In C++ code , variables can be passed to a function by

1.
A. Pass by value

2.
A. Pass by reference

3.
A. Pass by pointer

4.
A. All the above

What is output of the following program?

#include
using namespace std;
class base
{
int val1, val2;
public:
int get()
{
val1 = 100;
val2 = 300;
}
friend float mean(base ob);
};
float mean(base ob)
{
return float(ob.val1 + ob.val2)/2;
}
int main()
{
base obj;
obj.get();
cout << mean(obj);
return 0;
}

1.
200

2.
150

3.
100

4.
300
When a class serves as base class for many derived classes, the situation is called

1.
Polymorphism

2.
Hierarchical inheritance

3.
Hybrid inheritance

4.
Multipath inheritance

When two or more classes serve as base class for a derived class, the situation is known as

1.
polymorphism

2.
encapsulation

3.
hierarchical inheritance

4.
multiple inheritance

Data members which are static

1.
cannot be assigned a value

2.
can only be used in static functions

3.
cannot be defined in a Union

4.
can be accessed outside the class

Data members which are static

1.
cannot be assigned a value

2.
can only be used in static functions

3.
cannot be defined in a Union

4.
can be accessed outside the class

.................... member variable is initialized to zero when the first object of its class is created where no other
initialization is permitted.

1.
friend
2.
static

3.
onlineexam./span>

4.
private

A ................... member function can only be called by another function that is member of it's class.

1.
friend

2.
static

3.
onlineexam./span>

4.
private

A member function can be called by using its name inside another function of the same class, which is known
as ............ of member function.

1.
sub function

2.
sub member

3.
nesting

4.
sibling

In C++, the declaration of functions and variables are collectively called .......

1.
class members

2.
function members

3.
object members

4.
member variable

/////////////////////////////////////////////////////////////////////////////////////////////////////////

11.Only the ...................... can have access to the private members and private functions.

1.
data functions

2.
inline functions

3.
member functions

4.
member variables

12.The binding of data and functions together into a single class-type variable is referred to as

1.
Encapsulation

2.
Inheritance

3.
Polymorphism

4.
Dynamic binding

13.The variables declared inside the class are known as data members and functions are known as

1.
data functions

2.
inline functions

3.
member functions

4.
member variables

14.When the function is defined inside a class, it is treated as

1.
data function

2.
inline function

3.
member function

4.
member variable

15.Which of the following statements about member functions are True or False.
i) A member function can call another member function directly with using the dot operator.
ii) Member function can access the private data of the class

1.
i-True, ii-True

2.
i-False, ii-True

3.
i-True, ii-False
4.
i-True, ii-True

16................. can be invoked like a normal function without the help of any object.

1.
constant member function

2.
private member function

3.
static member function

4.
friend function

17.A .............. can only be called by another function that is member of its class.

1.
constant member function

2.
private member function

3.
static member function

4.
friend function

18.A ................. can have access to only other static members declared in the same class.

1.
constant member function

2.
private member function

3.
static member function

4.
friend function

19.A ........................., although not a member function, has full access rights to the private members of the class.

1.
constant member function

2.
private member function

3.
static member function

4.
friend function

20.A static member function can be called using the ..................... instead of its objects.

1.
variable name

2.
function name

3.
Class name

4.object name

///////////////////////////////////////////////////////////////////////////////////////////////////////////

21.If a member function does not alter any data in the class, that may be declared as ....................

1.
constant member function

2.
private member function

3.
static member function

4.
friend function

22.State whether the following statements are True or False about the characteristics of static data members.
i) Only one copy of static member is created for the entire class and is shared by all the objects of that class, no
matter how many objects are created.
ii) Static member variable is visible only within the class, but its lifetime is the entire

1.
i-True, ii-True

2.
i-False, ii-True

3.
i-True, ii-False

4.
i-True, ii-True

23.Static variables are associated with the class itself rather than with any class object, they are also known
as ................

1.
class variables

2.
object variables

3.
function variables

4.
internal variables

24.Static variables are like ..................... as they are declared in a class declaration and defined in the source file.

1.
inline member function

2.
non inline member function
3.
static member function

4.
dynamic member function

25.While using an object as a function argument, a copy of the entire object is passed to the function in ..............
method

1.
pass-by-value

2.
pass-by-reference

3.
pass-by-variable

4.
pass-by-function

26.Function overloading and Operator overloading are the types in compile time polymorphism? (T/F)

1.
True

2.
False

3. 4.

27.A base class will offer

1.
offer more specific objects than its derived classes 45%

2.
correspond to something in the rest world 0%

3.
behave badly when the chops are down 0%

4.
be a generalized version of its derived classes 56%

28.Choose most appropriate statement

1.
An abstract base class can have pure virtual destructor 43%

2.
An abstract base class can have only virtual destructor 0%

3.
An abstract base class can have non virtual destructor 29%

4.
An abstract base class cannot have destructor 29%

CHECK ONCE WHEN YOU READ!

29.If a base class member access is public, and an inherited class accesses specifier is private, which of the
following statement is true ?
1.
The base class member can be accessed by derived class objects 43%

2.
The base class members cannot be accessed by the derived class members 29%

3.
The derived class members can be accessed by the base class objects 0%

4.
None of above

30.Which of the following is/are false

1.
Inheritance is deriving new class from existing class 10%

2.
In an inheritance, all data and function members of base class are derived by derived class 46%

3.
We can specify which data and function members of base class will be inherited by derived class 19%

4.
We can add new functions to derived class without recompiling the base class 28%

///////////////////////////////////////////////////////////////////////////////////////////////////////////

31.A function that changes the state of the cout object is called _______?

1.
a Member function

2.
an Adjuster function

3.
a Manipulator function

4.
an Operator function

32.An array element is accessed using _______ .

1.
A first-in-first-out approach.

2.
The dot operator.

3.
A member name.

4.
An index number.

33.Format flags may be combined using the _______.

1.
Bitwise OR operator ( | )

2.
Logical OR operator ( || )

3.
Bitwise AND operator (& )
4.
Logical AND operator ( && )

34.The following statement where T is true and F is false,T && T || F && T _______ .

1.
is true

2.
is false

3.
is wrong

4.
Not applicable in C language

35.The function whose prototype is void getData(Item *thing);receives ________ .

1.
A pointer to a structure.

2.
A reference to a structure.

3.
A copy of a structure.

4.
Nothing

36.To hide a data member from the program, you must declare the data member in the _______ section of the class.

1.
Protected

2.
Confidential

3.
Hidden

4.
Private

37.Which feature in Object Oriented Programming allows reusing code?

1.
Polymorphism

2.
Inheritance

3.
Encapsulation

4.
Data hiding

38.Which of the following formulas can be used to generate random integers between 1 and 10?

1.
1 + rand() % (10 - 1 + 1).

2.
1 + (10 - 1 + 1) % rand().

3.
10 + rand() % (10 - 1 + 1).

4.
10 + rand() % (10 + 1).

39.Which of the following will store the number 320000 as a Float number?

1.
CounPop = (float) 3.2e5;

2.
CounPop = (float) 3.2e6;

3.
CounPop = (float) .32e5;

4.
CounPop = (float) .32e7;

40.A class can serve as base class for many derived classes

1.
True
2.
FalsE

//////////////////////////////////////////////////////////////////////////////////////////////////////////

41.Which of the following relation between A.M., G.M. and H.M. holds?

3.

(ANS OPTION 3 )

42.Sum of squares of the deviations is minimum when deviations taken from

1.
Mean

2.
Median

3.
Mode

4.
Geometric Mean

43.Which of the following can be classified as hypothetical population?

1.
All labourers of a factory

2.
Female population of a country

3.
Population of real numbers between 0 and 100

4.
Students of the world

44.A and B play 10 games of chess of which A won 5 games, B won 3 games and 2 games ended in a draw. The
probability of B winning a game in future is

1.
1/2

2.
3/10

3.
1/5

4.
2/5

45.The hypothesis usually tested by analysis of variance is

1.
Equality of variances of the effects

2.
Equality of means of the effects

3.
Equality of errors of the factors

4.
Equality of median of the effects

46.A dice is tossed, If X is the random variable denote the number on the dice, the expected value of X is

1.
1/6

2.
7/2

3.
7/6

4.
1

47.The decision whether a test of hypothesis is one tailed or two tailed, depends on

1.
Null hypothesis

2.
Sample size

3.
Level of significance
4.
Alternative hypothesis

48.#include <iostream>
using namespace std;
int main()
{
const char* p = "12345";
const char **q = &p;
*q = "abcde";
const char *s = ++p;
p = "XYZWVU";
cout << *++s;
return 0;
}

1.
Compiler Error

2.
c

3.
b

4.
Garbage Value

49.#include <stdio.h>

int main()

int ary[4] = {1, 2, 3, 4};

int *p = ary + 3;

printf("%d\n", p[-2]);

1.
1

2.
2

3.
run time error

4.
Some garbage value

50.#include <stdio.h>

void main()

char *s= "hello";

 char *p = s;

printf("%c\t%c", p[0], s[1]);

1.
run time error

2.
hh

3.
he

4.
hl

///////////////////////////////////////////////////////////////////////////////////////////////////////////

51.#include <stdio.h>

void main()

char *s = "hello";

char *p = s;

printf("%p\t%p", p, s);

1.
Different address is printed

2.
Same address is printed

3.
run time error

4.
no address is printed

52.#include

void main()

int a[3] = {1, 2, 3};

int *p = a;

printf("%p\t%p", p, a);

1.Same address is printed.

2.Different address is printed.
3.No address is printed
4.Run time error
53.Mention the output of below program?

#include <iostream>

using namespace std;

void print(int i)

cout << i;

void print(double f)

cout << f;

int main(void)

print(5);

print(500.263);

return 0;

1.
5500.263

2.
500.263

3.
500.2635

4.
500.3

54. A CONSTRUCTOR THAT ACCEPTS __________ PARAMETERS IS CALLED THE DEFAULT CONSTRUCTOR
1.
ONE

2.
TWO

3.
THREE

4.
NO

55.A DESTRUCTOR IS USED TO DESTROY THE OBJECTS THAT HAVE BEEN CREATED BY A ....................

1.
OBJECT

2.
CLASS

3.
FUNCTION

4.
CONSTRUCTOR

56.According to boolean algebra absorption law, which of following is correct?

1.
x+xy=x

2.
(x+y)=xy

3.
xy+y=x

4.
x+y=y

57. Assume the output of the given program

#include<iostream>

using namespace std;

class Empty {};

int main()

Empty obj;

cout << sizeof(obj);

return 0;

}
1.
A non-zero value

2.
Zero

3.
Compile time Error

4.
Runtime Error

58.In any ways, Non-member function can have access to the private data of the class

1.
Virtual function

2.
Static function

3.
Friend function

4.
None

59. In OOP terminology, an object's member variables are often called as _________ and its member functions are
sometimes referred to as _________.

1.
Values, morals

2.
Data, activities

3.
Activities, behaviors

4.
Attributes, methods

60. Objects created using new operator are stored in

1.
Virtual memory

2.
Cache memory

3.
Heap memory

4.
Stack

///////////////////////////////////////////////////////////////////////////////////////////////////////////

61.Overloaded functions are

1.
Very long functions that can hardly run

2.
One function containing another one or more functions inside it.
3.
Two or more functions with the same name but different number of parameters or type.

4.
Very long functions that can run easily.

62.Specify the output of the given program?

#include

using namespace std;

int Add(int X, int Y, int Z)

return X + Y;

double Add(double X, double Y, double Z)

return X + Y;

int main()

cout << Add(5, 6);

cout << Add(5.5, 6.6);

return 0;

1.
11 12.1

2.
12.1 11

3.
11 12

4.
Compile time error

63. What is the output of the following program?

#include

using namespace std;

int operate (int a, int b)

{
 return (a * b);

float operate (float a, float b)

return (a / b);

int main()

int x = 5, y = 2;

float n = 5.0, m = 2.0;

cout << operate(x, y) <<"\t";

cout << operate (n, m);

return 0;

1.
10.0 5.0

2.
5.0 2.5

3.
10.0 5

4.
10 2.5

64. WHAT WILL BE THE OUTPUT

#include <iostream>

using namespace std;

class GFG

public:

GFG()

cout << "Hi from GFG. ";

} g;

int main()
{

cout << "You are in Main.";

return 0;

1.
Hi from GFG

2.
You are in Main

3.
You are in Main. Hi from GFG.

4.
Hi from GFG. You are in Main.

65.WHICH IS THE CORRECT FORM OF DEFAULT CONSTRUCTOR FOR FOLLOWING CLASS?

#include <iostream>

using namespace std;

class sample

private:

int x,y;

};

1.
onlineexam. void sample(){}

2.
onlineexam. void sample(){ x=0; y=0;}

3.
onlineexam. void sample(int a,int b){ x=a; y=b;}

4.
Both 1 and 2

66.Which of the following is true about the following program

#include <iostream>

class Test

public:

int i;

void get();

};
 void Test::get()

std::cout << "Enter the value of i: ";

std::cin >> i;

Test t; // Global object

int main()

Test t; // local object

t.get();

std: :cout << "value of i in local t: "<<t.i<<'\n';

::t.get();

std::cout << "value of i in global t: "<<::t.i<<'\n';

return 0;

1.
Compiler Error: Cannot have two objects with same class name

2.
Compiler Error in Line "::t.get();"

3.
Runtime Error

4.
Compile and run succesfully

67.(x*y)z=x(y*z) is the

1.
commutative property

2.
inverse property

3.
associative property

4.
Identity element

68.-----------is a property that describes various characteristics of an entity.

1.
ER Diagram

2.
Column

3.
Relationship
4.
Attribute

69.----------engine executes low level instructions generated by the DML compiler.

1.
DDL Analyzer

2.
Query Interpreter

3.
Database Engine

4.
None of the these

70........ is a condition specified on a database schema and restricts the data that can be stored in an instance of the
database.

1.
Key Constraint

2.
Check Constraint

3.
Foreign key constraint

4.
Integrity constraint

//////////////////////////////////////////////////////////////////////////////////////////////////////

71........ is a specific concurrency problem wherein two transactions depend on each other for something.

1.
phantom read problem

2.
transaction read problem

3.
deadlock

4.
locking

72. .......... helps solve concurrency problem.

1.
locking

2.
transaction monitor

3.
transaction serializability

4.
two phase commit

73. ............ protocol grantees that a set of transactions becomes serialisable.

1.
two phase locking

2.
two phase commit

3.
transaction locking

4.
checkpoints

74. .............. would only be an effective choice in a environment in which many disk errors occur.

1.
RAID Level 0

2.
RAID Level 1

3.
RAID Level 2

4.
RAID Level 3

75. ................. is not a true member of RAID family, because it does not include redundancy to improve performace.

1.
RAID Level 0

2.
RAID Level 1

3.
RAID Level 2

4.
RAID Level 3

76. .................... PROVIDES THE FLEXIBILITY OF USING DIFFERENT FORMAT OF DATA AT RUN TIME
DEPENDING UPON THE SITUATION.

1.
DYNAMIC INITIALIZATION

2.
RUN TIME INITIALIZATION

3.
STATIC INITIALIZATION

4.
VARIABLE INITIALIZATION

77. ..................... specifies the actions needed to remove the drawbacks in the current design of database.

1.
1 NF

2.
2 NF

3.
3 NF

4.
Normalform

78. 3428 is the decimal value for which of the following binary-coded decimal (BCD) groupings?

1.
1101000100100000

2.
11010000101000

3.
011010010000010

4.
110100001101010

79. 4 to 1 mux would have

1.
2inputs

2.
3inputs

3.
4inputs

4.
5inputs

80. 4 to 1 mux would have

1.
1 output

2.
3 outputs

3.
4 outputs

4.
2 ouput

///////////////////////////////////////////////////////////////////////////////////////////////////////////

80. Message passing system allows processes to :

1. communicate with one another without resorting to shared data.

2.Communicate with one another by resorting to shared data.

3.Share Data
4.Name the recipient or sender of the message

82. If a higher priority process arrives and wants service, the memory manager can swap out the lower priority
process to execute the higher priority process. When the higher priority process finishes, the lower priority process is
swapped back in and continues execution. This variant of swapping is sometimes called :

1.
priority swapping
2.
pull out, push in

3.
roll out, roll in

4.
None of these

83. Run time mapping from virtual to physical address is done by

1. memory management unit

2.
CPU

3.
PCI

4.
none of the mentioned

84. A binary semaphore is a semaphore with integer values :

1.
1&0

2.
-1 & 1

3.
0 & -1

4.
0.5

85. A process can be

1.
single threaded

2.
multithreaded

3.
both (a) and (b)

4.
none of the mentioned

86. A set of processes is deadlock if

1.
each process is blocked and will remain so forever

2.
each process is terminated

3.
all processes are trying to kill each other

4.
none of the mentioned
87. In Unix, Which system call creates the new process?

1.
fork

2.
create

3.
new

4.
none of the mentioned

88. Messages sent by a process :

1.
have to be of a fixed size

2.
have to be a variable size

3.
can be fixed or variable sized

4.
None of these

89. semaphore :

1.
is a binary mutex

2.
must be accessed from only one process

3.
can be accessed from multiple processes

4.
None of these

90. Semaphore is a/an _______ to solve the critical section problem.

1.
hardware for a system

2.
special program for a system

3.
integer variable

4.
None of these

//////////////////////////////////////////////////////////////////////////////////////////////////////

91.Termination of the process terminates

1. first thread of the process

2.
first two threads of the process

3.
all threads within the process

4.
no thread within the process

92. The link between two processes P and Q to send and receive messages is called :

1.
communication link

2.
message-passing link

3.
synchronization link

4.
All of these

93. The page table contains

1.
base address of each page in physical memory

2.
page offset

3.
page size

4.
none of the mentioned

94. The two kinds of semaphores are :

1.
Mutex & Duplex

2.
Binary & Counting

3.
Counting & Signal

4.
decimal & Integer

95. When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of
the two tasks, the scenario is called

1.
priority inversion

2.
priority removal

3.
priority exchange

4.
priority modification

96. Which one of the following is not a valid state of a thread?

1.
running
2.
parsing

3.
ready

4.
blocked

97. Which one of the following is the address generated by CPU?

1.
physical address

2.
absolute address

3.
logical address

4.
none of the mentioned

98. A monitor is a module that encapsulates

1.
shared data structures

2.
procedures that operate on shared data structure

3.
synchronization between concurrent procedure invocation

4.
all of the mentioned

99. A mutex is :

1.
is a binary mutex

2.
must be accessed from only one process

3.
can be accessed from multiple processes

4.
None of these

100. A process can be terminated due to

1.normal exit

2.fatal error
3.killed by another process
4.all of the mentioned

//////////////////////////////////////////////////////////////////////////////////////////////////////

101.An IPC facility provides atleast two operations :

1.write and delete message

2.delete and receive message only
3.send and write message only
4.send and receive message

102. If one thread opens a file with read privileges then

1.
other threads in the another process can also read from that file

2.
other threads in the same process can also read from that file

3.
any other thread can not read from that file

4.
all of the mentioned

103. In indirect communication between processes P and Q :

1.
there is another process R to handle and pass on the messages between P and Q

2.
there is another machine between the two processes to help communication

3.
there is a mailbox to help communication between P and Q

4.
None of these

104. Process synchronization can be done on

1.
hardware level

2.
software level

3.
both (a) and (b)

4.
none of the mentioned

105. Program always deals with

1.
logical address

2.
absolute address

3.
physical address

4.
relative address

106. The two atomic operations permissible on semaphores are :

