www.jntuworld.

com

Code No: A109100106 Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD I B.Tech. III Mid Examinations, May 2010 COMPUTER PROGRAMMING AND DATA STRUCTURES Objective Exam Name: ______________________________ Hall Ticket No. A Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. I. 1. Choose the correct alternative: C Supports ________ a) Only Text Streams c) Both Text and Binary Streams [ b) Only Binary Streams d) No Streams ]

2.

Opening a file that exists in the system with write mode _______ a) Deletes the existing file and creates an empty file for writing b) Erases the old content and allows for writing new content c) Opens the file and appends the new content to the existing content d) Results an error message File Already Exists Which of the following is not a Standard Stream a) stdin b) stdout c) stderr d) stdfile

3.

4.

Which of the following uses the divide-and-conquer design strategy a) Binary Search b) Linear Search c) Insertion Sort d) Selection Sort Which of the following an external sorting technique a) Quick Sort b) Merge Sort c) Selection Sort d) Insertion Sort Which of the following is the best sorting technique to sort large data sets a) Insertion Sort b) Selection Sort c) Bubble Sort d) Quick Sort

5.

6.

T N

W U

R O

D L

7.

Which of the following allows insertion and deletion of elements at any place in the list? [ a) Stack b) Queue c) Linked List d) Double Ended Queue (DeQueue) Which of the following is not an application of Stacks? a) Checking the Balancing of parenthesis in an expression b) Converting an expression from infix to postfix c) Evaluating the Postfix Expression d) Keeping track of the jobs submitted to a printer [

8.

Cont.2

www.jntuworld.com

www.jntuworld.com

Code No: A109100106 9.

:2:

Set No. 1

Which of the following is an equivalent postfix form of the infix expression (Based on C language Precedence and Associativity Rules) : A + B * C D / E [ ] a) AB+C*D-E/ b) ABC*+DE/- c) ABC*+D-E/ d) AB+CD-*E/ Finding the previous element of a given element in the list is easy in which of the following implementations of the List [ a) Doubly Linked List b) Circular Linked List c) Singly Linked List d) All the above three Lists Fill in the blanks In a Queue, deletion of an element takes place at the end called as __________ _____ searching technique requires the elements to be in sorted order

10.

II 11. 12. 13. 14. 15.

Collection of elements and their relationships are called as _________

In a Singly Linked List, each node must contain data and _____ to the next node If the last node of the singly linked list points to the first node of the same list, then the list is called as _______ Time Complexity (efficiency) of the linear search is _____ Time Complexity of the Selection Sort is ______ ____ function checks for end of file rewind() function sets the file position pointer to ________ _____ files contain data stored in the internal format of the computer

16. 17. 18. 19. 20.

T N

W U
-oOo-

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A109100106 Set No. 2 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD I B.Tech. III Mid Examinations, May 2010 COMPUTER PROGRAMMING AND DATA STRUCTURES Objective Exam Name: ______________________________ Hall Ticket No. A Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. I. 1. Choose the correct alternative: Which of the following uses the divide-and-conquer design strategy a) Binary Search b) Linear Search c) Insertion Sort d) Selection Sort Which of the following an external sorting technique a) Quick Sort b) Merge Sort c) Selection Sort d) Insertion Sort [ ]

2.

3.

Which of the following is the best sorting technique to sort large data sets a) Insertion Sort b) Selection Sort c) Bubble Sort d) Quick Sort

4.

Which of the following allows insertion and deletion of elements at any place in the list? [ a) Stack b) Queue c) Linked List d) Double Ended Queue (DeQueue) Which of the following is not an application of Stacks? a) Checking the Balancing of parenthesis in an expression b) Converting an expression from infix to postfix c) Evaluating the Postfix Expression d) Keeping track of the jobs submitted to a printer

5.

6.

Which of the following is an equivalent postfix form of the infix expression (Based on C language Precedence and Associativity Rules) : A + B * C D / E [ ] a) AB+C*D-E/ b) ABC*+DE/- c) ABC*+D-E/ d) AB+CD-*E/ Finding the previous element of a given element in the list is easy in which of the following implementations of the List [ a) Doubly Linked List b) Circular Linked List c) Singly Linked List d) All the above three Lists C Supports ________ a) Only Text Streams c) Both Text and Binary Streams [ b) Only Binary Streams d) No Streams Cont.2 www.jntuworld.com

T N

W U

R O

D L

7.

8.

www.jntuworld.com

Code No: A109100106 9.

:2:

Set No. 2 [ ]

Opening a file that exists in the system with write mode _______ a) Deletes the existing file and creates an empty file for writing b) Erases the old content and allows for writing new content c) Opens the file and appends the new content to the existing content d) Results an error message File Already Exists Which of the following is not a Standard Stream a) stdin b) stdout c) stderr d) stdfile

10.

II 11. 12.

Fill in the Blanks In a Singly Linked List, each node must contain data and _____ to the next node

If the last node of the singly linked list points to the first node of the same list, then the list is called as _______ Time Complexity (efficiency) of the linear search is _____ Time Complexity of the Selection Sort is ______ ____ function checks for end of file

13. 14. 15. 16. 17. 18. 19. 20.

rewind() function sets the file position pointer to ________ _____ files contain data stored in the internal format of the computer In a Queue, deletion of an element takes place at the end called as __________ _____ searching technique requires the elements to be in sorted order Collection of elements and their relationships are called as _________ -oOo-

T N

W U

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A109100106

