CS201 Final Term Solved Subjective by Moaaz
- Type
- Final term past paper
- Course
- CS201 Introduction to Programming
- Size
- PDF 505 KB
- Updated
- 23 Oct 2026
You get 3 free files a day on the website. Add the Chrome extensionSign in with the extension for 30 a day.
Preview text
Text from pages 1, 2, 3 of 18. Download the file for all 18 pages.
Q1. Identify each of the following as system software and application software. (mark 5)
LINUX, DISK CLEANUP, WORD PROCESSOR, WINDOWS, STUDENT INFORMATION
Answer: System software: - Linux, Disk cleanup, windows. Application software:- Word Processor, Student information
Q2. Write a program which defines three variables of type double which store three different values including decimal points, using set precision manipulators to print all these values with different numbers of digits after the decimal number.(5)
Answer: #include #include int main ()
double x1 = 12345624.72345 double x2 = 987654.12345 double x3 = 1985.23456
return 0;
Q3. Define static variable also explain life time of static variable? (3)
Answer: Static variable means maintaining the state of a variable. It exists and lives around even when we are outside the function. It is created and initialized only once during the lifetime of the program and therefore it will be destroyed or taken out of memory only once during the lifetime of the program.
Q4. What do you know about run time error? (3)
Run-Time Errors
- Occur when the program is running and tries to do something that is against the
rules Example: Accessing a non-existent variable, property, method, object, etc (e.g. a method name is misspelled)
- Sources of these can be determined by a careful reading of the code, but
unfortunately, not always
Q5. What is limitation of the friendship between classes? (3)
Answer: Friendship relation between classes is a one way relation that is if one class declare friend another class then the another class is the friend of first class but not the first class if the friend of another class.
Q6. what is the source and destination of cin?(2)
Answer: For cin, the source is normally keyboard and the destination can be an ordinary variable i.e. native-data type variable
Q6. Write the general syntax of allocation memory dynamically to an array using new operator? (2)
Answer: Page 332 Following is the syntax: new data_type [number_of_locations];
Q7. What is diffrent between pointer and variable?
Answer: normal variable contains tha value of variable either int or float whereas pointer variable contains the address of another variable
Q8. What is difference between Unary and binary operators and how they can be overloaded?
Answer: Unary operator takes one argument. a ++ is an example of unary operator Binary take two operators +,-,* are example of binary operators Overloaded binary operator may return any type Here is general syntax of overloading Return-type operator symbol (parameters); Operator is keyword
Q9. How many types of templates?
Answer: There are two different types of templates in C++ language i.e.’ function templates and class templates.
Q10. What will be the output of following function if we call this function by passing int 5?
template T reciprocal(T x) {return (1/x); }
zero
Q11. math temp;
Answer: The errors are in the arguments of the member operation function and also in the body of operator member function.
math temp; temp = m;
Fall 2011
Q1. Define buffer? Explain its usage? 5 MARKS
Answer: a program that writes the output data to the disc, it will be nice to collect the output data (numbers) and write it on the disc in one write operation instead of writing the numbers one by one. The area where we gather the numbers is known as buffer.
Q2. Why binary search algorithm is efficient than linear search algorithm? 5 marks
Answer: (page118) Binary search algorithm is more efficient than liner algorithm because the arrays are sorted in ascending or descending order and we use “divide and conquer” technique. In binary search each iteration reduces the search by the factor of two but in the linear we have the same number of searches as we have the number of elements. E.g. if we have array of 1000 elements the linear search will take 1000 iterations however binary search will take max 10.
Related CS201 files
All CS201 files →- CS201 Final Term MCQs by Sparrows Final term PDF 1.1 MB
- CS201 Final Term Short Notes Set 4 Final term PDF 66 KB
- CS201 Midterm Solved Subjective with References by Moaaz Midterm PDF 1.3 MB
- CS201 Midterm Solved MCQs with References by Moaaz and Asad Midterm PDF 270 KB
- CS201 Highlighted Handouts by VUBuddy Highlighted PDF 3.8 MB
- CS201 Short Notes Set 4 Quiz PDF 434 KB
Get more out of VUBuddy, for free
- Unlimited downloads
- The explanation behind every MCQ answer
- Study offline on slow data
- 30 downloads a day instead of 3
- Sign in and buy Pro Semester here
One Pro Semester membership works in both the extension and the app.