Code No: 117CC Set No.

1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B .Tech. I Sem., I Mid-Term Examinations, September - 2017
DATA STRUCTURES
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

I. Choose the correct alternative:

1. Queue works on the principle of ________________________ [ ]

A) LIFO B) FIFO C) FILO D) MIMO

2. The value of the expression 9 3 4 * 8 + 4 / - is _____________ [ ]

A) 5 B) 4 C) 0 D) 12

3. A function is said to be _______recursive if there are no pending operations to

perform after recursive call. [ ]
A)direct B) non-tail C) tail D)indirect

4. In linked list each node contain minimum of two fields. One field is data field
to store the data second field is? [ ]
A) Pointer to character B) Pointer to integer C) Pointer to node D) Node

5. Reverse polish notation is the other name of _______________ [ ]

A) Infix B) prefix C) postfix D) expression

6. A binary tree with n elements will have number of edges [ ]

A) n-1 B) 2n C) n+1 D) 2n-1

7. What is the asymptotic time complexity to add an element in the linked list? [ ]
A) O(1) B) O(n) C) O(n2) D) None

8. Which Data Structure is used to perform Recursion? [ ]

A) Queue B) Stack C) Linked List D) Tree

9. What does stack overflow refer to? [ ]

A) accessing item from an undefined stack B) adding items to a full stack
C) removing items from an empty stack D) index out of bounds exception

10. What will be the output of sum(8)? [ ]

int sum(int n) {
if (n==0)
return n;
else
return n + sum(n-1);
}
A) 36 B) 40 C) 8 D) 15

Cont..2
Code No: 117CC :2: Set No. 1

II Fill in the Blanks

11. The node which has no children is a _______________________.

12. The condition to check the circular queue is empty or not is ______________________ .

13. In circular linked list, the last node always points to _________________________.

14. Array List is static in nature created at ___________________ time mostly.

15. We can represent the polynomial with the help of _____________ data structure.

16. ________________________ is a non linear data structure.

17. The operation of visiting each element in the list is known as _________________.

18. The postfix form of the expression (A+ B)*(C*D- E)*F / G is____________________.

19. In linked list implementation of a queue, At the___________________ a new element be inserted.

20. The Big O notation defines an ____________________of an algorithm.

-oOo-
Code No: 117CC Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B .Tech. I Sem., I Mid-Term Examinations, September - 2017
DATA STRUCTURES
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

I. Choose the correct alternative:

1. In linked list each node contain minimum of two fields. One field is data field
to store the data second field is? [ ]
A) Pointer to character B) Pointer to integer C) Pointer to node D) Node

2. Reverse polish notation is the other name of _______________ [ ]

A) Infix B) prefix C) postfix D) expression

3. A binary tree with n elements will have number of edges [ ]

A) n-1 B) 2n C) n+1 D) 2n-1

4. What is the asymptotic time complexity to add an element in the linked list? [ ]
A) O(1) B) O(n) C) O(n2) D) None

5. Which Data Structure is used to perform Recursion? [ ]

A) Queue B) Stack C) Linked List D) Tree

6. What does stack overflow refer to? [ ]

A) accessing item from an undefined stack B) adding items to a full stack
C) removing items from an empty stack D) index out of bounds exception

7. What will be the output of sum(8)? [ ]

int sum(int n) {
if (n==0)
return n;
else
return n + sum(n-1);
}
A) 36 B) 40 C) 8 D) 15

8. Queue works on the principle of ________________________ [ ]

A) LIFO B) FIFO C) FILO D) MIMO

9. The value of the expression 9 3 4 * 8 + 4 / - is _____________ [ ]

A) 5 B) 4 C) 0 D) 12

10. A function is said to be _______recursive if there are no pending operations to

perform after recursive call. [ ]
A)direct B) non-tail C) tail D)indirect
Cont..2
Code No: 117CC :2: Set No. 2

II Fill in the Blanks

11. Array List is static in nature created at ___________________ time mostly.

12. We can represent the polynomial with the help of _____________ data structure.

13. ________________________ is a non linear data structure.

14. The operation of visiting each element in the list is known as _________________.

15. The postfix form of the expression (A+ B)*(C*D- E)*F / G is____________________.

16. In linked list implementation of a queue, At the___________________ a new element be inserted.

17. The Big O notation defines an ____________________of an algorithm.

18. The node which has no children is a _______________________.

19. The condition to check the circular queue is empty or not is ______________________ .

20. In circular linked list, the last node always points to _________________________.

