BCA 3rd Semester

Data Structures And Algorithms 2019 Board Question Paper

Tribhuvan university logo

Tribhuvan university

Bachelor In Computer Application

Course Title: Data Structures And Algorithms

Code No:CACS 201

Semester:III

2019

Full Marks:60 Pass Marks:24 Time:3 hours

Candidates are required to answer the question in their own words as far as possible.

Group B
Attempt any SIX question.
[6x5=30]
11.

What is Data Structure? Show the status of stack converting following infix expression to post fix: P + Q - (R*S/T+U)-V*W

12.

Write binary search. Consider a hash table of size 10; insert the keys 62, 37, 36, 44, 67, 91 and 107 using linear probing.

13.

What are deterministic and non-deterministic algorithms? Explain greedy algorithm.

14.

Draw a BST from the string DATASTRUCTURE and traverse the tree in post order and preorder.

15.

Define circular queue? How does circular queue overcome the limitation of linear queue? Explain.

16.

What is singly linked list? Write an algorithm to add a node at the beginning and end of Singly linked list.

17.

Define AVL tree. Construct AVL tree from given data set:4, 6, 12, 9, 5, 2, 13, 8, 3, 7, 11.

Group C

Attempt any TWO questions

[2x10=20]
18.

What is stack? List the applications of stack. Write an algorithm or procedure to perform PUSH and POP operation in stack.

18.

What is heap? Explain quick sort algorithm with Big-oh notation in best case, average case and worst case and trace it to sort the data: 8, 10, 5, 12, 14, 5, 7, 13.

18.

Define graph and tree data structure. Explain breadth first traversal and depth first traversal with example.