1.
wait

2.
Stop & Signal
 CHECK IT ONCE WHEN YOU READ!
3.
Both (a) & (b)

4.
Wait & Hold

107. What is interprocess communication?

1.
communication within the process

2.
communication between two process

3.
communication between two threads of same process

4.
none of the mentioned

108. What is the ready state of a process?

1.
when process is scheduled to run after some execution

2.
when process is unable to run until some task has been completed

3.
when process is using the CPU

4.
none of the mentioned

109. if (fork() == 0)

{ a = a + 5; printf("%d,%d\n", a, &a); }

else { a = a –5; printf("%d, %d\n", a, &a); }

Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which one of
the following is TRUE?

1. u = x + 10 and v = y

2. u = x + 10 and v != y

3.u + 10 = x and v = y

4. u + 10 = x and v != y

110.The purpose of a TLB is

1.
To cache page translation information

2.
To cache frequently used data

3.
To hold register values while a process is waiting to be run

4.
To hold the start and length of the page table
//////////////////////////////////////////////////////////////////////////////////////////////////////////

111.The OS of a computer may periodically collect all the free memory space to form contiguous block of free space.
This is called

1.
Concatenation

2.
. Garbage collection

3.
Collision

4.
Dynamic Memory Allocation

112.Which of the following is not usually stored in a two-level page table?

1.
Virtual page number

2.
Physical page number

3.
Dirty bit

4.
Reference bit

113.Null character needs a space of _______ .

1.
Zero bytes.

2.
One byte.

3.
Three bytes.

4.
Four bytes.

114.The number of structures that can be declared in a single statement is _______ ?

1.
One

2.
Two

3.
Three

4.
Unlimited

115.What does C++ append to the end of a string literal constant?

1.
A space.

2.
A number sign (#).

3.
An asterisk (*).

4.
A null character.

116.Which other keywords are also used to declare the class other than class?

1.
struct

2.
union

3.
object

4.
both (a) and (b)

117.What is the Output of this Program?

#include < iostream >

using namespace std;

class sample

private:

int a, b;

public:

void test()
 {

a = 100;

b = 200;

friend int compute(sample e1);

};

int compute(sample e1)

return int(e1.a + e1.b) - 5;

int main()

sample e;

e.test();

cout << compute(e);

return 0;

}
1.
295

2.
100

3.
300

4.
200

118.Which of the following is false with respect to inheritance?

1.
When a base class is privately inherited,onlineexam.members of the base class become private members of the
derived class 31%

2.
When a base class is onlineexam.y inherited,onlineexam.members of the base class becomes onlineexam.members
of derived class 8%

3.
When a base class is privately inherited, a private member of base class becomes private member of derived
class 31%

4.
When a base class is onlineexam.y inherited protected members of base class becomes protected members of
derived class 31%

119.Which feature allows you to create a Derived class that inherits properties from more than one Base class?

1.
Multilevel Inheritance.

2.
Multiple Inheritance.

3.
Hybrid Inheritance.

4.
Hierarchical Inheritance.

120.A CONSTRUCTOR IS CALLED WHENEVER

1.
OBJECT IS DECLARED

2.
OBJECT IS USED

3.
CLASS IS DECLARED

4.
CLASS IS USED

////////////////////////////////////////////////////////////////////////////////////////////////////////

121.Assuming that Rectangle is a class name, the statement Rectangle *BoxPtr;

1.
Declares an object of class Rectangle

2.
Assigns the value of *BoxPtr to the object Rectangle

3.
Declares a Rectangle pointer object called BoxPtr

4.
Is illegal in C++

22.CONSTRUCTORS ARE NORMALLY USED TO ________ AND TO ALLOCATE MEMORY.

1.
DEFINE VARIABLES

2.
ALLOCATE VARIABLES

3.
INITIALIZE VARIABLES

4.
INITIALIZE OBJECT

23.COPY CONSTRUCTOR MUST RECEIVE ITS ARGUMENTS BY __________

1.
EITHER PASS-BY-VALUE OR PASS-BY-REFERENCE

2.
ONLY PASS-BY-VALUE

3.
ONLY PASS-BY-REFERENCE

4.
ONLY PASS BY ADDRESS

23.The process of object-oriented analysis can be viewed as the following steps

1.
Define data members and member functions, then assign a class name

2.
Declare private and onlineexam.variables, prototype functions, then write code

3.
Write the main() function, then determine which classes are needed

4.
Identify objects, then define objects' attributes, behaviors, and relationships

24.WHAT VALUE SHOULD RETURN A DESTRUCTOR

1.
A POINTER TO THE CLASS

2.
AN OBJECT OF THE CLASS

3.
A STATUS CODE INDICATING WHETHER THE CLASS IS DESTROYED PROPERLY

4.
DESTRUCOTRS DO NOT RETURN VALUE

25.WHENEVER CONST OBJECTS TRY TO INVOKE NON-CONST MEMBER FUNCTIONS, THE

COMPILER .....................

1.
RETURN ZERO VALUE

2.
RETURN NULL

3.
GENERATE ERROR

4.
RETURN NO VALUE

26.Which of the following is true?

1.
All objects of a class share all data members of class

2.
Objects of a class do not share non-static members. Every object has its own copy.

3.
Objects of a class do not share codes of non-static methods, they have their own copy

4.
None of the above

27.Which of the following permits function overloading on c++?

1.
Type

2.
No. of Arguments

3.
Type of arguments

4.
All the above

29.Let A and B be two events with P(A) = 0.25 and P(B) = 0.5. The probability of both occurring together is 0.14.
Then the probability of both A and B not happening is

1.
0.39

2.
0.25

3.
0.11

4.
0.61
30.Mean and variance of a binomial distribution are 8 and 4, respectively. Then, P(X = 1) is equal to

1.1/2 POWER 12

2.

3.

4.

////////////////////////////////////////////////////////////////////////////////////////////////////

31.The average time required to reach a storage location in memory and obtain its contents is called the

1.
seek time

2.
turnaround time

3.
access time

4.
transfer time

32. Dynamic loading is :

1.
loading multiple routines dynamically

2.
loading a routine only when it is called

3.
loading multiple routines randomly

4.
None of these

33.___ is not Types of update anomalies

1.
Insertion

2.
Deletion

3.
Modification

4.
Alteration

34.____ means that the data used during the execution of a transaction cannot be used by a

second transaction until the first one is completed.

1.
Consistency

2.
Atomicity

3.
Durability

4.
Isolation

35._____ is the concept in which a process is copied into main memory from the secondary memory according to the
requirement.

1.
Paging

2.
Demand paging

3.
Segmentation

4.
Swapping

36.______ controller sends the command placed into it, via messages to the _____ controller.

1.
Host, host

2.
Disk, disk

3.
Host, disk

4.
Disk, host

37._______ attributes can have more than one value.

1.
Composite

2.
simple

3.
Multi-valued

4.
Single valued

38._______ specifies the maximum number of relationship instances that an entity can participate.

1.
Range

2.
Domain

3.
Cardinality

4.
Ceiling

39._______ specifies the set of values that can be assigned to the attribute.
1.
Block

2.
Relation

3.
Structure

4.
Domain

40.________ attribute values are used to identify each entity uniquely.

1.
Complex

2.
Unique

3.
Characters

4.
Key

///////////////////////////////////////////////////////////////////////////////////////////////////////////

41.________ is the basic object of ER model which is a thing in real world.

1.
Relation

2.
Domain

3.
Attribute

4.
Entity

42.__________ is generally faster than _________ and _________.

1.
first fit, best fit, worst fit

2.
best fit, first fit, worst fit

3.
worst fit, best fit, first fit

4.
None of these

43.__________ states that only valid data will be written to the database.

1.
Consistency

2.
Atomicity

3.
Durability

4.
Isolation

44.__________ USED TO MAKE A COPY OF ONE CLASS OBJECT FROM ANOTHER CLASS OBJECT OF THE
SAME CLASS TYPE.

1.
CONSTRUCTOR

2.
COPY CONSTRUCTOR

3.
DESTRUCTOR

4.
DEFAULT DESTRUCTOR

45.___________ may take place only when there is some minimum amount(or) no space left in free storage list.

1.
Memory management

2.
Garbage collection

3.
Recycle bin

4.
Storage management

46._____________ refers to a linear collection of data items.

1.
List

2.
Tree

3.
Graph

4.
Edge

47.________is a set of permitted value for each attribute of a relation

1.
Domain

2.
Relation

3.
Set

4.
Schema

48.________is very useful in situation when data need to stored and then retrieved in reverse order.
1.
Stack

2.
Queue

3.
List

4.
Linked List

49.________will retrieve the top of the element from the stack.

1.
Stack[top]

2.
stack[0]

3.
List[top]

4.
Linked list

50.A 32X1 Multiplexer has

1.
2 select lines

2.
3 select lines

3.
4 select lines

4.
5 select lines

///////////////////////////////////////////////////////////////////////////////////////////////////////////

51.A ___________ indicates the end of the list.

1.
Guard

2.
Sentinel

3.
End pointer

4.
Last pointer

52.A _____________ is a linear list in which insertions and deletions are made to from either end of the structure

1.
circular queue

2.
random of queue
3.
priority queue

4.
double ended queue

53.A base class will offer

1.
offer more specific objects than its derived classes

2.
correspond to something in the rest world

3.
behave badly when the chops are down

4.
be a generalized version of its derived classes

54.A binary parallel adder produces arithmetic sum in

1.
serial

2.
parallel

3.
sequence

4.
both a and b

55.A binary search tree whose left subtree and right subtree differ in height by atmost 1 is called __

1.
Lemma Tree

2.
Redblack Tree

3.
AVL Tree

4.
Balanced Binary Tree

56.A binary search tree whose left subtree and rightsubtree differ in hight by at most 1 unit is called

1.
Red Black Tree

2.
Lemma Tree

3.
AVL Tree

4.
Balanced Binary Tree

57.A binary tree can be converted into its mirror image by traversing in ___

1.
Inorder

2.
Preorder

3.
Postorder

4.
Laplace transform

58.A certain 5-bit self-complementary code is used to represent the 10 decimal digits 0 through 9. Given that (246)10
is represented as 00010 00100 00110 in this code, what is the representation for (375)10?

1.
00110 00100 00010

2.
00011 00111 00101

3.
11101 11011 11001

4.
11001 11101 11011

59.A circuit that converts n inputs to 2^n outputs is call

1.
encoder

2.
decoder

3.
comparator

4.
carry look ahead

60.A CLASS CAN HAVE ___________

1.
ALL CONSTRUCTORS THAT ARE NEEDED

2.
ONLY THE DEFAULT CONSTRUCTOR

3.
A DESTRUCTOR FOR EACH CONSTRUCTOR

4.
ALL THE PREVIOUS ANSWERS ARE INCORRECT

///////////////////////////////////////////////////////////////////////////////////////////////////////

61.A class can inherit properties from more than one class which is known as ..........inheritance.
1.
single

2.
multiple

3.
multilevel

4.
hierarchical

62.A correct output is achieved from a master-slave J-K flip-flop only if its inputs are stable while the:

1.
clock is LOW

2.
slave is transferring

3.
flip-flop is reset

4.
clock is HIGH

63.A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside
buffer (TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the
TLB tag is:

1.
11 bits

2.
13 bits

3.
15 bits

4.
20 bits

64.A data dictionary is a special file that contains

1.
names of all fields in all files

2.
data types of all fields in all files

3.
width of all fields in all files

4.
all of the above

65.A data structure where elements can be added or removed at either end but not in the middle is called

1.
linked lists

2.
stacks

3.
queues

4.
dequeue

A J-K flip-flop is in a "no change" condition when ________.

1.J = 1, K = 1
2. J = 1, K = 0
3.J = 0, K = 1
4.J = 0, K = 0

A linear list in which the last node points to the first node is ______________
1.singly linked list
2.doubly linked list
3.arrays
4.none of the above

A linear list in which the pointer points only to the successive node is ____________
1.singly linked list
2.circular linked list
3.doubly linked list
4.none of the above

A logical schema is----------

1.is the entire database
2.is a standard way of organizing information into accessible parts.
3.Describes how data is actually stored on disk.
4.All of the above

A measure of linear association of a variable say, with number of other variables is known as
1.Partial correlation
2.Multiple correlation
3.Simple Correlation
4.Auto correlation

A memory buffer used to accommodate a speed differential is called

1. stack pointer
2.cache
3.accumulator
4.disk buffer

A monitor is a module that encapsulates

1.shared data structures
2.procedures that operate on shared data structure
3.synchronization between concurrent procedure invocation
4.all of the mentioned

A multilevel page table is preferred in comparison to a single level page table for translating virtual address to
physical address because :
1.it reduces the memory access time to read or write a memory location
2.it helps to reduce the size of page table needed to implement the virtual address space of a process
3.it is required by the translation look aside buffer
4.it helps to reduce the number of page faults in page replacement algorithms

A multiplexer is also called as a

1.Coder
2.parallel adder
3.Data selector
4.NOR gate

A pointer in which a pointer variable contains the address of a variable that has already been allocated
1.Null pointer
2.Generic pointer
3.Dangling pointer
4.wild pointer
A positive edge-triggered D flip-flop will store a 1 when ________.
1.the D input is HIGH and the clock transitions from HIGH to LOW
2.the D input is HIGH and the clock transitions from LOW to HIGH
3.the D input is HIGH and the clock is LOW
4.the D input is HIGH and the clock is HIGH

A positive edge-triggered J-K flip-flop is used to produce a two-phase clock. However, when the circuit is operated it
produces erratic results. Close examination with a scope reveals the presence of glitches. What causes the glitches,
and how might the problem be corrected?

1.The PRESET and CLEAR terminals may have been left floating; they should be properly terminated if not being
used.
2.The problem is caused by a race condition between the J and K inputs; an inverter should be inserted in one of the
terminals to correct the problem.
3.A race condition exists between the Q and Q outputs to the AND gate; the AND gate should be replaced with a
NAND gate.
4.A race condition exists between the clock and the outputs of the flip-flop feeding the AND gate; replace the
flip-flop with a negative edge-triggered J-K Flip-Flop.

A process is thrashing if
1.it is spending more time paging than executing
2.it is spending less time paging than executing
3.page fault occurs
4.swapping cannot take place

A queue is a,
1.FIFO (First In First Out) list.
2.LIFO (Last In First Out) list.
3.Ordered array.
4.Linear tree.

A relation is in this form if it is in BCNF and has no multivalued dependencies:

1.second normal form.
2.third normal for
3.fourth normal form.
4.domain/key normal form.

A relational database consists of a collection of

1.Tables
2.Fields
3.Records
4.Keys

A report generator is used to

1.update files.
2.print files on paper.
3.data entry
4.delete files
A sample of 12 specimen taken from a normal population is expected to have a mean 50 mg/cc. The sample has a
mean of 64 mg/cc with a variance of 25. Which of the following test statistic can be used to test
1.Z - test
2.
3.t - test
4.F - test

A scheduling algorithm can use either ___________ priority or ________ priority.

1.Static, still
2.Static, dynamic
3. Live, dead
4.None of these

A semaphore is a shared integer variable

1.that can not drop below zero
2.that can not be more than zero
3.that can not drop below one
4.that can not be more than one

A Standard logic gate is a typical example of

1.MSI Circuits
2.SSI Circuits
3.LSI Circuits
4.VLSI Circuits

A system program that combines the separately compiled modules of a program into a form suitable for execution
1.assembler
2.linking loader
3.cross compiler
4.load and go

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The
system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the
reverse order. How many page faults will occur?
1.196
2.192
3.197
4.195

A table can have only one

1.Secondary key
2.Alternate key
3.Unique key
4.Primary key

A table is in the ....................... if only candidate keys are the determinants.

1.functional dependency
2.transitive dependency
3.NF
4.BCNF

A table on the many side of a one to many or many to many relationship must:
1.Be in Second Normal Form (2NF)
2.Be in Third Normal Form (3NF)
3.Have a single attribute key
4.Have a composite key

A three digit decimal number requires ________ for representation in the conventional BCD format.
1.3 bits
2.6 bits
3.12 bits
4.24 bits

A transaction processing system is also called as ........

1.processing monitor
2.transaction monitor
3.TP monitor
4.monitor

A variant of the linked list in which none of the node contains NULL pointer is?
1.Singly linked list
2.Doubly linked list
3.circular linked list
4.None

A weak entity type always has a ______ participation constraint with respect to its identifying relationships.
1.Partial
2.Total
3.Overlap
4.Disjoint

A weak entity type normally has a ________ key.

1. Partial
2. Total
3.Super
4.Strong

Access time of a binary search tree may go worse in terms of time complexity upto

1.n pow 2
2.(n log n)
3.n
4.1

According to Boolean algebra Involution law (x')'=? Is equal to

1. x'
2.x
3. 1
4.0

Addressing structure
1.defines the fundamental method of determining effective operand addresses
2.are variations in the use of fundamental addressing structures, or some associated actions which are related to
addressing.

3.performs indicated operations on two fast registers of the machine and leave the result in one of the registers.
4.all of the above

Advantage of a multi-dimension array over pointer array

1.Pre-defined size.
2.Input can be taken from user.
3.Faster Access.
4.All of the mentioned

After the crash of a disk containing the database, which of the following tools will need to be used for recovery?
1.Database backup
2.Log
3.Checkpoint table
4.All of the above

After the nodes are prepared, the distributed transaction is said to be ......
1. in-doubt
2.in-prepared
3.prepared transaction
4.in-node

ALLOCATION OF MEMORY TO OBJECTS AT THE TIME OF THEIR CONSTRUCTION IS KNOWN AS ................

OF OBJECTS.
1.RUN TIME CONSTRUCTION
2.DYNAMIC CONSTRUCTION
3.INITIAL CONSTRUCTION
4.STATIC CONSTRUCTION

AN ....................... WITH A CONSTRUCTOR OR DESTRUCTOR CANNOT BE USED AS A MEMBER OR A UNION.

1.CLASS
2.OBJECT
3.FUNCTION
4.VARIABLE

An 8x3 encoder has how many output wires

1.2
2.3
3.8
4.11

An entity set that does not have sufficient attributes to form a primary key is a
1.Strong entity set.
2.Weak entity set.
3.Simple entity set.
4.Primary entity set.

An entity type without a key attribute is called _______ entity type.

1.Null
2.weaak
3.Strong
4.single

An invalid condition in the operation of an active-HIGH input S-R latch occurs when ________.
1. HIGHs are applied simultaneously to both inputs S and R
2. LOWs are applied simultaneously to both inputs S and R
3. a LOW is applied to the S input while a HIGH is applied to the R input
4.a HIGH is applied to the S input while a LOW is applied to the R input

An operator function is created using _____________ keyword.

1.iterator
2.allocator
3.constructor
4.operator

Applications of multidimensional array are?

1.Matrix-Multiplication
2.Minimum Spanning Tree
3.Finding connectivity between nodes
4.All of the mentioned

Array is basically
1.Collection of numbers only
2.Collection of ascii values only
3.Collection of Homogeneous data types
4.Collection of Heterogeneous data types

As disks have relatively low transfer rates and relatively high latency rates, disk schedulers must reduce latency times
to :
1.Ensure high bandwidth
2.Ensure low bandwidth
3.Make sure data is transferred
4.Reduce data transfer speeds

As the bank audit transaction reads Mary's savings balance, $100, Mary transfers $50 to her checking, making it
$250, and the audit transaction completes with the combined value of $350 in both accounts. This is called:
1.An uncommitted dependency
2.An incorrect summary
3.A lost update
4.A data entry error

Assume that an integer and a pointer each takes 4 bytes. Also, assume that there is no alignment in objects. Predict
the output following program.

#include<iostream>
using namespace std;
class Test
{
static int x;
int *ptr;
int y;
};
int main()
 {
Test t;
cout << sizeof(t) << " ";
cout << sizeof(Test *);

1.12 4
2.12 12
3.8 4
4.8 8

Assume that the size of char is 1 byte and negatives are stored in 2's complement form
#include<stdio.h>
int main()
{
char c = 125;
c = c+10;
printf("%d", c);
return 0;
}
1.135
2.+INF
3.-121
4.-8

Attribute of a table is refers to as____ in relational model

1.Record
2.Column
3.Tuple
4.Key

Attributes that are not divisible are called _________.

1. Composite
2. Atomic
3.Complex
4.Structured

Avoid placing attributes in a base relation whose values may frequently be

1.Null
2.Multiple
3.Single
4.Repeated

Avoid relations that contain matching attributes that are not ____ combinations
1.foreign key, primary Key
2.Null value, primary key
3.foreign key, Candidate Key
4.Candidate key, primary Key

Backward recovery is which of the following?

1.Where the before-images are applied to the database
2.Where the after-images are applied to the database
3.Where the after-images and before-images are applied to the database
4.Switching to an existing copy of the database

BCD to seven segment conversion is a ________________

1. Decoding process
2.Encoding process
3. Comparing process
4.None of the mentioned

Because of virtual memory, the memory can be shared among

1.processes
2.threads
3.instructions
4.none of the mentioned

Binary code that distinguishes ten elements must contain at least

1.Two bits
2.Three bits
3.Four bits
4.Five bits

Binary coded decimal is a combination of

1. Two binary digits
2.Three binary digits
3.Four binary digits
4.None of the Mentioned

Binary search algorithm can not be applied to

1.sorted linked list
2.sorted binary trees
3.sorted linear array
4.pointer array

Can member functions of one class be friend functions of another class?

1.Yes
2.No

1. 4.Carry out BCD subtraction for (68) – (61) using 10’s complement method.
1.00000111
2.01110000
3.100000111
4.011111000

Choose most appropriate statement

1.An abstract base class can have pure virtual destructor
2.An abstract base class can have only virtual destructor
3.An abstract base class can have non virtual destructor
4.An abstract base class cannot have destructor

Choose the most appropriate choice with respect to conceptual design.

1.Conceptual design is a documentation technique. Once the relation schemes are defined one can draw E-R
diagrams from the relation schemes for documentation
2.Conceptual design needs data volume and processing frequencies to determine the size of the database
3.Output of any conceptual design is an E-R diagram
4.Conceptual design involves modeling the data requirements independent of the DBMS, operating system
and the hardware.

Closure of Y is denoted as
1.Y*
2.Y->X
3.Y+
4.None of the above

Collection of information stored in database at particular instance of time is called as __________.

1.Data Structure
2.Database Schema
3.Instance of Database
4.Objects in Database

Comment on the following statement: int (*A.[7];

1.An array a of pointers
2.A pointer a to an array
3.A ragged array
4.None

Comment on the output of this C code?

int main()
{
int a[5] = {1, 2, 3, 4, 5};
int i;
for (i = 0; i < 5; i++)
if ((char)a[i] == '5')
printf("%d\n", a[i]);
else
printf("FAIL\n");
}

1.The compiler will flag an error

2.Program will compile and print the output 5
3.Program will compile and print the ASCII value of 5
4.Program will compile and print FAIL for 5 times

Commit and rollback are related to ..........

1.data integrity
2.data consistency
3.data sharing
4.data security

Consider a directed line(->) from the relationship set advisor to both entity sets instructor and student. This indicates
_________ cardinality

1.One to many
2.One to one
3.Many to many
4.Many to one

Consider a schema R(A, B, C, D) and functional dependencies A -> B and C -> D. Then the decomposition of R into
R1 (A, B) and R2(C, D) is
1.dependency preserving and lossless join
2.lossless join but not dependency preserving
3.dependency preserving but not lossless join
4.not dependency preserving and not lossless join

Consider a weight balanced tree such that, the number of nodes in the left sub tree is at least half and at most twice
the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root
to the farthest leaf) of such a tree on k nodes can be described as
1.log2 n
2.log4/3 n
3.log3 n
4.log3/2 n
Consider an implementation of unsorted doubly linked list. Suppose it has its representation with a head pointer and
tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?
i) Insertion at the front of the linked list
ii) Insertion at the end of the linked list
iii) Deletion of the front node of the linked list
iv) Deletion of the end node of the linked list

