Guru Nanak Dev University 2011 B.C.A Computer Application Data structure and File Processing - Question Paper

2270
2411
Bachelor Of Computer Application Part-2
DATA STRUCTURE & FILE PROCESSING
Paper-5

[Time allowed-Three hours] [Maximum Marks-100]

Note:-Attempt 5 ques. in all, selecting
at lowest 1 ques. from every unit.


UNIT-1

1. (a) discuss linear as well as non-linear data structures
along with different operations performed on them.
12

(b) explain briefly the subsequent terms:
(1) Complexity of an algorithm
(2)Time-space tradeoff of algorithm. 8

2. What is binary search? what conditions should be kept in
mind before perorming Binary search? discuss how Binary
Search is performed with the help of an example.
20

UNIT-2

3. How Array is implemented in the memory? Write an algorithm
that performs insertion an a sorted array. Also determine
its complexity.
20

4. What is linked list? How it is represented? Write an algorithm
to delete a node in the linked list. discuss this process with
the help of an example.
20

UNIT-3

5. What is Queue? How it is implemented in the memory? Write an
algorithm to discuss the process of Insertion as well as
Deletion of an element from a queue.
20

6. What is Binary Search Tree? How it is various from Binary
tree? discuss the process of inserting a new node into a
Binary Search tree with the help of an example.
20

UNIT-4

7. What is Graph? define its sequential representation. discuss
the method of depth-First search using an example. 20

8. (a) discuss the subsequent terms associated eith file structure:
(1) Master File
(2) Transaction File
(3) Report File
(4) Back-up File
(5) work File. 5

(b) discuss Index Sequential files. Write down the advantages
and disadvantages of this file organization. 15

Earning:   Approval pending.