Skip to content
Gblog Write It Up: Share Your Interview Experiences
Since we are receiving so many interview experiences, we have great news to share with you. Therefore, we are moving this event’s date up to… Read More
A Unix-style i-node has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block… Read More
Consider two processes P1 and P2 accessing the shared variables X and Y protected by two binary semaphores SX and SY respectively, both initialized to… Read More
Consider a system with a two-level paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds.… Read More
Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds Process Arrival Time Burst Time P1 0 5… Read More
Consider the grammar with the following translation rules and E as the start symbol. E → E1 # T { E.value = E1.value * T.value… Read More
Suppose we run Dijkstra’s single source shortest-path algorithm on the following edge weighted directed graph with vertex P as the source. In what order do… Read More
Consider the following C program segment struct CellNode {   struct CelINode *leftchild;   int element;   struct CelINode *rightChild; }    int Dosomething(struct CelINode *ptr) {     int… Read More
What does the following algorithm approximate? x = m; y = 1; while (x - y > e) {     x = (x + y)/2;     y… Read More
Consider the following C program main() {     int x, y, m, n;     scanf ("%d %d", &x, &y);     /* Assume x > 0 and y >… Read More
Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations among union, intersection, membership, cardinality will be… Read More
Two matrices M1 and M2 are to be stored in arrays A and B respectively. Each array can be stored either in row-major or column-major… Read More
Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^,… Read More
The elements 32, 15, 20, 30, 12, 25, 16 are inserted one by one in the given order into a Max Heap. The resultant Max… Read More
A circularly linked list is used to represent a Queue. A single variable p is used to access the Queue. To which node should p… Read More
Consider the label sequences obtained by the following pairs of traversals on a labeled binary tree. Which of these pairs identify a tree uniquely ?… Read More

Start Your Coding Journey Now!