1.I and II
2.I and III
3.I,II and III
4.I,II,III and IV

Consider linked list is used to implement the Stack then which of the following node is considered as Top of the
Stack ?
1.Any Node
2.Last Node
3.First Node
4.Middle Node

Consider money is transferred from (1)account-A to account-B and (2) account-B to account-A.
Which of the following form a transaction ?
1.Only 1
2.Only 2
3.Both 1 and 2 individually
4.Either 1 or 2

Consider the following combinational function block involving four Boolean variables x, y, a, b where x, a, b are inputs
and y is the output.
f (x, y, a, b)
{
if (x is 1) y = a;
else y = b;
}
Which one of the following digital logic blocks is the most suitable for implementing this function?
Full adder
Priority encoder
Multiplexer
Flip-flop

Consider the following definition in c programming language

struct node
{
int data;
struct node * next;
}
typedef struct node NODE;
NODE *ptr;
Which of the following c code is used to create new node?
1.ptr=(NODE*)malloc(sizeof(NODE));
2.ptr=(NODE*)malloc(NODE);
3.ptr=(NODE*)malloc(sizeof(NODE*));
4.ptr=(NODE)malloc(sizeof(NODE));

Consider the following linked list and following linked list representation -
10--->12---->15---->25---->30---->36
struct node {
int data;
struct node *next;
}*start = NULL;
what will be the value of following statement ?
start->next->next->next->data

1.12
2.30
3.15
4.25

Consider the function f defined here:

struct item
{
int data;
struct item * next;
};
int f (struct item *p)
{
return((p==NULL) ||((p->next==NULL)||(p->data<=p->next->data) && (p->next)));
}
For a given linked list p, the function f returns 1 if and only if
1.the list is empty or has exactly one element
2.the element in the list are sorted in non-decreasing order of data value
3.the element in the list are sorted in non-increasing order of data value
4.not all element in the list have the same data value
Consider the Singly linked list having n elements. What will be the time taken to add an node at the end of linked list if
Pointer is initially pointing to first node of the list.

1.O(1)
2.O(n-1)
3.O(n)
4.O(2n)

Consider the usual algorithm for determining whether a sequence of parentheses is balanced.Suppose that you run
the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order).The maximum
number of parentheses that appear on the stack AT ANY ONE TIME during the computation?

1.1
2.2
3.3
4.4 and above

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1. On a demand paged virtual memory system
running on a computer system that main memory size of 3 pages frames which are initially empty. Let LRU, FIFO and
OPTIMAL denote the number of page faults under the corresponding page replacements policy. Then
1.OPTIMAL < LRU < FIFO
2.OPTIMAL < FIFO < LRU
3.OPTIMAL = LRU
4.OPTIMAL = FIFO

const member function does not allow to modify/alter value of any data member of the class.
1.False
2.True
3.None
4.Error

CONSTRUCTORS CANNOT BE INHERITED, THROUGH A DERIVED CLASS CAN CALL THE ...................
CONSTRUCTOR.
1.BASE CLASS
2.DERIVED CLASS
3.VOID CLASS
4.DEFAULT CLASS

Convert binary number into gray code: 100101

1.101101
2.001110
3.110111
4.111001

Convert the binary number 1100 to Gray code.

1.0011
2.1010
3.1100
4.1001

Convert the following decimal number to BCD.

469
1.100101101000
2.010001101001
3.100001101001
4.100101100100

Convert the function F(x,y,z) =∏ (1,3,7) to other canonical form

1. F(x,y,z) = ∏(0,2,4,5,6)
2. F(x,y,z) = Σ(0,2,4,5,6)
3.F(x,y,z) =∏(0,2,4,5,6,8)
4.F(x,y,z) = Σ(0,2,4,5,6,8)
Convert the Gray code 1011 to binary.
1.1011
2.1010
3.0100
4.1101

counter and gate delays are negligible. If the counter starts at 0, then it cycles through the following sequence:
1.0,3,4
2.0,3,4,5
3.0,1,2,3,4
4.0,1,2,3,4,5

CPU fetches the instruction from memory according to the value of

1.program counter
2.status register
3.instruction register
4.program status word

Customer(customer_id,ono,dop)
Here the customer_id is ______ and customer is a _
1.Relations, Attribute
2.Attributes, Relation
3.Tuple, Relation
4.Tuple, Attributes

Data Integrity means

1.Providing first access to stored data
2.Providing data sharing
3.Providing access to modify structure of the database
4.Ensuring correctness and consistency of data

Data Manipulation Language enables users to

1.Retrieval of information stored in database
2.Insertion of new information into the database
3.Deletion of information from the database
4.All of the above

Database management systems are intended to

1.Eliminate data redundancy
2.Establish relationship among records in different files
3.Maintain data integrity
4.all of the these

Deadlocks are possible only when one of the transactions wants to obtain a(n) ____ lock on a data item.
1.binary
2.exclusive
3.shared
4.complete

Decoder is a
1.combinational circuit
2.sequential circuit
3.complex circuit
4.gate

Decoders and Encoders are doing reverse operation

1.True
2.False
3.Inverters
4.Inverters and AND gates

Deletion of a node in linked list involves keeping track of address of node which comes immediately
1.after the node that is to be deleted
2.before the node that is to be deleted
3.after the middle node
4.none of the above

DESTRUCTOR HAS THE SAME NAME AS THE CONSTRUCTOR AND ITS PRECEDED BY
1.!
2.?
3.~
4.$

Determine output:
void main()
{
int c = - -2;
printf("c=%d", c);
}

1.1
2.-2
3.2
4.Error

Determine the output frequency for a frequency division circuit that contains 12 flip-flops with an input clock frequency
of 20.48 MHz.
1.10.24 kHz
2.5 kHz
3.30.24 kHz
4.15 kHz

Difficulty of performing operations and joins due to __ value

1.Null
2.key
3.Single
4.Multi

Digital electronics is based on the ________ numbering system.

1.decimal
2.octal
3.binary
4.hexadecimal

Disadvantages of File systems to store data is:

1. Data redundancy and inconsistency
2.Difficulty in accessing data
3.Data isolation
4.All of the above

Discrete quantities of information are represented in digital system with

1.Uni code
2.ASCII code
3.Binary Code
4. Octal code

Dividing a program into functions

1.is the key to object oriented programming
2.makes the program easier to conceptualize
3.makes the program run faster
4.None

DTMF stands for _______________

1.Dual Tone Magnetic Frequency
2.Double Tone Magnetic Frequency
3.Dual Tone Multiple Frequency
4. Dual Tone Mechanical Frequenc
During the ______ design phase of database design, the properties of data are given importance, rather than its
storage details.
1.Conceptual
2.Logical
3.Physical
4.Actual

Dynamic loading is :
1.loading multiple routines dynamically
2.loading a routine only when it is called
3. loading multiple routines randomly
4.None of these

Each gate has a delay of

1.1
2.2
3.3
4.4

Each node in singly linked list has ____________ fields.

1.2
2.3
3.1
4.4

Earlier, reflected binary codes were applied to

1.Binary addition
2.2’s complement
3.Mathematical puzzles
4.binary multiplication

Edge-triggered flip-flops must have:

1.very fast response times
2.at least two inputs to handle rising and falling edges
3.positive edge-detection circuits
4.negative edge-detection circuits

Effective access time is directly proportional to

1.page-fault rate
2.hit ratio
3.memory access time
4.none of the mentioned

Eight minterms will be used for

1.three variables
2.four variables
3.five variables
4.six variables

Electric digital systems uses signals that have 2 distinct values and circuit elements having
1.One stable state
2.Two stable states
3.Three stable states
4.Four stable states

Empdt1(empcode, name, street, city, state,pincode).For any pincode, there is only one city and state. Also, for given
street, city and state, there is just one pincode. In normalization terms, empdt1 is a relation in
1.1 NF only
2.2 NF and hence also in 1 NF
3.3NF and hence also in 2NF and 1NF
4.BCNF and hence also in 3NF, 2NF and 1NF

Encoders are made by three

1.AND gate
2.OR gate
3.NAND gate
4.XOR gate

Entities are described by properties called as _______.

1.Attributes
2.Characteristics
3.Features
4.Relations

Entity Relationship model consists of collection of basic objects called _________ and relationship among these
objects.
1.functions
2.models
3.entities
4.None of these

Entries in a stack are “ordered”. What is the meaning of this statement?

1.A collection of stacks is sortable
2.Stack entries may be compared with the ‘<‘ operation
3.The entries are stored in a linked list
4.There is a Sequential entry that is one by one

External fragmentation exists when :

1.enough total memory exists to satisfy a request but it is not contiguous
2.the total memory is insufficient to satisfy a request
3.a request cannot be satisfied even when the total memory is free
4.None of these

External fragmentation will not occur when :

1.first fit is used
2.best fit is used
3. worst fit is used
4.no matter which algorithm is used, it will always occur

For an S-R flip-flop to be set or reset, the respective input must be:
1.installed with steering diodes
2.in parallel with a limiting resistor
3.LOW
4.HIGH

For larger page tables, they are kept in main memory and a __________ points to the page table.
1.page table base register
2.page table base pointer
3.page table register pointer
4.page table base

For the following code snippet:

char *str = “VIT\0” “University”;
The character pointer str holds reference to string:
1.VIT
2.VITUniversity
3.University
4.Invalid declaration

For the following functional dependencies A->BC,CD->E,E->C,D->AEG,ABH->BD,DH->BC. Find the closure

1.A+
2.B+
3.C+
4.D+

Form of dependency in which set of attributes that are neither a subset of any of keys nor candidate key is classified
as
1.transitive dependency
2.full functional dependency
3.partial dependency
4.prime functional dependency

Four gates in a package is called

1.Biruple
2.Octruple
3.Dualruple
4.quadruple

Full adder forms sum of

1.2 bits
2.3 bits
3.4 bits
4.5 bits

Function has basically these two parts

1.Definition and calling
2.Calling and address
3.calling and methods
4.methods and declarations
Function overloading is also similar to which of the following?
1.Operator overloading
2.Destrcutor overloading
3.Constructor overloading
4.None of the above

Functional Dependencies are the types of constraints that are based on______
Functions are used to
1.Provide modularity to code
2.increases number of lines
3. Does not do the same work
4. Used only for mathematical calculation

Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any
rotations?
1.just build the tree with the given input
2.find the median of the set of elements given, make it as root and construct the tree
3.use trial and error
4.use dynamic programming to build the tree

Grouped data are diagrammatically presented by : 1.Bar diagram 2.Histogram 3.Simple graph 4.Pictogram
Half-adders have a major limitation in that they cannot
1.Accept a carry bit from a present stage
2.Accept a carry bit from a next stage
3.Accept a carry bit from a previous stage
4.None of the Mentioned

Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the
expression from infix to postfix notation.The maximum number of symbols that will appear on the stack AT ONE TIME
during the conversion of this expression?
1. 1
2.2
3.3
4.4

How can you ensure that an inline function isn't inlined for a particular function call for function foo?
1.unline x();
2.noexpand x();
3.x();
4.This is not possible on a case-by-case basis

How does an arithmetic operation take place in binary adders?

1.By addition of two bits corresponding to 2n digit
2.By addition of resultant to carry from 2n-1 digit
3.both a & b
4.none of the above
How does C++ compiler differs between overloaded postfix and prefix operators?
1.C++ doesn’t allow both operators to be overlaoded in a class
2.A postfix ++ has a dummy parameter
3.A prefix ++ has a dummy parameter
4.By making prefix ++ as a global function and postfix as a member function.

How is a J-K flip-flop made to toggle?

1. J = 0, K = 0
2.J = 1, K = 0
3. J = 0, K = 1
4.J = 1, K = 1

How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any
other logic gates?
1.7
2.8
3.9
4.10

How many AND, OR and EXOR gates are required for the configuration of full adder
1.1, 2, 2
2.2, 1, 2
3.3, 1, 2
4.4, 0, 1

How many bits would be required to encode decimal numbers 0 to 9999 in straight binary codes.
1.12
2.14
3.16
4.18

How many entries would a truth table for a four-input NAND gate have?
1.2
2.8
3.16
4.32

How many flip-flops are in the 7475 IC?

1.1
2.2
3.4
4.8

How many gates would be required to implement the following Boolean expression before simplification? XY + X(X +
Z) + Y(X + Z)
1.1
2.2
3.4
4.5

How many pulses are needed to change the contents of a 8-bit up counter from 10101100 to 00100111
1.134
How many queues are needed to implement a stack?
1.1
2.2
3.3
4.4

How many select lines would be required for an 8-line-to-1-line multiplexer?

1.8
2.2
3.3 , 4.4
How many types of inheritance are there in c++?
1.2
2.3
3.4
4.5

How to check whether the stack is empty or not ?

1.S[Top]==-1
2.S[Top +n]
3.S[top-n-1]
4.None of the option

HSAM stands for?

1.Hierarchic Sequential Access Method
2.Hierarchic Standard Access Method
3.Hierarchic Sequential and Method
4.Hierarchic Standard and Method

IC decoders are made with

1.AND gate
2.OR gate
3.NAND gate
4.XOR gate

Identify the characteristics of transactions

1.Atomicity
2.Durability
3.Isolation
4.All of the mentioned

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
1.Input restricted dequeue
2.Output restricted queue
3.Priority queues
4.Stack

If a 3-input AND gate has eight input possibilities, how many of those possibilities will result in a HIGH output?
1.1
2. 2
3.3
4.4

If a 3-input NOR gate has eight input possibilities, how many of those possibilities will result in a HIGH output?
1.1
2.2
3.7
4.8

If A and B are the inputs of a half adder, the sum is given by

1.A AND B
2.A OR B
3.A XOR B
4.A EXOR B

If a database server is referenced in a distributed transaction, the value of its commit point strength determines which
role it plays in the .........
1.two phase commit
2.two phase locking
3.transaction locking
4checkpoints

If a node having two children is deleted from a binray tree, it is replaced by its ___
1.Preorder Predecessor
2.Preorder Successor
3.Inorder Predecessor
4.Inorder Successor
If a signal passing through a gate is inhibited by sending a LOW into one of the inputs, and the output is HIGH, the
gate is a(n):
1.AND
2.NAND
3.OR
4.NOT

If a transaction acquires a shared lock, then it can perform .......... operation.

1. read
2.write
3. read and write
4.update

If a transaction acquires exclusive lock, then it can perform .......... operation.

1. read
2.write
3.read and write
4.update

If a transaction obtains a shared lock on a row, it means that the transaction wants to ..... that row.
1.write
2.insert
3.execute
4.read

If a transaction obtains an exclusive lock on a row, it means that the transaction wants to ....... that row.
1.select
2.update
3.view
4.Read

If an input is activated by a signal transition, it is ________.

1.edge-triggered
2.toggle triggered
3. clock triggered
4.noise triggered

If any anomalies are present make sure that programs that ____ the database will operate correctly
1.Insert
2.Delete
3.Update
4.Alter

If attributes A and B determine attribute C, then it is also true that:

1.A ? C.
2.B ? C.
3.(A,B) is a composite determinant.
4.C is a determinant.

