Skip to main content

CS304 Current Finalterm Paper Spring 2014 Shared By Fivestar

Almost 50% MCQ and 50% long from moaaz file
CS304_FinalPaper_Spring2014 Held On 28-AUG-2014
Q41. Which specification is implemented using which specifier? Your answer should be brief. (2 marks)

Q42. A person is an abstract class. Describe the salient features of abstract class Answer:- Abstract class’s objects cannot be instantiated they are used for inheriting interface and/or implementation, so that derived classes can give implementation of these concepts. In C++, we can make a class abstract by making its function(s) pure virtual. Conversely, a class with no pure virtual function is a concrete class

Q.44 Give the names of two types of containers basically known as first class containers.(2 Marks) Answer:- (page 14 Q.10 moaaz file) Sequence and associative containers are collectively referred to as the first-class containers

Q.45 In which situation do we need to implement Virtual inheritance? explain with an example (5 marks)

Q.46 In which situation virtual inheritance is implemented? Explain with example (3 marks) Answer:- (page 13 Q.3 moaaz file) In multiple inheritance while solving diamond problem virtual inheritance need to implement. The solution of avoid this problem is virtual inheritance so that in multiple inheritance only one copy of base class is generated as shown below instead of two separate copies. In virtual inheritance there is exactly one copy of the anonymous base class object Example: class Vehicle{ protected: int weight; }; class LandVehicle : public virtual Vehicle{ }; class WaterVehicle : public virtual Vehicle{ };


Q.47 Write C++ code for Try Catch in Initialization list Answer:- Example Student::Student (String aName) : name(aName) /*The constructor of String can throw a exception*/ { ... } Exception in Initialization List The programmer may want to catch the exception and perform some action to rectify the problem Example Student::Student (String aName) try : name(aName) { ... } catch (…) { }

Q.49 Virtual Functions Implementation example given (see page 222 and 223 handouts) What changes we should made in this example to get output Line Circle Triangle Instead of Shape Shape Shape

Q.50 Write a template function that returns the average of all elements of array. The arguments to the function should be the array name and size of the array (type int) (5 marks) Answer:- (see page 267 of handouts)

Q.51 There are some errors in the code given below, you have to Indicate the line no. with error/s Give the reason for error/s Correct the error/s. Answer:- (Page 06 Q.38 moaaz file)

Q.52 Write output of the following code. (5 marks) Int wait_time=46; Try { Cout “Entering Try-block”endl; if (wait_time>30) Throw wait_time; Cout “Leaving Try Block”endl; } Catch (int thrown_value) { Cout ”Exception thrown/n” “ wait_time equal to “” thrown_value endl; } Cout “After Catch-Block”endl;


Comments

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

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

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