Guru Nanak Dev University 2009-2nd Year B.C.A Computer Application Bachelor of s(Part-) - Question Paper

UNIT-1
1.Define the subsequent terms with the help of suitable example:
(a)Complexity of Algorithms
(b)Time-Space Trade off
(c)Big O Notation
(d)Data structures used for storage strings. [Marks 4*5]

2.What do you mean by linear search ? Write a program that performs linear search.Also compute its best case,worst case and avg. case complexity. [Marks 20]

UNIT-2
3.Explain the process of bubble sort.Write an algorithm that performs Bubble sort.Also determine its complexity. [Marks 20]

4.What is linked list?How it is represented in the memory ? Write an algorithm to insert a new node at a provided location in the linked list.Explain this process with the help of an example.
[Marks 20]

UNIT-3
5. (a)What do you mean by Circular Queue ? How it is implemented in the memory ? discuss the process of insertion a new element in Circular Queue. [Marks 12]

(b)Convert the subsequent Infix notation into Postfix notation using stack:
((A*B) + D)!((E-F)*G) [Marks 8]

6. What do you mean by Binary Tree ? How is it implemented in the memory ? discuss various ways to transverse a binary tree using suitable example. [Marks 20]

UNIT-4
7. What is graph ? How it is represented in the memory ? discuss Breadth-First Search method to traverse a node of a Graph. [Marks 20]


8. (a)Define the term Hashing.Explain the techniques used to resolve collision.
[Marks 20]

(b)Explain Indexed file organization.Write down the advantages and disadvantages of Indexed file organization. [Marks 20]

Earning:   Approval pending.