Advanced Pytest Fixtures: Beyond the Basics for Cleaner Test Code


Pytest has become the de facto testing framework in the Python ecosystem, and for good reason. Its fixture system is one of its most powerful features, yet many developers only scratch the surface of its capabilities. In this post, we’ll explore advanced fixture patterns that can make your test suite more maintainable, readable, and efficient. Fixture Fundamentals Refresher Before diving deep, a fixture in pytest … Continue reading Advanced Pytest Fixtures: Beyond the Basics for Cleaner Test Code

Hate ads? Simple steps for going ad-free


Ads are the evil thing present everywhere and yet a necessity as it is the basis of the free content or service. Many businesses are running and providing their services for free to users as someone else is paying them (advertisers instead of users). This mode of operation is good enough as we don’t have to pay for most of services around, but these ads … Continue reading Hate ads? Simple steps for going ad-free

Bionic Beaver : Ubuntu 18.04 LTS


Hi Readers, Ubuntu is a famous Linux distribution based on Debian. It releases its LTS (Long Term Support, gets security and software updates for 5 years) release every 2 years in the month of April. Ubuntu’s Founder Mark Shuttleworth says the following for the Ubuntu 18.04 on the occasion of naming it Bionic Beaver. It’s builders that we celebrate – the people that build our … Continue reading Bionic Beaver : Ubuntu 18.04 LTS

Write x86 ALP to find the factorial of a given integer number on a command line by using recursion.


Problem Statement: Write x86 ALP to find the factorial of a given integer number on a command line by using recursion. Explicit stack manipulation is expected in the code. ; Microprocessor Lab ; Assignment no. : 9 ;Problem Statement: Write x86 ALP to find the factorial of a given integer number on a command line by using ;recursion. Explicit stack manipulation is expected in the … Continue reading Write x86 ALP to find the factorial of a given integer number on a command line by using recursion.

Divide and Conquer strategy for Binary Search Algorithm


Using divide and conquer strategy, design a recursive function to implement Binary Search Algorithm in C++ /* * @OmkarNathSingh * Computer Laboratory 1 * Binary Search Algorithm */ #include<iostream> using namespace std; void bubbleSort(int arr[],int size) { for (int i = 0; i < size; i++) for (int j = 0; j < size-i-1; j++) if (arr[j] > arr[j+1]) swap(arr[j], arr[j+1]); } int binarySearch(int arr[],int … Continue reading Divide and Conquer strategy for Binary Search Algorithm

Explanation of Assembly Procedures


Procedures are like the functions which we write in any High Level Language code like Java. Procedures of Assembly Language simply our task and saves up time in writing repeated statement. Basic Syntax of Procedure for 32 and 64 bit ALP: Procedure Declaration: It refers to giving definition of the procedure. While defining a procedure make sure of following things, Registers contents and the pointers. … Continue reading Explanation of Assembly Procedures

Write X86/64 Assembly Language Program (ALP) to count number of positive and negative numbers from the array.


32 Bit Code 64 Bit Code 32 Bit NASM Code %macro scall 4         mov eax,%1         mov ebx,%2         mov ecx,%3         mov edx,%4         int 80h %endmacro section .data arr dd -18888888h,18888888h,22222222h,11111111h n equ 4 pmsg db 10d,13d,”The Count of Positive No: “,10d,13d plen equ $-pmsg nmsg db 10d,13d,”The Count of Negative No: “,10d,13d nlen equ $-nmsg nwline db 10d,13d section .bss pcnt resq 1 ncnt resq 1 … Continue reading Write X86/64 Assembly Language Program (ALP) to count number of positive and negative numbers from the array.

C++ program to check whether given string is palindrome or not using stack.


/* Author: Omkar Nath Singh #DS : Problem Statement Part I. Implement working of Stack (LIFO) using Array Part II. Extend above program with functions- 1. to check whether given string is palindrome or not that uses a stack to determine whether a string is a palindrome. 2. to remove spaces and punctuation in string, convert all the Characters to lowercase, and then call above … Continue reading C++ program to check whether given string is palindrome or not using stack.

C++ program using stack to check whether given expression is well parenthesized or not


/* Author: Omkar Nath Singh #DS Problem Statement In any language program mostly syntax error occurs due to unbalancing delimiter such as (),{},[]. Write C++ program using stack to check whether given expression is well parenthesized or not. */ #include<iostream> #include<string.h> #include<ctype.h> using namespace std; #define MAX 100 class Stack { private: char data[MAX],str[MAX]; int top,length,count; void pushData(char); char popData(); public: Stack() { top=-1; length=0; … Continue reading C++ program using stack to check whether given expression is well parenthesized or not