III Semester B.CA.Degree Examination. NOV/DEC 2010
Y2K8 SCHEME
COMPUTER SCIECNCE
BCA 305:DATA STRUCTURE USING C
TIME:3HOURS MAX.MARKS:60
INSTRUCTION: Answer all the sctions.
SECTION-A
Answer any 10 question. 1X10=10
1.Mention different operations performed on non primitive data structure.
2.Define time complexity of an algorithm.
3.Write one application of stack.
4,Define Heap.
5.In which situation binary search technique will be userful/
6.What is void pointer?
7.What is tree traversal?
8.How memory can be deallocated?
9.Write the difference between linked list and array.
10.Mention the applications of stack.
11.What is an advantage of circular queue over a liner queue?
12.Define leaf node.
SECTION-B
Answer any five questions 5X3=15
13.Write an algorithm for push operation of a stack.
14.write an algorithm to delete an item from a circular queue.
15.Write the difference between iterative and recursive methods.
16.write a C program to sort an element using Bubble sort techniques.
17.Explain the tower of hanoi problem.
18.Write an algorithm to insert a node at the end of the linked list.
19.Explain tree traversal techniques.
20.Write the differences between static and dynamic memory allocation.
SECTION-C
Answer any five questions. 5X7=35
21.Write a C program to simulate the working of queue using arrays.
22.Wrie an algorithm to find the value of postfix expression.use the same to find the
value of a following infix expression
6 * 5 + 3 * 2 -8/4
23.a)Write a recursive function to find the sum of first 'N' natural numbers 4+3
b)Write an algorithm to search an element using linear search.
24.Write a C program to create a linked list and also count the number of nodes in a linked list.
25.What is BST? Write a C program to construct BST.
26).Arrange the following numbers in ascending order using heap sort technique.
50, 25, 30, 75, 100, 45, 80.
27.a)Construct the folowing infix epression to prefix 3+4
A + B ^ C+ D * E - G* H
B) Explaination classification of data structure with example
28) Write a C program to sort the array using merge sort.
Y2K8 SCHEME
COMPUTER SCIECNCE
BCA 305:DATA STRUCTURE USING C
TIME:3HOURS MAX.MARKS:60
INSTRUCTION: Answer all the sctions.
SECTION-A
Answer any 10 question. 1X10=10
1.Mention different operations performed on non primitive data structure.
2.Define time complexity of an algorithm.
3.Write one application of stack.
4,Define Heap.
5.In which situation binary search technique will be userful/
6.What is void pointer?
7.What is tree traversal?
8.How memory can be deallocated?
9.Write the difference between linked list and array.
10.Mention the applications of stack.
11.What is an advantage of circular queue over a liner queue?
12.Define leaf node.
SECTION-B
Answer any five questions 5X3=15
13.Write an algorithm for push operation of a stack.
14.write an algorithm to delete an item from a circular queue.
15.Write the difference between iterative and recursive methods.
16.write a C program to sort an element using Bubble sort techniques.
17.Explain the tower of hanoi problem.
18.Write an algorithm to insert a node at the end of the linked list.
19.Explain tree traversal techniques.
20.Write the differences between static and dynamic memory allocation.
SECTION-C
Answer any five questions. 5X7=35
21.Write a C program to simulate the working of queue using arrays.
22.Wrie an algorithm to find the value of postfix expression.use the same to find the
value of a following infix expression
6 * 5 + 3 * 2 -8/4
23.a)Write a recursive function to find the sum of first 'N' natural numbers 4+3
b)Write an algorithm to search an element using linear search.
24.Write a C program to create a linked list and also count the number of nodes in a linked list.
25.What is BST? Write a C program to construct BST.
26).Arrange the following numbers in ascending order using heap sort technique.
50, 25, 30, 75, 100, 45, 80.
27.a)Construct the folowing infix epression to prefix 3+4
A + B ^ C+ D * E - G* H
B) Explaination classification of data structure with example
28) Write a C program to sort the array using merge sort.
No comments:
Post a Comment