Skip to main content

CS301 Quiz No.2 Shared by Umair Arshad

Question # 1 of 10 ( Start time: 06:53:05 PM ) Total Marks: 1
Which data structure allows deleting data elements from front and inserting at rear?
Select correct option:
Stacks
Queues        ok
Deques
Binary search tree


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


Question # 3 of 10 ( Start time: 06:54:16 PM ) Total Marks: 1
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
None of above


Question # 4 of 10 ( Start time: 06:54:38 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 # 5 of 10 ( Start time: 06:55:04 PM ) Total Marks: 1
When converting binary tree into extended binary tree, all the original nodes in binary tree are ____
Select correct option:
Internal nodes on extended tree
External nodes on extended tree         ok?
Vanished on extended tree
None of above


Question # 6 of 10 ( Start time: 06:55:55 PM ) Total Marks: 1
A binary tree whose every node has either zero or two children is called _________
Select correct option:
Complete binary tree
Binary search tree        ok
Strictly binary tree
None of above


Question # 7 of 10 ( Start time: 06:56:17 PM ) Total Marks: 1
The smallest value element in a binary tree( Each node with left and right pointers)lies at
Select correct option:
Root Node
Left Child of Root        ok
Right Most Node
Left Most Node


Question # 8 of 10 ( Start time: 06:56:50 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: 06:57:16 PM ) Total Marks: 1
The depth of a binary tree is
Select correct option:
Total number of nodes in the tree
Number of leaf nodes in the tree
Number of non-leaf nodes in the tree
Maximum level of a leaf        ok


Question # 10 of 10 ( Start time: 06:57:56 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.

Comments

Post a Comment

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

Popular posts from this blog

CS504 Quiz No.3 Shared by Angel

Question # 1 of 10 ( Start time: 09:08:01 PM ) Total Marks: 1 Defining the services of an object means: Select correct option: What it does?        ok What it knows? Who knows it? Whome it knows? Question # 2 of 10 ( Start time: 09:08:27 PM ) Total Marks: 1 Which one of these represents the Krutchen’s 4+1 architectural view model? Select correct option: Logical view, Process view, Physical view, Development view, Use case view Logical view, Dynamic view, Physical view, Development view, Use case view Logical view, Process view, Physical view, Development view, Sequence view Dynamic view, Process view, Physical view, Development view, Use case view Question # 3 of 10 ( Start time: 09:09:50 PM ) Total Marks: 1 Return values in Synchronous messages are represented by: Select correct option: A solid line A dotted line with label        ok A solid line with label Double line Question # 4 of 10 ( Start tim...
Post a Comment
Read more

CS614 Quiz No.1 Shared by Manzar (UnSolved)

Question # 1 of 10 ( Start time: 03:35:24 PM )   Total Marks: 1 MDX by Microsoft is an example of _______ Select correct option: HOLAP DOLAP ROLAP None of the given options Question # 2 of 10 ( Start time: 03:36:40 PM )   Total Marks: 1 In decision support system ease of use is achieved by: Select correct option: Normalization Denormalization Drill up Drill down Question # 3 of 10 ( Start time: 03:38:07 PM )   Total Marks: 1 Which of the denormalization technique squeezes master table into detail? Select correct option: Pre-joining Horizontal splitting Vertical splitting Adding redundant column Question # 4 of 10 ( Start time: 03:38:28 PM )   Total Marks: 1 The trade-offs of denormalization is/are: Select correct option: Storage Performance Ease-of-use All of the given options Question # 5 of 10 ( Start time: 03:38:46 PM )   Total Marks: 1 ________is usually deployed when expressions can be used to group data together in...
Post a Comment
Read more

CS302 Quiz No. 3 File 3

In a 4-bit binary counter, the next state after the terminal count in the DOWN mode is __________ 0000 1111 0001 10000 If S=1 and R=0, then for positive edge triggered flip-flop Q(t+1) = _______ 0 1 invalid Input is invalid In Master-Slave flip-flop setup, the master flip flop operates at ________ Positive half cycle of pulse Negative half cycle of pulse Both Master-Slave operate simultaneously Master-Slave flip-flop does not operate on pulses, rather it is edge triggered. If the S and R inputs of the gated S-R latch are connected together using a ____ gate then there is only a single input to the latch. The input is represented by D instead of S or R (A gated D-Latch) AND OR NOT XOR The minimum time required for the input logic levels to remain stable before the clock transition occurs is known as the _________ Set-up time Hold time Pulse Interval time Pulse Stability time (PST) The 74HC163 is a 4-bit Synchron...
2 comments
Read more