Data Structure Previous year question paper 2019 | HNBGU Second Semester

Data Structure

HNBGU BCA Previous Question Paper 2019-20

  1. Convert the following in-fix expression into equivalent post-fix expressions:
    (a) A* (B+D) / E – ( F*G )

    (b) ( B-C )/E*( F-G )

  2. Why there is a need to convert an in-fix expression into post-fix notation?

  3. What are advantages and disadvantages of doubly linked list over singly linked list? In what cases linked list? In what cases linked list is better than array?

  4. Write down an algorithm that generates first fifty odd numbers and displays the total of these

  5. Consider the following binary search tree:

  6. Perform the deletion of node 0 from the given tree with proper explanation.

  7. Write down the following as recursive function:

    1. A*b
    2. Xa
    3. N!
  8. Consider the following list of numbers:


  9. Built a binary search tree for these numbers.

  10. What do you understand by divide and conquer algorithm?

  1. Let a Binary Search Tree ‘T’ Is maintained in memory and an ITEM of information is given. Write an algorithm for funding the location of item in the binary search tree ‘T’.

  2. Write an algorithm to travers a linked list in reverse order with the help of recursion.

  3. What do you mean by circular queue? Write an algorithm for insertion and deletion in a circular queue.

  4. Describe Huffman algorithm, with the help of an example. Write down the Huffman algorithm.

  5. What do you mean by Hashing? Explain it with the help of suitable examples. What is collision in hashing? Discuss two methods for collision resolution.

  6. Write short notes on the following.

    1. Threaded trees
    2. AVL Trees
    3. ADT
    4. Application of stack