II Semester B.C.A Examination ,May/June 2010
Y2K7 Scheme
COMPUTER SCIENCE
B.C.A 204 :Data Structure Using C
Time:3hours Max Marsk:60
Instruction: Answer all Sections.
SECTION-A
Anwer any eight questions. Each question carrires three marks . 8X3=24
1.Define data structure .Explain different types of data structure with an example
2.what is dynamic memory allocation? Explain any one dynamic memory allocation function.
3.Write the difference between iterative and recursive methods.
4.What is dangling pointer ? Explain with an example.
5.Write the applications of a Stack.
6.What is D-Queue ? Explain variations of D-Queue.
7.Convert the following infix expression into prefix expression.
(A*B/C+E*F^2)^4+D
8.Write an algorithm to add a node at the beginning of the linked list.
9.Write the difference between array and linked list?
10.Define:
i) Binary tree
ii) Depth of a tree.
iii)Leaf node.
SECTION-B 4X14=56
answer any four quesitons.
1.a) what is recursion? Write a C program to find the factorial using recursion. 6marks
b) Write an algorithm and program to search an element using binary search. 8marks
2.a)Write an algortihm to perform various operations on stack. 6marks
b) Write an algorithm to convert an infix expression to a postfix expression with an example 8mar
3.a) Write an algorithm to insert and delete an element from a circular queue. 7
b) Define linked list. Briefly explain different types of linked list.write two advantages of linked list. 7
4.a)Write an algorithm to 8
i) insert a node after a given node of information.
ii) delete a node at the beginning of the linked list.
b)write a c program to search an item in a linked list. 6
5.a) Write a an algorithm for insetion sort and explain the same with an example. 8
b) Sort the following set of Data in ascending order using heap sort. 6
100,75,80,25,50,45,30,15
6.a) Construct a binary tree for the following preorder and inorder traversals. 5
Preorder : A B D G H C E F I K J
Inorder: B G H D A E C I K F J
b) What is tree traversal ? Explain any one tree traversal technique. 3
c)What is Binary search tree ? Write an algorithm to insert an element in a Binary search tree. 6
Y2K7 Scheme
COMPUTER SCIENCE
B.C.A 204 :Data Structure Using C
Time:3hours Max Marsk:60
Instruction: Answer all Sections.
SECTION-A
Anwer any eight questions. Each question carrires three marks . 8X3=24
1.Define data structure .Explain different types of data structure with an example
2.what is dynamic memory allocation? Explain any one dynamic memory allocation function.
3.Write the difference between iterative and recursive methods.
4.What is dangling pointer ? Explain with an example.
5.Write the applications of a Stack.
6.What is D-Queue ? Explain variations of D-Queue.
7.Convert the following infix expression into prefix expression.
(A*B/C+E*F^2)^4+D
8.Write an algorithm to add a node at the beginning of the linked list.
9.Write the difference between array and linked list?
10.Define:
i) Binary tree
ii) Depth of a tree.
iii)Leaf node.
SECTION-B 4X14=56
answer any four quesitons.
1.a) what is recursion? Write a C program to find the factorial using recursion. 6marks
b) Write an algorithm and program to search an element using binary search. 8marks
2.a)Write an algortihm to perform various operations on stack. 6marks
b) Write an algorithm to convert an infix expression to a postfix expression with an example 8mar
3.a) Write an algorithm to insert and delete an element from a circular queue. 7
b) Define linked list. Briefly explain different types of linked list.write two advantages of linked list. 7
4.a)Write an algorithm to 8
i) insert a node after a given node of information.
ii) delete a node at the beginning of the linked list.
b)write a c program to search an item in a linked list. 6
5.a) Write a an algorithm for insetion sort and explain the same with an example. 8
b) Sort the following set of Data in ascending order using heap sort. 6
100,75,80,25,50,45,30,15
6.a) Construct a binary tree for the following preorder and inorder traversals. 5
Preorder : A B D G H C E F I K J
Inorder: B G H D A E C I K F J
b) What is tree traversal ? Explain any one tree traversal technique. 3
c)What is Binary search tree ? Write an algorithm to insert an element in a Binary search tree. 6
No comments:
Post a Comment