If you are looking for past papers for the Final Term, then you have come to the right place. CS201 Final Term Past Papers are available here. VU’s final term past papers are available on THEINFO.pk.
In this post, you will find the final term past paper for the course CS201. You can refer to past papers to help you prepare for the final term exams in a quick and efficient manner.
Subjective For CS201 Final Term Past Papers 2022
You can download CS201 Final Term past papers. This will provide them with a better understanding of what type of questions will be covered in the Final Term Exams in terms of MCQs and Subjective questions.
VU CS201 Final Term Past Papers Subjective 2022
If you want to do well in exams, you can use CS201 Final term Past papers to gain knowledge. Moreover, students must follow all video lectures, PPT slides, and Virtual University handouts.
Second Part of Final Terms Past Papers for CS201 Subjective
1. What Is meant by Array?
An ordered and indexable sequence of values. C++ supports arrays of a single dimension (a vector) or of multiple dimensions.
2. What is Assignment?
The process of giving a value to a pre-existing object. Also see copy constructor and initialization.
3. What is Byte?
A byte is a grouping of eight bits which a computer typically groups as one logical unit. It is usually the smallest addressable unit of memory.
4. Call by reference
Passing a pointer to an argument to a function. The function can then change the argument value. Also see call by value.
5. Data structure
The term data structure refers to the way data is organized for use within a program. Correct organization of data can lead to simpler and more efficient algorithms. Common data structures are linked-lists, stacks, queues and trees.
A function called when a class object goes out of scope. It cleans up the object, freeing resources like dynamic storage.
7. Dynamic memory allocation
The process of dynamically creating objects in the heap or free store during program runtime. Statically created objects, created by the compiler, are put on the program stack.
8. Function overloading
The capability of having several routines in a program with the same name. The different functions are distinguished by their parameter types, return value types, or both; the compiler automatically selects the correct version, based on parameter types and return types.
9. Garbage collection
A way of automatically managing dynamic storage such that explicit cleanup of storage is not required. C++ does not have garbage collection.
C++ keyword used to declare an inline function.
11. Inline function
A function that can be expanded by a compiler at the point of call, thereby saving the overhead time required to call the function. Best for recursive and loop calls. Provides type safety and side-effects protection not afforded by #define.
A queue is a data structure that supports FIFO, first in first out processing. Objects will be processed in the order they enter a queue. Conceptualize a queue as a water pipe. The first water to flow in will be the first water to flow out of the other end.
Defining an alias for a structure or built-in type allows use of the alias as if it were a new type. In C, the keyword is typedef. It’s a bad idea to alias (have two objects pointing to the same data) unless one of those objects is a temporary variable.
14. What is C++?
- C++ is a cross-platform language that can be used to create high-performance applications.
- C++ was developed by Bjarne Stroustrup, as an extension to the C language.
- C++ gives programmers a high level of control over system resources and memory.
- The language was updated 3 major times in 2011, 2014, and 2017 to C++11, C++14, and C++17.
A function called when a class object comes into scope. The constructor is used to initialize the object. See allocation, copy constructor, and destructor.