Computer Science Previous Year Questions

Explanation

The CPU fetches, decodes and executes instructions and controls the other parts, so it is called the brain of the computer.

Explanation

Fifth-generation computers are marked both by technological advancement (AI, parallel processing) and by object-oriented programming, so more than one option applies.

Explanation

Open-source software makes its source code freely available to view, change and redistribute.

Explanation

Machine language depends on the processor, is hard to write and is error prone, so all of A, B and C hold (more than one).

Explanation

Assembly language uses mnemonics close to the hardware, so it is a low-level language.

Explanation

A compiler translates the whole high-level source program into machine code and is not part of the execution itself, so A, B and C are all true (more than one).

Explanation

C++ is an object-oriented language that builds a program from small objects and classes upward, which is the bottom-up approach.

Explanation

Virtual inheritance makes derived classes share one copy of a common base class, which avoids duplicate copies in diamond-shaped inheritance.

Explanation

delete frees a single object, while delete[] frees an array of objects (and calls each destructor).

Explanation

Code that may raise an exception is placed inside a try block so that a matching catch block can handle it.

Explanation

Inline functions are meant for small, simple functions; saying they are generally very large and complicated is incorrect.

Explanation

An abstract class is a base class that has at least one pure virtual function, so it cannot be instantiated.

Explanation

If a class defines no constructor at all, the compiler supplies a default constructor.

Explanation

In C++ the members of a struct are public by default, while those of a class are private by default.

Explanation

A language that lets the programmer define new data types is called extensible.

Explanation

C++ was created by Bjarne Stroustrup at Bell Labs.

Explanation

None of the listed forms is valid C++ (the correct usage is cin.get(ch)), so the answer is None of the above.

Explanation

Array indices start at 0, so the nth element is array[n-1].

Explanation

C++ arrays are classified as one-dimensional and multi-dimensional, i.e. two types, as the official key accepts.

Explanation

rank() reports the number of dimensions of an array type.

Explanation

A variable declared inside a function is local and visible only within that function's { } block.

Explanation

is_array checks whether the given type or variable is an array.

Explanation

All three statements are true (new is an operator that calls constructors; malloc is a function returning void*), so more than one option, i.e. (D), is correct.

Explanation

Private members are inherited by a derived class but cannot be accessed directly from it.

Explanation

Object-oriented languages also use run-time (virtual) binding, so I is false; in procedural languages every call is resolved at compile time, so only II is true.

Explanation

An unnamed class is allowed, but a destructor is declared with the class name, so such a class cannot declare a destructor; the official key is (C).

Explanation

Templates (along with overloading) are resolved at compile time, so they implement compile-time polymorphism; virtual functions give run-time polymorphism.

Explanation

Bundling data and the functions that work on it into one unit is encapsulation.

Explanation

Modularity means splitting a program into small independent modules.

Explanation

Stacks are used for string reversal and backtracking; asynchronous data transfer is handled with queues (buffers), so it is not a stack application.

Explanation

B*C becomes *BC, and A + (B*C) in prefix is +A*BC.

Explanation

The conversion holds operators on a stack while scanning the expression, so a stack is needed.

Explanation

Spatial locality relies on elements being stored in contiguous memory, which is exactly how arrays are laid out.

Explanation

Before dequeuing, one must check that the queue is not empty, i.e. underflow.

Explanation

Balancing of symbols (parentheses) is done with a stack, not a queue.

Explanation

Preorder, inorder and postorder are all binary-tree traversals, so none of A-C is the odd one out.

Explanation

An array is a container that stores elements of the same type.

Explanation

A circular queue is also called a ring buffer.

Explanation

A circular queue reuses the freed slots at the front, which avoids wasting memory.

Explanation

A binary heap gives O(log n) insertion and removal of the highest-priority item, better than a list or array.

Explanation

Recursive calls are kept in the call stack, so the stack is used.

Explanation

In a red-black tree the root is black and a newly inserted non-root node is coloured red, so both A and B hold (more than one).

Explanation

In a singly linked list the node before the tail must be found by traversing the whole list, so deleting from the rear takes O(N).

Explanation

Depending on whether rear points at the last used slot or one past it, both rear = MAX_SIZE-1 and rear = MAX_SIZE are accepted overflow conditions, so more than one is correct.

Explanation

Merge sort splits the list in halves, sorts them and merges, which is divide and conquer.

Explanation

A database is an organised collection of data that can be accessed, updated and managed.

Explanation

A database can hold images, text/files and audio or video data, so more than one option is correct.

Explanation

Network and distributed are standard database types; 'decentralized' is not a classical database type.

Explanation

Microsoft Access and IBM Db2 are DBMS products; Google is a search engine company, not a DBMS.