2 Marks
• What is the balance factor? How is it calculated?
• What is a polynomial? How is it different from structure?
• What is searching? List out its types.
• What are the different types of graph?
• How to measure performance of an algorithm?
• What is a circular queue?
• List out different types of data structures
• What is the level of a node?
• Differentiate array and structure.
• What is the priority queue?
• What are the applications of stack?
• What is an abstract data type?
• What are the different types of tree?
• What are the different operations performed on stack?
• List out different types of Linked List.
• What are different types of sorting?
• What is pointer to pointer.
• What is space and time complexity?
• What is a spanning tree?
• What is BFS
• What is meant by tree traversal?
• What is sorting? State its techniques
• What is DFS?
• What is self referential structure?
• Define Data structure.
• Explain typedef keyword with syntax or example.
• What is a complete binary tree.
• What are the advantages of a linked list over an array?
• What is a binary tree? List its types.
4 Marks
• Explain DFS with an example
• What is stack? Explain different operations used in stack.
• Explain different types of AVL rotations with an example.
• What is a height-balanced tree? Explain RR and RL rotations with an example.
• Explain bubble sort technique with an example
• Explain BFS with example.
• What is height-balanced tree? Explain LL and LR rotations with an example.
• Explain insertion sort technique with an example.
• What is queue? Explain different operations performed on queue.
• What is Graph? Explain adjacency list of graph.
• Write an algorithm to convert given infix expression to postfix expression.
• What is the queue? Explain different operations performed on queue.
• Explain Binary search method with an example.
• Explain selection sort technique with an example.
• What is a circular queue? How is it differ from a static queue?
• Write a function to add node at the beginning of a circular singly linked list.
• Write a function to reverse a string using stack.
• Write a function to create and display doubly link list.
• Write a function to create and display circular singly linked list.
• Explain different types of AVL rotations with an example.
• Write a function to traverse a graph using DFS technique.
• Write a function to insert a node in linked list at given position
• Write a function to check whether a given string is palindrome or not (use Stack)Write a
function for preorder traversal of the tree.
• Write a C program for static Implementation of stack.
• Write a function to delete the first node from a singly linked list
• Write a function to create a doubly circular linked list.
• Write a program to dynamically allocate memory for an array of integers and then print the
elements of the array.
• Write a function for inorder traversal of the tree.
• Write a C program to search for a key element in a sorted array of integers using binary
search technique.
• Construct an AVL tree for following sequential data: Jan, Feb, Apr, May, July, Aug, June.
• Sort the following data by using selection sort. 37, 30, 50, 80, 5, 10, 17.
• Construct Binary search tree of following data. 18, 40, 22, 8, 12, 4, 9.
• Write a function to search the element from the array using binary search.
• What is a circular queue? Explain it with an example.
• Write a ‘C’ Program to count the number of nodes from singly link list.
• What is the priority queue? Explain it with an example.
• Construct an AVL tree for given data :, SAT, THUR, FRI, WED, TUE, MON
• Sort the following data by using quick sort. 9, 7, 77, 60, 49, 55
• Write a ‘C’ program for dynamic implementation of stack.
• Write a C program to traverse the linked list.
• What is Dequeue? Explain with example.
• Convert the following expression into postfix
• What is degree of vertex? Find in degree & out degree of following graph for each vertex
• Define the following terms:
• Degree of node
• Strict binary tree
• Path
• Convert the following expressions into prefix
• Define the following terms
• Directed graph
• Parent node
• Complete binary tree
• bridge
• Cyclic graph
• Pendant vertex
