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

CS301 Current Finalterm Paper Spring 2014 Shared By M. Waleed

My Tday's Cs301 Paper: Mcq's Are From Moaz And Some Are From Handouts. Subjective Is From Moaz Majority One. 1- The Image Segmentation Define? 2- The Maximum Number Level Of Nodes In Binary Tree 3-The Iteration Array Have To Sort. 4- The Hapified Array Have To Solved 5- The Algorithm Of Binary Seaoh Tree 6-Sara Arrays Wala He Tha Ya Heap Wala. 7-....Wala Wala Wala...
1 comment
Read more

CS614 Quiz No.3 Shared by Students (Solved), Spring 2014

______ index stores first value in each block in the sequential file and a pointer to the block.  Select correct option:   Dense  Sparse  B-Tree  Hash In context of data parallelism, the work done by query processor should be:  Select correct option:  Almost zero  Maximum  Pipelined  Filtered across partitions The optimizer uses a hash join to join two tables if they are joined using an equijoin and  Select correct option:   Outer table has less number of rows  Inner table has less number of rows  Cardinality of tables is equal  Large amount of data needs to be joined Bitmap index is appropriate for:  Select correct option:  Low cardinality data  High cardinality data  Clustered data  Aggregated data If a task takes “T” time units to execute on a single data item, then execution of this task on “N” data items will take __...
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 Sele...
1 comment
Read more