Skip to main content

CS301 Quiz No.2 Shared by Annie

Question # 1 of 10 ( Start time: 07:00:53 PM ) Total Marks: 1
Which of the following statement is false?
Select correct option:
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjecent space in memory        ok
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer


Question # 2 of 10 ( Start time: 07:01:32 PM ) Total Marks: 1
Which one is not the property of binary tree?
Select correct option:
Every node in binary tree should have maximum two children.
Only one node should have two parents.        ok
Sibling nodes should have same parent.
None of given options.


Question # 3 of 10 ( Start time: 07:01:53 PM ) Total Marks: 1
Deleting a _____ node in BST is a _______ case
Select correct option:
Root, simplest
Left child, simplest        ok
Right child, simplest
Leaf, simplest


Question # 4 of 10 ( Start time: 07:02:24 PM ) Total Marks: 1
To represent hierarchical relationship between elements, which data structure is suitable?
Select correct option:
Dequeue
Priority
Stack
Tree        ok


Question # 5 of 10 ( Start time: 07:02:45 PM ) Total Marks: 1
The _________ of a binary tree is the maximum level of its leaves (also called the depth).
Select correct option:
Level        ok ?
Width
Height       
None of the above


Question # 6 of 10 ( Start time: 07:03:10 PM ) Total Marks: 1
Which of the following data structure is linear type?
Select correct option:
Stack
List
Queue
All of above        ok


Question # 7 of 10 ( Start time: 07:03:36 PM ) Total Marks: 1
Suppose there is a BST with elements, 13,3,14,1,4,18 and 2. Now if the method insert(4) is called, which message will be

displayed?
Select correct option:
Node is inserted in root
Node is inserted in left subtree        ok
Node is inserted in right subtree
Node already exist in the tree


Question # 8 of 10 ( Start time: 07:04:03 PM ) Total Marks: 1
A BST generated from the data in ascending order is ____________.
Select correct option:
Linear
Nonlinear
Balanced        ok
Un sorted


Question # 9 of 10 ( Start time: 07:04:25 PM ) Total Marks: 1
The depth of a complete binary tree is given by _________
Select correct option:
Dn = n log2n
Dn = n log2n+1
Dn = log2n
Dn = log2(n+1)-1        ok


Question # 10 of 10 ( Start time: 07:04:38 PM ) Total Marks: 1
In which traversal method, the recursive calls can be used to traverse a binary tree ?
Select correct option:
In preorder traversal only
In inorder traversal only
In postorder traversal only
All of the given options        ok

Comments

  1. Anonymous1 January 2023 at 16:15

    right option of question 5 is "Height"

    ReplyDelete

Post a Comment

Please give us your feedback & help us to improve this site.

Popular posts from this blog

CS614 Quiz No.4 Shared by Princess (solved), Spring 2014

  “What means What”. The phrase refers to: Select correct option:  Meta data  External data Transformed data Internal representations Question # 2 of 10 Which of the following is NOT one of the activities of “Maintenance and Growth” phase in Kimball’s DWH development approach? Select correct option: Education Technical Education Program Support  Interface Deployment                 Question # 3 of 10 Horizontally wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records Dataset has attribute skews Dataset has partitioning skews                 Question # 4 of 10 Which of the following is NOT one of the top-10 mistakes that should be avoided during DWH development? Select correct option: Not interacting directly with end user Not being an accommodating person Isolating IT support people from business users Training the users with dummy data and considering it success             
1 comment
Read more

CS502 Quiz No.4 File 3

There is relationship between number of back edges and number of cycles in DFS Select correct option: Both are equal. Cycles are half of back edges.   Cycles are one fourth of back edges. There is no relationship between back edges and number of cycles .         (Correct) In strong components algorithm, the form of graph is used in which all the vertices of original graph G have been reversed in direction. Select correct option: True                 (Correct)   False In Kruskal's algorithm, the next edge is added to viable set A, if its adding does not induce a/an __________ . Select correct option: Vertex Edge   Cycle               (Correct)   Tree For undirected graph, there is no distinction between forward and back edges. Select correct option: True                 (Correct)   False You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ? Select correct option: (V+E)             (Corre
Post a Comment
Read more

CS301 Quiz No.2 Shared by Tayyeba

Binary search algorithm can not be applied to ____ Select correct option: sorted linked list sorted binary trees        ok sorted linear array pointer array During in-order traversal using recursive calls, if we found a node is NULL. It means this node will satisfy following condition. Select correct option: It will not have left child        ok It will not have right child It will not have both left and right children None of given options Identify the data structure which allows deletions at both ends of the list but insertion at only one end. Select correct option: Input-restricted deque Output-restricted deque Priority queues        ok A BST generated from the data in ascending order is ____________. Select correct option: Linear Nonlinear Balanced        ok Un sorted In a program a reference variable, say x, can be declared as Select correct option: int &x ;        ok int *x ; int x ; None of the given options he depth of a complete bina
Post a Comment
Read more