If both inputs of an S-R flip-flop are low, what will happen when the clock goes HIGH?
1.An invalid state will exist.
2.No change will occur in the output.
3.The output will toggle.
4.The output will reset.

If every functional dependency in set E is also in closure of F then this is classified as

1.FD is covered by E
2.E is covered by F
3.F is covered by E
4.Fplus is covered by E

If relocation is static and is done at assembly or load time, compaction _________.

1.cannot be done
2.must be done
3.must not be done
4.can be done

If several requests have different deadlines that are relaticely close together, then using the SCAN – EDF algorithm :
1.The SCAN ordering will service the requests in that batch
2.The EDF ordering will service the requests in that batch
3.The FCFS ordering will service the requests in that batch
4.None of these

If the thread pool contains no available thread :

1.the server runs a new process
2.the server goes to another thread pool
3.the server demands for a new pool creation
4.the server waits until one becomes free

If the variables x and y are not linearly related, then the correlation between x and y is: 1.0 2.-1 3.1 4.0.5
If there are 32 segments, each of size 1Kb, then the logical address should have :
1.13 bits
2.14 bits
3.15 bits
4.16 bits

If two inputs are active on a priority encoder, which will be coded on the output?
1. the higher value
2.the lower value
3.both of the inputs
4.neither of the inputs

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, the
1.we'll get a different spanning tree.
2.we'll get the same spanning tree.
3.spanning will have less edges.
4.spanning will not cover all vertices.

If we perform xor operation of same operand then what is the status condition that is getting affected?
1.zero
2.Sign
3.Carry
4.overflow

If X is a Poisson variate with mean such that , then the value of is

1.3
2.4
3.2
4.6

If Y subset-of X, then
1.Y -> X
2.X -> Y
3.XY -> Y
4.None of the above
 COMPREHENSIVE EXAM-ANSWERS
PG 100-150

If a transaction obtains an exclusive lock on a row, it means that the transaction wants to ....... that row.

1.select

2.update

3.view

4.Read

If an input is activated by a signal transition, it is ________.

1.edge-triggered

2.toggle triggered

3.clock triggered

4.noise triggered

If any anomalies are present make sure that programs that ____ the database will operate correctly

1.Insert

2.Delete

3.Update

4.Alter

If attributes A and B determine attribute C, then it is also true that:

1.A ? C.

2.B ? C.

3.(A,B) is a composite determinant.

4.C is a determinant.

If both inputs of an S-R flip-flop are low, what will happen when the clock goes HIGH?

1.An invalid state will exist.

2.No change will occur in the output.

3.The output will toggle.

4.The output will reset.

If every functional dependency in set E is also in closure of F then this is classified as

1.FD is covered by E

2.E is covered by F
3.F is covered by E

4.Fplus is covered by E

If relocation is static and is done at assembly or load time, compaction _________.

1.cannot be done

2.must be done

3.must not be done

4.can be done

If several requests have different deadlines that are relaticely close together, then using the SCAN – EDF
algorithm :

1.
The SCAN ordering will service the requests in that batch

2.
The EDF ordering will service the requests in that batch

3.
The FCFS ordering will service the requests in that batch

4.
None of these

If the thread pool contains no available thread :

1.
the server runs a new process

2.
the server goes to another thread pool

3.
the server demands for a new pool creation

4.
the server waits until one becomes free

If the variables x and y are not linearly related, then the correlation between x and y is:
1.0
2.-1
3.1
4.0.5
If there are 32 segments, each of size 1Kb, then the logical address should have :

1.13 bits

2.14 bits
3.15 bits

4.16 bits

If two inputs are active on a priority encoder, which will be coded on the output?

1.
the higher value

2.
the lower value

3.
both of the inputs

4.
neither of the inputs

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

1.
we'll get a different spanning tree.

2.
we'll get the same spanning tree.

3.
spanning will have less edges.

4.
spanning will not cover all vertices.

If we perform xor operation of same operand then what is the status condition that is getting affected?

1.
zero

2.
Sign

3.
Carry

4.
overflow

If X is a Poisson variate with mean such that , then the value of is

1.
3

2.
4

3.
2
4.
6

If Y subset-of X, then

1.
Y -> X

2.
X -> Y

3.
XY -> Y

4.
None of the above

If you have an empty queue and you insert characters ‘r’, ‘a’, ‘t’ (in this order only), what is the order of the
characters when you dequeue all the elements?

1.
‘r’, ‘a’, ‘t’

2.
‘t’, ‘a’, ‘r’

3.
‘r’, ‘t’, ‘a’

4.
‘t’, ‘r’, ‘a’

If you were collecting and storing information about your music collection, an album would be considered a(n)
_____.

1.
Relation

2.
Entity

3.
Instance

4.
Attribute

If and are the two regression coefficients of variables X and Y , then the value of the correlation coefficient
is

1.
1/3

2.
1/9
3.
-1/3

4.
-1/9

In .........., we have many mini transactions within a main transaction.

1.
transaction control

2.
chained transaction

3.
nested transaction

4.
calling transaction

In ................... policy, when the last track has been visited in one direction, the arm is returned to the opposite
end of the disk and the scan begins again.

1.
Last in first out

2.
Shortest service time first

3.
SCAN

4.
Circular SCAN

In .................... inheritance, the base classes are constructed in the order in which they appear in the
deceleration of the derived class.

1.
multipath

2.
multiple

3.
multilevel

4.
hierarchical

In ......................... inheritance, the constructors are executed in the order of inheritance.

1.
multipath

2.
multiple
3.
multilevel

4.
hierarchical

In 2NF

1.
No functional dependencies exist.

2.
No multivalued dependencies exist.

3.
No partial functional dependencies exist

4.
No partial multivalued dependencies exist.

In _______, information is recorded magnetically on platters.

1.
Magnetic disks

2.
Electrical disks

3.
Assemblies

4.
Cylinders

In ________, there is an inefficient use of memory due to internal fragmentation.

1.
Fixed partitioning

2.
Simple Paging

3.
Virtual memory paging

4.
Simple segmentation

In ___________, there is an inefficient use of processor due to the need for compaction to counter external
fragmentation.

1.
Fixed partitioning

2.
Dynamic partitioning
3.
Virtual memory paging

4.
Simple segmentation

In ________________ linked list, there are backward and forward link

1.
Single Linked List

2.
Doubly linked list

3.
Circular linked list

4.
All the option

In a 2-tree, nodes with 0 children are called ___

1.
External node

2.
Exterior node

3.
Outer node

4.
Outside node

In a circular queue the value of r will be _______

1.
r=r+1

2.
r=(r+1)% [QUEUE_SIZE – 1]

3.
r=(r+1)% QUEUE_SIZE

4.
r=(r-1)% QUEUE_SIZE

In a doubly linked list traversing comes to a halt at

1.
null

2.
front
3.
rear

4.
rear-1

In a four variable Karnaugh map eight adjacent cells give a

1.
Two variable term

2.
single variable term

3.
Three variable term

4.
four variable term

In a full binary tree if number of internal nodes is I, then number of leaves L are?

1.
L = 2I

2.
L=I+1

3.
L=I–1

4.
L = 2I – 1

In a linked list the ____________ field contains the address of next element in the list.

1.
Link field

2.
Next element field

3.
Start field

4.
Info field

In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to
100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a
page is :

1.
3.0 ns

2.
68.0 ns
3.
68.5 ns

4.
78.5 ns

In a priority queue, insertion and deletion takes place at

1.
front, rear end

2.
only at rear end

3.
only at front end

4.
any position

In a queue, the initial values of front pointer f rear pointer r should be ……. and ………. respectively.

1.
0 and 1

2.
0 and -1

3.
-1 and 0

4.
1 and 0

In a relational model, relations are termed as

1.
Tuples

2.
Attributes

3.
Tables

4.
Rows

In a stack the command to access nth element from top of the stack s will be _______

1.
S[Top –n]

2.
S[Top +n]
3.
S[top-n-1]

4.
None of the above

In a three variable K-Map with minterms of variables x, y, and z an Octet will represent

1.
x

2.
x’

3.
z

4.
1

In a two-phase locking protocol, a transaction release locks in ......... phase.

1.
shrinking phase

2.
growing phase

3.
running phase

4.
initial phase

In a two-phase locking protocol, a transaction release locks in ......... phase.

1.
shrinking phase

2.
growing phase

3.
running phase

4.
initial phase

In a(n) ____ backup of the database, only the last modifications to the database are copied.

1.
full

2.
incomplete
3.
differential

4.
transaction log

In an E-R diagram an entity set is represent by a

1.
rectangle.

2.
ellipse

3.
diamond box

4.
circle.

In an Entity-Relationship Diagram Rectangles represents

1.
Entity sets

2.
Attributes

3.
Database

4.
Tables

In an expression involving || operator, evaluation

I.Will be stopped if one of its components evaluates to false

II.Will be stopped if one of its components evaluates to true

III.Takes place from right to left

IV. Takes place from left to right

1.
I and II

2.
I and III

3.
II and III

4.
II and IV
In an operating system a utility which lets the users issue and execute commands from the keyboard is called:

1.
Terminal Handler

2.
Command Interpreter

3.
Kernel

4.
None of the above

In an operating system a utility which lets the users issue and execute commands from the keyboard is called:

1.
Terminal Handler

2.
Command Interpreter

3.
Kernel

4.
None of the above

In an SR latch made by cross-coupling two NAND gates, if both S and R inputs are set to 0, then it will result in

1.
Q = 0, Q' = 1
Q = 1, Q' = 0
Q = 1, Q' = 1
Indeterminate states
In Augmentation Inference rule If X -> Y, then XZ ->

1.
ZX

2.
YZ

3.
YX

4.
None of the above

In C++, const qualifier can be applied to 1) Member functions of a class 2) Function arguments 3) To a class
data member which is declared as static 4) Reference variables

1.
Only 1, 2 and 3

2.
Only 1, 2 and 4
3.
All

4.
Only 1, 3

.In C, sizes of an integer and a pointer must be same.

1.True
2.False
3.Choose either true or false
4.Neither true nor false
In case of operator overloading, operator function must be ______ . 1. Static member functions 2. Non- static
member functions 3.Friend Functions

1.
Only 2

2.
Only 1, 3

3.
Only 2 , 3

4.
All 1 , 2, 3

In circular linked list, insertion of node requires modification of?

1.
One pointer

2.
Two pointer

3.
Three pointer

4.
None

In Decomposition Inference rule If __ then X -> Y and X -> Z

1.
XY -> Y

2.
X -> YZ

3.
YZ -> X

4.
None of the above
In doubly linked lists, traversal can be performed?

1.
Only in forward direction

2.
Only in reverse direction

3.
In both directions

4.
None

In ER diagrams, the total participation is displayed as a _______.

1.
Oval

2.
Single line

3.
Double line

4.
Arrow

In FIFO page replacement algorithm, when a page must be replaced

1.
oldest page is chosen

2.
newest page is chosen

3.
random page is chosen

4.
none of the mentioned

In fixed sized partition, the degree of multiprogramming is bounded by ___________.

1.
the number of partitions

2.
the CPU utilization

3.
the memory size

4.
All of these

In Functional dependency x->y, x attribute is know as

1.
Determinant

2.
primary key

3.
key

4.
None

In K-map pairing of minterms to eliminate literal uses following postulate:

1.
x.x’=0

2.
x + x’ = 1

3.
x+0=x

4.
(x’)’ = x

In linear search algorithm the Worst case occurs when

1.
The item is somewhere in the middle of the array

2.
The item is not in the array at all

3.
The item is the last element in the array

4.
The item is the last element in the array or is not there at all

In linked list there are no NULL links in

1.Single Linked List

2. Doubly linked list
3.Circular linked list
4.All the option
In log based recovery, the log is sequence of

1.
filter

2.
records

3.
blocks
4.
numbers

In map representation number of variables cannot be exceeded by

1.
4,5

2.
2,3

3.
5,6

4.
7,8

In order to keep track of current topmost element of the stack we need to maintain one variable.

1.
True

2.
False

3.
Partially Correct

4.
None of the above.

In paging the user provides only ________, which is partitioned by the hardware into ________ and ______.

1.
one address, page number, offset

2.
one offset, page number, address

3.
page number, offset, address

4.
None of these

In Psuedotransitivity Inference rule If X -> Y and WY -> Z, then

1.
WX -> Z

2.
WY -> X

3.
Y->Z
4.
None of the above

In relation schema common attributes is one way of relating ___________ relations.

1.
Attributes of common

2.
Tuple of common

3.
Tuple of distinct

4.
Attributes of distinct

In SCAN – EDF, requests with the same deadlines are ordered according to :

1.
SCAN policy

2.
EDF policy

3.
FCFS policy

4.
FIFO policy

In the ............, one transaction inserts a row in the table while the other transaction is half way through its
browsing of table.

1.
transaction read problem

2.
one way read problem

3.
serial read problem

4.
phantom read problem

In the ..................... scheme, two different parity calculations are carried out an stored in separate blocks on
different disks.

1.
RAID Level 4

2.
RAID Level 5

3.
RAID Level 6

4.
RAID Level 3

In the __________ normal form, a composite attribute is converted to individual attributes.

1.
First

2.
Second

3.
Third

4.
Fourth

In the __________ normal form, a composite attribute is converted to individual attributes.

1.
First

2.
Second

3.
Third

4.
Fourth

In the expression A(A+B), by writing the first term A as A+0, the expression is best simplified as

1.
A+AB

2.
AB

3.
A

4.
A+B

In the expression A+BC, the total number of min terms will be

1.
2

2.
3
3.
4

4.
5

In the following FD {a1->a2,a2->a3,a1->a3} which attribute will act as key

1.
a1

2.
a2

3.
a3

4.
None of the above

In the following scenarios, when will you use selection sort?

1.
The input is already sorted

2.
A large file has to be sorted

3.
Large values need to be sorted with small keys

4.
Small values need to be sorted with large keys

In the given FD F={B->A, D->A, AB->D}.Find the minimal cover

1.
F={D->A, B->D}

2.
F={B->A, D->A}

3.
Both A and B

4.
None of the above

In the multiprogramming environment, the main memory consist of ________________ number of process?

1.
>100

2.
only one
3.
>50

4.
More than one

In the stack process of inserting an element in the stack is called as ___________.

1.
Pop

2.
Evaluation

3.
Create

4.
Push

In the stack, if user try to remove an element from the empty stack then it called as ___________.

1.
Empty Collection

2.
Stack Underflow

3.
Stack Overflow

4.
Garbage Collection

In the worst case, the number of comparisons needed to search a singly linked list of length n for a given
element is

1.
O(log 2 n)

2.
O(n/2)

3.
O(log 2 n – 1)

4.
O(n)

In two phase commit, .......... coordinates the synchronization of the commit or rollback operations.

1.
database manager
2.
central coordinator

3.
participants

4.
concurrency control manager

In two-phase locking protocol, a transaction obtains locks in ........phase.

1.
shrinking phase

2.
growing phase

3.
running phase

4.
initial phase

In which Access method , Cycle time is Same for all the blocks of memory

1.
Random Access

2.
Sequential Access

3.
Direct Access

4.
Semi Random Access

In which operation carry is obtained?

1.
Subtraction

2.
Addition

3.
Multiplication

4.
Both addition and subtraction

In which traversal we process all of a vertex's descendants before we move to an adjacent vertex.

1.
Depth Limited

2.
Depth First

3.
Breadth First

4.
With first

Indexing the _____________ element in the list is not possible in linked lists

1.
middle

2.
first

3.
last

4.
any where in between

int marks[30]; What the number 30 tells us

1.
int data type size

2.
int value= marks[2]

3.
marks[9] = 30

4.
marks[30]=0

Invalid BCD can be made to valid BCD by adding with _______________

1.
0101

2.
0110

3.
0111

4.
1001

Is a pile in which items are added at one end and removed from the other.

1.
Stack
2.
Queue

3.
List

4.
None

It is impossible to represent which of the following in a relational schema?

1.
Any mandatory participation constraint in a many-to-one relationship

2.
Any mandatory participation constraint in a many-to-many relationship

3.
A one-to-one relationship

4.
A many-to-one relationship

It is possible to declare as a friend

1.
a member function

2.
a global function

3.
class

4.
a member function, a global function and a class

It is possible to detect deadlocks in a database system at the following cost:

1.
Query the database with SQL

2.
Special hardware devices

3.
Slower overall processing

4.
It is not possible to detect deadlocks

Kernel mode of operation is also called as

1.
User mode

2.
Privileged mode

3.
Monitor mode.

4.
Mode

Latches constructed with NOR and NAND gates tend to remain in the latched condition due to which
configuration feature?

1.
cross coupling

2.
gate impedance

3.
low input voltages

4.
asynchronous operation

Let A and B is the input of a subtractor then the output will be

1.
A XOR B

2.
A AND B

3.
A OR B

4.
A EXNOR B

Let k = 2n. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2n bit decoder.
This circuit is equivalent to a

1.

k-bit binary up counter

2.

k-bit binary down counter

3.
k-bit ring counter

4.
k-bit Johnson counter.
Let the following circular queue can accommodate maximum six elements with the

following data front = 2 rear = 4 queue = _______; L, M, N, ___, ___

What will happen after ADD O operation takes place?

1.
front = 2 rear = 5 queue = ______; L, M, N, O, ___

2.
front = 3 rear = 5 queue = L, M, N, O, ___

3.
front = 3 rear = 4 queue = ______; L, M, N, O, ___

4.
front = 2 rear = 4 queue = L, M, N, O, ___

Linked list is generally considered as an example of _________ type of memory allocation

1.
Static

2.
Dynamic

3.
Compile Time

4.
None of these

Linked lists are best suited ______________

1.
for relatively permanent collections of data.

2.
for the size of the structure and the data in the structure are constantly changing.

3.
data structure

4.
for none of above situation

Linked lists are not suitable to for the implementation of?

1.
Insertion sort

2.
Radix sort

3.
Polynomial manipulation

4.
Binary search

LLINK is the pointer pointing to the _______________

1.successor node
2.predecessor node
3.head node
4.last node
Locks placed by command are called ________

1.
implicit locks

2.
explicit locks

3.
exclusive locks

4.
shared locks

Media Recovery refers to recovering database

1.
after database has been physically damaged

2.
after some individual transaction has failed

3.
after inconsistent transaction has been identified

4.
after a system crash

Members of a class object are accessed with the

1.
Dot operator

2.
Scope resolution operator

3.
Stream insertion operator
4.
Extraction operator

Memory

1.
is a device that performs a sequence of operations specified by instructions in memory.

2.
is the device where information is stored

3.
is a sequence of instructions

4.
is typically characterized by interactive processing and time-slicing of the CPU's time to allow quick response to
each user.

Memory Address locations are specified using which data representation

1.
Sign-magnitude

2.
one's complement

3.
Unsigned

4.
two's complement

memory buffer used to accommodate a speed differential is called

1.
stack pointer

2.
cache

3.
accumulator

4.
disk buffer

Memory management technique in which system stores and retrieves data from secondary storage for use in
main memory is called

1.
Fragmentation

2.
Paging

3.
Mapping
4.
none of the mentioned

Minimization of following Boolean function will result in: F(A,B,C)=Σ (0,1,2,3,4,5,6,7)

1.
0

2.
1

3.
A

4.
A’

Minterms are arranged in map in a sequence of

1.
Binary sequence

2.
Gray code

3.
Binary variables

4.
BCD code

Modification schema of oracle database in one level without affecting the schema in high level is called as
_______

1.
Data Migration

2.
Data Isolation

3.
Data Independence

4.
Data Abstraction

Most demultiplexers facilitate which type of conversion?

