Karnataka State Open University (KSOU) 2010 B.C.A Computer Application Data Structures - Question Paper
Illllllllllllllllll BCA - 14
I Semester B.C.A. Examination, Feb./March 2010 DATA STRUCTURES
Time: 3 Hours Max. Marks: 80
Instructions: 1) Answer all questions in Part A, 6 out of 8 questions in Part B, and 3 out of 5 questions in Part C.
2) PART A : Questions from 1 to 8 carry 1 mark and 9 to 14 carry 2 marks each.
3) PART B : Each question carries 5 marks.
4) PART C: Each question carries 10 marks.
PART - A
What is space complexity?
1
2
3
4
5
6
7
8 9
10
11
12
13
14
Define stack.
Define queue.
Give difference between static and dynamic variable.
What is linear search?
Define hashing.
What is tree?
How many comparisions required to sort N nos using selection sort ? What are the drawbacks of linked list?
What is binary search tree?
Mention drawbacks of array.
Write any 2 applications on stacks.
Define Interpolation search.
What is nonlinear data structure ? Give example.
Construct binary search tree for 10,50,20,5,2,1,100.
Give difference between array and linked list.
Discuss tree sorting with example.
Give an example of radix sort.
Give an example with binary tree to insert a node between root and leaf node. Give an example of bubble sort.
Explain how stack is used as a circular list.
Explain how queue represented in an array with basic operations.
PART - C
Write a C program to insert and delete a node from a single linked list.
Explain tree traversal technique with example.
Write a program for quick sort.
Write an algorithm for binary search and explain with an example.
Explain algorithmic notations with examples.
|
Attachment: |
| Earning: Approval pending. |
