Blog

Consider the following graph. Assume the adjacency lists are in sorted order: explore 0-1 before 0-6 or 0-7 (numerical order). Perform breadth-first traversal on the graph below.

Imagine a circular array-based queue capable of holding 100 objects. The queue is initially empty, and then objects are put into the queue at the rate of 10 per minute while at the meantime they are processed and removed from the queue at the rate of 5 per minute. This goes on for 14 minutes. 10 items in and 5 items out per minute, for 14 minutes [a] How many objects are in the queue? [b] At what index will the start of the queue be (indices 0 to 99)? 

How many rows are used to represent a graph with n vertices and m edges, when using an adjacency list representation.

Which of the following operation is not efficient for a singly linked list?

You are given the following undirected graph. [Breadth] List the vertices in Breadth-first Search starting at vertex A: [Depth] List the vertices in Depth-first Search starting at vertex A:

How does a stack add and remove entries?

What’s the maximum height of any AVL-tree with 7 nodes? (The root is considered height 1)

Consider the following graph. Assume the adjacency lists are in sorted order: explore 0-1 before 0-6 or 0-7 (numerical order). Perform depth-first traversal on the graph blow.

What is the output of the following code snippet? union test{    int x;    char arr[8];    int y;}; int main(){    printf(“%d”, sizeof(union test));     return 0;}

What is the output of the following code snippet? union test{    int x;    char arr[8];    int y;}; int main(){    printf(“%d”, sizeof(union test));     return 0;}