8/15/2019 System Data Structure
1/22
Save Answer Clear Answer
Q.1 :‐Convert the following infix expression into postfix expression using stacks: A ^ B* C ‐ D + E / F / (G+H)
Q.2 :‐Write an algorithm for inserting an element into linked list.
Section 1 01 : 57 : 29
Instruction/Guide End Test
SECTION 1
1 2 3 4
SECTION 2
SECTION 3
(INDEX.HTML) (index.html#)
http://void%28%27center%27%29/http://void%28%27underline%27%29/http://void%28%27bold%27%29/http://void%28%27insert%20special%20character%27%29/http://exam.amityonline.com/exam/june2016/index.html#http://void%28%27increase%20indent%27%29/http://void%28%27superscript%27%29/http://void%28%27align%20left%27%29/http://void%28%27increase%20indent%27%29/http://void%28%27decrease%20indent%27%29/http://void%28%27superscript%27%29/http://void%28%27italic%27%29/http://void%28%27bold%27%29/http://void%28%27insert/Remove%20Numbered%20List')http://void%28%27italic%27%29/http://void%28%27insert%20equation%27%29/http://void%28%27align%20right%27%29/http://void%28%27subscript%27%29/http://void%28%27decrease%20indent%27%29/http://void%28%27insert%20special%20character%27%29/http://void%28%27align%20left%27%29/http://void%28%27select%20all%27%29/http://void%28%27image%27%29/http://void%28%27center%27%29/http://void%28%27select%20all%27%29/http://void%28%27image%27%29/http://void%28%27underline%27%29/http://void%28%27insert/Remove%20Numbered%20List')http://void%28%27subscript%27%29/http://void%28%27align%20right%27%29/http://exam.amityonline.com/exam/june2016/index.htmlhttp://void%28%27insert/Remove%20Bulleted%20List')http://void%28%27insert/Remove%20Bulleted%20List')http://void%28%27insert%20equation%27%29/
8/15/2019 System Data Structure
2/22
Save Answer Clear Answer
Q.3 :‐Expalin breadth first algorithm for traversal of graphs.
Q.4 :‐Give an algorithm for binary searching.
Consider the following queue of charactes, where QUEUE is acircular array
which is allocated six memory cells: FRONT = 2, REAR = 4, QUEUE: ‐‐‐, A, C, D, ‐‐‐‐, ‐‐‐‐. (For notational convenience, "…." has been used to denote an emptymemory cell) Describe the queue as the following operations take place: (Notethat all operations are follwing the previous ones)
Section 2
http://void%28%27bold%27%29/http://void%28%27insert/Remove%20Bulleted%20List')http://void%28%27insert%20special%20character%27%29/http://void%28%27insert/Remove%20Numbered%20List')http://void%28%27align%20left%27%29/http://void%28%27insert/Remove%20Numbered%20List')http://void%28%27underline%27%29/http://void%28%27insert/Remove%20Bulleted%20List')http://void%28%27decrease%20indent%27%29/http://void%28%27align%20right%27%29/http://void%28%27italic%27%29/http://void%28%27align%20left%27%29/http://void%28%27bold%27%29/http://void%28%27increase%20indent%27%29/http://void%28%27image%27%29/http://void%28%27insert%20equation%27%29/http://void%28%27select%20all%27%29/http://void%28%27underline%27%29/http://void%28%27increase%20indent%27%29/http://void%28%27superscript%27%29/http://void%28%27subscript%27%29/http://void%28%27image%27%29/http://void%28%27italic%27%29/http://void%28%27align%20right%27%29/http://void%28%27subscript%27%29/http://void%28%27center%27%29/http://void%28%27select%20all%27%29/http://void%28%27center%27%29/http://void%28%27insert%20equation%27%29/http://void%28%27superscript%27%29/http://void%28%27insert%20special%20character%27%29/http://void%28%27decrease%20indent%27%29/
8/15/2019 System Data Structure
3/22
Q.5 :‐Following the result obtained in (1), ywo letters are deleted.
Q.6 :‐Following the result obtained in (2) K, L, and M are added to the queue.
Q.7 :‐
Following this, two letters D and F are deleted
FRONT = 2, REAR = 3
FRONT = 4, REAR =5
FRONT = 4, REAR =5
FRONT = 0, REAR =5
FRONT = 4, REAR = 2
FRONT = 4, REAR = 3
FRONT = 2, REAR = 3
FRONT = 2, REAR = 4
FRONT = 6, REAR = 0
FRONT = 4, REAR = 2
FRONT = 2, REAR = 2
FRONT = 6, REAR = 2
8/15/2019 System Data Structure
4/22
Q.8 :‐F is added to the queue.
Q.9 :‐Following this, R is added to the queue
Q.10 :‐Which of the following statement is false?
FRONT = 2, REAR =5
FRONT = 3, REAR =5
FRONT = 3, REAR =5
FRONT = 2, REAR =3
FRONT = 4, REAR = 2
FRONT = 6, REAR = 3
FRONT = 4, REAR = 3
FRONT = 3, REAR = 2
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjecent space in memory
pointers store the next data element of a list
Section 3
8/15/2019 System Data Structure
5/22
Q.11 :‐
Two dimensional arrays are also called
Q.12 :‐Which of the following is a two way list?
Q.13 :‐The memory address of the first element of an array is called
linked lists are collection of the nodes that contain information part and nextpointer
tables arrays
matrix arrays
sparse arrays
tabular arrays
grounded header list
circular header list
linked list with header and trailer nodes
circular list
floor address
foundation address
8/15/2019 System Data Structure
6/22
Q.14 :‐Each data item in a record may be a group item composed of sub‐items; thoseitems which are indecomposable are called
Q.15 :‐
A graph G is multigraph if it does not have any restriction on
Q.16 :‐The data structure required for depth First Traversal on a graph is
first address
base address
elementary items
atoms
scalars
all of the above
the number of edges
the number of vertices
number of edges and vertices
self loops
queue
8/15/2019 System Data Structure
7/22
Q.17 :‐In linked list, a node contains
Q.18 :‐Preorder traversal is nothing but
Q.19 :‐While considering data structure implementation, the factors underconsideration is/ are
stac
array
tree
node, address field and data field
node number, data field
next address field, information field
node, address field
depth first order
breadth first order
topological order
linear order
time
8/15/2019 System Data Structure
8/22
Q.20 :‐In an adjacency matrix parallel edges are given by
Q.21 :‐In top down approach
Q.22 :‐Breadth first search is used in
space and time
time, space and processor
space
similar columns
similar rows
not representable
diagonal elements
a problem is subdivided into subproblems
a problem is tackled from beginning to end in one go
subproblems are solved first, then all solutions to subproblems are put togetherto solve the main problem
starts from basic components
8/15/2019 System Data Structure
9/22
Q.23 :‐Which of the following statements hold true for binary trees.
Q.24 :‐
A data structure in which elements are added and removed only at one end isknown as
Binary trees
Stacks
Graphs
both 1 and 3
The left subtree of a node contains only nodes with keys less than the node'skey
The right subtree of a node contains only nodes with keys greater than thenode's key.
Both 1 and 2
Both left and right subtree nodes contains only nodes with keys less than thenode's key
queue
stack
array
linked list
8/15/2019 System Data Structure
10/22
Q.25 :‐On which principle does stack work
Q.26 :‐An isolated vertex has degree
Q.27 :‐Which of the following linked list have last node of the list pointing to the firstnode
FILO
FIFO
LILO
LIFO or FILO
0
1
2
4
Circular doubly linked list
Circular linked list
Circular singly linked list
8/15/2019 System Data Structure
11/22
Q.28 :‐Underflow is a condition where you
Q.29 :‐A directed graph G = (V, E) is said to be finite if its
Q.30 :‐Which of the following is not the required condition for binary search algorithm?
doubly linked list
insert a new node when there is no free space for it
delete a non‐exixtent node in the list
delete a node in empty list
list is full
set V of vertices is finite
Set V of vertices and set E of edges are finite
set E of edges is finite
none of these
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and or insert elements in list
8/15/2019 System Data Structure
12/22
8/15/2019 System Data Structure
13/22
Q.34 :‐The difference between linear array and a record is
Q.35 :‐A vertex with degree one in a graph is called
Q.36 :‐Which of the following data structure can't store the non‐homogeneous dataelements?
have a common path
have a common walk
have a loop
An array is suitable for homogeneous data but hte data items in a record may
have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a lienear array does not
all of the above
a leaf
pendant vertex
adjacency list
isolated vertex
8/15/2019 System Data Structure
14/22
Q.37 :‐A graph with n vertices will definitely have a parallel edge or self loop if the total
number of edges are
Q.38 :‐Key value pair is usually seen in
arrays
records
pointers
tables
more than n
more than n+1
more than (n+1)/2
more than n(n‐1)/2
Hash tables
Heaps
Both 1 and 2
skip list
8/15/2019 System Data Structure
15/22
. ‐Which of the following is a preorder tranersal
Q.40 :‐A sparse matrix is one where most of its elements are
Q.41 :‐Which of the following data structures are indexed structures?
Root‐>left sub tree‐> right sub tree
Root‐>right sub tree‐> left sub tree
right sub tree‐> left sub tree‐>Root
left sub tree‐> right sub tree‐>Root
even
prime
zero
odd
linear arrays
linked lists
tress
graphs
8/15/2019 System Data Structure
16/22
Q.42 :‐What is inorder traversal
Q.43 :‐Which of the following data structure store the homogeneous data elements?
Q.44 :‐
Array is
Root‐>left sub tree‐> right sub tree
Root‐>right sub tree‐> left sub tree
right sub tree‐> left sub tree‐>Root
left sub tree‐> root‐>right sub tree
arrays
records
pointers
tables
linear data structure
non‐linear data structure
complex data structure
real data structure
8/15/2019 System Data Structure
17/22
Q.45 :‐A ‐‐‐‐‐ tree ia a tree where for each parent node, there is only one associatedchild node.
Q.46 :‐A binary tree with the property that the key stored at each node is greater thanthose of its children is a/ an
Q.47 :‐Which of the following data structure can't store the non‐homogeneous dataelements?
balanced binary tree
rooted complete binary tree
complete binary tree
Degenerate tree
AVL tree
heap
binary search tree
threaded tree
Arrays
records
8/15/2019 System Data Structure
18/22
Q.48 :‐
Null pointer is used to tell
Q.49 :‐In a heap, element with the greatest key is always in the ….node.
Q.50 :‐In ‐‐‐‐‐tree, the heights of two child subtrees of any node differ by atmost one.
po nters
none
end of linked list
empty pointer field of a structure
the linked list is empty
start of linked list
leaf
root
first node of left sub tree
first node of right sub tree
binary tree
red black tree
8/15/2019 System Data Structure
19/22
Q.51 :‐An empty list is the one which has no
Q.52 :‐Items in a priority queue are entered in a ‐‐‐‐ order.
Q.53 :‐Which of the following is not a limitation of binary search algorithm?
splay tree
AVL tree
nodes
data
both 1 and 2
address
random
order of priority
as and when they come
none of these
must use a sorted array
requirement of sorted array is expensive when a lot of insertion and deletions
8/15/2019 System Data Structure
20/22
Q.54 :‐Binary search algorithm can not be applied to
Q.55 :‐The depth of complete binary tree with n nodes is
Q.56 :‐FRONT = REAR pointer refers to empty
are needed
there must be a mechanism to access middle element directly
binary search algorithm is not efficient when the data elements are more than1000.
sorted linked list
sorted binary trees
sorted linear array
pointer array
Log2(n+1)‐1
log2 n
log2 (n‐1) +1
log2 n +1
stack
8/15/2019 System Data Structure
21/22
Q.57 :‐On which principle does queue work?
Q.58 :‐When inorder traversing a tree resulted E A C K F H D B G; the preorder traversalwould return
Q.59 :‐A variable P is called pointer if
queue
array
linked list
FILO
FIFO
LILO
Both 1 and 2
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
8/15/2019 System Data Structure
22/22
P contains the address of an element in DATA.
P points to the address of first element in DATA
P can store only memory addresses
P contain the DATA and the address of DATA
Top Related