CS201 VU Current Midterm Spring May 2013 Papers

CS201 VU Current Midterm Spring 2013 Papers

6 to 7 MCQs came form past papers

1 or 2 short questions came from past papers.

Some of the short questions that I remember were:

1. What is the difference between pre-increment and post-increment operator

2. One major use of pointer

3. If an array has elements 2^n, then what would be the maximum number of iterations required to search by binary and linear search? (I don’t remember the exact statement of the question) (answer is on page # 118)

4. Write the procedure of data insertion in middle of the files by Merge Method practiced in older systems? (answer is given in page # 218, in handouts)

5. Functions used to read/write more than a single character or a single line while using Files? (read chapter # 19, on page 221 i think this concept has been discussed)

In the long question, a program was given and we were required to point out the compilation errors and correct them.
It was easy.