Kathford
International College of Engineering and Management
Pre Board
Examination
Discrete Structure
B. Sc. CSIT 2nd
Semester
2012
SET A
|
Bachelor Level/ First Year/
Second Semester/ Science
Computer Science and
Information Technology (CSc. 154)
(Data
Structure and Algorithm)
|
|
Full Marks: 60
Pass Marks: 24
Time: 3 hours
|
Attempt all questions
Section A
10 x 2 = 20
1. Explain
the implementation of stack and queue with example.
2. A
binary tree T has 12 nodes. The in-order and pre-order traversals of T yield
the following sequence of nodes:
In-order : VPNAQRSOKBTM
Pre-order :
SPVQNARTOKBM
Construct the Binary tree
T showing each step. Explain how you can arrive at solution in brief.
Section B
8 x 5 = 40
3. How
can you define array as an ADT? Differentiate between one dimensional and two
dimensional arrays.
4. What
do you mean by recursion? Write a recursive algorithm to calculate the
factorial of given number.
5. Write
a C function to dequeue an element from the circular queue using array
implementation.
6. Write
C functions to perform PUSH and POP for dynamic implementation of stack.
7. What
do you mean by sorting? Illustrate the quick sort algorithm for following set
of data.
52,
13, 2, 78, 25, 6, 17, 99
8. What
is searching? Write an algorithm for linear search and compare its efficiency
with binary search algorithm.
9. What
do you mean by graph? Explain the different graph representation techniques.
10. Evaluate
the following postfix expression to get the result.
AB + C*DE - - FG + $
Where, A=2,
B=3, C=4, D=1, E=3, F=2, G=1
Kathford
International College of Engineering and Management
Pre Board
Examination
Discrete Structure
B. Sc. CSIT 2nd
Semester
2012
SET B
|
Bachelor Level/ First Year/
Second Semester/ Science
Computer Science and
Information Technology (CSc. 154)
(Data
Structure and Algorithm)
|
|
Full Marks: 60
Pass Marks: 24
Time: 3 hours
|
Attempt all questions
Section A
10 x 2 = 20
1. Write
a menu program to demonstrate the simulation of stack operations in array
implementation.
2. A
binary tree T has 12 nodes. The in-order and post-order traversals of T yield
the following sequence of nodes:
In-order :
VPNAQRSOKBTM
Post-order :
VANRQPBKOMTS
Construct the Binary tree
T showing each step. Explain how you can arrive at solution in brief.
Section B
8 x 5 = 40
3. How
can you define array as an ADT? Discuss the merits and demerits of contiguous
list over the linked list
4. What
do you mean by recursion? Write a recursive algorithm to print n Fibonacci
numbers.
5. Write
a C function to enqueue an element in the circular queue using array
implementation.
6. Write
C functions to perform insertion and deletion from the beginning in singly linked
list.
7. What
do you mean by sorting? Illustrate the quick sort algorithm for following set
of data.
68,
29, 30, 5, 45, 6, 20, 18
8. What
is searching? Write an algorithm for binary search and compare its efficiency
with linear search algorithm.
9. What
do you mean by graph? Explain the kruskal’s algorithm to get minimum spanning
tree.
10. Evaluate
the following prefix expression to get the result.
$ -*+ABC-DE+FG
Where, A=2,
B=3, C=4, D=1, E=3, F=2, G=1
No comments:
Post a Comment