• Answer any five questions.
• All questions carry equal marks.
• In case of any doubt or dispute the English version question should be treated as final.
Define data structure. Discuss different types of data structure and their implementations.
Give the Big-O notation definition and briefly discuss with suitable examples.
Explain different operations that are performed on data structures.
What is an array? Discuss different types of array with examples.
What is searching? Explain about fibonacci search technique.
Differentiate between iterative merge sort and recursive merge sort.
Write an algorithm for basic operations of stack.
Explain the procedure to evaluate postfix expression. Evaluate the following postfix expression .
Explain various operations that are performed on queue with suitable algorithms.
List various operations of linked list and explain how to insert a node anywhere in the list.
Describe how a polynomial is represented using singly linked lists. Write an algorithm to add two polynomials using linked list.
Write an algorithm to delete an element anywhere from doubly linked list.
Explain breadth first traversal algorithm with an example.
Explain the in-order, pre-order and post-order traversal of a binary tree.
Complexity analysis
Binary search
Types of trees
Applications of queues
