Toggle navigation
Toggle navigation
Classes
Quizzes
Sign in
Sign up
Go
Basic Programming

Take A Quiz
Toggle navigation
Classes
Quizzes
Go
Sign in

Sign up
Basic Programming
19 Quiz Sets
Basic Programming
Data Structures Fundamentals Test
Answer
25
questions in 10 minutes.
Data Structures Fundamentals Test 
A procedure that calls itself in a program is called _______.
Recursion
The count can be zero or CAPACITY  but no other value can occur
Tree
Repeat
Loop
What is the worstcase scenario for mergesort to sort an array of n elements?
O(log n)
O(n2)
O(n)
O(n log n)
In the linked representation of a sparse matrix  the head node for a column list stores_____
column number
a pointer to the next column head node
a+*b/cde+fgh
a pointer to the first node in the column list
All of the above
The minimum number of interchanges needed to convert the array 89  19  14  40  17  12  10  2  5  7  11  6  9  70 into a heap with the maximum element at the root is:
Something between 15 and 100
1
2
3
What is the value of the postfix expression 6 3 2 4 +  *?
A parentheses balancing program
Something between 5 and 15
Something between 15 and 100
Something between 15 and 100
Something between 5 and 15
What is the preorder traversal equivalent of the following algebraic expression? [a+(bc)]*[(de)/(f+gh)]
*+abc/d+efgh
abc+defg+h/*
a+*b/cde+fgh
Two entries with different data have exactly the same key
*+abc/de+fgh
Which of the following data structures has a balanced condition?
Double Ended Queue
Stack
AVL Tree
Doubly Linked List
the same degree
In a selection sort algorithm  the number of passes required to perform the sort are ______.
N1
N^2
N
10
N2
A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
different degrees
the same degree
ABDC
even degrees
odd degrees
Which operations require linear time for their worstcase behavior in the linkedlist version of a queue?
front
push
empty
4.2
None of these operations require linear time
In which dynamically created linked list can the first node be recovered after moving to the second node?
Circular linked list
Simple linked list
Both b and c
Doubly linked list
2h + 1 + 1
What is the maximum number of statements that may be recursive calls in a single function declaration?
There is no fixed maximum
2
1
n (n is the argument)
Complete graph
Which of the following applications may use a stack?
All of the above
A parentheses balancing program
2d2
Keeping track of local variables at run time
Syntax analyzer for a compiler
Which term is used to describe an O(n) algorithm?
Linear
Postorder traversal
Quadratic
Logarithmic
Constant
The number of nodes in the largest maximal independent set of the complete bipartite graph K(4  2) is_____ .
4
Dequeue
6
3
2
What kind of initialization needs to be done for a chained hash table?
Dequeue
The key at each array location must be initialized
Both B and C must be carried out
The head pointer of each chain must be set to NULL
None
Which of these are standard operations of Stack Data Structure?
Insert  pop
Push  pop
Put  extract
Both insertion and removal are better than linear
Push  delete
What is the meaning of the statement: 'Entries in a stack are 'ordered''?
The entries must be stored in a linked list
Stack entries may be compared with the '<' operation
There is a first entry  a second entry  and so on
ABDC
A collection of stacks can be sorted
Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
Deletion
Insertion
Both a and b
None of the above
More than that of A(G)
A matrix is called sparse when______
all of its elements are nonzero
None of the above
most of its elements are zero
most of its elements are nonzero
Doubly Linked List
You have implemented a queue with a circular array keeping track of the first  the last  and the count (the number of items in the array). Suppose the first is zero  and the last is CAPACITY1  what can you say about the count?
The count must be zero
None of the above
Circular queue
The count can be zero or CAPACITY  but no other value can occur
The count must be CAPACITY
In a graph G  F is a spanning forest of G if (i)F is a subgraph of G containing all the nodes of G (ii)F is an order forest containing trees T1  T2  ...Tn (iii)Ti contains all the nodes that are reachable in G from the root Ti and are contained in Tj for some j<i.. Which of the above conditions is/are true?
(i)  (ii) and (iii)
(i)  (ii)
(ii)  (iii)
about log(n)
(i)  (iii)
Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4  the location which will never be probed is:
4
O(n)
2
5
8
Which situation occurs frequently if the selected hash function is poor?
None of the above
Overflow
Collision
Underflow
efficient in accessing an entry
Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?
Preorder traversal
Postorder traversal
In order traversal
11
Topdown traversal
×
Please login to subscribe
×
Subscribed Successfully
GET PROVEN ADVICE FROM
100+ BEST BOOKS IN 1 BOOK
The World's First & Only Encyclopedia of
Self Help, Self Improvement & Career Advice
250+ EasytoFollow Guides
5000+ Proven Tips
13 Types of Essential Skills
502 Pages  $3.99  PDF / EPub, Kindle Ready
Please login/register to bookmark chapters.
Subjects
Aptitude
Basic Life Skills
High School
Elementary School
Entrance and Placement Exams
Jobs and Occupations
Information Technology
Certifications
Business Skills
Trades and Vocational
Languages
English
Healthcare
Math
Science and Technology
Education Standards and Boards
Humanities
Law
Explore
Browse Fatskills by topics
All Subjects on Fatskills
Popular Tests on Fatskills
Fatskills Career Aptitude Tests
Fatskills Community
About Fatskills
Help
Privacy Policy
Terms of Use
Fatskills on Facebook
Please report any error in fatskills quizzes and questions to 'simpleversity at gmail.com'.
Without work one finishes nothing.  Ralph Waldo Emerson
© The
Simple
Project 2020