Welcome to www.mcqtutorial.com!!!!
      
      
MCQ Tutorial Search
Home Search Add Question Today's History Discussion Board Job Portal Computer Science Basic Fundamental
Networking

Data Structure

System Analysis and Design Mock Test Contact Feedback
Home
Search
Add Question
Today's History
Discussion Board
Job Portal
Computer Science
Basic Fundamental
Networking

Data Structure

System Analysis and Design
Mock Test
Subscribe/Unsubscribe
Email:
Social Media
Facebook

Misc Tutorials

References

Question and Answer Tutorial
Tutorials Point
Stack Overflow

MCQ Tutorial - Computer Science->Data Structure

First Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next Last
1.) When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
Options are:
A.) FAEKCDBHG
B.) EAFKHDCBG
C.) FEAKDCHBG
D.) FAEKCDHGB
2.) The complexity of Bubble sort algorithm is
Options are:
A.) O(n logn)
B.) O(n2)
C.) O(n)
D.) O(logn)
                        
3.) Two dimensional arrays are also called
Options are:
A.) Tables arrays
B.) Matrix arrays
C.) None of the options
D.) Both Tables and Matrix arrays
4.) Linked lists are best suited
Options are:
A.) For none of above situation
B.) For the size of the structure and the data in the structure are constantly changing
C.) For relatively permanent collections of data
D.) For both of above situation
5.) When representing any algebraic expression E which uses only binary operations in a 2-tree,
Options are:
A.) The variables and operations in E will appear only in external nodes
B.) The variable in E will appear as external nodes and operations in internal nodes
C.) The operations in E will appear as external nodes and variables in internal nodes
D.) The variables and operations in E will appear only in internal nodes
                        
First Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next Last
Comment:
Name:Email:
Contact No.:
Copyright © 2014 by SBJ Group. All Rights Reserved. Developed and maintained by SBJ Group. Supported on Internet Explorer browser only