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

Take A Quiz
Toggle navigation
Classes
Quizzes
Subjects
Go
Sign in

Sign up
Basic Programming
Take a practice test
19 Quiz Set/s
Basic Programming
19 Quiz Sets
Basic Programming
Data Structures Fundamentals Test
Can you answer
25
questions in 10 minutes?
Data Structures Fundamentals Test 
Which of the following formulae in bigOh notation best represents the expression n2+35n+6?
O(n2)
O(n3)
O(42)
More than that of A(G)
O(n)
Which of the following data structures has a balanced condition?
Doubly Linked List
The same degree
Double Ended Queue
Stack
AVL Tree
What is the worstcase scenario for mergesort to sort an array of n elements?
O(n2)
O(n)
O(n log n)
O(log n)
A sparse matrix can be a lowertriangular matrix when____.
None of the above
All the nonzero elements lie below the leading diagonal
All the nonzero elements lie only on the leading diagonal
All the nonzero elements lie above the leading diagonal
A+*b/cde+fgh
What is the minimum number of nodes in a full binary tree with depth 3?
15
11
4
8
Stacks use two ends of the structure but queues use only one
How many real links are required for a sparse matrix having 10 rows  10 columns and 15 nonzero elements? (Pick the nearest answer)
Front
20
15
100
50
Using which traversal in a sorted binary insertion tree can a sorted array of numbers be obtained?
Postorder traversal
11
Topdown traversal
In order traversal
Preorder traversal
For a complete binary tree with depth d  the total number of nodes is:
2d
2d2
Add
2d+1
2d1
What is the preorder traversal equivalent of the following algebraic expression? [a+(bc)]*[(de)/(f+gh)]
A+*b/cde+fgh
Abc+defg+h/*
Two entries with different data have exactly the same key
*+abc/de+fgh
*+abc/d+efgh
A simple graph with n vertices and k components can have at the most _______.
(nk)(nk+1)/2 edges
(nk)(nk1)/2 edges
Nk edges
N edges
A binary tree  all the levels of which except possibly the last have the maximum number of nodes and all the nodes at the last level appear as far left as possible  is known as:
Quadratic time
Threaded tree
2Tree
Complete binary tree
Full binary tree
Which of the operations is simpler in the doubly linked list than it is in the simple linked list?
Both a and b
More than that of A(G)
Deletion
Insertion
None of the above
What is the best definition of a collision in a hash table?
Doubly linked list
Two entries with exactly the same key have different hash values
Two entries are identical except for their keys
Two entries with different data have exactly the same key
Two entries with different keys have exactly the same hash value
What is the value of the postfix expression 6 3 2 4 +  *?
Something between 15 and 100
Something between 5 and 15
Something between 15 and 100
Something between 5 and 15
A parentheses balancing program
A non planar graph with the minimum number of vertices has:
10 edges  5 vertices
9 edges  6 vertices
6 edges  4 vertices
X:=LINK[LINK[X]]
9 edges  5 vertices
In a selection sort algorithm  the number of passes required to perform the sort are ______.
N
N2
10
N^2
N1
Which of the following is the worstcase scenario for operations on heaps?
9 edges  6 vertices
Neither insertion nor removal is better than linear
Removal is better than linear  but insertion is not
Both insertion and removal are better than linear
Insertion is better than linear  but removal is not
The postorder traversal of a binary tree starts with:
Postorder traversal of the root
Postorder traversal of the lowest node
Overflow
Postorder traversal of the left sub tree
Postorder traversal of the right sub tree
Where does the push member function place the new entry on the linked list in the linked list implementation of a queue?
After all other entries that are smaller than the new entry
Postorder traversal
After all other entries that are greater than the new entry
At the tail
At the head
If a max heap is implemented using a partially filled array called data  and the array contains n elements (n > 0)  where is the entry with the greatest value?
Loop
Data[2*n + 1]
Data[n1]
Data[0]
Data[n]
Which graph traversal algorithm uses a queue to keep track of the vertices which need to be processed?
Breadthfirst search
Depthfirst search
A given connected graph G is a Euler graph if and only if all vertices of G are of ______.
ABDC
The same degree
Even degrees
Odd degrees
Different degrees
What is the maximum depth of recursive calls a function may make?
There is no fixed maximum
N (where n is the argument)
Quadratic time
2
1
Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child  where will the right child's value be stored (the array's first index is 0)?
Data[2*i + 2]
Data[i+1]
Data[i+2]
Last + (1 % CAPACITY)
Data[2*i + 1]
The linked list implementation of sparse matrices is superior to the generalized dope vector method because it is __________.
All of these
Conceptually easier and completely dynamic
Formal parameters
Efficient if the sparse matrix is a band matrix
Efficient in accessing an entry
×
Please login to subscribe
×
Subscribed Successfully
The First & Only Encyclopedia of Self Help,
Self Improvement & Career Advice
250+ EasytoFollow Guides
5000+ Proven Tips
13 Types of Essential Skills Covered
Get The Value of 100+ Best Books in 1 Book.
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