Skip to main content

CS301 Quiz No.1 Shared by Raza Ali

Question # 1 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
To Create a ________ we link the last node with the first node in the list
Double Linked list
Circularly-linked list  ok
Linked list
None of the above


Question # 2 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
New items are added at the ______ of the stack.
Bottom
Middle
Center
Top     ok


Question # 3 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
Which of the following is not a data structure ?
Select correct option:

Linked list
Stack
Queue
Memory cell  ans


Question # 4 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
Doubly linked list always has one Null pointer
True
False  ok


Question # 5 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
Which of the following data Structure Is non-linear type?
String
Lists
Stacks
None of given options


Question # 6 of 10 ( Start time: 05:28:30 PM )  Total Marks:  1
If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?
Select correct option:

 48
 4
 333
 5 ans


Question # 7 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
Suppose you are writing a class for Node class and forgot to write the constructor of the class, then

Compiler will give compile time error
Compiler will give run time error
Compiler will automatically generate a default constructor  ok
Compiler will do nothing.


Question # 8 of 10 ( Start time: 05:03:29 PM )  Total Marks:  1
What will out of following postfix expression? 3 1 3 * + 4 7 6 + - * 2 5 +
Select correct option:

 61 ans
 62
 63
 None of given options



Question # 9 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
STL is a ________ that is part of the official standard of C++
C program file
.h file
.cpp file
Library   ok


Question # 10 of 10 ( Start time: 04:59:17 PM )  Total Marks:  1
A queue is a data structure where elements are
Inserted at the front and removed from the back
Inserted and removed from the top
Inserted at the back and removed from the front
Inserted and removed from both ends..


Comments

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