Test your basic knowledge on DATASTRUCTURES

Classify the Hashing Functions based on the various methods by which the key value is found?
Direct method ,Subtraction method
Modulo-Division method, Digit-Extraction method
Digit-Extraction method, Mid-Square method, Folding method, Pseudo-random method
All of the above
What are the types of Collision Resolution Techniques and the methods used in each of the type?
None of the above
In RDBMS, what is the efficient data structure used in the internal storage representation?
B+ tree
AVL tree
B tree
None of the above

of order3
of order4
of order5
None of the above

Incomplete Binary Tree
Complete Binary Tree
Full Binary Tree
None of the above
What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once.
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree twice.
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree thrice.
None of the above
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Yes
No
Not possible
None of the above

1532
1530
1536
None of the above
Which is the simplest file structure?
Sequential
Indexed
Random
None of the above
Whether Linked List is linear or Non-linear data structure?
According to Access strategies Linked list is a linear one.
According to Storage Linked List is a Non-linear one.
According to Access strategies Linked list is a linear one.& According to Storage Linked List is a Non-linear one.
None of the above
Description:

This test is a very interesting collection of questions in the form of MCQ where the test-takers get an opportunity to check their performance to appear in UGC, NET (Computer Science)

Discussion

Your Facebook Friends on WizIQ

More Tests By Author

ASP Server Controls
10 Questions | 667 Attempts

ASP.NET, Namespaces ASP.NET
10 Questions | 2028 Attempts

An ASP.NET Application
10 Questions | 437 Attempts