Skip to main content

CS301 Quiz No.2 Shared by ibrar

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


Question # 2 of 10 ( Start time: 06:40:41 PM ) Total Marks: 1
If we write functions for recursive and non recursive inorder traversal method of BST, what will be the difference between its functions prototypes?
Select correct option:
Different return types
Different function names
Different arguments list
Nothing will be different    ok


Question # 3 of 10 ( Start time: 06:40:41 PM ) Total Marks: 1
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 # 4 of 10 ( Start time: 06:40:41 PM ) Total Marks: 1
Which one of the following calling method does not change the original value of the argument in the calling function?
Select correct option:
Call by passing reference of the argument
Call by passing the address of the argument    ok
Call by passing the value of the argument
None of the given options


Question # 5 of 10 ( Start time: 06:40:41 PM ) Total Marks: 1
Longest path from root node to farthest leaf node is called ________ of tree
Select correct option:
Level
Length
Depth        ok
Node level


Question # 6 of 10 ( Start time: 06:40:41 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 # 7 of 10 ( Start time: 06:45:44 PM ) Total Marks: 1
The _________ of a node in a binary tree is defined as the height of its left subtree minus height of its right subtree.
Select correct option:
Height
Balance        ok
Width
None of the above


 Question # 8 of 10 ( Start time: 06:46:33 PM ) Total Marks: 1
A tree is an AVL tree if
Select correct option:
Any one node fulfills the AVL condition
At least half of the nodes fulfill the AVL condition
All the nodes fulfill the AVL condition        ok
None of the given options


Question # 9 of 10 ( Start time: 06:47:22 PM ) Total Marks: 1
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


Question # 10 of 10 ( Start time: 06:47:22 PM ) Total Marks: 1
In which of the following functions, the value of variable cannot be changed in function body?
Select correct option:
int cube( int num)
int cube(int& num)
int cube(const int& num)    ok
int cube(int* num)

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