C/C++ Program to Count Inversions in an array | Set 1 (Using Merge Sort)
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count… Read More »
Count Inversions in an array | Set 1 (Using Merge Sort)
Inversion Count for an array indicates – how far (or close) the array is from being sorted. If array is already sorted then inversion count… Read More »
Sort elements by frequency | Set 1
Print the elements of an array in the decreasing frequency if 2 numbers have same frequency then print the one which came first. Examples: Input:… Read More »
Data Structures and Algorithms | Set 8
Following questions have been asked in GATE CS exam. 1. Consider the following functions Which of the following is true? (GATE CS 2000) (a) h(n)… Read More »
Compiler Theory | Set 2
Following questions have been asked in GATE CS exam. 1. Given the following expression grammar: E -> E * F | F+E | F F… Read More »
For Versus While
Question: Is there any example for which the following two loops will not work same way? filter_none edit close play_arrow link brightness_4 code /*Program 1… Read More »
Data Structures and Algorithms | Set 7
Following questions have been asked in GATE CS 2006 exam. 1. In a binary max heap containing n numbers, the smallest element can be found… Read More »
Level order traversal in spiral form
Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. Recommended:… Read More »
Babylonian method for square root
Algorithm: This method can be derived from (but predates) Newton–Raphson method. 1 Start with an arbitrary positive start value x (the closer to the root,… Read More »
Print reverse of a Linked List without actually reversing
Given a linked list, print reverse of it using a recursive function. For example, if the given linked list is 1->2->3->4, then output should be… Read More »
Principle of programming languages | Set 1
Following questions have been asked in GATE CS exam. 1.The most appropriate matching for the following pairs X: Indirect addressing 1: Loops Y: Immediate addressing… Read More »
Data Structures and Algorithms | Set 6
Following questions have been asked in GATE CS exam. 1. The usual Θ(n^2) implementation of Insertion Sort to sort an array uses linear search to… Read More »
Leaders in an array
Write a program to print all the LEADERS in the array. An element is leader if it is greater than all the elements to its… Read More »
Output of C Programs | Set 9
Predict the output of the below programs. Question 1 filter_none edit close play_arrow link brightness_4 code int main() { int c=5; printf(“%d\n%d\n%d”, c, c <<=… Read More »
Data Structures and Algorithms | Set 5
Following questions have been asked in GATE CS exam. 1. Consider the following C function. filter_none edit close play_arrow link brightness_4 code float f(float x,… Read More »