1.
decimal-to-hexadecimal

2.
single input, multiple outputs

3.
ac to dc

4.
odd parity to even parity

Multimedia systems require _________ scheduling to ensure critical tasks will be serviced within timing
deadlines.

1.
Soft real time

2.
Hard real time

3.
Normal

4.
None of these

Multiple inheritance leaves room for a derived class to have _______ members.

1.
dynamic

2.
Private

3.
onlineexam.br>

4.
ambiguous

Multiplexors use decoders. Which combinational circuit do encoders use

1.
encoder

2.
decoder

3.
both

4.
neither

Multivalued attributes are shown by _______.

1.
()

2.
{}
3.
<>

4.
“”

Name the process with Process ID ‘1’ in LINUX.

1.
Background

2.
Orphan

3.
Zombie

4.
Novel

New nodes are added to the ......... of the queue.

1.Front
2.Rear
3.Middle
4.Both Front and Rear
On a positive edge-triggered S-R flip-flop, the outputs reflect the input condition when ________.

1.
the clock pulse is LOW

2.
the clock pulse is HIGH

3.
the clock pulse transitions from LOW to HIGH

4.
the clock pulse transitions from HIGH to LOW

One application of a digital multiplexer is to facilitate:

1.
data generation

2.
serial-to-parallel conversion

3.
parity checking

4.
data selector

One difference between a queue and a stack is

1.
Queue requires dynamic memory but stacks do not

2.
Stack requires dynamic memory but queues do not

3.
Queues use two ends of the structures but stacks use only one

4.
Stacks use two ends of the structure but queues use only one

One that is a universal gate

1.
AND

2.
NAND

3.
OR

4.
NOT

Operating System maintains the page table for

1.
each process

2.
each thread

3.
each instruction

4.
each address

Operating system is

1.
Hardware

2.
Software

3.
Firmware

4.
Middleware
Operating System maintains the page table for

1.
each process

2.
each thread

3.
each instruction

4.
each address

Output of following program?

#include<stdio.h>

int main()

float x = 0.1;

if ( x == 0.1 )

printf("IF");

else if (x == 0.1f)

printf("ELSE IF");

else

printf("ELSE");

1.
ELSE IF

2.
IF

3.
ELSE

4.
None

Output will be a LOW for any case when one or more inputs are zero for a(n):

1. AND
2.NAND
3.OR
4.NOT

Overall design of the database is called as _________.

1.
Database Instance

2.
Database Abstraction

3.
Database Schema

4.
None of these

Pick out the correct statement.

1.
virtual functions does not give the ability to write a templated function.

2.
virtual functions does not give the ability to rewrite a templated function.

3.
virtual functions does give the ability to write a templated function.

4.
none

Pick the odd one out

1.
Primary Key

2.
Super Key

3.
Candidate Key

4.
Foreign Key

Pointer is pointing to the first element of the Node then time require to Insert Element to second position is
__________.

1.
O(n)

2.
O(1)

3.
O(2n)
4.
O(3n)

Predict the output of following program.

#include <iostream>
using namespace std;
class A
{
protected:
int x;
public:
A() {x = 0;}
friend void show();
};

class B: public A
{
public:
B() : y (0) {}
private:
int y;
};

void show()
{
A a;
B b;
cout << "The default value of A::x = " << a.x << " ";
cout << "The default value of B::y = " << b.y;
}

1.
Compiler Error in show() because x is protected in class A

2.
Compiler Error in show() because y is private in class b

3.
The default value of A::x = 0 The default value of B::y = 0

4.
Compiler Dependent

Predict the output of the following program?

include<iostream>

using namespace std;

class Test

{
 protected:

int x;

public:

Test (int i):x(i) { }

void fun() const { cout << "fun() const " << endl; }

void fun() { cout << "fun() " << endl; }

};

int main()

Test t1 (10);

const Test t2 (20);

t1.fun();

t2.fun();

return 0;

1.
Compiler Error

2.
fun()

3.
fun() const

4.
Const fun()

Predict the output

#include <stdio.h>

int main()

float c = 5.0;

printf ("Temperature in Fahrenheit is %.2f", (9/5)*c + 32);

 return 0;

1.
Temperature in Fahrenheit is 41.00

2.
Temperature in Fahrenheit is 37.00

3.
Temperature in Fahrenheit is 0.00

4.
Compiler Error

Prevention of access to the database by unauthorized users is referred to as:

1.
Productivity

2.
Security

3.
Reliability

4.
Integrity

Problems with NULL value

1.
Wasted storage space

2.
Problems understanding meaning

3.
Both A and B

4.
None of the above

Process is

1.
program in High level language kept on disk

2.
contents of main memory

3.
a program in execution

4.
a job in secondary memory
Process of removing an element from the stack is called as __________.

1.
Push

2.
Pop

3.
Create

4.
Enter

Process synchronization can be done on

1.
hardware level

2.
software level

3.
both (a) and (b)

4.
none of the mentioned

Program always deals with

1.
logical address

2.
absolute address

3.
physical address

4.
relative address

Property of normalization of relations which guarantees that functional dependencies are represented in
separate relations after decomposition is classified as

1.
nonadditive join property

2.
independency reservation property

3.
dependency preservation property

4.
additive join property
push() and pop() functions are found in ______________

1.
Queue

2.
List

3.
Stack

4.
Tree

Pushing an element into a full stack leads to_____________

1.Pop
2.Crash
3.Create
4.Overflow
putchar(c) function/macro always outputs character c to the:

1.
screen

2.
standard output

3.
depends on the compiler

4.
depends on the standard

Queue can be used to implement ?

1.
quick sort

2.
merge sort

3.
heap sort

4.
insertion sort

Queue can be used to implement ?

1.
radix sort

2.
quick sort
3.
recursion

4.
depth first search

Queue follows_______________

1.
LIFO

2.
FIFO

3.
LILO

4.
Array

QuickSort can be categorized into which of the following?

1.
Brute Force technique

2.
Divide and conquer

3.
Greedy algorithm

4.
Dynamic programming

Reflected binary code is also known as

1.
BCD code

2.
Binary code

3.
ASCII code

4.
Gray Code

REGARDING THE CONSTRUCTORS OF A CLASS

1.
ALL CONSTRUCTOR HAVE THE SAME NAME

2.
THE NAME OF CONSTRUCTORS MATCHES THE NAME OF THE CLASS

3.
CONSTRUCTORS CAN HAVE ANY NUMBER OF PARAMETERS OF ANY TYPE

4.
ALL THE ANSWERS ARE CORRECT

Related fields in a database are grouped to form a

1.
data file

2.
data record.

3.
menu.

4.
bank.

Reusability of the code can be achieved in CPP through

1.
Polymorphism

2.
Encapsulation

3.
Inheritance

4.
None

Rollback of transactions is normally used to

1.
Update the transaction

2.
Recover from transaction failure

3.
Retrieve old records

4.
Repeat a transaction

Rotary Switch is an example for _______________

1.
Multiplexer

2.
Decoder

3.
Encoder

4.
Demultiplexer

Row is synonymous with the term:

1.
record.

2.
relation.

3.
column.

4.
field.

Rule which states that addition of same attributes to right side and left side will results in other valid
dependency is classified as

1.
referential rule

2.
inferential rule

3.
augmentation rule

4.
reflexive rule

Run time mapping from virtual to physical address is done by

1.
memory management unit

2.
CPU

3.
PCI

4.
none of the mentioned

Run time mapping from virtual to physical address is done by

1.
memory management unit

2.
CPU

3.
PCI

4.
none of the mentioned

Select the canonical sum-of-products representation of the following function: f(x,y,z) = xy’ + y(x+z)

1.
f(x,y,z) = xy’ + xy + yz

2.
f(x,y,z) = x + yz

3.
f(x,y,z) = xy’z + xy’z’ + xyz + x’yz + xyz’

4.
f(x,y,z) = (x + y + z).(x + y + z’).(x + y’ + z)

Servicing requests strictly according to deadline using EDF may result in :

1.
Lower seek times

2.
Lower bandwidth

3.
Higher seek time

4.
Higher bandwidth

Special type of registers are

1.
latch

2.
flip-flop

3.
counters

4.
memory

SQL is a _______ language.

1.
Object-oriented

2.
Non-Procedural

3.
Declarative

4.
Procedural

Stack is a _____________ data Structure.

1.FIFO
2.LIFO
3.LILO
4.None of the above
State true or false. i) Stack may be empty also in some cases ii) Stack follows FIFO concept.

1.
True, True

2.
True, False

3.
False, True

4.
False, False

State true or false. i) The degree of root node is always zero. ii) Nodes that are not root and not leaf are called
as internal nodes.

1. True, True
2.True, False

3.False, True
4. False, False

STATE WHETHER THE FOLLOWING STATEMENTS ABOUT THE CONSTRUCTOR ARE TRUE OR FALSE.

I) CONSTRUCTORS SHOULD BE DECLARED IN THE PRIVATE SECTION.

II) CONSTRUCTORS ARE INVOKED AUTOMATICALLY WHEN THE OBJECTS ARE CREATED.

1.
TRUE, TRUE

2.
TRUE, FALSE

3.
FALSE,TRUE

4.FALSE,FALSE
Storing natural joins of base relations leads to
1.
insert anomalies

2.
select anomalies

3.
delete anomalies

4.
update anomalies

struct node {

int data;

struct node *next;

}*start = NULL;

Consider the above representation and predict what will be printed on the screen by following statement ?

start->next->data

1.
None of these

2.
Access the “data” field of 2nd node

3.
Access the “data” field of 3rd node

4.
Access the “data” field of 1st node

Structure is basically

1.
Collection of numbers only

2.
Collection of ascii values only

3.
Collection of Homogeneous data types

4.
Collection of Hetrogeneous data types
Subtraction of binary numbers can be done conveniently with

1.
high cost circuit

2.
low cost circuits

3.
complements

4.
borrows

Sum of product can be implemented with a group of

1.
NOT gates

2.
OR gates

3.
AND gates

4.
XOR gates

Supervisor state is

1.
never used

2.
entered by programs when they enter the processor

3.
required to perform any I/O

4.
only allowed to the operating system

Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that
the insertion and deletion operation are carried out using REAR and FRONT as array index variables,
respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are

1.
Full: (REAR+1) mod n == FRONT, empty: REAR == FRONT

2.
Full: (REAR+1) mod n == FRONT, empty: (FRONT+1) mod n == REAR

3.
Full: REAR == FRONT, empty: (REAR+1) mod n == FRONT

4.
Full: (FRONT+1) mod n == REAR, empty: REAR == FRONT

Suppose each set is represented as a linked list with elements in arbitrary order. Which of the operations
among union, intersection, membership, cardinality will be the slowest?

1.
union only

2.
intersection, membership

3.
membership, cardinality

4.
union, intersection

Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of n
variables. What is the minimum size of the multiplexer needed?

1.

2n line to 1 line
2n+1 line to 1 line
2n-1 line to 1 line
2n-2 line to 1 line

Swap space exists in

1.
primary memory

2.
secondary memory

3.
CPU

4.
none of the mentioned

Swapping requires a __________.

1.
motherboard

2.
keyboard

3.
monitor

4.
backing store
Tables in second normal form (2NF):

1.
Eliminate all hidden dependencies

2.
Eliminate the possibility of a insertion anomalies

3.
Have a composite key

4.
Have all non key fields depend on the whole primary key

Tables in second normal form (2NF):

1.
Eliminate all hidden dependencies

2.
Eliminate the possibility of a insertion anomalies

3.
ave a composite key

4.
Have all non key fields depend on the whole primary key

The ............... policy restricts scanning to one direction only.

1.
SCAN

2.
C-SCAN

3.
N-Step SCAN

4.
Both A and B

The ................ inherits some or all of the properties of the ........... class.

1.
base, derived

2.
derived, base

3.
derived, initial

4.
base, final
The .................. policy is to select the disk I/O request that requires the least movement of the disk arm from
its current position.

1.
Last in first out

2.
Shortest service time first

3.
Priority by process

4.
Random scheduling

The ___________ must design and program the overlay structure.

1.
programmer

2.
system architect

3.
system designer

4.
None of these

The ___________ swaps processes in and out of the memory.

1.
memory manager

2.
CPU

3.
CPU manager

4.
User

The address of a page table in memory is pointed by

1.
stack pointer

2.
page table base register

3.
page register

4.
program counter
The address of a page table in memory is pointed by

1.
stack pointer

2.
page table base register

3.
page register

4.
program counter

The advantage of optimistic locking is that:

1.
the lock is obtained only after the transaction has processed.

2.
the lock is obtained before the transaction has processed.

3.
the lock never needs to be obtained

4.
transactions that are best suited are those with a lot of activity

The arrays has one of the following

1.
Alphabets to access

2.
named key to access

3.
named value to access

4.
index to access

The Average case occur in linear search algorithm

1.
When Item is somewhere in the middle of the array

2.
When Item is not in the array at all

3.
When Item is the last element in the array

4.
When Item is the last element in the array or is not there at all

The base register is also known as the :

1.basic register
2. regular register
3.relocation register
4.delocation register
The basic logic gate whose output is the complement of the input is the:

1.
OR gate

2.
AND gate

3.
inverter

4.
comparator

The binary representation of BCD number 00101001 (decimal 29) is

1.
0011101

2.
0110101

3.
1101001

4.
0101011

The binary-coded decimal (BCD) system can be used to represent each of the 10 decimal digits as:

1.
4-bit binary code

2.
8-bit binary code

3.
16-bit binary code

4.
ASCII code
The Boolean expression for a 3-input AND gate is ________.

1.
X=A+B

2.
X=A+B+C

3.
X = ABC

4.
X = A + BC

The Boolean expression for a 3-input OR gate is ________.

1.
X=A+B

2.
X=A+B+C

3.
X = ABC

4.
X = A + BC

The candidate keys that are not selected as the Primary key are known as _______.

1.
super key

2.
alternate keys

3.
secondary key

4.
foreign key

The cin is

1.
An object

2.
A class
3.
A function

4.
A package

The complexity of linear search algorithm is

1.
O(n)

2.
O(n log n)

3.
O(log n)

4.
O(log 2n)

THE COPY CONSTRUCTOR

1.
CREATES AN OBJECT FROM ANY OBJECT

2.
CREATES AN OBJECT FROM AN OBJECT OF THE SAME CLASS

3.
CREATES AN OBJECT THAT IS A POINTER TO THE COPIED OBJECT

4.
ALL THE PREVIOUS ANSWERS ARE INCORRECT

The data structure required to check whether the parenthesis in an expression are balanced is ____________

1.
Stack

2.
Queue

3.
Tree

4.
Array
1) The arrays have one of the following
1. Alphabets to access
2. named key to access
3. named value to access
4. index to access

2) The Average case occurs in the linear search algorithm (choose)

1. When Item is somewhere in the middle of the array
2. When Item is not in the array at all
3. When Item is the last element in the array
4. When Item is the last element in the array or is not there at all

3) The base register is also known as the :

1.basic register
2. regular register
3.relocation register
4.delocation register

4) The basic logic gate whose output is the complement of the input is the:
1. OR gate
2. AND gate
3. inverter
4. comparator

5) The binary representation of BCD number 00101001 (decimal 29) is

1. 0011101
2. 0110101
3. 1101001
4. 0101011

6) The binary-coded decimal (BCD) system can be used to represent each of the 10 decimal digits as:
1. 4-bit binary code
2. 8-bit binary code
3. 16-bit binary code
4. ASCII code
7) The Boolean expression for a 3-input AND gate is ________.
1. X = A + B
2. X = A + B + C
3. X = ABC
4. X = A + BC

8) The Boolean expression for a 3-input OR gate is ________.

1. X = A + B
2. X = A + B + C
3. X = ABC
4. X = A + BC

9) The candidate keys that are not selected as the Primary key are known as _______.
1. super key
2. alternate keys
3. secondary key
4. foreign key

10) The cin is

1. An object
2. A class
3. A function
4. A package

11) The complexity of linear search algorithm is

1. O(n)
2. O(n log n)
3. O(log n)
4. O(log 2n)

12) THE COPY CONSTRUCTOR

1. CREATES AN OBJECT FROM ANY OBJECT
2. CREATES AN OBJECT FROM AN OBJECT OF THE SAME CLASS
3. CREATES AN OBJECT THAT IS A POINTER TO THE COPIED OBJECT
4. ALL THE PREVIOUS ANSWERS ARE INCORRECT

13) The data structure required to check whether the parenthesis in an expression are balanced is
____________
1. Stack
2. Queue
3. Tree
4. Array

14)The database environment has all of the following components except:

1.users.
2.separate files.
3.database.
4.database administrator.

15)The DBMS language component which can be embedded in a program is

1. The data definition language (DDL).
2. The data manipulation language (DML).
3. The database administrator (DBA).
4. A query language.

16) The decimal equivalent of the excess-3 number 110010100011.01110101 is

1. 970.42
2. 1253.75
3. 861.75
4. None of the Mentioned

17) The decimal number 10 is represented in its BCD form as

1. 1010
2. 01010
3. 00010000
4. 001010

18) The depth of a complete binary tree is given by

1. Dn = n log2n
2. Dn = n log2n + 1
3. Dn = log2n
4. Dn = log2n + 1

19) The difference between half adder and full adder is

1. Half adder has two inputs while full adder has four inputs
2. Half adder has one output while full adder has two outputs
3. Half adder has two inputs while full adder has three inputs
4. All of the Mentioned

20) The different classes of relations created by the technique for preventing modification anomalies are
called:
1. normal forms.
2. referential integrity constraints
3. functional dependencies.
4. None of the above is correct.

21) The disadvantage of moving all process to one end of memory and all holes to the other direction,
producing one large hole of available memory is :
1. the cost incurred
2. the memory used
3. the CPU used
4. All of these

22) The disk bandwidth is :

1. The total number of bytes transferred
2. Total time between the first request for service and the completion on the last transfer
3. The total number of bytes transferred divided by the total time between the first request for service and
the completion on the last transfer
4. None of these
23) The dummy header in linked list contain _______________
1. first record of the actual data
2. last record of the actual data
3. pointer to the last record of the actual data
4. middle record of the actual data
24) The EDF scheduler uses ________ to order requests according to their deadlines.
1. Stack
2. Disks
3. Queue
4. None of these

25) The effect of the ROLLBACK command in a transaction is the following:

1. Undo all changes to the database resulting from the execution of the transaction
2. Undo the effects of the last UPDATE command
3. Restore the content of the database to its state at the end of the previous day
4. Make sure that all changes to the database are in effect

26) The enrolling of a database in a recovery catalog is called

1. set up
2. registration
3. start up
4. enrolment

27) The entity types are represented in ER-diagrams by ______.

1. Ovals
2. Rectangles
3. Double ovals
4. Diamonds

28) The excess-3 code for 597 is given by

1. 100011001010
2. 100010100111
3. 010110010111
4. 010110101101

29) The following C function takes a singly linked list as input argument. It modifies the list by moving the
last element to the front of the list and returns the modified list. Some part of the code left blank. typedef
struct node { int value; struct node* next; }Node; Node* move_to_front(Node* head) { Node* p, *q;
if((head==NULL) || (head->next==NULL)) return head; q=NULL; p=head; while(p->next != NULL) { q=p;
p=p->next; } return head; } Choose the correct alternative to replace the blank line
1. q=NULL; p->next=head; head =p ;
2. q->next=NULL; head =p; p->next = head;
3. head=p; p->next=q; q->next=NULL;
4. q->next=NULL; p->next=head; head=p;

