Question Paper from Guru Nanak Dev University
Course: B.Sc Information Technology
Data Structure and File Processing - The Subject of this question paper
2011 Question Paper - The year of the question paper asked
Time : 3 hours.
Maximum Marks : 100.
Attachment Type : Text
Version : Original Version.
UNIT-1
1. (a) Explain linear as well as non-linear data structures along with various operations performed
on them. 12
(b) Discuss briefly the following 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? Explain 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.
Explain 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 explain the process of Insertion as well as Deletion of an element from a queue. 20
6. What is Binary Search Tree? How it is different from Binary tree? Explain 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? Describe its sequential representation. Explain the method of depth-First search
using an example. 20
8. (a) Explain the following terms associated eith file structure:
(1) Master File
(2) Transaction File
(3) Report File
(4) Back-up File
(5) work File. 5
(b) Explain Index Sequential files. Write down the advantages and disadvantages of this file organization. 15
Course: B.Sc Information Technology
Data Structure and File Processing - The Subject of this question paper
2011 Question Paper - The year of the question paper asked
Time : 3 hours.
Maximum Marks : 100.
Attachment Type : Text
Version : Original Version.
UNIT-1
1. (a) Explain linear as well as non-linear data structures along with various operations performed
on them. 12
(b) Discuss briefly the following 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? Explain 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.
Explain 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 explain the process of Insertion as well as Deletion of an element from a queue. 20
6. What is Binary Search Tree? How it is different from Binary tree? Explain 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? Describe its sequential representation. Explain the method of depth-First search
using an example. 20
8. (a) Explain the following terms associated eith file structure:
(1) Master File
(2) Transaction File
(3) Report File
(4) Back-up File
(5) work File. 5
(b) Explain Index Sequential files. Write down the advantages and disadvantages of this file organization. 15
0 comments:
Pen down your valuable important comments below