Skip to content
Gblog 100 Days of Code – A Complete Guide For Beginners and Experienced
Do you want to become a successful software developer and dreaming about getting into the big tech companies? Are you someone who is already working… Read More
Given a hash table with n keys and m slots with simple uniform hashing. If collisions are resolved by chaining then what is the probability… Read More
Let f(n) = Σ [(log(n/2i) +100] where i limits from 0 to k, and n = 2k. Find the time complexity of f(n). (A) θ(n)… Read More
Considering the data given in the previous question, if the stack A had 4 entries, then the number of possible permutations that can be printed… Read More
Linked Questions 22-23 Stack A has the entries as following sequence a, b, c (with ‘a’ on top), stack B is empty, as shown in… Read More
Which data structure would be the most appropriate to implement a collection of values with the following three characteristics? i) Items are retrieved and removed… Read More
Consider the following statements: S1 : DFS of a directed graph always produces the same number of edges in the traversal, irrespective of the starting… Read More
Consider the following pseudo code. x = 0; for (i = 1 to n) for (j = 1 to 4i – 3) x = x… Read More
Let X and Y be the integers representing the number of simple graphs possible with 3 labeled vertices and 3 unlabeled vertices respectively. Let X… Read More
Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case. Statement I: 2f(n) = O(2g(n)) Statement… Read More
Consider the following statements about Bellman ford algorithm for finding shortest path in a directed connected graph G having integral edge weights. Statement I: It… Read More
A buffered character-input stream that keeps track of line numbers. This class defines methods setLineNumber(int) and getLineNumber() for setting and getting the current line number… Read More
Consider the C code Below. void function(int n) { if (n == 1) return; for (int i = 0; i<n; i++) { for (int j… Read More
A balanced tree is given below. How many nodes will become unbalanced when a node is inserted as a child of node G? Note: A… Read More
What will the output of the following C code ? #include <stdio.h> int main() { int i=2, j=2; while (i+1 ? --i : j++) printf("%d",i);… Read More
Consider a sorted array of n elements. Let k inversions (swapping) have been performed on the sorted array and we want to sort it again… Read More

Start Your Coding Journey Now!