30) The following C Function takes a singly- linked list of integers as a parameter and rearranges the
elements of the lists. The function is called with the list containing the integers 1,2,3,4,5,6,7 in the given
order. What will be the contents of the list after the function completes execution? struct node{ int value;
struct node* next; }; void rearrange (struct node* list) { struct node *p,q; int temp; if (! List || ! list->next)
return; p->list; q=list->next; while(q) { temp=p->value; p->value=q->value; q->value=temp;p=q->next;
q=p?p->next:0; } }
1. 1, 2, 3, 4, 5, 6, 7
2. 2, 1, 4, 3, 6, 5, 7
3. 1, 3, 2, 5, 4, 7, 6
4. 2, 3, 4, 5, 6, 7, 1

31) The following function reverse() is supposed to reverse a singly linked list. There is one line missing at
the end of the function. struct node { int data; struct node* next; }; /* head_ref is a double pointer which
points to head (or start) pointer of linked list */ static void reverse(struct node** head_ref) { struct node*
prev = NULL; struct node* current = *head_ref; struct node* next; while (current != NULL) { next = current-
>next; current->next = prev; prev = current; current = next; } /ADD A STATEMENT HERE/ } What should
be added in place of "/ADD A STATEMENT HERE/", so that the function correctly reverses a linked list.
1. *head_ref = prev;
2. *head_ref = current;
3. *head_ref = next;
4. *head_ref = NULL;

32) The following is a data structure that organizes data similar to a line in the supermarket, where the first
one in line is the first one out.
1. Queue linked list
2. Stacks linked list
3. Both Queue and Stack Linked List
4. Neither of Queue and Stack Linked List

33) The following is a linear list in which insertions and deletions are made to from either end of the
structure. 1. Circular queue
2. random of queue
3. priority
4. dequeue

34) The following is not the operation that can be performed on queue.
1. Insertion
2. Deletion
3. Retrieval
4. Traversal

35) The following postfix expression with single digit operands is evaluated using a stack 8 2 3 ^ / 2 3 * + 5
1 * - 1.6,1
2. 5,7
3.3,2
4. 1,6

36) The format identifier ‘%i’ is also used for _____ data type?
1. char
2. int
3. float
4. double

37) The format used to present the logic output for the various combinations of logic inputs to a gate is
called a(n):
1. Boolean constant
2. Boolean variable
3. truth table
4. input logic function

38) The friend functions and the member functions of a friend class can directly access the ...................
data.
1. private and protected
2. private and onlineexam.br>
3. protected and onlineexam.br>
4. private, protected and onlineexam.br>

39) The friend functions are used in situations where

1. We want to exchange data between classes
2. We want to have access to unrelated classes
3. Dynamic binding is required
4. We want to create versatile overloaded operators.

40) The full subtractor can be implemented using

1. Two XOR and an OR gates
2. Two half subtractors and an OR gate
3. Two multiplexers and an AND gate
4. None of the Mentioned

41) The function of a multiplexer is

1. to decode information
2. to select 1 out of N input data sources and to transmit it to single channel
3. to transit data on N lines
4. to perform serial to parallel conversion

42) The getche() library function

1. returns a character when any key is pressed 20%
2. returns a character when ENTER is pressed 0%
3. displays a character on the screen when any key is pressed 80%
4. does not display a character on the scree

43) The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of
iterations in selection sort and bubble sort respectively are,
1. 5 and 4
2. 1 and 4
3. 0 and 4
4. 4 and 1
44) The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations
will be done to sort the array with improvised version?
1. 4
2. 2
3. 1
4. 0

45) The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations
will be done to sort the array?
1. 4
2. 2
3. 1
4. 0

46) The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent
partitioning?
1. 1 and 3
2. 3 and 1
3. 2 and 6
4. 6 and 2

47) The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent
partitioning? 1. 1 and 6
2. 6 and 1
3. 2 and 6
4. None of the mentioned

48) The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort
respectively are, 1. 5 and 4
2. 4 and 5
3. 2 and 4
4. 2 and 5

49) The global coordinator forgets about the transaction phase is called .........
1. Prepare phase
2. Commit phase
3. Forget phase
4. Global phase

50) The heads of the magnetic disk are attached to a _____ that moves all the heads as a unit.
1. Spindle
2. Disk arm
3. Track
4. None of these

51) The host controller is :

1. Controller built at the end of each disk
2. Controller at the computer end of the bus
3. Both a and b
4. Neither a nor b

52) The hybrid algorithm that combines EDF with SCAN algorithm is known as :
1. EDS
2. SDF
3. SCAN-EDF
4. None of these
53) The IC 74138 is
1. Decoder
2. OR Gate
3. 1:8 Dmux
4. Encoder

54) The IC 74151 is

1. 8:1 Mux
2. Encoder
3. Flipflop
4. Nand Gate

55) The identifying relationships are displayed as _______ in ER-diagrams.

1. Double rectangles
2. Double ovals
3. Double triangles
4. Double diamonds

56) The inputs/outputs of an analog multiplexer/demultiplexer are:

1. bidirectional
2. unidirectional
3. even parity
4. binary-coded decimal

57) The K-Map for following function will have F(w,x,y,z) = ∑ (0,1,2,4,5,6,8,9,12,13,14)
1. 2 pairs, 1 Quad, 0 Octet
2. 2 pairs, 2 Quad, 1 Octet.
3. 1 pair, 2 Quad, 1 Octet
4. 0 pair, 2 Quad, 1 Octet

58) The keyword used for structure is

1.Structure
2.struct
3.struct []
4.typedef

59) The language used in application programs to request data from the DBMS is referred to as the
1. DDL
2. DML
3. VDL
4. SDL

60) The library function exit() causes an exit from ?

1. The loop in which it occurs
2. The block in which it occurs
3. The function in which it occurs
4. The program in which it occurs

61) The logic gate that will have HIGH or "1" at its output when any one (or more) of its inputs is HIGH is
a(n):
1. OR gate
2. AND gate
3. NOR gate
4. NOT operation

62) The Memory Buffer Register (MBR)

1. is a hardware memory device which denotes the location of the current instruction being executed.
2. is a group of electrical circuits (hardware), that performs the intent of instructions fetched from memory.
3. contains the address of the memory location that is to be read from or stored into.
4. contains a copy of the designated memory location specified by the MAR after a "read" or the new
contents of the memory prior to a "write".

63) The minimum sum-of products for the function f(d,e,f)=∑(1,4,5,7)

1. f=e’f+de’+df
2. f=ef’+de’+d’f
3. f=e’f+d’e’+df’
4. f=e’f’+de’+df’

64) The multivalued attributes are represented in ER-diagrams by ______.

1. Ovals
2. Rectangles
3. Double ovals
4. Diamonds

65) The NAND logic gate is the same as the operation of the ________ gate with an inverter connected to
the output.
1. OR
2. AND
3. NAND
4. none of the above

66) The node where the distributed transaction originates is called the .......
1. local coordinator
2. starting coordinator
3. global coordinator
4. originating node
67) The NOR logic gate is the same as the operation of the ________ gate with an inverter connected to
the output.
1.OR
2.AND
3.NAND
4.none of the above

68) The normal form that is not necessarily dependency preserving is

1. 2NF
2. 3NF
3. BCNF
4. 4NF

69) The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C
is ? 1.3
2.4
3.5
4.6

70) The number of comparisons done in sequential search is __

1. (N/2)+1
2. (N+1)/2
3. (N-1)/2
4. (N-2)/2

71) The number of the threads in the pool can be decided on factors such as :
1. number of CPUs in the system
2. amount of physical memory
3. expected number of concurrent client requests
4. All of these

71) The operating system keeps a small table containing information about all open files called :
1. System table
2. Open-file table
3. File table
4. Directory table

72) The operation of processing each element in the list is known as _____________
1. sorting
2. merging
3. inserting
4. traversal

73) The Oracle RDBMS uses the ____ statement to declare a new transaction start and its properties.
1. BEGIN
2. SET TRANSACTION
3. BEGIN TRANSACTION
4. COMMIT

74) The output of a gated S-R flip-flop changes only if the:

1. flip-flop is set
2. control input data has changed
3. flip-flop is reset
4. input data has no change

75) The output of a NAND gate is LOW if ________.

1. all inputs are LOW
2. all inputs are HIGH
3. any input is LOW
4. any input is HIGH

76) The output of a NOR gate is HIGH if ________.

1. all inputs are HIGH
2. any input is HIGH
3. any input is LOW
4. all inputs are LOW

77) The output of an AND gate with three inputs, A, B, and C, is HIGH when ________.
1. A = 1, B = 1, C = 0
2. A = 0, B = 0, C = 0
3. A = 1, B = 1, C = 1
4. A = 1, B = 0, C = 1

78) The output of an OR gate with three inputs, A, B, and C, is LOW when ________
1. A = 0, B = 0, C = 0
2. A = 0, B = 0, C = 1
3. A = 0, B = 1, C = 1
4. all of the above

79) The output of logic gate is ‘1’ when all its inputs are at logic ‘0’. The gate is either
1.a NAND or an EX-OR gate
2.a NOR or an EX- NOR gate
3.an OR or an EX-NOR gate
4.an AND or an EX-OR gate

80) The page table contains

1. base address of each page in physical memory
2. page offset
3. page size
4. none of the mentioned

81) The pager concerns with the

1.individual page of a process
2.entire process
3.entire thread
4.first page of a process

82) The part of machine level instruction, which tells the central processor what has to be done, is
1. Operation code
2. Address
3. Locator
4. Flip-Flop
83) The partial key attribute is underlined with a ______ line.
1. Single
2. Shaded
3. Dotted
4. Double

84) The phenomenon of interpreting unwanted signals on J and K while Cp (clock pulse) is HIGH is called
________.
1. parity error checking
2. ones catching
3. digital discrimination
4. digital filtering

85) The post order traversal of a binary tree is DEBFCA. The pre order traversal is ___
1. ABFCDE
2. ADBFEC
3. ABDECF
4. ABDCEF

86) The postfix form of A*B+C/D is

