NEW
Font size
WorksheetsData Structure CO5 Quiz
Total questions: 60
Worksheet time: 31mins
If the insertion and deletion happens from both the ends then the queue is called a______Queue
a) Deque
b) Header
c) Queue
d) Circular Queue
Process of inserting an element in stack is called ____________
Create
Push
Evaluation
Pop
Entries in a stack are “ordered”. What is the meaning of this statement?
A collection of stacks is sortable
Stack entries may be compared with the ‘<‘ operation
The entries are stored in a linked list
There is a Sequential entry that is one by one
Which of the following applications may use a stack?
a) A parentheses balancing program
b) Tracking of local variables at run time
c) Compiler Syntax Analyzer
d) Data Transfer between two asynchronous process
What is the value of the postfix expression 6 3 2 4 + – *:
1
14
74
-18
The data structure required to check whether an expression contains balanced parenthesis is?
a) Stack
b) Queue
c) Array
d) Tree
Circular Queue is also known as ________
a) Ring Buffer
b) Square Buffer
c) Rectangle Buffer
d) Curve Buffer
If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?
a) ABCD
b) DCBA
c) DCAB
d) ABDC
Linked list data structure offers considerable saving in _____________
a) Computational Time
b) Space Utilization
c) Space Utilization and Computational Time
d) Speed Utilization
To represent hierarchical relationship between elements, Which data structure is suitable?
Dequeue
Priority
Tree
Graph
Match the following.
a) Completeness i) How long does it take to find a solution
b) Time Complexity ii) How much memory need to perform the search.
c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in one.
a-iii, b-ii, c-i
a-i, b-ii, c-iii
a-iii, b-i, c-ii
a-i, b-iii, c-ii
___________ is neither an algorithm nor a program.
a.Computing
b.Pseudo code
c.Computer science
d.None of the above
Efficiency of an algorithm is measured by
Time and Capacity complexity
Time and Space complexity
Speed and Space complexity
Speed and Capacity complexity
Data in the data structures are processed by operations like insertion, deletion, sorting, merging and
Traversing
Searching
Retrieval
Both A and B
To measure Time complexity of an algorithm Big O notation is used which:
A. describes limiting behaviour of the function
B. characterises a function based on growth of function
C. upper bound on growth rate of the function
D. all of the mentioned
If for an algorithm time complexity is given by O(1) then complexityof it is:
A. constant
B. polynomial
C. exponential
D. none of the mentioned
If for an algorithm time complexity is given by O(n) then complexityof it is:
A. constant
B. linear
C. exponential
D. none of the mentioned
Almost all programming languages start arrays at ___
index 0
index 1
index 2
the null character
In almost all programming languages, what kind of bracketing is used to denote array access?
round brackets
square brackets
curly braces
quotation marks
Most often, to save a string into memory, you just put it in ___
square brackets
round brackets
quotes
curly braces
A two-dimensional list, which can be thought of as an array of arrays, is called ___
a matrix
a struct
a tree
a grid
A data type that can be used to group items of possibly different types into a single type is called ___
a root
a struct
a tree
a pointer
A type of struct that stores a variable, like a number, and also a pointer is called ___
a nodule
a radix
a node
a root
A flexible data structure that can store many nodes is called ___
a tree
a linked list
a pointer
a queue
In a tree data structure, any nodes that hang from other nodes are called ___
branched nodes
leaf nodes
children nodes
daughter nodes
In a tree data structure, any nodes that have no children (where the tree ends) are called ___
boundary nodes
leaf nodes
orphan nodes
terminal nodes
An important property of trees is that there’s a one-way path from ___
branch to branch
roots to leaves
parent to daughter
peak to trough
Which data structure is used for data that links arbitrarily, and includes things like loops?
binary trees
circular trees
graphs
dynamic linked stacks
People have used the word ________ to mean computer information that is transmitted or stored.
Beta
Data
Database
None of above
_____________ specifies how we enter data into our programs and what type of data we enter.
data type
data
datum
all of above
In ___________ data structure data items are not in sequence.
non linear
linear
non-homogeneous
all of above
____________data structures are those whose sizes and structures associated memory locations are fixed at compile time.
linear
homogeneous
static
dynamic
Stack uses __________ data structure as the element that was inserted last is the first one to be taken out.
LIPO
FIFO
LIFO
FIPO
Full form of LIFO is ____________
Last Inside First Outside
Last Innner First Outer
Last In First Out
Last Impact First Out
Every stack has a variable _________ associated with it.
TOP
BOT
POT
none of the above
_________ operation adds an element to the top of the stack.
pop
push
peep
all of the above
_________ operation removes the element from the top of the stack.
push
pop
update
none of the above
_________ operation returns the value of the topmost element of the stack.
push
pop
peep
update
_________ operation changes the value of element given by user of the stack.
push
pop
peep
update
A function calls itself is called ___________.
queue
recursion
function
none of above
The elements in a queue are added at one end called ________.
front
rear
near
none of above
What is the value of the ROOT node in this Tree?
35
24
42
20
Root
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Tree
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
the starting node in a rooted tree structure from which all other nodes branch off./
Binary TREE
data structure similar to a graph, with no loops.
an object in a graph also known as a vertex
a join of relationship between nodes - also know as an arc
a tree where each node can only have 2 child nodes attached to it
In preorder traversal of a binary tree the second step is ____________
traverse the right subtree
traverse the left subtree
traverse right subtree and visit the root
visit the root
The decision tree structure begins at a node called the _____.
span
top
root
branch
How many leaf are there in the tree?
1
3
4
7
Which of these tree traversal methods is used to output the contents of a binary tree in ascending order?
Pre-Order
In-Order
Post-Order
Monastic Orders
What are the 3 depth traversals for a tree data structure?
Pre-, In- and Post-order
Pro-, In- and Past-order
Pre-, Out- and Post-order
Pre-, In- and New-order
A Data Structure is:
A C++ vector
A way of organizing, storing and performing operations on data.
A function in any programming language
A sequence of steps to solve a problem.
Given a sequence of number below:
50,60,40,70,45,55,30,80,65,35,25,75,85
When creating a binary search tree, what is the height of the tree?
3
4
5
6
Given a binary search tree, insert 27, 15, 63, 99, 70 and 85 (in this order) into the binary search tree. What is the post-order traversal?
5,15,27,34,47,54,63,70,72,75,83,85,88,94,99,101
72,54,34,5,27,15,47,63,70,83,75,88,85,101,94,99
15,27,5,47,34,70,63,54,75,85,99,94,101,88,83,72
15,27,5,47,34,63,54,70,75,85,99,94,101,88,83,72
none of the above
Choose the correct statement
A data structure is a specialised format for organising and storing data
A data structure is a specialised format for organising and storing information
A data structure is a format for organising and storing only one data type
A data structure is too complicated to truly understand or use
Example of linear data structure except
array
tree
queue
stack
