Scribd
Upload
7 views

Data Structures

Ds using c++

Uploaded by

P Venkatesh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Data Structures

Ds using c++

Uploaded by

P Venkatesh
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

PJR's SPOORTHY DEGREE COLLEGE – KAMAREDDY

(Affiliated to Telangana University)


INTERNAL ASSESSMENT-II
Subject Name: DATA STRUCTURES USING C++
STUDENT NAME: _____________________________ 20
Group & Year: B.Sc. (M.P.Cs) II Year/I SEMESTER, HTNO: ____________________________________
I. Multiple Choice Questions 10X1/2=5
1. A ____________ is a node that does not contain any sub node. [ ]
a) Root node b) Left node c) Right node d) Terminal node
2. A tree can be represented using [ ]
a) Array representation b) Linked representation
c) Binary representation d) All of the above
3. A __________ is a finite set of nodes that is either empty or consist of a root. [ ]
a) Tree b) Binary tree c) Binary tree traversal d) None of the above
4. In binary tree any node can have atmost___________________ branches. [ ]
a) One b) Two c) Three d) Four
5. The sorting method that will be best if number of swapping done is only measure of efficiency is _________
[
]
a) Insertion sort b) Selection sort c) Quick sort d) Merge sort
6. ___________ is a data structure that is used to store dictionary pairs. [ ]
a) Stack b) Queue c) Hash table d) Hash function
7. Each hash table position can store_______________ pair. [ ]
a) One b) Two c) Three d) Four
8. The technique in which the buckets are made to contain the statically allocated data entries is called
____________________. [ ]
a) Static hashing b) Dynamic hashing c) Open hashing d) Directory less dynamic hashing.
9. A heap is a balanced tree that requires__________________ searches to reach a leaf node. [ ]
a) O(n) b) O(n2 log n) c) O(log n) d) None of the above
10. Every node must have a key which is either greater than or equal to that of each of its children is referred
to______________ [ ]
a) Min-heap property b) Max-heap property c) Recall d) None of the above
II. Fill in the Blanks 10X1/2=5
11. The depth of a full binary tree is _________________________________________________.
12. Sorting techniques are generally classified into internal and ______________________________sorting.
13. The average case complexity of selection sort______________________________________.
14. Time complexity of insertion sort is ____________________________________________.
15. TBT stands for___________________________________________________.
16. Hashing is also called as __________________________________mapping process.
17. The method in which outer most partitions are reversed is_______________________________________.
18. _______________________________ is a tendency of the data to form groups within a hashed list.
19. Ascending heap is also called as_____________________________________________________.
20. __________________________________generates minimal spanning tree by selecting smallest weight edges.
III. Answer the followings 5X1=5
1. Define a tree.
2. Define binary tree.
3. Define sorting.
4. Define a graph.
5. Define hashing.
IV. Assignment 5X1=5

You might also like