Commvault Placement Papers with Answers

#include <iostream>
using namespace std;
class base {
    int b;
public:
    base (int x) {
        b = x;
        cout << "Base";
    };
};
class derived : public base
{
    double d;
public:
    derived(double x, int y);
    d = x;
    cout << " Derived";
};

int main () {
    derived d(23.5, 10);
}

What does the following statement result in?

Two processes want to write a file to a print spool area at the same time and both start writing. As the print spool area is of fixed size, it fills up before either process finishes writing its file, so both wait for more space to become available.

Which statement about thread synchronization is wrong?

Which statement about OS booting is wrong?

A computer program or routine is described as reentrant if the routine can be re-entered while it is already running. Which of the following conditions is not correct to be reentrant?

Assume single linked list pseudo code as follows?

struct Node {
data
next
}
record List {
Node firstNode
}

function1(List list) {
obsoleteNode = list.firstNode; list.firstNode = list.firstNode.next; free obsoleteNode;
}

function2(node node) {
obsoleteNode = node.next; node.next= node.next.next; free obsoleteNode;
}

function3(Node node,Node newNode) {
newNode.next = node.next;node.next= newNode
}

function4(List list, Node newNode) {
newNode.next = list.firstNode; list.firstNode = newNode;
}

Which of the following can a Dynamic Link Library contain?

Which of the following is an invalid path for the following graph?

What is the output of the program?

#include
#include
void main()
{
char *pl= "word";
char *p2;
p2=(char*)malloc(10);

memset(p2, 'A', 10);
while(*p2++ = *pl++)
printf("%s ", p2);
}

What is the worst case performance of Selection sort algorithm?