III Semester B.C.A Degree Examination,OCT/NOV 2011
Y2K8 SCHEME
COMPUTER SCIENCE
BCA 305:DATA STRUCTURE USING C
TIME:3HOURS Max.marsk:60
Insturctions: Answer all Sections.
SECTION-A 10X1=10
1.What is linear data structure ? Give an example.
2.Give an example for binary search tree.
3.How do you intialize a ponter variable ?
4.Define recursion ?
5.What is linear Search?
6.Convert the infix expression a + b * c / d into post fix expression.
7.Mention the stack operation
8.What is DeQueue.?
9.What is dynamic memory allocation ?
10.Define degree of a node.
11.What is doubly linked list?
12.What is the meaning of height of a binray tree ?
SECTION-B 5X3=15
13.Write the difference between stack and queue.
14.Write a C program to sort n elements using bubble sort.
15.Write a note on Searching techniques.
16.Write a Recursive Fucntion to find Factorial of a number.
17.Give the syntax of malloc() , calloc() , and free() function.
18.what is circular linked list ? Explain with an example.
19.Explain any one traversal of Binary tree.
20.Explain the concept of priority queue.
SECTION-C
Answer any five questions 5X7= 35
21.Explain the working of a stack with a suitable example.
22.Describe the concept of binary search technique with an example.
23.Write a C program to simulate the working of queue.
24.Write an anlgorithm to sort n numbers using quick sort technique.
25.a)What are the advantages of singly linked list over doubly linked list. 3marks
b)Write an algorithm to create a linked list . 4marks
26.Explain the construction of binary search tree with a suitable example.
27.Write a C program to find the binomial co-efficient using recursion.
28. a) What are the applications of stack ? 3marks
b)Explain the operations on primitive data structure. 4marks.
Y2K8 SCHEME
COMPUTER SCIENCE
BCA 305:DATA STRUCTURE USING C
TIME:3HOURS Max.marsk:60
Insturctions: Answer all Sections.
SECTION-A 10X1=10
1.What is linear data structure ? Give an example.
2.Give an example for binary search tree.
3.How do you intialize a ponter variable ?
4.Define recursion ?
5.What is linear Search?
6.Convert the infix expression a + b * c / d into post fix expression.
7.Mention the stack operation
8.What is DeQueue.?
9.What is dynamic memory allocation ?
10.Define degree of a node.
11.What is doubly linked list?
12.What is the meaning of height of a binray tree ?
SECTION-B 5X3=15
13.Write the difference between stack and queue.
14.Write a C program to sort n elements using bubble sort.
15.Write a note on Searching techniques.
16.Write a Recursive Fucntion to find Factorial of a number.
17.Give the syntax of malloc() , calloc() , and free() function.
18.what is circular linked list ? Explain with an example.
19.Explain any one traversal of Binary tree.
20.Explain the concept of priority queue.
SECTION-C
Answer any five questions 5X7= 35
21.Explain the working of a stack with a suitable example.
22.Describe the concept of binary search technique with an example.
23.Write a C program to simulate the working of queue.
24.Write an anlgorithm to sort n numbers using quick sort technique.
25.a)What are the advantages of singly linked list over doubly linked list. 3marks
b)Write an algorithm to create a linked list . 4marks
26.Explain the construction of binary search tree with a suitable example.
27.Write a C program to find the binomial co-efficient using recursion.
28. a) What are the applications of stack ? 3marks
b)Explain the operations on primitive data structure. 4marks.
No comments:
Post a Comment