70% of the paper was from past specially mcqs(moaaz's files)...long questions the ones with 5 marks were new...
The invigilator was like very kharoos ..she dint let me copy the question...so here are some of the questions I remember
Describe the way to declare a template function as a friend of any class. 2marks
Answer:- (Page 294)
Give the C++ code of template function to print the values of any type of array I int.this function will take 2 parameters one will be pointer and other will be will be size of array (mrk3)
Answer:- (Page 257)
Consider the code below,
- template<typename T> class Test {
- T value;
- public:
- Test( T val ) : value(val){}
- Test(const Test<T>& c) : value(c.value) {}
- };
- int main() {
- Test< int > t1( 0 ), t2( 0 );
- Test< float > t3 = t1;
- system("PAUSE");
- return 0;
- }
Give line number having any error/errors in this code explain the reason for error/s and give corrected code as well.
q)Why Abstract class’s objects cannot be instantiated
Answer:- (Page 230)
q)What output is produced by the following code?int wait_time=46;
try
{
cout “Try-block entered.\n”;
if (wait_time > 30)
throw wait_time;
cout ”Leaving try-block.\n”;
}
catch ( int thrown_value)
{
cout “Exception thrown with\n””wait_time equal to “thrown_valueendl;
}
cout “After catch-block” endl;
q)Write C++ code for the overloaded subscript operator of following template Vector class.
template< class T >
class Vector {
private:
T* ptr;
int size;
int index;
public:
T& operator [](int); // overloaded subscript operator
};
What do you mean by Stack unwinding?
Answer :- pg 336Write general syntax of nested try catch block?
Answer:- pg 336
Question ( Marks: 3 ) Consider the code below, template< typename T > class T1 { public: T i; protected: T j; private: T k; friend void Test(); }; This code has a template class T1 with three members i,j and k and a friend function Test(), you have to describe which member/s of T1 will be available in function Test().
Answer:- All of them (i, j, k) will be available in function Test().
Comments
Post a Comment
Please give us your feedback & help us to improve this site.