CS201 current paper (May 2010)
Wednesday, May 26, 2010 Posted In .Midterm May 2010 , CS and IT Edit ThisToday Paper(26-05-2010)
Q2: Why we close a file after use? 2 Marks
Q3: When a pointer is incremented then how many bytes will it move to change its address?
2 Marks
Q4: If there are 2n element in an array then what would be the number of iterations required to search a number using binary and linear search? 3 Marks
Q5: write down the functions definition if we want to pass the argument to a function by reference without changing the values stored at address. 5 Marks
Q6: What will be the output of the following code segment 5 Marks
, int x= 6;
int y;
x = x << y =" x">> 1;
cout << “x = ” << y =" ”">
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.