Scribd
Upload
8 views1 page

Data Stuructures 2nd Internal

Uploaded by

Arvind K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views1 page

Data Stuructures 2nd Internal

Uploaded by

Arvind K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Telangana University

CARE DEGREE COLLEGE (5002)


Internal Assessment Test – 2
Sub: Data Structure using C++
Time: 30 min
Max Marks: 20
Name of the Student: ___________________
H.T.No: ______________________________ Group & Sem/Year: BSc(Comp.App) 2nd Yr III sem

I) Multiple Choice Questions 10 X 1/2= 5


1.The operation of processing each element in the list is known as_________________ ( )
a) Sorting b) Transversal c) Merging d) Inserting
2.A_____________ is a node that does not contain any sub node. ( )
a) root node b)left node c)right node d) terminal nodes
3. In binary tree any node can have at most _________ branches ( )
a) one b) two c) three d) four
4. ____________ is also known as partition exchange sort ( )
a) Quick sort b) Insertion sort c) Merge sort d) Selection sort
5. Which of the following data structure is non linear type?
a) Strings b) List c) Stacks d) Graphs
6. A terminal nodes in a binary tree is called________________ ( )
a) root b)leaf c) child d) branch
7. Which of the following is useful in traversing a given graph by breadth first search ( )
a) stack b)set c)queue d) list
8. Which of the following is useful in implementing quick sort ( )
a) stacks b)set c)list d) queue
9. In linked list each node contains a 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. Which of the following is a linear data structure ( )
a) Binary tree b) Graph c) Array d) None

II) Fill in the blanks 10 X 1/2= 5


1. When a pop() operation is called on an empty queue, what is the condition called_____________
2. ___________data structures allow insertion and deletion from both ends.
3. A _______________ is a linear list, also known as LIFO list.
4. A ________________ is a linear list, also known as FIFO list.
5. In _____________traversal, the root node is visited last.
6. Prim’s algorithm to find______________________ spanning tree.
7. New nodes are added at the____________ of the list.
8. Items are inserted at the______________ of the stack.
9. Children of the same parent are called ______________
10. _________________ is a technique of organizing data.
III) Answer the following questions. 5X1=5
1. Define searching?
2. What is spanning tree?
3. Define binary tree?
4. Define sorting?
5. Explain about weighted graph?
IV) Answer any 1 of the following assignment questions. 5X1=5
1. Explain and write Insertion Sort Program? 2. Explain about DFS?

You might also like