Set No. 3

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD I B.Tech. III Mid Examinations, May 2010 COMPUTER PROGRAMMING AND DATA STRUCTURES Objective Exam Name: ______________________________ Hall Ticket No. A Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. I. 1. Choose the correct alternative: Which of the following is the best sorting technique to sort large data sets a) Insertion Sort b) Selection Sort c) Bubble Sort d) Quick Sort [ ]

2.

Which of the following allows insertion and deletion of elements at any place in the list? [ a) Stack b) Queue c) Linked List d) Double Ended Queue (DeQueue) Which of the following is not an application of Stacks? a) Checking the Balancing of parenthesis in an expression b) Converting an expression from infix to postfix c) Evaluating the Postfix Expression d) Keeping track of the jobs submitted to a printer

3.

4.

Which of the following is an equivalent postfix form of the infix expression (Based on C language Precedence and Associativity Rules) : A + B * C D / E [ ] a) AB+C*D-E/ b) ABC*+DE/- c) ABC*+D-E/ d) AB+CD-*E/ Finding the previous element of a given element in the list is easy in which of the following implementations of the List [ a) Doubly Linked List b) Circular Linked List c) Singly Linked List d) All the above three Lists C Supports ________ a) Only Text Streams c) Both Text and Binary Streams [ b) Only Binary Streams d) No Streams [ ]

5.

T N

W U

R O

D L

6.

7.

Opening a file that exists in the system with write mode _______ a) Deletes the existing file and creates an empty file for writing b) Erases the old content and allows for writing new content c) Opens the file and appends the new content to the existing content d) Results an error message File Already Exists Which of the following is not a Standard Stream a) stdin b) stdout c) stderr d) stdfile www.jntuworld.com

8.

[ Cont.2

www.jntuworld.com

Code No: A109100106

:2:

Set No. 3

9.

Which of the following uses the divide-and-conquer design strategy a) Binary Search b) Linear Search c) Insertion Sort d) Selection Sort Which of the following an external sorting technique a) Quick Sort b) Merge Sort c) Selection Sort d) Insertion Sort Fill in the blanks Time Complexity (efficiency) of the linear search is _____ Time Complexity of the Selection Sort is ______ ____ function checks for end of file rewind() function sets the file position pointer to ________

10.

II 11. 12. 13. 14. 15. 16. 17. 18. 19. 20.

_____ files contain data stored in the internal format of the computer In a Queue, deletion of an element takes place at the end called as __________ _____ searching technique requires the elements to be in sorted order Collection of elements and their relationships are called as _________ In a Singly Linked List, each node must contain data and _____ to the next node If the last node of the singly linked list points to the first node of the same list, then the list is called as _______

T N

W U
-oOo-

R O

D L

www.jntuworld.com

www.jntuworld.com

Code No: A109100106 Set No. 4 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD I B.Tech. III Mid Examinations, May 2010 COMPUTER PROGRAMMING AND DATA STRUCTURES Objective Exam Name: ______________________________ Hall Ticket No. A Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. I. 1. Choose the correct alternative: Which of the following is not an application of Stacks? a) Checking the Balancing of parenthesis in an expression b) Converting an expression from infix to postfix c) Evaluating the Postfix Expression d) Keeping track of the jobs submitted to a printer [ ]

2.

Which of the following is an equivalent postfix form of the infix expression (Based on C language Precedence and Associativity Rules) : A + B * C D / E [ ] a) AB+C*D-E/ b) ABC*+DE/- c) ABC*+D-E/ d) AB+CD-*E/ Finding the previous element of a given element in the list is easy in which of the following implementations of the List [ a) Doubly Linked List b) Circular Linked List c) Singly Linked List d) All the above three Lists C Supports ________ a) Only Text Streams c) Both Text and Binary Streams

3.

4.

5.

Opening a file that exists in the system with write mode _______ a) Deletes the existing file and creates an empty file for writing b) Erases the old content and allows for writing new content c) Opens the file and appends the new content to the existing content d) Results an error message File Already Exists Which of the following is not a Standard Stream a) stdin b) stdout c) stderr d) stdfile Which of the following uses the divide-and-conquer design strategy a) Binary Search b) Linear Search c) Insertion Sort d) Selection Sort Which of the following an external sorting technique a) Quick Sort b) Merge Sort c) Selection Sort d) Insertion Sort

T N

W U

R O

D L

b) Only Binary Streams d) No Streams [ ]

6.

7.

8.

Cont.2 www.jntuworld.com

www.jntuworld.com

Code No: A109100106

:2:

Set No. 4

9.

Which of the following is the best sorting technique to sort large data sets a) Insertion Sort b) Selection Sort c) Bubble Sort d) Quick Sort

10.

Which of the following allows insertion and deletion of elements at any place in the list? [ a) Stack b) Queue c) Linked List d) Double Ended Queue (DeQueue) Fill in the Blanks ____ function checks for end of file rewind() function sets the file position pointer to ________

II 11. 12. 13. 14. 15. 16. 17. 18.

_____ files contain data stored in the internal format of the computer

In a Queue, deletion of an element takes place at the end called as __________ _____ searching technique requires the elements to be in sorted order Collection of elements and their relationships are called as _________

In a Singly Linked List, each node must contain data and _____ to the next node If the last node of the singly linked list points to the first node of the same list, then the list is called as _______ Time Complexity (efficiency) of the linear search is _____ Time Complexity of the Selection Sort is ______

19. 20.

T N

W U
-oOo-

R O

D L

www.jntuworld.com