1. *AB/CD+
2. AB*CD/+
3. A*BC+/D
4. ABCD+/*

87) The pre-order and post-order of a Binary tree generates same output. Here, the tree can have
maximum of 1.Two Nodes
2.One Node
3.Three Nodes
4.No restrictions in number of nodes

88) The primary key is selected from the:

1. composite keys.
2. determinants.
3. candidate keys.
4. foreign keys.
89) The primary use for Gray code is
1. Coded representation of a shaft’s mechanical position
2. Turning on/off software switches
3. To represent the correct ASCII code to indicate the angular position of a shaft on rotating machinery
4. To convert the angular position of a shaft on rotating machinery into hexadecimal code

90) The priority of a process will ______________ if the scheduler assigns it a static priority.
1. Change
2. Remain unchanged
3. Depends on the operating system
4. None of these

91) THE PROCESS OF INITIALIZING THROUGH A COPY CONSTRUCTOR IS KNOWN AS ...............

1. COPY PROCESS
2. COPY REGISTRATION
3. COPY INITIALIZATION
4. INITIALIZATION PROCESS

92) The property / properties of a database is / are :

1. It is an integrated collection of logically related records.
2. It consolidates separate files into a common pool of data records.
3. Data stored in a database is independent of the application programs using it.
4. All of the above.

93) The property of a binary tree is ___

1. The right subtree can be empty
2. The root can not contain NULL
3. The first subset is called left subtree
4. The second subset is called right subtree

94) The property of transaction that persists all the crashes is

1. Atomicity
2. Durability
3. Isolation
4. All of the mentioned

95) The redo operation:

1. Restarts a transaction from scratch
2. Writes new values from the log to the database
3. Writes old values from the log back to the database
4. Force writes all buffers to disk

96) The relational model feature is that there

1. is much more data independence than some other database models.
2. is no need for primary key data.
3. are explicit relationships among records.
4. are tables with many dimensions.

97) The relational model is concerned with :

1. Data structure
2. Data manipulation
3. Data integrity
4. All the above

98) The relational model uses some unfamiliar terminology. A tuple is equivalent to a :
1. Record
2. Field
3. File
4. Database

99) The relationship in which an entity type participates more than once is a _____ relationship.
1. Recursive
2. Iterative
3. Enumerated
4. Implied

100) The remote backup site is sometimes called as

1. primary site
2. secondary site
3. ternary site
4. tertiary site

101) The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is ____________

1. 284
2. 213
3. 142
4. 71

102) The set of tracks that are at one arm position make up ___________.
1. Magnetic disks
2. Electrical disks
3. Assemblies
4. Cylinders

103) The situation in which a transaction holds a data item and waits for the release of data item held by
some other transaction, which in turn waits for another transaction, is called .......
1. serialiable schedule
2. process waiting
3. concurrency
4. deadlock

104) The situation when in a linked list START=NULL is ....

1. Underflow
2. Overflow
3. Houseful
4. Saturated

105) The size of a process is limited to the size of :

1. physical memory
2. external storage
3. secondary storage
4. None of these

106) The Storage-to-Storage instructions

1. have both their operands in the main store.
2. which perform an operation on a register operand and an operand which is located in the main store,
generally leaving the result in the register, expect in the case of store operation when it is also written into
the specified storage location
3. which perform indicated operations on two fast registers of the machine and have the result in one of the
registers
4. all of the above

107) The strategy of allowing processes that are logically runnable to be temporarily suspended is called
1. preemptive scheduling
2. non preemptive scheduling
3. shortest job first
4. first come first served

108) The systematic reduction of logic circuits is accomplished by:

1. using Boolean algebra
2. symbolic reduction
3. TTL logic
4. using a truth table

109) The term "enqueue" and "dequeue" is related to the

1. Stack
2. Queue
3. List
4. Array

110) The term _______ is used to refer to a row.

1. BCNF is stricter than 3 NF
2. Lossless, dependency -preserving decomposition into 3 NF is always possible
3. Loss less, dependency – preserving decomposition into BCNF is always possible
4. Any relation with two attributes is BCNF

111) The term m31 should be made up of at least ----- literals.

1. 6
2. 31
3. 5
4. 4
112) The time required for a gate or inverter to change its state is called
1. Rise time
2. Decay time
3. Propagation time
4. Charging time

113) The time taken for the desired sector to rotate to the disk head is called :
1. Positioning time
2. Random access time
3. Seek time
4. Rotational latency

114) The time taken to move the disk arm to the desired cylinder is called the :
1. Positioning time
2. Random access time
3. Seek time
4. Rotational latency

115) The transaction wants to edit the data item is called as .......
1. Exclusive Mode
2. Shared Mode
3. Inclusive Mode
4. Unshared Mode

116) The tuples of the relations can be of ________ order

1. Constant
2. Same
3. Sorted
4. Any

117) The undo operation:

1. Restarts a transaction from scratch
2. Writes new values from the log to the database
3. Writes old values from the log back to the database
4. Force writes all buffers to disk

118) The value obtained in the function is given back to main by using ________ keyword?
1.return
2.static
3.new
4.volatile

119) The way a particular application views the data from the database that the application uses is a
1. module.
2. relational model.
3. schema.
4. sub schema.

120) To avoid the race condition, the number of processes that may be simultaneously inside their critical
section is
1. 8
2. 1
3. 16
4. 0

121) To Delete an item from a Queue identify the correct set of statements
1. Q[REAR] = item; REAR ++
2. item = Q[FRONT]; FRONT++
3. item = Q[REAR]; FRONT ++
4. item = Q[FRONT]; REAR ++

122) To enable a process to wait within the monitor,

1. a condition variable must be declared as condition
2. condition variables must be used as boolean objects
3. semaphore must be used
4. all of the mentioned

123) To evaluate an expression without any embedded function calls:

1. One stack is enough
2. Two stacks are needed
3. As many stacks as the height of the expression tree are needed
4. A Turing machine is needed in the general case

124) To find out maximum element in a list of n numbers,one needs atleast

1. n comparisons
2. n-1 comparisons
3. n(n-1) comparisons
4. 2n-1 comparisons

125) Tower of hanoi is an application of ______________

1. Queue
2. List
3. Stack
4. Array

126) Transaction .......... ensures that the transaction are being executed successfully.
1. concurrency
2. consistency
3. serialisability
4. non serialiasability

127) Transaction processing is associated with everything below except

1. Producing detail, summary, or exception reports
2. Recording a business activity
3. Confirming an action or triggering a response
4. Maintaining data.

128) Two input multiplexer would have

1. 1 select line
2. 2 select lines
3. 4 select lines
4. 3 select lines
129) Two J-K flip-flops with their J-K inputs tied HIGH are cascaded to be used as counters. After four
input clock pulses, the binary count is ________.
1. 00
2. 11
3. 01
4. 10

130) Two variables will be represented by

1. eight minterms
2. six minterms
3. five minterms
4. four minterms

131) User push 1 element in the stack with already five elements and whose maximum stack size is 5 then
stack becomes ___________.
1. Underflow
2. Overflow
3. Userflow
4. Crash

132) User-defined data type can be derived by

1. struct
2. int
3. long int
4. int array

133) User-Friendly Systems are:

1. required for object-oriented programming
2. easy to develop
3. common among traditional mainframe operating systems
4. becoming more common

134) Value of first linked list index is ____________

1. 0
2. 1
3. -1
4. 2

135) What control signals may be necessary to operate a 1-line-to-16 line decoder?
1. flasher circuit control signa
2. a LOW on all gate enable inputs
3. input from a hexadecimal counter
4. a HIGH on all gate enable circuits

136) What do arrays do?

1. hold addresses
2. hold values under a single name
3. hold one value
4. hold two values

137) What does inheritance allows you to do?

1. create a class
2. create a hierarchy of classes
3. access methods
4. None

138) WHAT FUNCTION SHOULD ALL CLASSES HAVE?

1. NONE
2. CONSTRUCTOR
3. DESTRUCTOR
4. CONSTRUCTOR AND DESTRUCTOR

139) WHAT HAPPENS WHEN A CLASS WITH PARAMETERIZED CONSTRUCTORS AND HAVING NO
DEFAULT CONSTRUCTOR IS USED IN A PROGRAM AND WE CREATE AN OBJECT THAT NEEDS A
ZERO-ARGUMENT CONSTRUCTOR?
1. COMPILE-TIME ERROR
2. PREPROCESSING ERROR
3. RUNTIME ERROR
4. RUNTIME EXCEPTION
140) What is a 'tuple'?
1.Another name for a table in an RDBMS
2.A row or record in a database table.
3.An attribute attached to a record.
4.Another name for the key linking different tables in a database.

141) What is a array?

1.An array is a series of elements of the same type in contiguous memory locations
2.An array is a series of element
3.An array is a series of elements of the same type placed in non-contiguous memory locations
4. None

142) What is a memory efficient double linked list?

1. Each node has only one pointer to traverse the list back and forth
2. The list has breakpoints for faster traversal
3. An auxiliary singly linked list acts as a helper list to traverse through the doubly linked list
4. None of the mentioned

143) What is a randomized QuickSort?

1. The leftmost element is chosen as the pivot
2. The rightmost element is chosen as the pivot
3. Any element in the array is chosen as the pivot
4. A random number is generated which is used as the pivot

144) What is an external sorting algorithm?

1. Algorithm that uses tape or disk during the sort
2. Algorithm that uses main memory during the sort
3. Algorithm that involves swapping
4. Algorithm that are considered ‘in place’

145) What is an in-place sorting algorithm?

1. It needs O(1) or O(logn) memory to create auxiliary locations
2. The input is already sorted and in-place
3. It requires additional storage
4. None of the mentioned

146) What is an internal sorting algorithm?

1. Algorithm that uses tape or disk during the sort
2. Algorithm that uses main memory during the sort
3. Algorithm that involves swapping
4. Algorithm that are considered ‘in place’

147) What is compaction?

1. a technique for overcoming internal fragmentation
2. a paging technique
3. a technique for overcoming external fragmentation
4. a technique for overcoming fatal error

148) What is data structure used in recursion

1. Function calls
2. Queue
3. Evaluation of arithmetic expressions
4. Stack

149) What is log in log based recovery system?

1. Numbers
2. Records
3. Blocks
4. Filter

150) What is meant by multiple inheritance?

1. Deriving a base class from derived class
2. Deriving a derived class from base class
3. Deriving a derived class from more than one base class
4. None of the mentioned

151) What is meant by the fan-out of a logic gate?

1. The physical distance between the output pins on the device.
2. The number of other gates that can be connected to the gate's output.
3. The number of other gates that can be connected to one of the gate's inputs.
4. The amount of cooling required by the gate.

152) What is one disadvantage of an S-R flip-flop?

1. It has no enable input.
2. It has an invalid state.
3. It has no clock input.
4. It has only a single output.

153) What is short int in C programming?

1.Basic datatype of C
2.Qualifier
3.short is the qualifier and int is the basic datatype
4.All of the given choices

154) What is the advantage of bubble sort over other sorting techniques?
1.It is faster
2.Consumes less memory
3.Detects whether the input is already sorted
4.All the choice

155) What is the advantage of selection sort over other sorting techniques?
1. It requires no additional storage space
2. It is scalable
3. It works best for inputs which are already sorted
4. It is faster than any other sorting technique

156) What is the average case complexity of bubble sort?

1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)
157) What is the average case complexity of QuickSort?
1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)

158) What is the average case complexity of selection sort?

1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)

159) What is the best case complexity of QuickSort?

1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)

160) What is the best case complexity of selection sort?

1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)

161) What is the best case efficiency of bubble sort in the improvised version?
1. O(nlogn)
2. O(logn)
3. O(n)
4. O(n2)

162) What is the condition for a tree to be weight balanced. where a is factor and n is a node?
1. weight[n.left] >= a*weight[n] and weight[n.right] >= a*weight[n].
2. weight[n.left] >= a*weight[n.right] and weight[n.right] >= a*weight[n].
3. weight[n.left] >= a*weight[n.left] and weight[n.right] >= a*weight[n].
4. weight[n] is a non zero

163) What is the correct way to initialize values in an array?

1. my_array [5] = (5,3,4,2,7);
2. my_array [5] = {5;3;4;2;7};
3. my_array [5] = {5,3,4,2,7};
4. my_array [5] = {5,3,4;,2,7};

164) What is the difference between binary coding and binary-coded decimal?
1. BCD is pure binary.
2. Binary coding has a decimal format.
3. BCD has no decimal format.
4. Binary coding is pure binary.

165) What is the disadvantage of selection sort?

1. It requires auxiliary memory
2. It is not scalable
3. It can be used for small keys
4. None of the mentioned

166) What is the final value of j in the below code? #include int main() { int i = 0, j = 0; if (i && (j = i + 10))
//do something ; }
1. 0
2. 10
3. Depends on the compiler
4. Depends on language standard

167) What is the hold condition of a flip-flop?

1. both S and R inputs activated
2. no active S or R input
3. only S is active
4. only R is active

168) What is the index number of the last element of an array with 29 elements?
1. 29
2. 28
3. 0
4. Programmer-defined

169) What is the meaning of the term "POP" in stack?

1. Deletion
2. Insertion
3. Top of the stack
4. all of above

170) What is the meaning of the term "PUSH" in stack

1. Deletion
2. Insertion
3. Top of the stack
4. all of above

171) What is the minimum number of gates required to implement the Boolean function (AB+C)if we have
to use only 2-input NOR gates?
1. 2
2. 3
3. 4
4. 5

172) What is the minimum number of NAND gates required to implement a 2-input EXCLUSIVE-OR
function without using any other logic gate?
1. 3
2. 4
3. 5
4. 6

173) What is the most efficient way to assign or print out arrays?
1. loops
2. functions
3. pointers
4. Enum
174) What is the name given to the organized collection of software that controls the overall operation of a
computer?
1. Working system
2. Peripheral system
3. Operating system
4. Controlling system

175) What is the output of following function for start pointing to first node of following linked list? 1->2->3-
>4->5->6 void fun(struct node* start) { if(start == NULL) return; printf("%d ", start->data); if(start->next !=
NULL ) fun(start->next->next); printf("%d ", start->data); }
1.1 4 6 6 4 1
2.1 3 5 1 3 5
3.1 2 3 5
4.1 3 5 5 3 1

176) What is the output of the following #include int const s=9;int main(){ std::cout << s; return 0; }
1. 0
2. 9
3. Compile time Error
4. Runtime Error

177) What is the output of the following program? #include using namespace std; class Box { double width;
public: friend void printWidth( Box box ); void setWidth( double wid ); }; void Box::setWidth( double wid ) {
width = wid; } void printWidth( Box box ) { box.width = box.width * 2; cout << "Width of box : " << box.width
<< endl; } int main( ) { Box box; box.setWidth(10.0); printWidth( box ); return 0; }
1. 40
2. 5
3. 10
4. 20

178) What is the output of the following program? #include using namespace std; class sample { int width,
height; public: void set_values (int, int); int area () {return (width * height);} friend sample duplicate
(sample); }; void sample::set_values (int a, int b) { width = a; height = b; } sample duplicate (sample
rectparam) { sample rectres; rectres.width = rectparam.width * 2; rectres.height = rectparam.height * 2;
return (rectres); } int main () { sample rect, rectb; rect.set_values (2, 3); rectb = duplicate (rect); cout <<
rectb.area(); return 0; }
1. 20
2. 16
3. 24
4. None
179) What is the output of this C code? #include void main() { int x = 0, y = 2, z = 3; int a = x & y | z;
printf("%d", a); }
1. 3
2. 0
3. 2
4. Run time error

180) What is the output of this C code? #include void main() { int x = 1, y = 0, z = 5; int a = x && y && z++;
printf("%d", z); }
1. 6
2. 5
3. 0
4. Varies

181) What is the output of this C code? #include void main() { int x = 1, z = 3; int y = x << 3; printf(" %d\n",
y); }
1. -2147483648
2. -1
3. Run time error
4. 8
 (200-252)

1.What is the output of this C code?

#include <stdio.h>
void main()
{
int x = 1, y = 0, z = 5;
int a = x && y && z++;
printf("%d", z);
}

1.6

2.5

3.0

4.Varies

2.What is the output of this C code?

#include <stdio.h>
void main()
{
int x = 1, z = 3;
int y = x << 3;
printf(" %d\n", y);
}

1.-2147483648

2.-1

3.Run time error

4.8

3.What is the output of this C code?

#include <stdio.h>
int main()
{
int x = 1, y = 0, z = 3;
x > y ? printf("%d", z) : return z;
}

1.3

2.1

3.Compile time error

4.Run time error

4.What is the output of this C code?

 #include <stdio.h>

void main()
{
int x = 1, y = 0, z = 5;
int a = x && y || z++;
printf("%d", z);
}

1.6

2.5

3.0

4.Varies

5.What is the output of this program?

#include <iostream>
using namespace std;
class Box
{
double width;
public:
friend void printWidth( Box box );
void setWidth( double wid );
};
void Box::setWidth( double wid )
{
width = wid;
}
void printWidth( Box box )
{
box.width = box.width * 2;
cout << "Width of box : " << box.width << endl;
}
int main( )
{
Box box;
box.setWidth(10.0);
printWidth( box );
return 0;
}

1.40

2.10

3.5

4.20

6.What is the output of this program?

#include <iostream>
using namespace std;
class base
{
 int val1, val2;
public:
int get()
{
val1 = 100;
val2 = 300;
}
friend float mean(base ob);
};
float mean(base ob)
{
return float(ob.val1 + ob.val2) / 2;
}
int main()
{
base obj;
obj.get();
cout << mean(obj);
return 0;
}

1.200

2.150

3.100

4.300

7.What is the output of this program?

#include <iostream>
using namespace std;
class sample
{
int width, height;
public:
void set_values (int, int);
int area () {return (width * height);}
friend sample duplicate (sample);
};
void sample::set_values (int a, int b)
{
width = a;
height = b;
}
sample duplicate (sample rectparam)
{
sample rectres;
rectres.width = rectparam.width * 2;
rectres.height = rectparam.height * 2;
return (rectres);
}
int main ()
{
sample rect, rectb;
rect.set_values (2, 3);
 rectb = duplicate (rect);
cout << rectb.area();
return 0;
}

1.20

2.16

3.24

4.None

8.What is the output of this program?

#include <iostream>
using namespace std;
class sample;
class sample1
{
int width, height;
public:
int area ()
{
return (width * height);}
void convert (sample a);
};
class sample
{
private:
int side;
public:
void set_side (int a)
{
side = a;
}
friend class sample1;
};
void sample1::convert (sample a)
{
width = a.side;
height = a.side;
}
int main ()
{
sample sqr;
sample1 rect;
sqr.set_side(6);
rect.convert(sqr);
cout << rect.area();
return 0;
}

1.24

2.35

3.16
4.36

9.What is the output of this program?

#include <iostream>
using namespace std;
int main()
{
int const p = 5;
cout << ++p;
return 0;
}

1.5

2.6

3.Error

4.None

10.What is the postfix form of the following prefix *+ab–cd

1.ab+cd–*

2.ab+*cd–

3.abc+*–

4.ab+*c-d

11.What is the prefix form of the following postfix ab+cd–*?

1.*+ab–cd

2.+ab*-cd

3.abc+*–

4.+*ab-cd

12.What is the scope of the variable declared in the user defined function?

1.whole program

2.only inside the {} block

3.None

4.All

13.What is the size of an int data type?

1.4 Bytes

2.8 Bytes
3.Depends on the system/compiler

4.Cannot be determined.

14.What is the status of the inputs S0, S1, and S2 of the 74151 eight-line multiplexer in order for the
output Y to be a copy of input I5?

1.S0 = 0, S1 = 1, S2 = 0

2.S0 = 0, S1 = 0, S2 = 1

3.S0 = 1, S1 = 1, S2 = 0

4.S0 = 1, S1 = 0, S2 = 1

15.What is the syntax of friend function?

1.friend class1 Class2;

2.friend class;

3.friend class

4.None

16.What is the syntax of inheritance of class?

1.class name

2.class name : access specifer

3.class name : access specifer class name

4.None

17.What is the time complexity of inserting a node in a doubly linked list?

1.O(nlogn)

2.O(logn)

3.O(n)

4.O(1)

18.What is the use of full adder?

1. to perform 3-bit addition

2. to include the carry during addition

3. perform parallel addition

4. none of the above

19.What is the use of getchar()?

1.The next input character each time it is called

2.EOF when it encounters end of file.

3.Both of the given choices

4.None of the mentioned

20.What is the use of putchar()?

1.The character written

2.EOF is an error occurs

3.None of the given choices

4.Both of the given choices

21.What is the use of status register?

1.holds the answer of the operation

2.stores the status

3.additional information apart from processed output

4.used as temporary register

22.What is the value of the postfix expression 6 3 2 4 + – *:

1.Something between -5 and -15

2.Something between 5 and -5

3.Something between 5 and 15

4.Something between 15 and 100

23.What is the worst case complexity of bubble sort?

1.O(nlogn)

2.O(logn)

3.O(n)

4.O(n2) - n square

24.What is the worst case complexity of QuickSort?

1.O(nlogn)

2.O(logn)

3.O(n)

4.O(n2)
25.What is the worst case complexity of selection sort?

1.O(nlogn)

2.O(logn)

3.O(n)

4.O(n2)

26.What is true about inline functions ?

1.It's a compulsion on the compiler to make function inline 13%

2.It's a request to the compiler to make te function inline 38%

3.It's the indication to the compiler that the function is recursive

4.It's the indication to the compiler that the function is member function

27.What term is used to refer to a specific record in your music database; for instance; information
stored about a specific album?

1.Relation

2.Instance

3.Table

4.Column

28.What type of operation can use for the following one: 0.0=0, 0.1=1,1.0=1,1.1=0

1.addition

2.Subtraction

3.A and B

4.None of the above

29.What will be the order of execution of base class constructors in the following method of
inheritance. class A: public B, public C {....};

1.B(); C(); A();

2.C(); B(); A();

3.A(); B(); C();

4.B(); A(); C();

30.What will be the order of execution of base class constructors in the following method of
inheritance. class A: public B, virtual public C {....};

1.B(); C(); A();

2.C(); B(); A();

3.A(); B(); C();

4.B(); A(); C();

31.WHAT WILL BE THE OUTPUT

#include <iostream>
using namespace std;
class Sand
{
public: Sand()
{
cout << "Sand ";
}
~Sand()
{
cout << "~Sand ";
}
};

A.Sand

B.~Sand

C.Sand ~Sand

D.COMPILER ERROR

32.What will be the postfix expression for following infix expression A/B^C-D?

1.AB/^CD-

2.AB^/CD-

3.ABC^/D-

4.ABC/^D-

33.What will happen when we use void in argument passing?

1.It will not return value to its caller

2.It will return value to its caller

3.None

34.What will happen while using pass by reference?

1.The values of those variables are passed to the function so that it can manipulate them.

2.The location of variable in memory is passed to the function so that it can use the same memory
area for its processing.

3.The function declaration should contain ampersand (& in its type declaration)
4.The values of those variables are can not be passed to the function.

35.What would be the asymptotic time complexity to add a node at the end of singly linked list,
if the pointer is initially pointing to the head of the list?

1.O(1)

2.O(n)

3.θ (n)

4.θ(1)

36.What would be the asymptotic time complexity to insert an element at the second position in the
linked list?

1.O(1)

2.O(n)

3.O(n2)

4.None

37.When "Underflow" situation happens in stack"?

1.When stack is full and performing push operation

2.When stack is full and performing POP operation

3.When stack is empty and performing pop operation

4.When stack is empty and performing push operation

38.When a deadlock is detected, recovery is normally accomplished by

1.Repeating the transaction

2.Consistency checking

3.Rollback of transaction

4.Locking of data

39.When a member function is defined outside of the class declaration, the function name must be
qualified with the:

1.Class name, followed by a semicolon

2.Class name, followed by the scope resolution operator

3.Name of the first object

4.Private access specifier

40.When a program is abnormally terminated, the equivalent of a ____ command occurs.

1.COMMIT

2.ROLLBACK

3.QUIT

4.EXIT

41.When a program tries to access a page that is mapped in address space but not loaded in physical
memory, then

1.segmentation fault occurs

2.fatal error occurs

3.page fault occurs

4.no error occurs

42.When do status register gets updated

1.assign values

2.certain instructions are executed

3.during the time of code generation

4.all of the above

43.When high priority task is indirectly preempted by medium priority task effectively inverting the
relative priority of the two tasks, the scenario is called

1.priority inversion

2.priority removal

3.priority exchange

4.priority modification

44.When our function doesn't need to return anything means what will be the return type of the
function?

1.The void data type

2.Blank Space

3.Any data type

4.none of the above

45.When overloading unary operators using Friend function,it requires_____ argument/s.

1.Zero

2.One
3.Two

4.None

46.When the body of a member function is defined inside a class declaration, it is said to be

1. Virtual

2.Friend

3.Static

4.Inline

47.When the head damages the magnetic surface, it is known as _________.

1.Disk crash

2.Head crash

3.Magnetic damage

4.All of these

48.When the memory allocated to a process is slightly larger than the process, then :

1.internal fragmentation occurs

2.external fragmentation occurs

3.both internal and external

4.neither internal nor external

49.When the recovery procedure uses ____, the database is immediately

updated by transaction operations during the transaction's execution,

even before the transaction reaches its commit point.

1.write-through

2.deferred write

3.immediate write

4.unbuffered

50.When the value of an attribute A is obtained from the value of an attribute B, then the attribute A
is called _______.

1.Composite

2.Stored

3.Derived
4.Retrieved

51.When the values in one or more attributes being used as a foreign key must exist in another set of
one or more attributes in another table, we have created a(n):

1.transitive dependency.

2.insertion anomaly.

3.referential integrity constraint.

4.normal form.

52.When using SQL*Plus, Oracle commands, column names, table names and all other database
elements:

1.are case insensitive.

2.are case sensitive.

3.must always be in lower case.

4.must always be in upper case.

53.When we cant perform deletion in stack?

1.stack is empty

2.stack is full

3.stack is partially full

4.None of the above

54.When we cant perform insertion in stack?

1.stack is empty

2.stack is full

3.stack is partially full

4.None of the above

55.When we perform A - B where the value of A and B are 5 and 10, which of the status condition gets
affected?

1.zero

2.Sign

3.Carry

4.overflow

56.When we perform a-(-b), what is the actual operation done?

1.addition

2.Subtraction

3.complement

4.none of the above

57.When you dereference an object pointer, use the

1.-> operator

2.<> operator

3.:: operator

4.& operator

58.Where does the execution of the program starts?

1.user-defined function

2.main function

3.void function

4.none

59.Which systems typically allows to replace failed disks without stopping access to the system?

1.RAM

2.RMAN

3.RAD

4.RAID

60.Which algorithm chooses the page that has not been used for the longest period of time whenever
the page required to be replaced?

1.first in first out algorithm

2.additional reference bit algorithm

3.least recently used algorithm

4.counting based page replacement algorithm

61.Which are the fundamental inputs assigned or configured in the full adder circuit ?

1.Addend, Augend & Sum

2.Augend, Sum & Input Carry

3.Addend, Augend & Input Carry

4.Addend, Sum & Input Carry

62.Which code maintains the decimal number system even after the manipulation

1.BCD

2.Ascii

3.Excess-3

4.Hexadecimal

63.Which data structure is needed for circular queue concept?

1.Branch

2.Queue

3.Tree

4.Stack

64.Which data structure is needed to convert infix notation to postfix notation?

1.Branch

2.Queue

3.Tree

4.Stack

65.Which data structure is used in breadth first search of a graph to hold nodes?

1.Stack

2.queue

3.Tree

4.Array

66.Which data type is most suitable for storing a number 65000 in a 32-bit system?

1.short

2.int

3.long

4.double

67.Which datastructure is used in breadth first search of a graph to hold nodes?

1.Array
2.Tree

3.Stack

4.Queue

68.Which forms are based on the concept of functional dependency:

1.1NF

2.2NF

3.3NF

4.4NF

69.Which forms has a relation that possesses data about an individual entity:

Which forms simplifies and ensures that there is minimal data aggregates and repetitive groups:

Which function definition will run correctly?

1.int sum(int a, int B., return (a + B.;

2.int sum(int a, int B., {return (a + B.;}

3.int sum(a, B., return (a + B.;

4.none

70.Which is a block of Recovery Manager (RMAN) job commands that is stored in the recovery catalog?

1.recovery procedure

2.recovery block

3.stored block

4.stored script

71.Which is a bottom-up approach to database design that design by examining the relationship
between attributes:
Which is more effective while calling the functions?

1.call by value

2.call by reference

3.call by pointer

4.none

72.Which is the pointer associated with the availability list?

1.FIRST

2.AVAIL
3.TOP

4.REAR

73.Which is true?

1.The symbolic constant EOF is predefined

2.The value of EOF is typically -1

3.Both of the given choices

4.Either one of the given choice or the another

74.Which is/are the application(s) of stack

1.Function calls

2.Large number Arithmetic

3.Evaluation of arithmetic expressions

4.All of the above

75.Which keyword is used to declare the friend function?

1.firend

2.friend

3.classfriend

4.myfriend

76.Which method of combination circuit implementation is widely adopted with maximum output
functions and minimum requirement of ICs

1.Multiplexer Method

2.Decoder Method

3.Encoder Method

4.Parity Generator Method

77.Which of the following accesses a variable var in structure, where b is pointer to structure

1.b->var

2.b.var

3.b-var

4.b>var
78.Which of the following addressing modes, facilitates access to an operand whose location is
defined relative to the beginning of the data structure in which it appears?

1.ascending

2.sorting

3.index

4.indirect

79.Which of the following applications may use a stack?

1.A parenthesis balancing program

2.Underflow of Stack

3.Garbage Collection

4.Overflow of Stack

80.Which of the following are building blocks of encoders?

1.NOT gate

2.OR gate

3.AND gate

4.NAND gate

81.Which of the following are correct syntax to send an array as a parameter to function:

1.func(&array);

2.func(array)

3.func(*array);

4.func(array[size]);

82.Which of the following are correct syntaxes to send an array as a parameter to function:

1.func(&array);

2.func();

3.func(*array);

4.func(array[size]);

83.Which of the following are functions of Database Manager?

1. Interacting with File Manager

2. Creating Queries to Access data

3. Security Enforcement

4. Database Definition and Schema Generation

1.1 and 2

2.1 and 3

3.1, 2 and 3

4.2, 3 and 4

84.Which of the following are generated from char pointer?

1.char *string = “Hello.”;

2.
char *string; scanf(“%s”, string);

3.char string[] = “Hello.”;

4.None

85.Which of the following are loaded into main memory when the computer is booted?

1.internal command instructions

2.external command instructions

3.utility programs

4.word processing instructions

86.Which of the following are(is) Language Processor(s)

1.assembles

2.compilers

3.interpreters

4.All of the above

87.Which of the following best describes how to construct a 1-line to 8-line demultiplexer from a 3-
line to 8-line decoder:

1.Connect the decoder input select lines CBA to D.

2.Connect the decoder enable input to D

3.Connect the decoder input data lines to Di.

4.Connect the ith decoder output to Di.

88.Which of the following best describes the action of pulse-triggered FF's?

1.The clock and the S-R inputs must be pulse shaped.

2.The data is entered on the leading edge of the clock, and transferred out on the trailing edge of the
clock.

3.A pulse on the clock transfers data from input to output.

4.The synchronous inputs must be pulsed.

89.Which of the following cannot be a structure member?

1.Another structure

2.Function

3.Array

4.int array

90.Which of the following conditions checks available free space in avail

1.Avail=Top

2.NULL=AVAIL

3.Avail=Null

4.Avail=Max stack

91.Which of the following consists of the various applications and database that play a role in a
backup and recovery strategy?

1.Recovery Manager environment

2.Recovery Manager suit

3.Recovery Manager file

4.Recovery Manager database

92.Which of the following correctly accesses the seventh element stored in foo, an array with 100
elements?

1.foo[6]

2.foo[7]

3.foo(7)

4.foo

93.Which of the following correctly declares an array?

1.int anarray[10];

2.int anarray;

3.anarray{10};
4.array anarray[10];

94.Which of the following data structures is best suited for efficient implementation of priority
queues?

1.Arrays

2.Linked Lists

3.Heaps

4.Stacks

95.Which of the following deals with soft errors, such as power failures?

1.system recovery

2.failure recovery

3.database recovery

4.media recovery

96.Which of the following expressions is in the sum-of-products (SOP) form?

1.(A + B)(C + D)

2.(A)B(CD)

3.AB(CD)

4.AB + CD

97.Which of the following fields in a student file can be used as a primary key?

1.class

2.Social Security Number

3.GPA

4.Major

98.Which of the following functions is(are) performed by the loader

1.allocate space in memory for the programs and resolve symbolic references between object decks

2.adjust all address dependent locations, such as address constants, to correspond to the allocated
space.

3.physically place the machine instructions and data into memory.

4.All of the above

99.Which of the following gates is described by the expression (ABCD)' ?

1.OR

2.AND

3.NOR

4.NAND

100.Which of the following gives the memory address of the first element in array foo, an array with
100 elements?

1.&foo

2.foo[2]

3.&foo[2]

4.foo[1]

101.Which of the following gives the memory address of the first element in array?

1.array[0];

2.array[1];

3.array(2);

4.array;

102.Which of the following has “all-or-none” property ?

1.Atomicity

2.Durability

3.Isolation

4.All of the mentioned

103.Which of the following in not a function of DBA?

1.Network Maintenance

2.Routine Maintenance

3.Schema Definition

4.Authorization for data access

104.Which of the following in Object Oriented Programming is supported by Function overloading

concept of C++.

1.Inheritance
2.Polymorphism

3.Data abstraction

4.Data encapsulation

105.Which of the following indicates the maximum number of entities that can be involved in a
relationship?

1.Minimum cardinality

2.Maximum cardinality

3.ERD

4.Greater Entity count

106.Which of the following is a correct format for declaration of function?

1.return-type function-name(argument type);

2.return-type function-name(argument type){}

3.return-type (argument type)function-name;

4.None

107.Which of the following is a Data Model?

1.Entity-Relationship model

2.Relational data model

3.Object-Based data model

4.All of the above

108.Which of the following is a properly defined struct?

1.struct {int a;}

2.struct a_struct {int a;}

3.struct a_struct int a;

4.struct a_struct {int a;};

109.Which of the following is a transaction?

1.A group of SQL statements consisting of one read and one write operation

2.A group of SQL statements consisting only of read operations

3.A group of SQL statements defining a user-oriented task

4.A group of SQL statements consisting only of write operations

110.Which of the following is a two-dimensional array?

1.array anarray[20][20];

2.int anarray[20][20];

3.int array[20, 20];

4.char array[20];

111.Which of the following is a User-defined data type?

1.typedef int Boolean;

2.typedef enum {Mon, Tue, Wed, Thu, Fri} Workdays;

3.struct {char name[10], int age};

4.All of the mentioned

112.Which of the following is a valid inline for function foo?

1.inline void foo() {}

2.void foo() inline {}

3.inline:void foo() {}

4.None

113.Which of the following is an application of stack?

1.Web Browser

2.Text Editor

3.Infix to postfix convertion

4.all of above

114.Which of the following is an essential part of any backup system?

1.Filter

2.Security

3.Scalability

4.Recovery

115.Which of the following is an invalid BCD code?

1.0011

2.1101
3.0101

4.1001

116.Which of the following is Database Language?

1.Data Definition Language

2.Data Manipulation Language

3.Query Language

4.All of the above

117.Which of the following is false with respect to inheritance?

1.When a base class is privately inherited,onlineexam.members of the base class become private
members of the derived class

2.When a base class is onlineexam.y inherited,onlineexam.members of the base class becomes

onlineexam.members of derived class

3.When a base class is privately inherited,a private member of base class becomes private member
of derived class

4.When a base class is onlineexam.y inherited protected members of base class becomes protected
members of derived class

118.Which of the following is false:

1.Digital signature is used to verify that a message is authentic

2.Digital certificate is issued by a third party

3.Digital certificate ensures integrity of the message

4.Digital signature ensures non-repudiation.

119.Which of the following is known as memory-style error correcting-code(ECC) organization that

employs parity bits?

1.RAID level 1

2.RAID level 2

3.RAID level 3

4.RAID level 4

120.Which of the following is not a basic Boolean operation?

1.OR

2.NOT

3.AND
4.FOR

121.Which of the following is not a level of data abstraction?

1.Physical Level

2.Critical Level

3.Logical Level

4.View Level

122.Which of the following is NOT a proper state of transaction?

1.Partially aborted

2.Committed

3.Aborted

4.Partially committed

123.Which of the following is not a Storage ManagerComponent?

1.Transaction Manager

2.Logical Manager

3.Buffer Manager

4.File Manager

124.Which of the following is not a type of Linked List ?

1.Doubly Linked List

2.Singly Linked List

3.Circular Linked List

4.Hybrid Linked List

125.Which of the following is not a valid declaration in C?

1.short int x;

2.signed short x;

3.short x;

4.unsigned short;

126.Which of the following is not generally associated with flip-flops?

1.Hold time

2.Propagation delay time

3.Interval time

4. Set up time

127.Which of the following is not layer of operating system

1.Kernel

2.Shell

3.Application programs

4.Critical Section

128.Which of the following is not possible under any scenario?

1.s1 = &s2;

2.s1 = s2;

3.(*s1).number = 10;

4.None

129.Which of the following is not the required condition for binary search algorithm?

1.The list must be sorted

2.There should be the direct access to the middle element in any sublist

3.There must be mechanism to delete and/or insert elements in list

4.There are no constraints

130.Which of the following is not the type of queue?

1.Ordinary queue

2.Single ended queue

3.Circular queue

4.Priority queue

131.Which of the following is not true about QuickSort?

1.in-place algorithm

2.pivot position can be changed

3.adaptive sorting algorithm

4.can be implemented as a stable sort

132.Which of the following is the preferred way to recover a database after a transaction in progress
terminates abnormally?
1.Rollback

2.Rollforward

3.Switch to duplicate database

4.Reprocess transactions

133.Which of the following is TRUE ?

1.Overlays are used to increase the size of physical memory

2.Overlays are used to increase the logical address space

3.When overlays are used, the size of a process is not limited to the size of the physical memory

4.Overlays are used whenever the physical address space is smaller than the logical address space

134.Which of the following is true about linked list implementation of queue?

1.In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation,
nodes must be removed from end.

2.In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be
removed from the beginning.

3.Both of the above

4.None of the above

135.Which of the following is true about linked list implementation of stack?

1.In push operation, if new nodes are inserted at the beginning of linked list, then in pop operation,
nodes must be removed from end.

2.In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be
removed from the beginning.

3.None of the above

4.Both 1 and 2

136.Which of the following is true about linked list implementation of stack?

1.we do not perform push operation if compiler fails to create a new node.

2.In push operation, if new nodes are inserted at the end, then in pop operation, nodes must be
removed from the beginning.

3.None of the above

4.Both 1 and 2

137.Which of the following is two way list?

1.grounded header list

2.circular header list

3.linked list with header and trailer nodes

4.none of above

138.Which of the following is two way lists?

1.Grounded header list

2.Circular header list

3.Linked list with header and trailer nodes

4.List traversed in two directions

139.Which of the following is used to terminate the function declaration?

1.:

2.)

3.;

4.None

140.Which of the following is/are false

1.Inheritance is deriving new class from existing class

2.In an inheritance, all data and function members of base class are derived by derived class

3.We can specify which data and function members of base class will be inherited by derived class

4.We can add new functions to derived class without recompiling the base class

141.Which of the following levels of abstraction involves in viewing the data

1.External level

2.Conceptual level

3.Internal level

4.Logical level

142.Which of the following logical operations is represented by the + sign in Boolean algebra?

1.inversion

2.AND

3.OR

4.NOT
143.Which of the following operations is performed more efficiently by doubly linked list than by
singly linked list?

1.Deleting a node whose location in given

2.Searching of an unsorted list for a given item

3.Inverting a node after the node with given location

4.Traversing a list to process each node

144.Which of the following operator can be overloaded through friend function?

1.->

2.=

3.()

4.*

145.Which of the following operator functions cannot be global, i.e., must be a member function.

1.new

2.delete

3.Converstion Operator

4.None

146.Which of the following operator takes only integer operands?

1.+

2.*

3./

4.%

147.Which of the following operators should be preferred to overload as a global function rather than
a member method?

1.Postfix ++

2.Comparison Operator

3.Insertion Operator <<

4.Prefix++

148.Which of the following overloaded functions are NOT allowed in C++?

1) Function declarations that differ only in the return type

int fun(int x, int y);

 void fun(int x, int y);

2) Functions that differ only by static keyword in return type

int fun(int x, int y);
static int fun(int x, int y);

3)Parameter declarations that differ only in a pointer * versus an array []

int fun(int *ptr, int n);

int fun(int ptr[], int n);

4) Two parameter declarations that differ only in their default arguments

int fun( int x, int y);

int fun( int x, int y = 10);

1.All of the above

2.All except 2

3.All except 1

4.All except 2 and 4

149.Which of the following refers to the associative memory?

1.the address of the data is generated by the CPU

2.the address of the data is supplied by the users

3.there is no need for an address i.e. the data is used as an address

4.the data are accessed sequentially

150.Which of the following relationships represents the dual of the Boolean property: x + x'y = x + y
Choose the best.

1.x'(x + y') = x'y'

2.x(x' + y) = xy

3.x(1 + x') + y = xy

4.x'(xy') = x'y'

151.Which of the following represents number of output lines for decoder with 4 input lines?

1.15

2.16

3.17

4.18

152.Which of the following return-type cannot be used for a function in C?

1.char *

2.struct

3.void

4.None

153.Which of the following schema is present at highest level ?

1.Physical Schema

2.Sub-Schema

3.None of these

4.Logical Schema

154.Which of the following searching techniques do not require the data to be in sorted form

1.Binary Search

2.Interpolation Search

3.Linear Search

4.Exhaustive Search

155.WHICH OF THE FOLLOWING STATEMENT IS CORRECT?

1.CONSTRUCTOR HAS THE SAME NAME AS THAT OF THE CLASS.

2.DESTRUCTOR HAS THE SAME NAME AS THAT OF THE CLASS WITH A TILDE SYMBOL AT THE
BEGINNING.

3.BOTH A AND B.

4.DESTRUCTOR HAS THE SAME NAME AS THE FIRST MEMBER FUNCTION OF THE CLASS.

156.Which of the following statement is false?

1.Arrays are dense lists and static data structure

2.data elements in linked list need not be stored in adjacent space in memory

3.pointers store the next data element of a list

4.linked lists are collection of the nodes that contain information part and next pointer

157.Which of the following statement is false?

1.stack can be implemented in either static allocation and dynamic allocation

2.stack can be implemented in either static allocation and nor dynamic allocation

3.stack can be implemented only in static allocation and not in dynamic allocation
4.stack can be implemented in dynamic allocation

158.Which of the following statements about linked list data structure is/are TRUE?

1.Addition and deletion of an item to/ from the linked list require modification of the existing
pointers

2.The linked list pointers do not provide an efficient way to search an item in the linked list

3.Linked list pointers always maintain the list in ascending order

4.The linked list data structure provides an efficient way to find kth element in the list

159.Which of the following statements about queues is incorrect?

1.Queues are first-in, first-out (FIFO) data structures

2.Queues can be implemented using arrays

3.Queues can be implemented using linked lists

4.New nodes can only be added at the front of the queue

160.WHICH OF THE FOLLOWING STATEMENTS ARE NOT TRUE ABOUT DESTRUCTOR?

1. IT IS INVOKED WHEN OBJECT GOES OUT OF THE SCOPE

2. LIKE CONSTRUCTOR, IT CAN ALSO HAVE PARAMETERS

3. IT CAN BE VIRTUAL

4. IT CAN BE DECLARED IN PRIVATE SECTION

5. IT BEARS SAME NAME AS THAT OF THE CLASS AND PRECEDES LAMBDA SIGN.

1.Only 2, 3, 5

2.Only 2, 3, 4

3.Only 2, 4, 5

4.Only 3,4,5

161.Which of the following statements are true?

1.Database must contain two or more tables

2.Database must contain two data tables

3.Database must contain at least one data table

4.Database must contain one data table

162.Which one is a TRUE statement?

1.With finger degree granularity of locking a high degree of concurrency is possible

2.Locking prevents non-serializable schedule

3.Locking cannot take place at level

4.An exclusive lock on data item X is granted even if a shared lock is already held on X

163.Which one is an alternative of log based recovery?

1.Disk recovery

2.Dish shadowing

3.Shadow paging

4.Crash recovery

164.Which one of the following is an application of Queue Data Structure?

1.When a resource is shared among multiple consumers.

2.When data is transferred asynchronously (data not necessarily received at same rate as sent)
between two processes

3.Load Balancing

4.All of the above

165.Which one of the following is an application of Stack data structure?

1.Managing function calls

2.Arithmetic expression evaluation

3.The stock span problem

4.All of the above

166.Which one of the following is an application of Stack Data Structure?

1.PUSH

2.POP

3.Recursion

4.Array

167.Which one of the following is the address generated by CPU?

1.physical address

2.absolute address

3.logical address
4.none of the mentioned

168.Which properly declares a variable of struct foo?

1.struct foo

2.int foo

3.foo var

4.foo

169.Which SQL statement is used to insert new data in a database?

1.Add new

2.Insert new

3.Add record

4.Insert into

170.Which statement is true:

1.All canonical form are standard form

2.All standard form are canonical forms

3.Standard form must consists of minterms

4.Canonical form can consist of a term with a literal missing

171.Which symbol is used to create multiple inheritance?

1.Dot

2.Comma

3.Dollar

4.None

172.Which-one ofthe following statements about normal forms is FALSE?

While overloading binary operators using member function, it requires ___ argument/s.

1.Zero

2.One

3.Two

4.Three

173.Who is responsible for keeping database in consistent state despite system failure?

1.End User
2.Content Developer

3.Transaction Manager

4.Storage Manager

174.Why can a CMOS IC be used as both a multiplexer and a demultiplexer?

1.It cannot be used as both.

2.CMOS uses bidirectional switches

3.CMOS uses unidirectional Switch

4.CMOS is used for different purpose.

175.Why is a demultiplexer called a data distributor?

1.The input will be distributed to one of the outputs.

2.One of the inputs will be selected for the output.

3.The output will be distributed to one of the inputs.

4.Demultiplexer

176.Why is the Gray code more practical to use when coding the position of a rotating shaft?

1.All digits change between counts

2.Two digits change between counts

3.Only one digit changes between counts

4.None of the Mentioned

177.Why would you want to use inline functions?

1.To decrease the size of the resulting program

2.To increase the speed of the resulting program

3.To simplify the source code file

4.To remove unnecessary functions

178.With regard to a D latch, ________.

1. the Q output follows the D input when EN is LOW

2.the Q output is opposite the D input when EN is LOW

3.the Q output follows the D input when EN is HIGH

4.the Q output is HIGH regardless of EN's input state

179.without the carry bit if add the numbers 1 and 1 what will be the output?

1.1

2.0

3.error

4.none of the above

180.Working set model for page replacement is based on the assumption of

1.modularity

2.locality

3.globalization

4.random access

181.Write the output of the following #include <iostream.h>int main(){ const int x; x = 10;
printf("%d", x); return 0;}

1.0

2.10

3.Compile time Error

4.Runtime Error

182.Write the output of the following program.

class Test
{
int x;
};
int main()
{
Test t;
cout << t.x;
return 0;
}

1.0

2.some garbage value

3.compile time error

4.1

183.Write the output of the following

#include <iostream>
using namespace std;
class B;
class A {
int a;
public:
A():a(0) { }
void show(A& x, B& y);
};

class B {
private:
int b;
public:
B():b(0) { }
friend void A::show(A& x, B& y);
};

void A::show(A& x, B& y) {

x.a = 10;
cout << "A::a=" << x.a << " B::b=" << y.b;
}

int main() {
A a;
B b;
a.show(a,b);
return 0;
}

1.Compiler Error

2.A::a=10 B::b=0

3.A::a=0 B::b=0

4.None

184.X+0=0+X =X is an example of

1.commutative property

2.inverse property

3.associative property

4.Identity element

185.…………defines the structure of a relation which consists of a fixed set of attribute-domain pairs.

1.Instance

2.Schema

3.Program

4.Super Key