Skip to content
All Medium Articles
Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check out our Data… Read More
Assume that size of an integer is 32 bit. What is the output of following program?Take a step-up from those "Hello World" programs. Learn to… Read More
C++ supports function overloading, i.e., there can be more than one function with the same name but, different parameters. How does the C++ compiler distinguish… Read More
What is the output of following function for start pointing to first node of following linked list? 1->2->3->4->5->6 void fun(struct node* start) {   if(start ==… Read More
A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the… Read More
Consider the following snapshot of a system running n processes. Process i is holding Xi instances of a resource R, 1 <= i <= n.… Read More
Suppose n processes, P1, …. Pn share m identical resource units, which can be reserved and released one at a time. The maximum resource requirement… Read More
Given an unsorted array. The array has this property that every element in array is at most k distance from its position in sorted array… Read More
What is output? # include <stdio.h>    void print(int arr[]) {    int n = sizeof(arr)/sizeof(arr[0]);    int i;    for (i = 0; i < n; i++)… Read More
Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity? (A) Insertion Sort (B) Quick Sort… Read More
What does the following function do for a given binary tree? int fun(struct node *root) {    if (root == NULL)       return 0;    if (root->left ==… Read More
Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using… Read More
What is recurrence for worst case of QuickSort and what is the time complexity in Worst case? (A) Recurrence is T(n) = T(n-2) + O(n)… Read More
Consider the following code. The function myStrcat concatenates two strings. It appends all characters of b to end of a. So the expected output is… Read More
We have introduced segment tree with a simple example in the previous post. In this post, Range Minimum Query problem is discussed as another example… Read More
At 8:30 AM on 17th Dec., I heard my name from the recruiter, and that was the starting of a long technical interview. I was… Read More
Let us consider the following problem to understand Segment Trees.We have an array arr[0 . . . n-1]. We should be able to 1 Find the… Read More
Take a step-up from those "Hello World" programs. Learn to implement data structures like Heap, Stacks, Linked List and many more! Check out our Data… Read More
Even if we were to search around the world, it would be a truly difficult job to find someone like Ravi Kiran. As a Computer… Read More