Data Structure
HNBGU BCA Previous Question Paper 201920
Read Also:
 Computer Fundamental HNBGU BCA PYQ 2011
 Computer Fundamental HNBGU BCA PYQ 2012
 Computer Fundamental HNBGU BCA PYQ 2013
 Computer Fundamental HNBGU BCA PYQ 2016
 Computer Networks HNBGU BCA PYQ 2018
 Data Structure HNBGU BCA PYQ 2019
 General English HNBGU BCA PYQ 2016
 MFCS HNBGU BCA PYQ 2013
 MFCS HNBGU BCA PYQ 2016
 MFCS HNBGU BCA PYQ 2018
 Modern English HNBGU BCA PYQ 2018
 Programming in C HNBGU BCA PYQ 2011
 Programming in C HNBGU BCA PYQ 2012
 Programming in C HNBGU BCA PYQ 2013
 Programming in C HNBGU BCA PYQ 2016
 Programming in C HNBGU BCA PYQ 2017
 Programming in C HNBGU BCA PYQ 2018
Section A

Convert the following infix expression into equivalent postfix expressions:
(a) A* (B+D) / E – ( F*G )
(b) ( BC )/E*( FG ) 
Why there is a need to convert an infix expression into postfix notation?

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?

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

Consider the following binary search tree:

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

Write down the following as recursive function:
 A*b
 Xa
 N!

Consider the following list of numbers:
14,10,17,11,20,48,9,18,33

Built a binary search tree for these numbers.

What do you understand by divide and conquer algorithm?
Section B

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’.

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

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

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

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.

Write short notes on the following.
 Threaded trees
 AVL Trees
 ADT
 Application of stack
Read Also:
 Computer Fundamental HNBGU BCA PYQ 2011
 Computer Fundamental HNBGU BCA PYQ 2012
 Computer Fundamental HNBGU BCA PYQ 2013
 Computer Fundamental HNBGU BCA PYQ 2016
 Computer Networks HNBGU BCA PYQ 2018
 Data Structure HNBGU BCA PYQ 2019
 General English HNBGU BCA PYQ 2016
 MFCS HNBGU BCA PYQ 2013
 MFCS HNBGU BCA PYQ 2016
 MFCS HNBGU BCA PYQ 2018
 Modern English HNBGU BCA PYQ 2018
 Programming in C HNBGU BCA PYQ 2011
 Programming in C HNBGU BCA PYQ 2012
 Programming in C HNBGU BCA PYQ 2013
 Programming in C HNBGU BCA PYQ 2016
 Programming in C HNBGU BCA PYQ 2017
 Programming in C HNBGU BCA PYQ 2018