Download Question Paper of "Data Structures Through C 2 BSC(IT)" , Question Paper of BSC(IT) 2nd Semester, Subject Code : BS-108, Paper ID B0408, Paper 2

Roll  No..............

Total  No.  of  Questions  :  07

B.Sc.  (IT)  (Sem.–2nd)

DATA  STRUCTURES  THROUGH  C

Subject  Code  : BS-108

Paper  ID  :  [B0408]

Time  :  3  Hrs.

INSTRUCTION  TO  CANDIDATES  :

1) Section - A is Compulsory.

2) Attempt any Four questions from Section–B.

Section –A

Q. 1.  (a) List out the areas in which data structures are used?

(b) Which data structure is used to perform recursion?

(c) What are sparse matrices?

(d) Write the complexities of (i) Bubble sort (ii) Selection sort.

(e) Why are queues called FIFO data structure?

(f) Define AVL trees.

(g) What are the different ways to traverse a binary tree?

(h) What is time space trade off?

 (i) Give some applications of arrays as data structure.

(j) Differentiate between stack and queues.

Section-B

Q. 2.  (a) What is an algorithm? What are its characteristics?

(b) How an array can be used to represent a string? Give three string related function.

Q. 3.  (a) Write an algorithm to perform PUSH and POP operation on stack.

          (b) Give linked list representation of sparse matrix.

Q. 4.  (a) Write an algorithm to delete an element from doubly linked list. 

          (b) Translate infix expression into its equivalent post fix expression (using stack):

A* (B+D)/E-F * (G+H/K)

Q. 5. Write an algorithm to perform various tree traversal methods. Give example.

Q. 6.  (a) Differentiate between circular and double queue? Which one is better and when?

(b) What are arrays? How are they useful?

Q. 7.  (a) Write an algorithm for Bubble sort? Sort the following elements: 24, 56, 13, 89, 42.

          

          (b) How linked list can be used to represent a polynomial.