Home
Services
Our Products
Palette RGB
Code Asteroid
Skill Test
Code War
Videos
News
Jobs & Hiring
Tech News
Startups
Aptitude Test
Technology
Developer Corner
Tutorials
Sign In
Sign Up
Jobs & Hiring
Tech News
Developer Corner
Startups
Home
Services
Our Products
›
Back
‹
Palette RGB
Code Asteroid
Skill Test
Code War
Videos
News
›
Back
‹
Jobs & Hiring
Tech News
Startups
Aptitude Test
Technology
›
Back
‹
Developer Corner
Tutorials
Instruction
This test contains a total of 20 questions.
Do not switch the tab or open a new window, otherwise, the test will be submitted automatically.
Test time is 15 minutes.
Data Structure (War begins 3)
Q 1.
Which among the following is a Dynamic Link Library contain?
Code, Data, and Resources
Code and Data Only
Code and Resources only
Only Code
Q 2.
2-D arrays are also called
tables arrays
matrix arrays
none of the above
Both A and B
Q 3.
Time taken for the addition of elements in the queue is
O(log n)
O(n)
O(1)
None of the above
Q 4.
FIFO (First In First Out) is an example of --
queue
stack
array
linked list
Q 5.
LIFO (Last In First Out) is an example of --
queue
stack
array
linked list
Q 6.
What its inorder predecessor, if a node in a BST has two children
no left child
no right child
two children
no child
Q 7.
How many nodes contained by a full binary tree with n leaves
(2n-1) nodes
(log2 n)nodes
n nodes
2^n nodes
Q 8.
Process of removing an element from an empty stack is
removing
underflow
deleting
overflow
Q 9.
Process of removing an element from the stack is known as
Crush
Evaluate
Pop
None of the Above
Q 10.
The queues follow
LIFO
FIFO
LILO
None of the Above
Q 11.
Which is not the application of stack?
balancing symbols
line at ticket counter
evaluation of postfix expression
Both A and B
Q 12.
Following operation on the data structure
selection
deletion
creation
All of the Above
Q 13.
Convert the following expression into postfix expression
650
350
400
550
Q 14.
Another name of Circular Queue
Ring Buffer
Circular Buffer
Circle Buffer
Curve Buffer
Q 15.
Asymptotic time complexity to find an element in the linked list is
O(N+1)
n
O(n)
1
Q 16.
One-dimensional Array is known as
Vertical Array
Horizontal Array
Straight Line Array
Linear Array
Q 17.
Which of the following bitwise operator will you use to invert all the bits in a bit array
NOT
NAND
OR
AND
Q 18.
Dynamic Array is
The memory to the array is allocated at runtime
A variable size data structure
An array which is reallocated everytime whenever new elements have to be added
All of the Above
Q 19.
Queues serve major role in
Simulation of heap sort
Simulation of recursion
Simulation of limited resource allocation
Simulation of arbitrary linked list
Q 20.
First Index of Array is
1
0
-1
None of the Above
Reload Test
Back skill tests
Time:
Want to get latest updates of IT industry?
Subscribe to our newsletter!