Part - | [DS] CS205 DATA STRUCTURES KTU B TECH QUESTIONS FOR SECOND YEAR [S3] STUDENTS | QUESTION BANK


APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY

[DS] CS205 DATA STRUCTURES KTU B TECH QUESTIONS FOR SECOND YEAR [S3] STUDENTS | QUESTION BANK,data Structures ktu questions,data Structures questions ktu,data Structures questions,data Structures questions,data Structures questions ktu,ktu data Structures questions,data Structures questions,data Structures questions ktu,ktu data Structures questions,ktu CS questions,Cs questions,Computer Science questions,ds,data Structures ktu important,Previous questions,ds,data Structures important,Previous questions ktu,ds,data Structures important,Previous questions,ds,data Structures important,Previous questions,ds,data Structures important,Previous questions ktu,ktuds,data Structures ,ds important,Previous questions,ds,data Structures  important,Previous questions,ds,data Structures important,Previous questions ktu,ktu ds,data Structures important,Previous questions,ktu CS  important,Previous questions,Cs  important,Previous questions,Computer Science  important,Previous questions
DATA STRUCTURES QUESTION PAPERS


PART A

(Answer All Questions)


1.Let f(n) = 2000n+5. Express f(n) in terms of big oh, omega, theta by specifying the constants to be satisfied. (3)

2. How can we analyze an algorithm (3)

3. Write an algorithm to print a single linked list in reverse order (3)

4. Explain linear data structure (3)

PART B

(Answer Any Two Questions)


1.Consider the following recursive algorithm

ALGORITHM Q(n) // n is a positive integer

If n == 1

             Return 1

Else

         Return Q(n-1) + 2 * n-1

a) Setup a recurrence relation for this function value and determine what this algorithm compute. (2)

b) Solve the given recurrence relation (4)

c) Distinguish recursive and iterative algorithm (3)

2. Consider a collection of elements. 12, 24, 35, 55, 60, 70.

a) Insert an item 45 into the above collection. Identify the data structure which efficiently handle the situation. Explain its feature (2)

b) Write an algorithm to insert the item 45 into the collection without violating the order of collection (4)

c) Justify your proposed algorithm (3)

3. Consider the expression 

3x^2+ 4x + 1 op 2x + 1 = 6x^3 + 9x^2+ 6x + 2

a) Identify the data structure in order to implement above (1)

b) Explain stepwise refinement technique to implement above operation (8)

Part C

(Answer all Questions)

1. Convert infix expression to postfix

A + ( B * C – ( C / E ^ F) * G ) * H                   (3)

2. Consider Queue, where QUEUE is a circular array which is allocated 6 memory cells

FRONT = 2 REAR = 4 QUEUE : - , A ,C , D ,-, -

a) F is added to the QUEUE

b) Two letter are deleted

c) K,L and M are added                  (3)

3. Consider the following tree. And find

a) Sibling ( B)

b) Level of node F

c) Height of the tree                        (3)

CLICK HERE FOR MORE QUESTIONS :--**

No comments:

Powered by Blogger.