-oOo-
Code No: 117CC Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B .Tech. I Sem., I Mid-Term Examinations, September - 2017
DATA STRUCTURES
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

I. Choose the correct alternative:

1. A binary tree with n elements will have number of edges [ ]

A) n-1 B) 2n C) n+1 D) 2n-1

2. What is the asymptotic time complexity to add an element in the linked list? [ ]
A) O(1) B) O(n) C) O(n2) D) None

3. Which Data Structure is used to perform Recursion? [ ]

A) Queue B) Stack C) Linked List D) Tree

4. What does stack overflow refer to? [ ]

A) accessing item from an undefined stack B) adding items to a full stack
C) removing items from an empty stack D) index out of bounds exception

5. What will be the output of sum(8)? [ ]

int sum(int n) {
if (n==0)
return n;
else
return n + sum(n-1);
}
A) 36 B) 40 C) 8 D) 15

6. Queue works on the principle of ________________________ [ ]

A) LIFO B) FIFO C) FILO D) MIMO

7. The value of the expression 9 3 4 * 8 + 4 / - is _____________ [ ]

A) 5 B) 4 C) 0 D) 12

8. A function is said to be _______recursive if there are no pending operations to

perform after recursive call. [ ]
A)direct B) non-tail C) tail D)indirect

9. In linked list each node contain minimum of two fields. One field is data field
to store the data second field is? [ ]
A) Pointer to character B) Pointer to integer C) Pointer to node D) Node

10. Reverse polish notation is the other name of _______________ [ ]

A) Infix B) prefix C) postfix D) expression

Cont..2
Code No: 117CC :2: Set No. 3

II Fill in the Blanks

11. ________________________ is a non linear data structure.

12. The operation of visiting each element in the list is known as _________________.

13. The postfix form of the expression (A+ B)*(C*D- E)*F / G is____________________.

14. In linked list implementation of a queue, At the___________________ a new element be inserted.

15. The Big O notation defines an ____________________of an algorithm.

16. The node which has no children is a _______________________.

17. The condition to check the circular queue is empty or not is ______________________ .

18. In circular linked list, the last node always points to _________________________.

19. Array List is static in nature created at ___________________ time mostly.

20. We can represent the polynomial with the help of _____________ data structure.

-oOo-
Code No: 117CC Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B .Tech. I Sem., I Mid-Term Examinations, September - 2017
DATA STRUCTURES
Objective Exam
Name: ______________________________ Hall Ticket No. A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

I. Choose the correct alternative:

1. Which Data Structure is used to perform Recursion? [ ]

A) Queue B) Stack C) Linked List D) Tree

2. What does stack overflow refer to? [ ]

A) accessing item from an undefined stack B) adding items to a full stack
C) removing items from an empty stack D) index out of bounds exception

3. What will be the output of sum(8)? [ ]

int sum(int n) {
if (n==0)
return n;
else
return n + sum(n-1);
}
A) 36 B) 40 C) 8 D) 15

4. Queue works on the principle of ________________________ [ ]

A) LIFO B) FIFO C) FILO D) MIMO

5. The value of the expression 9 3 4 * 8 + 4 / - is _____________ [ ]

A) 5 B) 4 C) 0 D) 12

6. A function is said to be _______recursive if there are no pending operations to

perform after recursive call. [ ]
A)direct B) non-tail C) tail D)indirect

7. In linked list each node contain minimum of two fields. One field is data field
to store the data second field is? [ ]
A) Pointer to character B) Pointer to integer C) Pointer to node D) Node

8. Reverse polish notation is the other name of _______________ [ ]

A) Infix B) prefix C) postfix D) expression

9. A binary tree with n elements will have number of edges [ ]

A) n-1 B) 2n C) n+1 D) 2n-1

10. What is the asymptotic time complexity to add an element in the linked list? [ ]
A) O(1) B) O(n) C) O(n2) D) None

Cont..2
Code No: 117CC :2: Set No. 4

II Fill in the Blanks

11. The postfix form of the expression (A+ B)*(C*D- E)*F / G is____________________.

12. In linked list implementation of a queue, At the___________________ a new element be inserted.

13. The Big O notation defines an ____________________of an algorithm.

14. The node which has no children is a _______________________.

15. The condition to check the circular queue is empty or not is ______________________ .

16. In circular linked list, the last node always points to _________________________.

17. Array List is static in nature created at ___________________ time mostly.

18. We can represent the polynomial with the help of _____________ data structure.

19. ________________________ is a non linear data structure.

20. The operation of visiting each element in the list is known as _________________.

-oOo-