Semester
Subject
Year
Bachelors In Information Technology
Institute of Science and Technology, TU
Data Structures and Algorithms (BIT201)
Year Asked: Model, syllabus wise question
Algorithms
1.
Write short notes on a.) Analysis of Algorithm Write short notes on b.) Representation of Graph [2.5+2.5]
Background and Concept of Data Structures
1.
Define ADT? Explain the benefits of using ADT? [5]
Graph
1.
Trace Prim's Algorithm to find minimum spanning tree for the following graph.
[5]
List
1.
What are the advantages and disadvantages of linked list over an array? Discuss algorithms for inserting a node at front position of the linked list and deleting its last item in singly linked list. [10]
2.
What is a circular linked list? How can you traverse all nodes in a singly linked list? [5]
Queue
1.
Why circular queue is advantageous over linear queue? Write algorithm for enqueue and is full operation for circular queue. [5]
Recursion
1.
Define recursive algorithm. Write recursive TOH algorithm? [5]
Searching
1.
Is hashing better than binary search algorithm? Give reasons. Define any two collision resolution techniques. [5]
Sorting
1.
Define sorting problem. Trace quick sort algorithm for the following given list of data and also discuss about its time complexity: 78 45 23 89 65 12 90 33 [10]
Stack
1.
Differentiate stack with queue? Trace an algorithm for converting infix expression to postfix for the following infix expression: (A+B)*(C$(D-E)+F)-G [10]
Tree
1.
What is a Binary Search Tree? Write an algorithm for searching an item in a binary search tree. [5]
2.
What are the different traversing methods in a binary tree? Explain with a clear example. [5]