BCA 3rd Semester

Data Structures And Algorithms 2022 Board Question Paper

Tribhuvan university logo

Tribhuvan university

Bachelor In Computer Application

Course Title: Data Structures And Algorithms

Code No:CACS 201

Semester:III

2022

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 abstract data type? convert a$b*c-d+e/f/(g+h) into postfix expressionusing stack.

12.

What is linked list? Describe types of linked list. Write an algorithm to insertand delete node from beginning of doubly linked list.

13.

Describe Prim's algorithm to solve MST problem with suitable illustration.

14.

What is the limitation of linear queue over circular queue? Write an algorithmto insert and delete node in circular queue.

15.

What is hashing? Describe the types of collision resolution techniques with suitable example.

16.

Define divide and conquer algorithm. What is binary search? Write analgorithm to search an item using binary search with suitable illustration.

17.

What is minimax algorithm? Create Huffman Tree and calculate Huffman code for the following characters along with their frequencies using Huffman algorithm.

charactersAEIOUST
ferquencies10151234131

Group C

Attempt any TWO questions

[2x10=20]
18.

What is stack? List the application of the stack. Write an algorithm to perform PUSH and POP operation in stack. Describe linked list implementation of stack operations.

18.

What is external sorting? Explain heap sort algorithm and trace it to sort the data: 82, 90, 10, 12, 15, 77, 55, 23, 25, 32

18.

Differentiate between BST and AVL tree. Given the following AVL Tree:
Draw the resulting BST after 5 is removed, but before any rebalancing takes place. Label each node in the resulting tree with its balance factor. Replace a node with both children using an appropriate value from the node's left child.