CS301 Final Term Solved MCQs and Subjective by Moaaz

CS301, CS301 FInalTerm past paper, CS301 solved MCQs and Subjective by Moaaz, CS301 final term Pastpaper and All files

CS301 Final Term Solved MCQs and Subjective by Moaaz And All Other Final Term Past Paper 

CS301 Final Term Solved MCQs and Subjective by Moaaz And All Other Final Term Past Paper 

CS301- Data Structures 

LATEST SOLVED MCQS FROM FINALTERM PAPERS

CS301- Data Structures

LATEST SOLVED SUBJECTIVES FROM FINALTERM PAPERS

File 2

CS301- Data Structures

LATEST SOLVED SUBJECTIVES FROM FINALTERM PAPERS

How to Download OR for more Help Please View the following Video

Damo Paper Of Objective Type:

FINALTERM EXAMINATION
Spring 2010 Question
 No: 1 ( Marks: 1 ) - Please choose one
A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.
 ► True (Page 4) 

► False 

Question No2 ( Marks: 1 ) -
 Please choose one Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?
 ► Linked List
 ► Stack (Page 54)
 ► Queue
 ► Tree 

Question No:3 ( Marks: 1 ) - Please choose one What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d
 ► ab+c*d-
 ► abc*+d-
 ► abc+*d-
 ► abcd+*-
Question No: 4 ( Marks: 1 )
- Please choose one For compiler a postfix expression is easier to evaluate than infix expression?
 ► True Click here for detail
 ► False
___________________________________________________________________________
Damo Paper Subjective Type:
Question No:1 name of two divide and conquer algorithm (2 marks)

 Answer:- (Page 488)
 Merge Sort
 Quick Sort
  Heap Sort
These three algorithms fall under ‗divide and conquer category‘.
Question No:2 difference between call by value n call by reference (2 marks) 

Answer:- (Page 202) In case of call by value, a copy of object is made and placed at the time of function calling in the activation record. By using the references, we are not making the copy but send the address of the variable that function can use the original value.
 Question No:3 heap and two types of heap(3) 

Answer:- (Page 333 ) Heap is a data structure of big use and benefit. It is used in priority queue. ―The definition of heap is that it is a complete binary tree that conforms to the heap order‖. Here heap order means the min and max heap. Max heap: In max heap, each node has a value greater than the value of its left and right child nodes. Moreover, the value of the root will be largest and will become lesser at downward levels. Min heap: in a (min) heap for every node X, the key in the parent is smaller than (or equal to) the key in X. This means that the value in the parent node is less than the value on its children nodes.
Question No: 30 ( Marks: 2 ) If we allow assignment to constants what will happen? 

Answer:- (Page 8) Suppose ‗a‘ has the value number 3. Now we assigned number 2 the number 3 i.e. all the number 2 will become number 3 and the result of 2 + 2 will become 6. Therefore it is not allowed.
Question No: 31 ( Marks: 3 ) Explain the process of Deletion in a Min-Heap 

Answer:- (Page 350) We have to write a function deleteMin(), which will find and delete the minimum number from the tree. Finding the minimum is easy; it is at the top of the heap.
Question No: 32 ( Marks: 3 ) Give any three characteristics of Union by Weight method.

 Answer:- (Page 408) Following are the salient characteristics of this method:  Maintain sizes (number of nodes) of all trees, and during union.  Make smaller tree, the sub-tree of the larger one.  Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes.

Good Luck!