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

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 ...

CS614 Quiz No.4 Shared by MT Khan (Solved)

Question # 1 of 10 ( Start time: 09:04:39 PM ) Total Marks: 1 A typical cycle of implementing the change in DWH comprises of the sequence: Select correct option: Production -> QA -> Development Development-> QA -> Production(CORRECT) Development -> Production -> QA Production -> Development -> QA Question # 2 of 10 ( Start time: 09:05:16 PM ) Total Marks: 1 Vertically wide data means: Select correct option: Dataset has large no. of attributes Dataset has large no. of records(CORRECT) Dataset has attribute skews Dataset has partitioning skews Question # 3 of 10 ( Start time: 09:05:43 PM ) Total Marks: 1 In ___________ phase of kimballs approach, we identify the components needed now and in future. Select correct option: Requirement definition Architectural design Product development Analytical application development Question # 4 of 10 ( Start time: 09:06:56 PM ) Total Marks: 1 Technical architecture design supports the communicat...

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 __...