Blog

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;}

Arrays are 

Arrays are