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 1

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

1.     Write briefly:

a.     Write 5 basic characteristics of an algorithm.

b.     What is the brute force approach?

c.      What is an array of pointers?

d.     Write the function to copy one string into another.

e.      What is polish notation?

f.       What is row-major and column – major order?

g.     Write the application of binary trees.

h.     How is binary search better then the linear search?

i.       Draw the logical diagram of a doubly linked list.

j.       What are self referential structures?

Section –B

2.       

a.      Define best-case, worst –case and average-case complexity of an algorithm what is time space trade off?

b.     What are the various notations to express the time and space complexity?

3.     Describe the array of  notation to represent a list of strings.

4.     Explain using appropriate diagrams the algorithm to:

a.     Add a new element at the beginning of a linked list.

b.     Add a new element at the beginning of a doubly linked list.

5.        

a.     Write the overflow and underflow conditions for a circular queue using diagrams.

b.     Write push and pop algorithms for a stack.

6.     Explain Quick sort with example.

7.     How do you search an  element in a binary search tree? How it is efficient?