1

1.
Stack
2.
String
A ........................ does not keep track of address of every
element in the list. 3.
Linear Array
4.
Queue

1.
AVL tree
2.Red Black tree
3.
A binary search tree whose left subtree and right subtree differ
B trees
in hight by at most 1 unit is called ……
4.
Spanning trees

1.
Static
2.
Array of
A linked-list is a ________ structure
3.
Dynamic
4.
Fixed

1.
It contains the real data
2.
It assumes all other factors
to be dynamic
Aposterior analysis are more accurate than apriori analysis
because − 3.
It assumes all other factors
to be constant
4.
It is a result of reverse-
engineering

1.
For relatively permanent
collections of data.
2.
Arrays are best data structures ............ For the size of the
structure and the data in
the structure are constantly
changing
 2
3.
For both of above situation
4.
For none of the above

1.
Merge Sort
2.
If the array is already sorted, which of these algorithms will exhibit Insertion Sort
the best performance 3.
Quick Sort
4.
Heap Sort

1.
Push and Pop
2.
Inserting an item into the stack when stack is not full is called Pop and Push
…………. Operation and deletion of item form the stack, 3.
when stack is not empty is called ………..operation. Insert and Delete
4.
Delete and Insert

1.
0
2.
n
Minimum number of spanning tree in a connected graph is
3.
2n
4.
1

1.
Insertion Sort
2.
Quick Sort
Shell sort uses
3.
Merge Sort
4.
Selection Sort

1.Data Structure
The logical or mathematical model of a particular organization
of data is called a ......... 2.Data Configuration
 3
3.Data arrangement

4.Data formation

1.
O(|V|2)

2.
What will be the running-time of Dijkstra's single source O (|V| log |V|)
shortest path algorithm, if the graph G(V,E) is stored in form
of adjacency list and binary heap is used − 3.
Ο(|E|+|V| log |V|)

4.
None of these

1.
Before deletion
2.
After Deletion
3.
When does top value of the stack changes? While checking for
underflow
4.
At the time of deletion

1.

Abstract level

2.

Application level
Which if the following is/are the levels of implementation of
data structure 3.

Implementation level

4.

All of the above

1.
Data
2.
Operations
Which of the following is not the part of ADT description? 3.
Both A and B
4.
None of A and B

Which of the following is true about the characteristics of 1.

abstract data types? A is true, B is true
A. It exports a set of operations
 4
B. It exports a type. 2.
A is true and B is false
3.
A is false and B is true
4.
A is false and B is false

1.
Tower of Hanoi

2.
Fibonacci Series
Which of the following algorithm cannot be desiged without
recursion − 3.
Tree Traversal

4.
Polynomial Evaluation

1.
Tree
2.
Heap
Which of the following has search effeciency of Ο(1) − 3.
Hash Table
4.
Linked List

1.
Stack
2.
Queue
………… is very useful in situation when data have to stored 3.
and then retrieved in reverse order. Single Linked List
4.
Doubly Linked List

1.
Operations
2.
…………… is not the component of data structure. Storage Structures
3.
Algorithms
4.None of the above

1.
Stack
2.
Queue
……………. Is a pile in which items are added at one end and 3.
removed from the other. Single Linked List
4.
Double Linked List
 5
1.
Abstract level
2.
……………….. level is where the model becomes compatible Application Level
executable code 3.
Implementation Level
4.
Interprating Level

1.
unsorted list
2.
reverse of input
In order traversal of binary search tree will produce − 3.
sorted list
4.
none of the above

1.
Queue
2.
What data structure can be used to check if a syntax has Stack
balanced paranthesis ? 3.
Tree
4.
List

1.
Linear arrays
2.
Linked Lists
Which of the following data structures are indexed structures? 3.
Graphs
4.
Trees

1.
Mapping
2.
A graphical display of the fundamental products in a truth- Graphing
table is known as 3.
T-Map
4.
K-Map

1.
Zero
2.
The minimum number of NAND gates required to implement 1
the Boolean function. A + AB' + AB'C is equal to 3.
4
4.
7
 6
1.
1⊕0=1
2.
1⊕1⊕1=1
Which of the following logic expression is incorrect?
3.
1⊕1=0
4.
1 ⊕ 1 ⊕ 0 =1

1.
3
2.
How many illegitimate states has synchronous mod-6 counter 2
? 3.
1
4.
6

1.
3
2.
5
To build a mod-19 counter the number of flip-flops required is 3.
7
4.
9

1.
frequency counters
2.
multiplexed displays
Mod-6 and mod-12 counters are most commonly used in 3.
digital clocks
4.
power consumption meters

1.
-10111

2.
-10011
X=1010100 and Y=1000011 using 1's complement Y-X is
3.
-10001

4.
-11001

1.
A ________ in a table represents a relationship among a set of Column
values.

2.
 7
Key

3.
Row

4.
Entry

1.
Different

2.
A domain is atomic if elements of the domain are considered Indivisbile
to be ____________ units.
3.
Constant

4.
Divisible

1.
Schema
2.
Database _______,which is a snapshot of the data in the Domain
database at a given instant in time 3.
Instance
4.
Relation

1.
Instance
2.
Database __________ , which is the logical design of the Schema
database 3.
Relation
4.
Domain

1.
Domain

For each attribute of a relation, there is a set of permitted 2.

Relation
values, called the ________ of that attribute.
3.
Set

4.
Schema

1.
The term _______ is used to refer to a row. Attribute

2.
 8
Tuple

3.
Field

4.
Instance

1.
Any

2.
The tuples of the relations can be of ________ order. Same

3.
Sorted

4.
Constant

1.
Tables

2.
A relational database consists of a collection of Fields

3.
Records

4.
Keys

1.
Rows

A _____ is a property of the entire relation, rather than of the 2.

Key
individual tuples in which each tuple is unique.
3.
Attribute

4.
Fields

1.
Referential
A _________ integrity constraint requires that the values
appearing in specified attributes of any tuple in the referencing 2.
Referencing
relation also appear in specified attributes of at least one tuple
in the referenced relation. 3.
Specific

4.
 9
Primary

1.
Candidate

2.
Primary
A attribute in a relation is a foreign key if the _______ key
from one relation is used as an attribute in that relation . 3.
Super

4.
Sub

1.
Be in Second Normal Form
(2NF)

A table on the many side of a one to many or many to many 2.

Be in Third Normal Form
relationship must: (3NF)

3.
Have a single attribute key

4.
Have a composite key

1.
NAME

Consider attributes ID , CITY and NAME . Which one of this 2.

ID
can be considered as a super key ?
3.
CITY

4.
none of the above

1.
Key

Functional Dependencies are the types of constraints that are 2.

Key revisited
based on______
3.
Superset key

4.
None of these
 10
1.
Descriptive

In a relation between the entities the type and condition of the 2.

Derived
relation should be specified . That is called as______attribute
3.
Recursive

4.
Relative

1.
NA

Not applicable condition can be represented in relation entry 2.

0
as
3.
NULL

4.
Blank Space

1.
Eliminate all hidden
dependencies

2.
Eliminate the possibility of a
Tables in second normal form (2NF): insertion anomalies

3.
Have a composite key

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

1.
Referential relation

The ______ is the one in which the primary key of one relation 2.
Referencing relation
is used as a normal attribute in another relation .
3.
Referenced relation

4.
Referred relation
 11
1.
Single valued

The attribute AGE is calculated from DATE_OF_BIRTH . 2.

Multi valued
The attribute AGE is _________________
3.
stored

4.
Derived

1.
Simple attribute

The attribute name could be structured as a attribute consisting 2.

of first name, middle initial, and last name . This type of Composite attribute
attribute is called _______________
3.
Multivalued attribute

4.
Derived attribute

1.
Entity

The descriptive property possessed by each entity set is 2.

Attribute
_________ .
3.
Relation

4.
Model

1.
Participation

2.
The function that an entity plays in a relationship is called that Position
entity’s _____________.
3.
Role

4.
Instance

The relation with the attribute which is the primary key is 1.

referenced in another relation. The relation which has the Referential relation
attribute as primary key is called 2.
Referencing relation
 12
3.
Referenced relation

4.
Referred relation

1.
1NF

2.
2NF
Which forms simplifies and ensures that there is minimal data
aggregates and repetitive groups: 3.
3NF

4.
4NF

1.
Register_number

2.
Which of the following is a single valued attribute Address

3.
SUBJECT_TAKEN

4.
Reference

1.
Entity set

An ________ is a set of entities of the same type that share the 2.

Attribute set
same properties, or attributes .
3.
Relation set

4.
Entity model

1.
Object of relation

2.
Present working model
Entity is a ___________________
3.
Thing in real world

4.
Model of relation
 13
1.
Functional dependency

Which is a bottom-up approach to database design that design 2.

Database modeling
by examining the relationship between attributes:
3.
Normalization

4.
Decomposition

1.
Phone_number

2.
Which of the following can be a multivalued attribute ? Register Number

3.
Date_of_birth

4.
All of the mentioned

1.
Candidate key

Which one of the following is a set of one or more attributes 2.

Sub key
taken collectively to uniquely identify a record?
3.
Super key

4.
Foreign key

1.
Record

2.
The term attribute refers to a ___________ of a table. Column

3.
Tuple

4.
Key

Empdt1(empcode, name, street, city, state,pincode). 1.

For any pincode, there is only one city and state. Also, for 1 NF only
given street, city and state, there is just one pincode. In
normalization terms, empdt1 is a relation in
2.
 14
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

1.
First

In the __________ normal form, a composite attribute is 2.

Second
converted to individual attributes.
3.
Third

4.
Fourth

1.
No proper subset is a super
key

2.
The subset of super key is a candidate key under what All subsets are super keys
condition ?
3.
Subset is a super key

4.
Each subset is a super key

1.
sophisticated
2.
naïve
_____ users work on canned transactions 3.
DBA
4.
casual

1.

Conservative 2PL

_______________________ is the deadlock free lock

2.
Basic 2PL
3.
Rigorous 2PL
4.
Strict 2PL
 15
1.
conceptual
2.
____________is the first schema to be designed when you are relational
developing a DBMS 3.
physical
4.
hierarchical

1.
UML
Which of this is not a implementation data model 2.
Relational
3.
Hierarchical
4.
network

1.
data model
DBMS cannot be classified on 2.
Number of sites
3.
Number of users
4.
Concurrency level

1.
The ______________ checks the query syntax to determine Scanner
whether it is formulated according to the syntax rules of the
2.
query language.
Parser
3.
Validation
4.
query tree

1.
Wait-die

. When transaction Ti requests a data item currently held by Tj

, Ti is allowed to wait only if it has a timestamp larger than 2.
Wait-wound
that of Tj (that is, Ti is younger than Tj ). Otherwise, Tj is
rolled back (Tj is wounded by Ti ). This is 3.
Wound-wait

4.
Wait

__________ rollback requires the system to maintain 1.

Total
additional information about the state of all the running
transactions. 2.
 16
Partial

3.
Time

4.
Commit

1.
Cycle

2.
A deadlock exists in the system if and only if the wait-for Direction
graph contains a ___________.
3.
Bi-direction

4.
Rotation

1.
Database-level lock

A lock that allows concurrent transactions to access different 2.

Table-level lock
rows of the same table is known as a
3.
Page-level lock

4.
Row-level lock

1.
Parent-Child relation ship
between the tables that
connect them

2.
A primary key is combined with a foreign key creates Many to many relationship
between the tables that
connect them

3.
Network model between the
tables that connect them

4.
None of the mentioned

A system is in a ______ state if there exists a set of

transactions such that every transaction in the set is waiting for 1.
Idle
another transaction in the set.
2.
 17
Waiting

3.
Deadlock

4.
Ready

1.
Schema

2.
A window into a portion of a database is View

3.
Query

4.
Data dictionary

1.
Scheduler

All lock information is managed by a ____, which is 2.

responsible for assigning and policing the locks used by the DBMS
transactions.
3.
Lock manager

4.
Locking agent

1.
Strong entity set

2.
An entity set that does not have sufficient attributes to form a Variant set
primary key is termed a __________ .
3.
Weak entity set

4.
Variable set

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

3.
 18
Many to many

4.
Many to one

1.
Identifying set

2.
Owner set
For a weak entity set to be meaningful, it must be associated
with another entity set, called the 3.
Neighbour set

4.
Strong entity set

1.
An attribute of an entity can
have more than one value

2.
An attribute of an entity can
be composite
Given the basic ER and relational models, which of the
following is INCORRECT? 3.
In a row of a relational table,
an attribute can have more
than one value

4.
In a row of a relational table,
an attribute can have exactly
one value or a NULL value

1.
Explicit lock in exclusive
mode

2.
If transaction Ti gets an explicit lock on the file Fc in Implicit lock in shared mode
exclusive mode, then it has an __________ on all the records
belonging to that file. 3.
Explicit lock in shared mode.

4.
Implicit lock in exclusive
mode

If you were collecting and storing information about your 1.

music collection, an album would be considered a(n) _____. Relation

2.
 19
Entity

3.
Instance

4.
Attribute

1.
Primary key

2.
Secondary Key
Key to represent relationship between tables is called
3.
Foreign Key

4.
None of the mentioned

1.
Read-only graph

2.
Wait graph
The deadlock in a set of transaction can be determined by
3.
Wait-for graph

4.
All of the mentioned

1.
Commit

The deadlock state can be changed back to stable state by 2.

Rollback
using _____________ statement.
3.
Savepoint

4.
Deadlock

1.
Double diamonds

2.
The entity relationship set is represented in E-R diagram as
Undivided rectangles

3.
Dashed lines
 20
4.
Diamond

1.
Entity set

2.
Relationship set
The Rectangles divided into two parts represents
3.
Attributes of a relationship
set

4.
Primary key

1.
Lock timeout

2.
The situation where the lock waits only for a specified amount Wait-wound
of time for another lock to be released is
3.
Timeout

4.
Wait

1.
Diamond , diamond

2.
We indicate roles in E-R diagrams by labeling the lines that Rectangle, diamond
connect ___________ to __________.
3.
Rectangle, rectangle

4.
Diamond, rectangle

1.
Underline

2.
Double line
Weak entity set is represented as
3.
Double diamond

4.
Double rectangle

What are the ways of dealing with deadlock ? 1.

 21
Deadlock prevention

2.
Deadlock recovery

3.
Deadlock detection

4.
All of the mentioned

1.
Unary

2.
What is a relationship called when it is maintained between Binary
two entities? 3.
Ternary

4.
Quaternary

1.
Relation

What term is used to refer to a specific record in your music 2.

database; for instance; information stored about a specific Instance
album?
3.
Table

4.
Column

1.
Wait-die
When transaction Ti requests a data item currently held by Tj ,
Ti is allowed to wait only if it has a timestamp smaller than 2.
that of Tj (that is, Ti is older than Tj ). Otherwise, Ti is rolled Wait-wound
back (dies). This is
3.
Wound-wait
4.
wait

1.
Which of the following are introduced to reduce the overheads Checkpoints
caused by the log-based recovery?
2.
Indices
 22
3.
Deadlocks

4.
Locks

1.
Minimum cardinality

2.
Which of the following indicates the maximum number of Maximum cardinality
entities that can be involved in a relationship?
3.
ERD

4.
Greater Entity Count

1.
Record controller

2.
Which of the following is a procedure for acquiring the Exclusive lock
necessary locks for a transaction where all necessary locks are
acquired before any are released?
3.
Authorization rule

4.
Two phase lock

1.
Two-phase locking protocol

2.
Which of the following protocols ensures conflict Time-stamp ordering
serializability and safety from deadlocks? protocol

3.
Graph based protocol

4.
Node based protocol

1.
Concurrency

Which refers to a property of computer to run several

operation simultaneously and possible as computers await 2.
response of each other Deadlock

3.
Backup
 23
4.
Recovery

1.
Entity-relationship diagram

2.
Entity diagram
Which of the following gives a logical structure of the
database graphically ? 3.
Database diagram

4.
Architectural representation

1.
Dead code

Which of the following is the block that is not permitted to be 2.

Read only
written back to the disk?
3.
Pinned

4.
Zapped

1.
Serializability

_______ means that data used during the execution of a 2.

transaction cannot be used by a second transaction until the Atomicity
first one is completed.
3.
Isolation

4.
Time stamping

1.
Checkpoint facility

DBMS periodically suspends all processing and synchronizes 2.

Backup facility
its files and journals through the use of
3.
Recovery manager

4.
Database change log

Each modification done in database transaction are first 1.Harddrive

recorded into the
 24

2.Log

3.Disk

4.Datamart

1.
Flashback

If an transaction is performed in a database and committed, the 2.

Rollback
changes are taken to the previous state of transaction by
3.
Redo

4.
Cannot be done

1.
Consistent state

2.
If the state of the database no longer reflects a real state of the Parallel state
world that the database is supposed to capture, then such a
state is called 3.
Atomic state

4.
Inconsistent state

1.
Batch. Exe

The name of the transaction file shall be provided by the 2.

operator and the file that contains the edited transactions ready Trans. Exe
for execution shall be called
3.
Opt. Exe

4.
Edit.Exe

Questions Choices

When the transaction finishes the final statement the 1.

Active state
transaction enters into
2.
 25
Committed state

3.
Partially committed state

4.
Abort state

1.
Transaction

Which of the following is an atomic sequence of database 2.

Concurrency
actions?
3.
Relations

4.
Reliability

1.
Active

2.
Terminated
Which of the following is not a state in transaction ?
3.
Aborted

4.
Partially committed

1.
Aborted

2.
Terminated
A transaction may not always complete its execution
successfully. Such a transaction is termed 3.
Closed
4.

All of the mentioned

1.
Triggers
In order to maintain transactional integrity and database
2.
consistency, what technology does a DBMS deploy?
Pointers

3.
Locks
4.
Cursors
 26
4.
Cursors

1.
Entity

Let us consider phone_number ,which can take single or 2.

several values . Treating phone_numberas an _________ Attribute
permits instructors to have several phone numbers (including
zero) associated with them. 3.
Relation

4.
Value

1.
Dashed line

2.
The total participation by entities is represented in E-R Double line
diagram as
3.
Double rectangle

4.
Circle

1.
93%
2.
If memory access takes 20 ns with cache and 110 ns without it, 90%
then the ratio (cache uses a 10 ns memory) is _____. 3.
88%
4.
83%

1.
LDA
2.
In a memory-mapped I/O system, which of the following will IN
not be there? 3.
OUT
4.
ADD

1.
Suppose that a bus has 16 data lines and requires 4 cycles of 1 Megabyte/sec
250 nsecs each to transfer data. The bandwidth of this bus 2.
2 Megabyte/sec
would be 2 Megabytes/sec. If the cycle time of the bus was 3.
reduced to 125 nsecs and the number of cycles required for 3 Megabyte/sec
transfer stayed the same what would the bandwidth of the bus? 4.
4 Megabyte/sec
 27
1.
Latency time
2.
Access time
The average time required to reach a storage location in 3.
memory and obtain its contents is called_____. Turnaround time
4.
Response time.

1.
Register
2.
Encoder
The circuit used to store one bit of data is known as_______. 3.
Decoder
4.
Flipflop

1.
Accumulator

2.Instruction Register
The load instruction is mostly used to designate a transfer from
memory to a processor register known as____ 3. Program counter

4.Memory address Register

1.
(812)10
2.
The multiplicand register & multiplier register of a hardware (-812)10
circuit implementing booth's algorithm have (11101) & 3.
(1100). The result shall be ______. (-12)10
4.
(12)10

1.

Word-time
The time interval between adjacent bits is called the_____.

2.
Bit-time
3.
Turn around time

4.
Slice time

1.
(2FAOC)16 is equivalent to _____. (195 084)10
2.
 28
(001011111010 0000
1100)2
3.
(011011011011 0000
1100)2
4.
None of these

1.
Address Register
2.
_________ register keeps track of the instructions stored in Data Register
program stored in memory. 3.
Program counter
4.
Accumulator

1.
Instruction code

2.
A group of bits that tell the computer to perform a specific Micro-operation
operation is known as____.

3.

Accumulator

4.
Register

1.
3k registers
2.
2k registers
A k-bit field can specify any one of_____. 3.
k2 registers
4.
k3 registers

1.
Locality of data
2.
Locality of memory
Cache memory works on the principle of_____. 3.
Locality of reference
4.
Locality of reference and
memory

Computers use addressing mode techniques for

1.
____________.
 29
giving programming
versatility to the user by
providing facilities as
pointers to memory counters
for loop control
2.
to reduce no. of bits in the
field of instruction
3.
specifying rules for
modifying or interpreting
address field of the
instruction
4.
All the above

1.
only if an interrupt service
routine is being executed
2.
only if a bit in the interrupt
In a microprocessor system, the RST instruction will cause an
mask is made 0
interrupt 3.
only if interrupts have been
enabled by an EI instruction
4.
None of these

1.
the branch address is
assigned to a fixed location
in memory.
2.
the interrupting source
supplies the branch
In a vectored interrupt. information to the processor
through an interrupt vector.
3.
the branch address is
obtained from a register in
the processor
4.
None of the above

1.
AB*CD*+
2.
A*BCD*+
In Reverse Polish notation, expression A*B+C*D is written as 3.
AB*C*D+
4.
AB*+CD*

Memory unit accessed by content is called______. 1.

 30
Read only memory
2.

Programmable Memory

3.
Virtual Memory
4.

Associative Memory

1.
8080
2.
Microprocessor 8085 is the enhanced version of ......... with 8088
essentially the same construction set 3.
8800
4.
6800

1.
Multiple instruction multiple
data
2.
Multiple instruction memory
data
MIMD stands for _____. 3.
Memory instruction multiple
data
4.
Multiple information
memory data

1.
n^2
2.
n bits in operation code imply that there are ___________ 2n
possible distinct 3.
2^n
4.
n2

1.
1
2.
Number of machine cycles required for RET instruction in 2
8085 microprocessor is 3.
3
4.
4

1.
PSW is saved in stack when there is a _____. interrupt recognized
2.
 31
execution of RST instruction
3.
Execution of CALL
instruction
4.
All of these

1.
Absolute
2.
The addressing mode used in an instruction of the form ADD Indirect
X Y, is _____. 3.
indexed
4.
base addressed

1.
the time takes for the platter
to make a full rotation
2.
the time it takes for the read-
write head to move into
The amount of time required to read a block of data from a position over the
disk into memory is composed of seek time, rotational appropriate track
latency, and transfer time. Rotational latency refers to ______.
3.
the time it takes for the
platter to rotate the correct
sector under the head
4.
none of the above

1.
seek time
2.
The average time required to reach a storage location in turn around time
memory and obtain its contents is called the _____. 3.
access time
4.
transfer time

1.
Encoder
2.
Decoder
The circuit converting binary data in to decimal is_____. 3.
Muitiplexer
4.
Code converter

1.
lower the HOLD input
To put the microprocessor in the wait state 2.
lower the READY input
 32
3.
raise the HOLD input
4.
None of these

1.
Two passes.
2.
Translation from symbolic program into Binary is done Three passes.
in_____. 3.
Four passes.
4.
Five passes

1.
SISD
2.
SIMD
Von Neumann architecture is ______. 3.
MISD
4.
MIMD

1.
too slow
2.
What characteristic of RAM memory makes it not suitable for unreliable
permanent storage? 3.
it is volatile
4.
too bulky

1.
Decimal Number system
2.
Excess 3-code
Which of the following is not a weighted code? 3.
Binary number System
4.
None of these

1.
one input is high
2.
A three input NOR gate gives logic high output only one input is low
when_____. 3.
two input are low
4.
all input are low

1.
An instruction used to set the carry flag in a computer can be Data transfer
classified as 2.
Program Control
 33
3.
Logical
4.
Arithmetic

1.
uses alphabetic codes in
place of binary numbers
used in machine language
2.
is the easiest language to
Assembly language ________. write programs
3.
need not be translated into
machine language
4.
None of these

Which two are valid constructors for Thread? 1.

1 and 3
1. Thread(Runnable r, String name) 2.
2 and 4
2. Thread() 3.
3. Thread(int priority) 1 and 2
4. Thread(Runnable r, ThreadGroup g) 4.
5. Thread(Runnable r, int priority) 2 and 5

1.
Method Invocating
class can have many methods with the same name as long as 2.
Method Overloading
the number of parameters or type of parameters is different. 3.
This OOP concept is known as Method Overriding
4.
Method Labeling

1.object

Which of the following is considered as a blue print that 2.class

defines the variables and methods common to all of its objects
of a specific kind? 3.method

4.data type

What will be printed as the output of the following program? 1.

public class testincr I=0
{ 2.
I=1
public static void main(String args[]) 3.
{ I=2
int i = 0; 4.
i = i++ + i; I=3
 34
System.out.println("I = " +i);
}
}

1.
class output
2.
character output
cout stands for 3.
common output
4.
call output

1.
n+m
R has n tuples and S has m tuples, then the Cartesian product 2.
of R and S will produce ___________ tuples. n*m
3.
n/m
4.
n-m

1.
Run time
2.
Compile time
Inline functions are invoked at the time of 3.
Depends on how it is
invoked
4.
Both b and c above

1.
SR Latch
2.
adder
Mater slave flipflop can be constructed with 3.
JK flipflop
4.
multiplier

1.
standard sum
2.
Minterms are also called standard product
3.
standard division
4.
 35
standard subtraction

1.
Decimal variables
2.
Hexadecimal variables
Voltage operated circuits represent 3.
Binary variables
4.
Octa variables

1.
An empty memory space is
returned so that the
developers can utilize it.
2.
What is the meaning of the return data type void? void returns no data type.
3.
void is not supported in Java
4.
None of the above

1.
Memory address of allocated
memory.
2.
What is the stored in the object obj in following lines of code?
NULL
box obj; 3.
Any arbitrary pointer
4.
Garbage

What will be the output of the following program?

class B
{
static int count = 100; 1.100
public void increment()
{ 2.101
count++; }
public static void main(String []args) 3.3
{
B b1 = new B(); 4.error
b1.increment();
B b2 = new B();
System.out.println(b2.count); } }

What will be the Output? 1.

animal generic noise
2.
class Animal
animal bark
{ 3.
String name = "animal"; dog bark
String makeNoise() { return "generic noise"; } 4.
 36
} dog generic noise
class Dog extends Animal
{
String name = "dog";
String makeNoise() { return "bark"; }
}
public class Test
{
public static void main(String[] args)
{
Animal an = new Dog();
System.out.println(an.name+" "+an.makeNoise());
}
}

1.
Running state
2.
Waiting state
When a thread terminates its processing, into what state that 3.
thread enters? Beginning state
4.
Dead state

1.
set
2.
Which of these interface declares core method that all EventListner
collections will have? 3.
Comparator
4.
Collection

1.
Traceability
2.
" Is the requirement properly understood? ",relates to Comprehensibility.
_________ 3.
Adaptability
4.
Verifiability

1.
Comprehensibility
2.
"Can the requirement be changed without a large impact on Verifiability
other requirements?",is related to _______ 3.
Adaptability.
4.
Traceability
 37
1.
Traceability.
2.
"Is the origin of the requirement clearly stated?" relates to Verifiability
_________ 3.
Adaptability
4.
Comprehensibility

#include <iostream> 1.0

using namespace std;
int main () 2.1
{
cout << (3 > 4 && 3 > 1) << endl; 3.error
return 0;
} 4.10

1.
pass arguments and improve
data hiding
2.
pass arguments and add
features to existing classes
without rewriting them
3.
Inheritance is a way to make general classes into
more specific classes and
add features to existing
classes without rewriting
them
4.
improve data hiding and
encapsulation.

1.
making C++ operators work
with objects
2.
giving new meaning to
Operator overloading is existing C++ operators
3.
making new C++ operators
4.
both (a) and (b)

1.
Linked lists
2.
A data structure where elements can be added or removed at Stacks
either end but not in the middle 3.
Queues
4.
Deque
 38
1.
Interior Node
2.
In a extended-binary tree nodes with 2 children are called Domestic Node
........ 3.
Internal Node
4.
Inner Node

1.
Shortest remaining time first
scheduling may cause
starvation
2.
Starvation may be caused by
preemptive scheduling.
Which of the following statements are true? 3.
In terms of
response time robin round is
better than FCFS
4.
All of the above statements
are true

1.
Memory Address Register
2.
Instruction Register
-------------contains the 8-bit opcode currently being executed. 3.
Memory Buffer Register
4.
Program Pointer

1.
Bit
2.
Byte
A binary digit is called a 3.
Number
4.
Character

1.
Occurs when there is an
error in a specific page.
2.
Occurs when a program
accesses a page of main
A page fault memory.
3.
Occurs when a program
accesses a page not currently
in main memory.
4.
 39
Occurs when a program
accesses a page belonging to
another program.

1.
compaction
2.
smaller memory space
A solution to the problem of external fragmentation is : 3.
larger memory space
4.
None of these

1.
Indirect addressing
2.
A Stack-organised Computer uses instruction of Two-addressing
3.Zero addressing
4.
Index addressing

1.
Physical address
2.
Memory address
An address in main memory is called 3.
Logical address
4.
Word address

1.
DDA.
2.
An interface that provides I/O transfer of data directly to and Serial interface.
form the memory unit and peripheral is termed as 3.
BR.
4.
DMA.

1. uses alphabetic codes in

place of binary numbers
used in machine language

2. is the easiest language to

write programs
Assembly language
3. need not be translated into
machine language

4. is the easiest language

to solve problems

1.
BAT refers to… Boot Files
 40
2.
Batch Files
3.
Executable Files
4.
None

1.
100100 & 011011
2.
can be represented in a signed magnitude format and in a 1’s 100100 & 111011
complement format as ( 3.
011011 & 100100
4.
111011 & 100100

1.
relative address mode
Content of the program counter is added to the address part of 2.
implied mode.
the instruction in order to obtain the effective address is 3.
called. index addressing mode.
4.
register mode.

1.
11 bits
If the main memory is of 8K bytes and the cache memory is 2.
21 bits
of 2K words. It uses associative mapping. Then each word of 3.
cache memory shall be 16 bits
4.
20 bits

1.
immediate.
2.
If the value V(x) of the target operand is contained in the direct.
address field itself, the addressing mode is 3.
indirect.
4.
implied.

1.
the branch address is
assigned to a fixed location
in memory
2.
In a vectored interrupt the interrupting source
supplies the branch
information to the processor
through an interrupt
vector
3.
 41
the branch address is
obtained from a register in
the processor
4.

1.
random page is chosen
2.
In FIFO page replacement algorithm, when a page must be newest page is chosen
replaced: 3.
oldest page is chosen
4.
none of the mentioned

1.fragmentation

Memory management technique in which system stores and 2.paging

retrieves data from secondary storage for use in main memory
is called: 3.mapping

4.Starvation

1.
product requirement
2.
Requirements which are a consequence of organisational External requirement
policies and procedures are termed as_______ 3.
Process requiement
4.
Organisational requirements

1.
Static loading
Routine is not loaded until it is called. All routines are kept on 2.
Dynamic loading
disk in a relocatable load format. The main program is loaded 3.
into memory & is executed. This type of loading is called... ? Dynamic linking
4.
Overlays

1.
Binary bit
2.
Flag bit
Status bit is also called 3.
Signed bit
4.
Unsigned bit

1.
CPU
Swap space exists in: 2.
secondary memory
3.
 42
primary memory
4.
none of the mentioned

1.
stack pointer
2.
page table base register
The address of a page table in memory is pointed by: 3.
page register
4.
program counter

1.
executes first the job that
last entered the queue

2.
executes first the job that
first entered the queue
The FIFO algorithm
3.
execute first the job that has
been in the queue the
longest

4.
executes first the job with
the least processor needs

1.
on the property of locality of
reference
2.
on the heuristic 90-10 rule
The idea of cache memory is based 3.
on the fact that references
generally tend to cluster
4.
based on main memory
concept

1.
main memory
2.
The memory unit that communicates directly with the CPU is Secondary memory
called the 3.
shared memory
4.
auxiliary memory.

1.
The set of pages that a process is currently using is called as Program
2.
Page Group
 43
3.
Working Set
4.
Working Group

1.
SISD
2.
SIMD
Von Neumann architecture is 3.
MIMD
4.
MISD

1.
Address of the current
instruction
2.
Address of the next
What is the content of Stack Pointer (SP)? instruction
3.
Address of the top element
of the stack
4.
Size of the stack.

1.
Which of the following is not a property of transactions? Atomicity
2.
Concurrency
3.
Isolation
4.
Redundancy

1.
Cache memory
2.
Secondary memory
Which of the following is lowest in memory hierarchy? 3.
Registers
4.
RAM

1.
locality
2.
Working set model for page replacement is based on the random access
assumption of: 3.
globalization
4.
modularity

(1010.011)2 = 1.
 44
(10.365)10
2.
(10.375)10
3.
(11.365)10
4.
(11.375)10

1.
2C5B.F2
2.
2C6B.F2
(10110001101011.11110010)2 in hexadecimal is 3.
3D5B.F2
4.
3D6B.F2

1.
101101
2.
101011
(41)10 in binary is 3.
101001
4.
101101

1.
a'b'c'
2.
a'+b'+c'
(a+b+c)'= 3.
abc
4.
a+b+c

1.
complement
2.
dual complement
(x')' is 3.
duality
4.
reflection

1.
instruction fetch
2.
------------------Read the instruction from its memory location operand address calculation
into the processor 3.
operand fetch
4.
operand store
 45
1.
Memory Buffer Register
2.
-----------------contains the word to be stored in memory or just Memory Address Register
received from memory 3.
Instruction Register
4.
Program Counter

1.
10001001
2.
11110110
-9 with signed 2's complement representation is 3.
11110111
4.
11110011

1.
10001001
2.
11110110
-9 with signed magnitude representation is 3.
11110111
4.
11110011

1.
Kruskal's algorithm
2.
.................. is known as a greedy algorithm, because it chooses Prim's algorithm
at each step the cheapest edge to add to subgraph S. 3.
Dijkstra algorithm
4.
Bellman ford algorithm

1.
Kernel level thread
2.
User level thread
.….. is generic and that can run on any OS. 3.

Both (1) & (2)

4.
None of the above

1.
987802
2.
10's complement of 012398 is 987602
3.
987902
4.
 46
987502

1.
753300
2.
753311
10's complement of 246700 is 3.
753320
4.
754371

1.
4
2.
8
16x4 RAM indicates that memory location are 3.
12
4.
16

1.
2
2.
4
2 left shifts are referred to as multiplication with 3.
8
4.
16

1.
11100
2.
10100
2's complement of 1101100 is 3.
110100
4.
100100

1.
three values
2.
four values
2^3 would have 3.
six values
4.
eight values

1.
1 select line
2.
2x1 mux has 2 select lines
3.
3 select lines
4.
 47
4 select lines

1.
3 combinational inputs
2.
4 combinational inputs
3 bits full adder contains 3.
6 combinational inputs
4.
8 combinational inputs

1.
3 inputs
2.
4 inputs
3x8 decoder will have 3.
5 inputs
4.
6 inputs

1.
4bit binary
2.
3bit binary
4 bit gray code can be converted into 3.
2bit binary
4.
1bit binary

1.
1 bit
2.
2 bits
4bit parallel adder produces output of 3.
3 bits
4.
4 bits

1.
a to b
2.
a to f
7 segment generates output 3.
a to g
4.
a to z

1.
single inverter
2.
7404 is a decimal inverter
3.
hex inverter
4.
 48
binary inverter

1.
2 select lines
2.3 select lines
8 input mux will have 3.
4 select lines
4.
5 select lines

1.
0001 0011 0111 0101
2.
0111 0011 0111 0101
842 + 537 = 3.
0001 0111 0111 0101
4.
0001 0011 0111 0111

1.
1000_0111_0010_0011
2.
1000_0001_0010_0011
8723 in BCD 3.
1000_0101_0010_0011
4.
1000_0111_0110_0011

1.
1000
2.
1001
9 in binary code is represented by 3.
1010
4.
101

1.
987641
2.
987631
9's complement of 012395 is 3.
987621
4.
987601

1.
453299
2.
453399
9's complement of 546700 is 3.
543399
4.
543299
 49
1.
1
2.
-1
Value of first linked list index is: 3.
0
4.
2

1.
decreasing heap
2.
Low heap
A min-heap is also known as: 3.
descending heap
4.
Small heap

1.
Polynomial evaluation
2.
Postfix expression
One of the applications of a linked list: evaluation
3.
Prefix expression evaluation
4.
Distance evaluation

1.
ABFCDE
2.
The post order traversal of a binary tree is :DEBFCA, find out ADBFEC
the preorder traversal: 3.
ABDECF
4.
ABDCEF

1.
BUBBLE-SORT
2.
The post order traversal of a binary tree is :DEBFCA, find out INSERTION SORT
the preorder traversal: 3.
QUICK SORT
4.
SHELL SORT

The time complexity of the following algorithm is: 1.

sum(a,n) 3n+2
{ 2.
2n+3
s=0; 3.
for i= 1 to n n+1
{ 4.
s=s+a[i]; 2n+2
 50
}
return s;
}

1.Arrays are static data

structures

2.data elements in linked list

need not be stored in
adjacent space in memory
3.
Which of the following statements is false: pointer stores the next data
element of a list
4.
linked lists are collection of
nodes that contain
information part and
the next pointer

1.
balanced binary tree
2.
1. A ___________ tree is a tree where for each parent node, rooted complete binary tree
there is only one associated child node 3.
complete binary tree
4.
degenerate tree

1.
The left subtree of a node
contains only nodes with
keys less than the node's key
2.
The right subtree of a node
contains only nodes with
keys greater than the node's
key.
3.
1. Which of the following statements hold true for binary The right subtree of a node
trees? contains only nodes with
keys greater than the node's
key and the left subtree of a
node contains only nodes
with keys less than the
node's key
4.
Noth left and right subtree
nodes contains only nodes
with keys less than the
node's key

1. Which of the following ways is a in-order traversal? 1.

 51
1.
Root->left sub tree-> right
1. Which of the following ways is a in-order traversal? sub tree
2.
Root->right sub tree-> left
sub tree
3.
left sub tree-> Root->right
sub tree
4.
right sub tree-> Root->left
sub tree

1.
Root->right sub tree-> left
sub tree
2.
Root->left sub tree-> right
sub tree
1. Which of the following ways is a post-order traversal? 3.
right sub tree-> left sub
tree->Root
4.
left sub tree-> right sub
tree->root

1.
X+Y+Z
2.
1. Simplified form of the boolean expression (X + Y + XY)
XY + YZ
(X + Z) is 3.X + YZ
4.
XZ + Y

1.
ab + (cd)' + cd + bd'
2.
1. Which of the following boolean expressions is not a(b+c) + cd
logically equivalent to all of the rest ? 3.
ab + ac + (cd)'
4.
bd' + c'd' + ab + cd

1.
(A + B) (A + C) = AC + BC
2.
(A + B) (A + C) = AB + C
1. Which of the following statements is true ? 3.
(A + B)(A + C) = A + BC
4.
(A + B) (A + C)= AC + B
 52
1.
JK flip flop needs a clock
pulse
2.
There is a feedback in JK lip-
lop
1. The main difference between JK and RS flip-flop is that 3.
JK flip-flop accepts both
inputs as 1
4.
JK flip-flop is acronym of
Junction cathode
multivibrator

1.
Encoder
2.
1. Which of the following unit will choose to transform Decoder
decimal number to binary code ? 3.
Multiplexer
4.
Counter

1.Tell the time of the day

2.Tell how much time has

elapsed since the system was
turned on
The clock signals are used in sequential logic circuits to
3.Carry parallel data signals

4.
Synchronize events in
various parts of system

1.
69282
2.
69272
1. Using 10's complement 72532- 3250 is 3.
69252
4.
69232

1.
Logical Diagram
2.
Logical Graph
1. A Boolean function may be transformed into 3.
Map
4.
Matrix

1. A circuit that converts n inputs to 2^n outputs is called 1.

 53
encoder

2.
decoder

3.
comparator

4.
carry look ahead

1.
1011
2.
1111
1. Adding 1001 and 0010 gives output of 3.
0
4.
1010

1.
circle

2.
variable
1. Adjacent squares represents a
3.
literal

4.
minterm

1.
Encoder
2.
Decoder
1. BCD to seven segment is a 3.
Comparator
4.
Carry Look Ahead

1.
1 input line
2.
2 input lines
1. Decimal digit in BCD can be represented by 3.
3 input lines
4.
4 input lines

1.
Combinational Circuit
1. Decoder is a 2.
Sequential Circuit
 54
3.
Complex Circuit
4.
Gate

1.
4 steps

2.
5 steps
1. Design procedure of combinational circuit involves
3.
6 steps

4.
8 steps

1.
three variables

2.
four variables
1. Eight minterms will be used for
3.
five variables

4.
six variables

1.
AND gate

2.
1. Encoders are made by three OR gate
3.
NAND gate
4.
XOR gate

1.
NAND gates
2.
OR gates
1. Flip-flops can be constructed with two 3.
AND gates
4.
NOT gates

1.
meaning
1. In BCD no. 1010 has 2.
no meaning
 55
3.
value

4.
Vcc

1.
numeric values

2.
letter symbols
1. In design procedure input output values are assigned with
3.
0's

4.
1's

1.
present state

2.
next state
1. In excitation table of D flipflop next state is equal to
3.
input state

4.
D state

1.
No
2.
1. Is it possible to find two algebraic expressions that specify Yes
same function 3.
Maybe
4.
Never

1.
Addition
2.
Subtraction
1. Magnitude comparator compares using operation of 3.
Division
4.
Multiplication

1.
binary sequence
1. Minterms are arranged in map in a sequence of 2.
gray code
 56
3.
binary variables

4.
BCD code

1.
Equal
2.
Less
1. One operation that is not given by magnitude comparator. 3.
Greater
4.
Addition

1.
JK
2.
T
1. One that is not type of flip-flop is 3.
RS
4.
ST

1.
NOT gates

2.
OR gates
1. Output of AND gates in SOP is connected to
3.
AND gates

4.
EX-OR gates

1.
RS Latch
2.
SR Latch
1. RS flip-flops are also called 3.
TS Latch
4.
ST Latch

1.
transition table

2.
1. Table that is not a part of asynchronous analysis procedure state table

3.
flow table
 57
4.
excitation table

1.
AND terms

2.
1. To perform product of maxterms Boolean function must
OR terms
be brought into 3.
NOT terms
4.
NAND terms

1.
eight minterms
2.
six minterms
1. Two variables will be represented by 3.
five minterms

4.
four minterms

1.
10111

2.
101101
1. X=1010100 and Y=1000011 using 2's complement X-Y is
3.
10011

4.
10001

1.
AND
2.
OR
1. x+y=z represents operation that is 3.
NOT
4.
EX-OR

1.
Fool proof mechanism
2.
Just-in-time (JIT)
"Kaizen" is a Japanese term meaning 3.
Setting standards
4.
Continuous improvement
 58
1.
Push strategy
2.
Pull strategy
"Taking the product to the customer" 3.
Link strategy
4.
Final strategy

1.
Ceramic
2.
Polyester
________ is an excellent example for sustainable fibre. 3.
Wool
4.
Lyocell

1.
Harmony
2.
Line
________ refers unity of design in a garment 3.
Shape
4.
Form

1.
Break-down
2.
_________ is where profit is expressed as a percentage of the Break-up
sale price. 3.
Markdown
4.
Markup

1.
Cylinder
2.
_________ machines allow manipulation of fabric on both Flatbed
sides of the needle for topstitching and lapped seaming 3.
Post
4.
Raised bed

1.
Labels
2.
__________ are made of durable materials are permanently Tags
sewn into garments for production information 3.
Stringers
4.
Care taps
 59
1.
Flat patterning
__________ creating a pattern by pinning fabric to a 2.
Draping
dressmaker's dummy and manipulating it until the look is 3.
achieved. Pinning
4.
Dart manipulation

1.
Line preview
2.
__________ date is the merchandiser’s deadline for having all Deadline
prototypes and pricing for a new product line completed. 3.
Line presentation
4.
Line releases

1.
Plotter
__________ is a diagram of a precise arrangement of pattern 2.
Marker
pieces for a specific style and the sizes to be cut from a single 3.
spread. Design
4.
Grading

1.
Thimble
2.
Needle threader
__________ is a guide containing steps to make a garment 3.
Sewing gauge
4.
Pattern

1.
SAM
2.
__________ is the application of computer technology to the CAD
development of a garment to the point of production. 3.
CIM
4.
CIF

1.
Texture
__________ is the feel, drape and degree of stiffens and 2.
Surface effect
softness of the fabric, it also creates a visual effect upon the 3.
wearer. Hairiness
4.
Hang
 60
1.
Enzymes
2.
__________ is the natural polymer that makes up the living Keratin
cells of all vegetation. 3.
Cellulose
4.
Lumen

1.
Value based pricing
2.
__________ occurs when pricing is used as the basis to make Discount pricing
consumers “feel more favourable” about a product 3.
Membership pricing
4.
Psychological pricing

1.
Carding
__________ process improves the yarn strength, evenness and 2.
Combing
decreases the imperfections due to removal of short fibres and 3.
making the fibres more parallel. Drawing
4.
Drafting

1.
Stitch density
2.
__________ refers to the total number of loops in a measured Stitch length
area of fabric. 3.
Areal density
4.
Course length

1.
Mail order
__________ retailing offers merchandises to consumers in a 2.
E- Commerce
catalog as directional format 3.
E-retailing
4.
Chain store

1.
Mock seam
2.
__________ seams are those in which all seam allowance are Self-enclosed seam
contained within the finished seam 3.
Lap seam
4.
Bound Seam
 61
1.
TQM
__________ series programme provides standards for data 2.
documentation and audits as part of a quality management QMS
system. 3.
ISO
4.
AQL

1.
Spec sheet
2.
Check sheet
__________ special types of forms for data collection. 3.
Work sheet
4.
Make sheet

1.
ISO 14000
__________ standards are designed to help organize QA/QC 2.
ISO 6000
activities. 3.
ISO 8583
4.
ISO 9000

1.
Sampling Plan
2.
__________ statistically calculated number of sample items to Scheduling plan
inspect and the number of defects allowed. 3.
Cutting plan
4.
Inspection plan

1.
Pinning mannequin
2.
__________ also known as dressmaker's dummies, are padded Mannequin
so that material may be pinned to them: 3.
Dress form
4.
Character form

1.
Marketing Research
___________ is the systematic gathering, recording, and 2.
analyzing of data about problems relating to the marketing of Production planning
goods and services. 3.
Process planning
4.
Purchase planning
 62
1.
Set
2.
____________ is a difference between actual and garment Ease
measurement at any given point 3.
Seam
4.
Allowance

1.
1800
__________is the angle at which the cutting device contacts 2.
900
the spread. 3.
Cutting pitch
4.
Longitudinal

1.
Lay
2.
A __________ is a stock of fabric plies that have been Marker
prepared for cutting 3.
Fabric
4.
Bundle

1.
Parts
A merchandise __________ is a collection of various styles, 2.
Assortment
quantities and prices related merchandise, usually grouped 3.
under one classification within a department. Segmentation
4.
Market

1.
Oil-in-water
2.
For pigment printing, which following type of thickener Water-in-oil
system is preferably used 3.
Sodium alginate
4.
Guar gum

1.
Equal to number of warperse
beams
2.
In a sizing machine the number of lease rods is given
number of warperse beams –
by__________. 1
3.
Number of warperse beams
–2
 63
4.
not depends on warperse
beams

1.
Twisting
2.
In the delivery roller nip point, fibres are getting twisted Parallelisation
together and the yarn is formed. 3.
Spinning triangle
4.
Spinning bar

1.
Andhra Pradesh
2.
Karnataka
Kalamkari is the most ancient industry in _________. 3.
Madhya Pradesh
4.
Tamil Nadu

1.
ECO-TEX
2.
Label of international association for research and testing in ECO Steam
the field of textile ecology is given by __________ eco label. 3.
ECOS
4.
OEKO-TEX

1.
Total time taken to Produce
Sample
2.
Time taken to Process the
Lead-time means Garment
3.
Time from conforming to
shipping the order
4.
Stitching Time alone

1.
consistent flow of materials
for production
2.
Major challenges in material management is __________ campus planning
3.
cost of raw material
4.
marketing cost
 64
1.
3nos
2.
Maximum how many thread will be using in Over Lock 4nos
machine. 3.
5nos
4.
6nos

1.
Identify inspection points in
a process
2.
Outline production
Pareto charts are used to __________ . schedules
3.
Organize errors, problems or
defects
4.
Show material flow

1.
Product development
management
2.
Product design management
PDM stands for ______________ 3.
Product data Management
4.
Product decoding
management

1.
Wholesalers
2.
Fashion retailing
The business of buying fashion merchandise from a variety of
3.
resources and reselling it to ultimate consumers __________ . Marketing
4.
Merchandising

1.
31 tex
2.
The count of yarn is 20 Ne and its equivalent count in tex 32 tex
system will be __________. 3.
29.5 tex
4.
30.7 tex

1.
The crop cultivated without pesticides and chemicals, but
Eco-friendly
using synthetic fertilizers are said to be ___________ one. 2.
 65
Organic
3.
In-organic
4.
Sustainable

1.
pH 7, 60°C
2.
The optimum conditions for bleaching cotton with hydrogen pH 7, boil
peroxide are 3.
pH 10, 60°C
4.
pH 10, boil

1.
2T,3T,4T
The toddlers apparel, for the child who has learned to walk are 2.
4 to 7
sized: 3.
3,6and 9 months
4.
4X to 6X

1.
Blind stitch machine
2.
This machine sews a seam, cuts both pieces of fabric about Walking foot machine
1/4" from the seam, and overcast stitches all in a single pass. 3.
Zig zag machine
4.
Serger

1.
300
2.
400
Two thread chain stitch refer __________ classes. 3.
301
4.
401

1.
2.5% span length and 50%
span length
2.
50% span length and 2.5%
span length
Uniformity ratio is the ratio of: 3.
Mean length and upper half
mean length
4.
Upper half mean length and
mean length
 66
1.
Cotton
2.
Utilization of __________ fibre in clothing has added to the Wool
fast depleting of forests. 3.
Silk
4.
rayon

1.
Honeycomb
2.
Herringbone
Which among them is not a good weave absorbent towel? 3.
Huckaback
4.
Terry

1.
Rly alignment
2.
__________ may result from friction among materials and Static Electricity
spreading equipment 3.
Tension
4.
Shrink

1.
Progressive bundle system
2.
Production bundle sets
Expand PBS: 3.
Promoting business sales
4.
Product buying status

1.
Red and Blue
2.
Red and Green
Violet (purple) is made up of the combination of __________ . 3.
Red and Yellow
4.
Red and Orange

1.
schema
2.
__________is the description of the database schema construct
3.
schema evolution
4.
snapshot
 67
1.
self describing nature
The advantage of DBMS over file systems is 2.
Logical data independence
3.
multiple user
4.
Physical data independence

1.
Primary Key

The set of all attributes of a relation is called default 2.

_____________. Super Key
3.
Foreign Key
4.
Alternate key

1.
Scanner
The ____________ identifies the language tokens in the text
of the query.
2.
Parser
3.
Validation
4.
query tree

1.
Active
During _____________ state, transaction issues read and write
operations. 2.
committed
3.
Partially committed
4.
failed

1.

Trivial
______________ FD have same set of attributes on both
sides.
2.
non-trivial
3.
Fully
4.
Paritial
 68
1.
______________ join requires that the two join attributes have Theta Join
the same name in both relations. 2.
Equi join
3.
Self join
4.
Natural join

1.
Conflict
In ______________ Schedule only one transaction at a time is
active.
2.
view
3.
serial
4.
non serial

1.
The attributes in foreign key and primary key have the same Number of tuples
____________. 2.
Number of attributes
3.
Domain
4.
Symbol

1.

Conflict
In ______________ Schedule transactions are executing with
interleaved process.
2.
view
3.
serial
4.
non serial

1.
Primary Key
2.
Minimal super key of a relation is called _______________. Super Key
3.
Foreign Key
4.
Alternate key

The combination of selection and Cartesian product operators 1.

Division
is ____________ operator 2.
Set difference
 69
3.
Join
4.
Union

1.
Structural

The participation constraints and cardinality ratio together 2.

Un Structural
called as _______________ constraints.
3.
Integrity
4.
Referential

1.
O(n)
2.
O(log n )
The complexity of binary search algorithm is 3.
O(log n )
4.
O(n log n)

1.
O(n)
2.
O(log n)
The complexity of Bubble sort algorithm is 3.
O(n^2)
4.
O(n log n)

1.
O(n)
2.
O(n^2)
The complexity of Insertion sort algorithm is 3.
O(log n)
4.
O(n log n)

1.
O(n)
2.
O(n log n)
The complexity of Merge sort algorithm is 3.
O(n^2)
4.
O(log n)

Which of the following sorting algorithms does not have a 1.

worst case running time of O(n2) Insertion sort
 70
2.
Merge sort
3.
Quick sort
4.
Bubble sort

1.
Time Complexity
2.
Space Complexity
Apriory algorithm analysis does not include 3.
Program Complexity
4.
Time and Space Complexity

1.
Match the following − 1 → A, 2 → B, 3 → C
(1) Bubble Sort (A) Ο(n) 2.
1 → B, 2 → C, 3 → A
(2) Shell Sort (B) Ο(n2) 3.
(3) Selection (C) Ο(n log 1 → A, 2 → C, 3 → B
Sort n) 4.
1 → B, 2 → A, 3 → C

1.
Deque
2.
To represent hierarchical relationship between elements, Priority Queue
which data structure is suitable? 3.
Tree
4.
All of these

1.
ARP
2.
RARP
A technique called ______ is used to create a subnetting effect 3.
proxy ARP
4.
none of the above

1.
next-hop
2.
In _______ forwarding, the destination address is a network network-specific
address in the routing table 3.
host-specific
4.
default

In IPv4 header, an HLEN value of decimal 10 means _______. 1.

 71
A) there are 10 bytes of
options
2.
there are 40 bytes of options
3.
there are 10 bytes in the
header
4.
there are 40 bytes in the
header

1.
distance vector
2.
The Open Shortest Path First (OSPF) protocol is an link state
intradomain routing protocol based on _______ routing. 3.
path vector
4.
link path

1.
an Ethernet frame
2.
an TCP segment
UDP packets are encapsulated in ___________. 3.
an IP datagram
4.
IP header

1.
12.2.2.0
2.
What is the first address of a block of classless addresses if 12.2.2.32
one of the addresses is 12.2.2.76/27? 3.
12.2.2.64
4.
none of these

1.
adapts to new computers
2.
takes advantage of already
sorted elements
An adaptive sorting algorithm − 3.
takes input which is already
sorted
4.
Take input which is unsorted

1.
parent nodes have values
In a MIN-Heap greater than or equal to their
childs
 72
2.parent nodes have values
less than or equal to their
childs 3.
both statements are true
4.
both statements are wrong

1.
Singly linked list
2.
A linked list in which last node contain the link of the first Doubly linked list
node is called 3.
Circular linked list
4.
Array

1.
Tower of Hanoi
2.
Ackermann’s function
3.
Example of primitive recursion is Tower of Hanoi
and Ackermann’s function
both

4.
None

1.
Singly linked list
2.
Doubly linked list
In linked lists there are no NULL links in: 3.
Circular linked list
4.
linear linked list

1.
FCFS
2.
LIFO
Stack works on the principles: 3.
FCFS and LIFO
4.
SJF

1.
Much more complicated to
analyze then that of worst
case
The complexity of the average case of an algorithm is 2.
Much more simpler to
analyze than that of worst
case
 73
3.
Sometimes more
complicated and some other
times simpler than that of
worst case
4.
None of these

1.
Stack is empty
2.
Stack is full
The condition Top= -1 indicates that 3.
Stack has only one element
4.
stack has two elements

1.
The list must be sorted
2.
There should be the direct
access to the middle element
Which of the following is not the required condition for binary
in any sub list
search algorithm? 3.
There must be mechanism to
delete and/or insert
elements in list
4.list is unsorted

1.
Array is a linear data
structure.
2.
Every element of array must
Which of the following statements are wrong statements? be of same type.
3.
In array, Insert element is
called push operation.
4.
Array is homogenous.

1.
Post-order
2.
Which of the following traversal techniques lists the nodes of a In-order
binary search tree in ascending order? 3.
Pre-order
4.
Pre-Post order

1.
A method to provide secure transmission of email is called TLS
____. 2.
SA
 74
3.
IPSec
4.
PGP

1.
File server
2.
A packet whose destination is outside the local TCP/IP DNS server
3.
network segment is sent to .............. DHCP server
4.
Default gateway

1.
Added
2.
As the data packet moves from the upper to the lower layers, Removed
headers are _______. 3.
Rearranged
4.
Modified

1.
automatically
2.
Distance vector routing algorithm is a dynamic routing by server
algorithm. The routing tables in distance vector routing 3.
algorithm are updated........... by exchanging information
with neighbour nodes
4.
with back up database

1.
TCP header length
2.
Which of the following field of the TCP header tells how Window size
many bytes may be sent starting at the byte acknowledged? 3.
Acknowledgement number
4.
Urgent pointer

1.
O(n)
2.
Binary search tree has best case run-time complexity of Ο(log O(n^2)
n). What could the worst case? 3.
Ο(n^3)
4.
O(nlogn)

In C programming, when we remove an item from bottom of 1.

the stack, then − The stack will fall down
 75
2.
Stack will rearranged items
3.
It will convert to LIFO
4.
This operation is not allowed

1.
Greedy approach
2.
Improved binary search
Quick sort algorithm is an example of 3.
Dynamic Programming
4.
Divide and conquer

1.
Ο(1)
2.
Ο(log n)
Re-balancing of AVL tree costs 3.
Ο(n)
4.
Ο(n^2)

1.
Queues
2.
Which one of the below mentioned is not a linear data Stacks
structure 3.
Arrays
4.
Trees

1.
Data Structure
2.
Abstract Data Type
_____________is a step-by-step procedure for calculation 3.
Primitive Data Type
4.
Algorithm

1.
(3,7)
A binary tree is generated by inserting in order of the 2.
(7,3)
following integers: 50, 15, 62, 5, 20, 58, 3, 8, 37, 60, 24 the 3.
number of nodes in the left of the root respectively is (4,6)
4.
(6,4)

1.
A complete binary tree of level 5 has how many nodes? 15
 76 1.
15
2.
A complete binary tree of level 5 has how many nodes? 63
3.
25
4.
30

1.
Single direction
2.
Any direction
A doubly linked list facilitates list traversal in 3.
Circular direction
4.
Revere direction

1.
n
2.
log n
A full binary tree with n leaves contains ______ nodes 3.
2n - 1
4.
2n+1

1.
log n
2.
A full binary tree with n non-leaf nodes contains 2n
____________ nodes 3.
2n - 1
4.
2n + 1

1.
Linear
2.
Non Linear
A linked list is which type of data structure. 3.
Hierarchical
4.
None

1.
Data structure
2.
A mathematical-model with a collection of operations defined Abstract Data Type
on that model is called 3.
Pimitive Data Type
4.
Algorithm

A multi-dimensional array array[0:2, 10:20, 3:4, -10:2] 1.

contains _________ elements. 240
 77
2.
858
3.
390
4.
160

1.
Data
2.
Link
A node carries information regarding 3.
Data and Link
4.
None

1.
Single direction
2.
Any direction
A singly linked list facilitates list traversal in 3.
Circular direction
4.
Reverse direction

1.
3
2.
A two-dimensional array array[1:3, 1:3] contains _________ 6
elements. 3.
9
4.
7

1.
Finiteness
2.
An algorithm must be generic enough to solve all problems of Definiteness
a particular class. This property is termed as ____________. 3.
Generality
4.
Effectiveness

1.
20
2.
22
Answer of following postfix expression: 2,3,10+*8,2/- 3.
23
4.
25

1.
Balancing symbol is a application of _______________. Singly linked list
 78
2.
Doubly linked list
3.
Doubly linked list
4.
Linked stack

1.
sorted linked list
2.
sorted binary trees
Binary search algorithm cannot be applied to 3.
sorted linear array
4.
pointer array

1.
2
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 4
Children(3) = 7, Children(10) = 40. How many children does 3.
the root have? 8
4.
9

1.
2
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 4
Children(3) = 7, Children(10) = 40. How many descendents 3.
does the root have? 8
4.
9

1.
2
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 4
Children(3) = 7, Children(10) = 40. How many leaves does it 3.
have? 7
4.
9

1.
2
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 4
Children(3) = 7, Children(10) = 40. How many of the nodes 3.
have at least one sibling? 3
4.
9

Consider the following tree with 9 nodes. Root = 14, 1.

Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 2
 79
Children(3) = 7, Children(10) = 40. What is the depth of the 2.
tree? 3
3.
4
4.
9

1.
2
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, 10
Children(3) = 7, Children(10) = 40. What is the value stored in 3.
the parent node of the node containing 30? 11
4.
14

1.
(2,11)
Consider the following tree with 9 nodes. Root = 14, 2.
Children(14) = 2,11, Children(2) = 1,3, Children(11) = 10,30, (1,3)
Children(3) = 7, Children(10) = 40. Which pair of nodes have 3.
equal number of descendants? (10,30)
4.
(7,14)

1.
(i – 1)u2
2.
For the array A[1:u1, 1:u2] where α is the base address, A[i,1] α + (i – 1)u2
has its address given by 3.
α + i * u2
4.
α + (I – 1) * u1

1.
Link to the first node
2.
NULL
In a linked list, the pointer of the last node contains 3.
Link
4.
Pointer to the tail node

1.
First
2.
Last
In a Single Link List_________ node contains no links. 3.
Last but one
4.
middle

In polynomial manipulation, nodes consists of three field

1.
representing
 80
Coefficient, exponential and
link
2.
Previous item link, data item,
next item link
3.
Coefficient, data item and
link
4.
Link, Coefficient and
exponential

1.
2
2.
In Single Linked List a node contain minimum how many 3
fields(assuming one for data). 3.
1
4.
0

1.
Singly linked list
2.
Doubly linked list
In which linked list, nodes in form of ring? 3.
Circular linked list
4.
Linked Stack

1.
Infix
2.
Inorder
In which notation operator comes between operand? 3.
Postfix
4.
Prefix

1.
Infix
2.
Postfix
In which notation operator is comes after operand? 3.
Prefix
4.
Preorder

1.
Infix
2.
In which notation operator is comes before operand? Postfix
3.
Postorder
 81
4.
Prefix

1.
Worst Case
2.
Input instance for which algorithm take maximum possible Best Case
time is called 3.
Average Case
4.
Null Case

1.Worst case 2.
Best case
Input instance for which algorithm take minimum possible 3.
time is called Average case
4.
Null Case

1.
variables
2.
arrays
Linear order linked list is provided through _________ 3.
Pointer
4.
Strings

1.
Underflow
2.
Overflow
Linked list START=NULL is ____________ 3.
Full
4.
Empty

1.
FCFS
2.
LIFO
Queue works on the principles: 3.
FCFS and LIFO
4.
Neither FCFS nor LIFO

1.
Recursive
2.
Abstract data type
Representation of data structure in memory is known as: 3.
Storage structure
4.
File structure
 82
1.
1 and 2
2.
Single link list performs which of the following methods 1) 2 and 3
Insertion 2) Modification 3) Searching 3.
1 and 3
4.
1, 2, 3

1.
When item is somewhere in
the middle of the array
2.
When item is not in the array
at all
The average case occur in linear search algorithm 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

1.
Problem analysis
2.
Problem statement
The first step of development of an algorithm is 3.
Algorithm analysis
4.
Implementation

1.
5*(6+2)-12/4
2.
5+6-2*12/4
The infix expression for the postfix expression : 5,6,2+*12,4/- 3.
(5+6)-2/12*4
4.
None

1.
Empty list
2.
Zero list
The list with no node is called as 3.
Null list
4.
Vacant list

1.
2i
The maximum number of nodes on level i of a binary tree is 2.
3i
 83
3.
i+1
4.
2i+2

1.
(1 - u)
2.
(u)
The number of elements in array Array[1:u] is given by 3.
(u – 1 + 1)
4.
(u – 1 - 1)

1.
(u1- l1 – 1)(u2 – l2 - 1) (u3 –
l3 - 1)
2.
The number of elements in array Array[l1:u1, l2:u2, l3:u3] is (u1*u2*u3)
given by 3.
(u1 – l1)(u2 – l2)(u3-l3)
4.
(u1- l1 + 1)(u2 – l2 + 1)(u3 –
l3 + 1)

1.
(u1- l1 – 1)(u2 – l2 - 1)
2.
The number of elements in array Array[l1:u1, l2:u2] is given (u1*u2)
by 3.
(u1 – l1)(u2 – l2)
4.
(u1- l1 + 1)(u2 – l2 + 1)

1.
11
2.
The number of swapping needed to sort the numbers 8, 22, 7, 12
9, 31, 19, 5, 13 in ascending order, using insertion sort is 3.
13
4.
14

1.
abc*d/+
2.
a*bcd/+
The postfix expression for the infix expression : a+b*c/d 3.
ab*cd/+
4.
abcd*/+

1.
The prefix expression for the infix expression : a+b*c/d +ab*/cd
 84
2.
+*ab/cd
3.
+a*b/cd
4.
None

1.
Stacks
2.
Queues
The term MAX and MIN is related to the 3.
Heaps
4.
Splays

1.
O(log2 n)
2.
The time complexity of linear search algorithm over an array O(n)
of n element is 3.
O(n log2 n)
4.
O(n^2)

1.
O(1)
2.
The time complexity of the algorithm in a best case would be O(n)
expressed as 3.
O(n2)
4.
O(n+1)

1.
Item is somewhere in the
middle of array
2.
Item is not in the array at all
The Worst case occur in linear search algorithm when 3.
Item is the last element in
the array
4.
Item is the last element in
the array or is not there at all

1.
Postorder
Traversing binary tree first root and then left and right subtrees 2.Preorder 3.
called _____________ traversal. In order
4.
Binary order

Type of storage is used to represent Lists 1.

 85
Random
2.
Sequential
3.
Dynamic
4.
Logical

1.
Constant time
2.
What is the worst-case time for serial search finding a single Logarithmic time
item in an array? 3.
Linear time
4.
Quadratic time

1.
Lists implemented with an
array
2.
What kind of list is best to answer questions such as "What is Doubly-linked lists
the item at position n?" 3.
Singly-linked lists
4.
Doubly-linked or singly-
linked lists are equally best

1.
Store and Retrieve
2.
Which among the following pairs of operations is supported Insert and Delete
by an array ADT? 3.
Copy and Delete
4.
Append and Copy

1.
int A[3]={1,2,3};
2.
int A[3]={123};
Which are the correct array initialization statements? 3.
int A[3]=”123”;
4.
int A[3]=1,2,3;

1.
Worst case
2.
Which case analysis appropriate when the response time of the Best case
algorithm is critical? 3.
Average Case
4.
Null case
 86
1.
Queue
2.
Stack
Which data structure will you use to evaluate prefix notation? 3.
Array
4.
Linked List

1.
Dense matrix
2.
Ordered list
Which is not an application of array? 3.
Sparse Matrix
4.
Linked List

1.
Best case
2.
Which of the following case does not exist in complexity Worst case
theory 3.
Average case
4.
Null case

1.
Array
2.
reference variable
Which of the following is considered an Abstract Data Type? 3.
any of the primitive types
(e.g., int, double, char)
4.
Stack

1.
Evaluation of Police notation
2.
Tower of Hanoi
Which of the following is not a application of Stack? 3.
Stack Machine
4.
None

1.
Must use a sorted array
2.
Which of the following is not a limitation of binary search Requirement of sorted array
algorithm? is expensive when a lot of
insertion and deletions are
needed
3.
 87
There must be a mechanism
to access middle element
directly
4.
Binary search algorithm is
not efficient when the data
elements are more than
1000.

1.
Insertion
2.
Deletion
Which of the following is not the operation on Queue? 3.
Updating
4.
Displaying

1.
Sparse matrix
2.
Which of the following is the application of the singly linked Polish notation
list? 3.
Tower of Hanoi
4.
Polynomial Addition

1.
Front=0 and Rear=size
2.
Which of the following is the condition of circular queue Front+1=Rear
overflow? 3.
Both a & b
4.
Neither a nor b

1.
Push
2.
Pop
Which of the following name related to stacks? 3.
Top
4.
All

1.
Stack, Graph
2.
Which of the following pair of data structures are both non- Stack, Linked List
linear type? 3.
Tree, Linked List
4.
Tree, Graph
 88
1.
Insertion
2.
Bubble
Which of the following sorting method is unstable? 3.
Selection
4.
Heap

1.
Every tree is a bipartite
graph
2.
A tree contains cycle
Which of the following statement is false? 3.
A tree with n nodes contains
n-1 edges
4.
A tree is connected graph

1.
Singly linked list
2.
Doubly linked list
Which of the following will contain more memory space? 3.
Array
4.
Circular linked list

1.
Static view
2.
Functional view
ER model shows the _______ 3.
Dynamic view
4.
All the above

1.
Cohesion

_______________ is a measure of the degree of 2.

interdependence between modules Coupling
3.
Corrosion
4.
None of the mentioned

1.
quality function design
QFD stands for

2.
 89
quality function
development
3.
quality function deployment

4.
none of the mentioned

1.
The work associated with software engineering can be 1, 2, 3
categorized into three generic phases, regardless of application 2.
area, project size, or complexity namely the__________ phase 2, 1, 3
which focuses on what, the_________ phase which focuses 3.
on how and the_________ phase which focuses on change 3, 2, 1
1. Support, 2. Development, 3. Definition 4.
3, 1, 2

1.
Usability, Reliability,
Security, Flexibility
2.
Availability, Reliability,
Maintainability, Security
What are the four dimensions of Dependability
3.
Availability, Reliability,
Security, Safety
4.
Security, Safety, Testability,
Usability

1.
Horizontal Prototype

2.
Vertical Prototype
Which is not one of the types of prototype of Prototyping
Model? 3.
Diagonal Prototype

4.
Domain Prototype

1.
Build & Fix Model
2.
Prototyping Model
Which one of the following models is not suitable for
accommodating any change?
3.
RAD Model
 90
4.
Waterfall Model

1.
Arrays
2.
Which of the following data structure can't store the non- Records
homogeneous data elements? 3.
Pointers
4.
None

1.
mn
Given two sorted lists of size m and n respectively.The 2.
max(m,n)
number of comparisons needed in the worst case by the merge 3.
sort algorithm will be? min(m,n)
4.
m+n-1

1.
P contains the address of an
element in DATA.
2.
P points to the address of
first element in DATA
A variable P is called pointer if 3.
P can store
only memory addresses
4.
P contain the DATA and the
address of DATA

1.
elementary items
2.
Each data item in a record may be a group item composed of atoms
sub-items; those items which are indecomposable are called 3.
scalars
4.
all of above

1.
Arrays
2.
Which of the following data structure store the NON Records
homogeneous data elements? 3.
Pointers
4.
None
 91
1.
Queues
A ________ is a data-structure that organizes data similar to a 2.
Stacks
line in the super-market, where the first one in the line is the 3.
first to be out: Arrays
4.
Structures

1.
n
2.
A binary tree with n internal nodes has a max. of external n+1
nodes equal to: 3.
n-1
4.
2n

1.
Sparse Matrix
2.
Zero matrix
A matrix which has most of its values equal to 0: 3.
Empty matrix
4.
Diagonal matrix

1.
increasing heap
2.
ascending heap
A max-heap is also known as: 3.
High heap
4.
Big heap

1.
inorder successor
2.
inorder predecessor
A right in-threaded binary tree contains: 3.
postorder successor
4.
preorder successor

1.
Forests
2.
A set of several trees that are not linked to each other in any Graphs
way 3.
B Trees
4.
AVL trees
 92
1.
queue
2.
Stack
A sparse matrix can also be represented using: 3.
tree
4.
Linked List

1.
Binary tree
2.
General tree
A tree having any number of nodes: 3.
AVL tree
4.
B tree

1.
Binary search tree
A tree in which the value in every node is more than node- 2.
AVL tree
values in its left subtree and less than node-values in its right 3.
subtree: B tree
4.
Splay tree

1.
n
2.
All the non-leaf nodes except the root node in a multi-way n-1
search tree of order, n have atleast ........... children 3.
2n
4.
n/2

1.
Sub - Algorithm
2.
Recursive Algorithm
An algorithm that calls itself directly or indirectly is known as: 3.
Polish notation
4.
Traversal Algorithm

1.
O(n)
2.
O(2n)
Complexity of heap sort 3.
O(logn)
4.
O(nlogn)
 93
1.
High and low
2.
Max and Min
Heaps are of two types: 3.
B and B+
4.
Complete and Binary

1.
n
2.
log n
Height of a full binary tree with n internal nodes is: 3.
n log n
4.
n-1

1.
tree
2.
If there are more than one paths between two nodes, it is a: list
3.
graph
4.path

1.
greater than all its children
2.
smaller than all its children
3.
Incase of min-heap, the value present in any node is: equal to all its children
4.
greater than values in left
subtree and smaller than
values in right subtree

1.
quick
2.
insertion
Shell sort is an improvisation over ........... sort. 3.
merge
4.
selection

1.
First fit
2.
The algorithm used in dynamic memory allocation with Best fit
minimum time: 3.
Worst fit
4.
Next fit
 94
1.
-1
2.
1
The degree of a leaf node is: 3.
0
4.
undefined

1.
n log n
2.
log n
The depth of a complete binary tree is given by: 3.
n log n +1
4.
log n +1

1.
Binary tree
2.
The inorder traversal of tree will yield a sorted listing of Binary Search Tree
elements of tree: 3.
Heaps
4.
Splays

1.
height of the tree
2.
zero
The leaf nodes of a tree have height equal to: 3.
one
4.
degree

1.
Singly Linked List
2.
Circular Linked list
The terms Tail and Head are related to 3.
Doubly Linked List
4.
Queues

1.
Local variables
2.
The variables which can be accessed by all modules in a External variables
program, are known as: 3.
Internal variables
4.
Global variable
 95
1.
binary search tree
2.
To reduce disk-accesses while searching for a record, the tree General tree
used is ............ tree. 3.
B tree
4.
AVL tree

1.
the variables in E will appear
as external nodes and
operations as internal nodes
2.
the operations in E will
appear as external nodes and
When representing any algebraic expression E which uses only variables as internal nodes
binary operations in a 2-tree: 3.
the variables and operations
in E will appear only as
internal nodes
4.
the variables and operations
in E appear only as external
nodes

1.
Short
2.
Which of the following abstract data types is not used by int
integer abstract data type group? 3.
Float
4.
Long

1.
Arrays
2.
Which of the following data structures can’t store non- Records
homogeneous data-elements: 3.
Pointers
4.
Strucutres

1.
grounded header list
2.
circular header list
Which of the following is a two-way list: 3.
linked list with header &
trailer nodes
4.
none of the above
 96
1.
compile time
2.
While calculating time-complexity, the program-time which is Execution time
considered is: 3.
run time
4.
Analysis time

1.
11
2.
The TTL field has value 10. How many routers (max) can 5
process this datagram? 3.
10
4.
1

1.
offset
2.
flag
Which field helps to check rearrangement of the fragments? 3.
TTL
4.
identifier

1.
->

The assignment operator is denoted by 2.

<-

3.
=

4.
==

1.
Consistency

____ means that the data used during the execution of a 2.

Atomicity
transaction cannot be used by a second transaction until the
first one is completed. 3.
Durability

4.
Isolation

_______________ has made PL/SQL code run faster without 1.

requiring any additional work on the part of the programmer. SQL Server
 97
2.

My SQL
3.

Oracle
4.

SQL Lite

1.
Transaction management

2.
Isolation of the transactions is ensured by Application programmer
3.
Concurrency control
4.
Recovery management

1.
Left to left

2.
8. In precedence of set operators the expression is evaluated Left to right
from
3.
Right to left
4.

From user specification

1.
Relational

2.
Deductive
Which of the following is the oldest database model?
3.
Physical

4.
Network

1.
PL/SQL

2.
___________ combines the data manipulating power of SQL
SQL
with the data processing power of Procedural languages. 3.

Advanced SQL
 98
4.
PQL

1.
SQL

2.
_______________ is a procedural extension of Oracle – SQL PL/SQL
that offers language constructs similar to those in imperative
programming languages. 3.
Advanced SQL

4.
PQL

1.
PL/SQL

2.
_______________ provides option for entering SQL queries SQL*Plus
as execution time, rather than at the development stage 3.

SQL
4.

Dynamic SQL

1.
Integers literal

2.
_________________ is a sequence of zero or more characters String literal
enclosed by single quotes.
3.
String units
4.

String label

1.
Comments

2.
A ___________________ is an explicit numeric, character, Literals
string or Boolean value not represented by an identifier. 3.

Delimiters
4.

Identifiers

A collection of data designed to be used by different people is 1.

called a/an Organization
 99
2.
Database

3.
Relationship

4.
Schema

1.
Lexical Units

2.
A line of PL/SQL text contains groups of characters known as Literals
3.

Textual Units
4.

Identifiers

1.
Super key
2.

Candidate key
A table can be logically connected to another table by defining
3.
a
Primary key
4.

Unique key

1.
Begin transaction and end
transaction

2.
Start transaction and stop
A transaction is delimited by statements (or function calls) of transaction
the form __________.
3.
Get transaction and post
transaction

4.
Read transaction and write
transaction

1.
By default sql server has ___________ isolation level READ COMMITTED
2.
 100

READ UNCOMMITTED

3.
SERIALIZABLE
4.

REPEATABLE READ

1.
Only 1

Consider money is transferred from (1) account-A to account- 2.

B and (2) account-B to account-A. Which of the following Only 2
form a transaction ? 3.
Both 1 and 2 individually

4.
only 1 or only 2

1.
CHECK, FOREIGN KEY
2.
Constraint checking can be disabled in existing
_______________ and _____________ constraints so that any DELETE, FOREIGN KEY
3.
data you modify or add to the table is not checked against the
constraint. CHECK, PRIMARY KEY
4.

PRIMARY KEY, FOREIGN

KEY

1.
Recovery-management
component of the DBMS

2.
Concurrency-control
component of the DBMS
Ensuring isolation property is the responsibility of the

3.
Transaction-management
component of the DBMS
4.
Buffer management
component in DBMS

For select operation the ________ appear in the subscript and 1.

the ___________ argument appears in the paranthesis after the Predicates, relation
sigma.
 1.
101 Predicates, relation

2.
For select operation the ________ appear in the Relation, Predicates
subscript and the ___________ argument appears in the
paranthesis after the sigma. 3.
Operation, Predicates

4.
Relation, Operation

1.
Atomicity

2.
Durability
Identify the characteristics of transactions
3.
Isolation

4.
All of the mentioned

1.
Strong

If no header is specified, the block is said to be an 2.

Weak
_______________ PL/SQL block
3.
Empty
4.
Anonymous

1.
Consistent state

If the state of the database no longer reflects a real state of the 2.

Parallel state
world that the database is supposed to capture, then such a
3.
state is called
Durable state
4.

Inconsistent state

1.
To create a place in the
database for storage of
scheme objects, rollback
In SQL, the CREATE TABLESPACE is used
segments, and naming the
data files to comprise the
tablespace.

2.
 102
To create a database trigger.

3.
To add/rename data files, to
change storage

4.
All of the mentioned

1.
CREATE PACKAGE
2.
In SQL, which command is used to issue multiple CREATE
CREATE SCHEMA
TABLE, CREATE VIEW and GRANT statements in a single
3.
transaction?
CREATE CLUSTER
4.

All of the mentioned

1.
Dirty reads
2.
Problems occurs if we don’t implement proper locking
Phantom reads
strategy 3.

Lost updates
4.
Unrepeatable reads

1.
Synonym

2.
Tablespace
SNAPSHOT is used for (DBA)
3.
System server

4.
Dynamic data replication

1.
Union

The ___________ operation, denoted by −, allows us to find 2.

tuples that are in one relation but are not in another. Set-difference

3.
Difference
4.
 103

Intersection

1.Queue
The best data structure to check whether an arithmetic 2.List
expression has balanced parentheses is a 3.Stack
4.Array

1.
Atomicity

The database system must take special actions to ensure that 2.

transactions operate properly without interference from Durability
concurrently executing database statements. This property is 3.
referred to as
Isolation
4.

All of the mentioned

1.
BEGIN
2.

The Oracle RDBMS uses the ____ statement to declare a new SET TRANSACTION
transaction start and its properties.
3.
BEGIN TRANSACTION

4.
COMMIT

1.
Atomicity

2.
The property of transaction that persists all the crashes is Durability

3.
Isolation

4.
All of the mentioned

1.
One-to-one relationship
2.
The relationship between DEPARTMENT and EMPLOYEE is
a One-to-many relationship
3.

Many-to-many relationship
4.
 104

Many-to-one relationship

1.
6789

The SQL statement SELECT SUBSTR(‘123456789’, 2.

2345
INSTR(‘abcabcabc’,’b’), 4) FROM EMP; prints
3.
1234

4.
456789

1.
Producing detail summary
or exception reports
2.

Transaction processing is associated with everything below Recording a business activity

except
3.
Confirming a action or
triggering a response

4.
Maintaining a data

1.
Lexical Units

2.
We use ______________ name PL/SQL program objects and Literals
units.
3.
Delimiters

4.
Identifiers

1.
Define, Create
2.

Drop, Comment
What are the different events in Triggers?
3.
Insert, Update, Delete

4.
Select, Commit
 105
1.
Nested query

When SQL statements are embedded inside 3GL, we call such 2.

Nested programming
a program as 3.

Distinct query
4.

Embedded SQL

1.
INSTR
2.
Which character function can be used to return a specified SUBSTRING
portion of a character string?

3.
SUBSTR
4.
POS

1.
Equijoins

2.
Cartesian
Which is a join condition contains an equality operator:
3.
Natural

4.
Left

1.
a) Selection operation
2.

b) Primitive operation
Which is a unary operation:
3.

c) Projection operation
4.

d) Generalized selection

1.
Which is the subset of SQL commands used to manipulate Data Definition Language
Oracle Database Structures, including tables? 2.
Data Manipulation Language
 106
3.
Data Described Language

4.
Data Retrieval Language

1.
db_accessadmin

2.
db_securityadmin
Which of the following fixed database roles can add or remove
user IDs? 3.
db_setupadmin

4.
db_sysadmin

1.
Atomicity

2.
Which of the following has “all-or-none” property ? Durability
3.
Isolation
4.
All of the mentioned

1.
Secondary key

2.
Which of the following is an attribute that can uniquely Candidate key
identify a row in a table? 3.

Foreign key

4.
Alternate key

1.
Left outer join
2.

Right outer join

Which of the following is not outer join ?
3.

Full outer join

4.

All of the mentioned

 107
1.
Logical database design
2.

Which of the following is the process of selecting the data physical database design
3.
storage and data access characteristics of the database?
Testing and performance
tuning
4.

Evaluation and selecting

1.
Can be assigned to a global
variable.

2.
Can be assigned to any field
only during design time.
Which of the following is TRUE for the System Variable
$date$? 3.
Can be assigned to any
variable or field during run
time.

4.
Can be assigned to a local
variable.

1.
Internal schema
2.

Conceptual schema
Which of the following schemas does define a view or views
3.
of the database for particular users?
Physical schema

4.
External schema

1.
MODIFY
2.
UPDATE
Which of the following SQL command can be used to modify
existing data in a database table?
3.
CHANGE
4.
NEW
 108
1.
Enables you to monitor
events

2.
Which of the following statements is/are not true for SQL Check if rows are being
inserted properly
profiler?
3.
Check the performance of a
stored procedure

4.
All of these

1.
Data security

2.
Data constraint
Which of the following terms does refer to the correctness and
completeness of the data in a database? 3.
Data independence

4.
Data integrity

1.
adapts to new computers
2.
takes advantage of already
sorted elements.
An adaptive sorting algorithm − 3.
takes input which is already
sorted.
4.
none of the these

1.
CPU Resource Allocation
2.
Breadth First Traversal
Stack is used for 3.
Recursion
4.
Depth First Traversal

1.
O(n2)
2.
The time required to search an element in a linked of length n
O(n log2 n)
is 3.
O(n)
4.
 109
O(log2 n)

1.
Consistency
__________ states that only valid data will be written to the 2.
Atomicity
database. 3.
Durability
4.
Isolation

1.
Disk capacities are greater
than memory capacities
2.
Disk access is much slower
than memory access
B+ trees are preferred to binary trees in databases because 3.
Disk data transfer rates are
much less than memory data
transfer rates
4.
Disks are more reliable than
memory

1.
Consider the following nested representation of binary trees: (1 2 (4 5 6 7))
(X Y Z) indicates Y and Z are the left and right sub stress, 2.
(1 (2 3 4) 5 6) 7)
respectively, of node X. Note that Y and Z may be NULL, or 3.
further nested. Which of the following represents a valid (1 (2 3 4)(5 6 7))
binary tree? 4.
(1 (2 3 NULL) (4 5))

Consider the label sequences obtained by the following pairs 1.

of traversals on a labeled binary tree. Which of these pairs (i) only
identify a tree uniquely? 2.
i) preorder and postorder (ii), (iii)
ii) inorder and postorder 3.
iii) preorder and inorder (iii) only
iv) level order and postorder 4.
(iv) only

1.
2n
In a complete binary tree, the number of leaves with n internal 2.
2(n-1)+1
nodes is: 3.
n+1
4.
n
 110
1.
log 2n
2.
In the worst case, the number of comparisons needed to search n/2
a singly linked list of length n for a given element is 3.
log n-1
4.
n

1.
LASTIN = LASTPOST
Let LASTPOST, LASTIN and LASTPRE denote the last 2.
vertex visited in a postorder, inorder and preorder traversal. LASTIN = LASTPRE
Respectively, of a complete binary tree. Which of the 3.
following is always true? LASTPRE = LASTPOST
4.
None of the above

1.
t (n) is 0 (1)
Let s be a sorted array of n integers. Let t(n) denote the time 2.
taken for the most efficient algorithm to determined if there n < t (n) < n
are two elements with sum less than 1000 in s. which of the 3.
following statements is true? n log 2 n < t (n) < n log 3n
4.
t(n) is O(n)

1.
preorder traversal
2.
Level order traversal of a rooted tree can be done by starting in-order traversal
from the root and performing 3.
depth first search
4.
breadth first search

1.
9, 10, 15, 22, 23, 25, 27, 29,
40, 50, 60, 95
Postorder traversal of a given binary search tree, T produces 2.
the following sequence of keys 9, 10, 15, 22, 40, 50, 60, 95,
23, 25, 27, 29
10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29 3.
Which one of the following sequences of keys can be the 29, 15, 9, 10, 25, 22, 23, 27,
result of an in-order traversal of the tree T? 40, 60, 50, 95
4.
95, 50, 60, 40, 27, 23, 22, 25,
10, 9, 15, 29

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in 1.

7510324689
that order into an initially empty binary search tree. The binary
2.
search tree uses the usual ordering on natural numbers. What 0243165987
is the in-order traversal sequence of the resultant tree? 3.
0123456789
 111
0123456789
4.
9864230157

The Breadth First Search algorithm has been implemented

using the queue data structure. One possible order of visiting 1.
the nodes of the following graph is MNOPQR
2.
NQMPOR
3.
QMNPRO
4.
QMNPOR

1.
2
The following numbers are inserted into an empty binary 2.
search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is 3
the height of the binary search tree (the height is the maximum 3.
distance of a leaf node from the root)? 4
4.
6

1.
2^(h-1)-1
The height of a binary tree is the maximum number of edges in 2.
2^(h+1) - 1
any root to leaf path. The maximum number of nodes in a 3.
binary tree of height h is: 2^h + 1
4.
2^(h+1)

1.
10, 20, 15, 23, 25, 35, 42, 39,
30
2.
The preorder traversal sequence of a binary search tree is 30, 15, 10, 25, 23, 20, 42, 35, 39,
30
20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is 3.
the postorder traversal sequence of the same tree? 15, 20, 10, 23, 25, 42, 35, 39,
30
4.
15, 10, 23, 25, 20, 35, 42, 39,
30

1.
T(n) = 2T(n – 2) + 2
2.
The recurrence relation capturing the optimal time of the
T(n) = 2T(n – 1) + n
Tower of Hanoi problem with n discs is 3.
T(n) = 2T(n/2) + 1
4.
T(n) = 2T(n – 1) + 1
 112
T(n) = 2T(n – 1) + 1

1.
Queue
To implement Dijkstra’s shortest path algorithm on 2.
Stack
unweighted graphs so that it runs in linear time, the data 3.
structure to be used is: B-Tree
4.
Array

1.
2
2.
What is the maximum height of any AVL-tree with 7 nodes? 3
Assume that the height of a tree with a single node is 0. 3.
4
4.
5

1.Merge Sort 2.
Quick Sort
Which of the following sorting algorithms has the lowest 3.
worst-case complexity? Bubble Sort
4.
Selection Sort

1.
Quick sort
2.
Which one of the following in place sorting algorithms needs Insertion sort
the minimum number of swaps? 3.
Selection sort
4.
Heap Sort

1.
Database relations have a
large number of records
2.
Database relations are
Which one of the following is a key factor for preferring B- sorted on the primary key
trees to binary search trees for indexing database relations? 3.
B-trees require less memory
than binary search trees
4.
Data transfer form disks is in
blocks.

1.
Divide and conquer strategy
Merge sort uses ? 2.
Backtracking approach
3.
 113
Heuristic search
4.
Greedy approach

1.
2,2,1,1,2
The following sequence of operation is performed on stack : 2.
2,2,1,2,2
push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. 3.
The sequence of popped out values are ? 2,1,2,2,1
4.
2,1,2,2,2

1.
10
2.
The number of swapping needed to sort numbers 12
8,22,7,9,31,19,5,13 in ascending order using bubble sort is ? 3.
14
4.
16

1.
Dynamic programming
2.
Which of the following algorithm design technique is used in Backtracking
the quick sort algorithm? 3.
Divide and conquer
4.
Greedy method

1.
Optimal binary search tree
construction can be
performed efficiently using
dynamic programming.
2.
Breath first search cannot be
used to find converted
components of a graph.
Which of the following statement is true ? 3.
Given the prefix and post fix
walks over a binary tree.The
binary tree cannot be
uniquely constructed
4.
Depth first search can be
used to find connected
components of a graph.

1.
A search begins the search with the element that is located in Serial
the middle of array 2.
Random
 114
3.
Parallel
4.
Binary

1.e-n+1
2.
n-e+1
From a complete graph, by removing maximum
3.
_______________ edges, we can construct a spanning tree. n+e-1
4.
e-n-1

1.
complete binary tree
2.
spanning tree
Heap is an example of 3.
sparse tree
4.
binary search tree

1.
O(n)
2.
O(log n)
The complexity of linear search algorithm is 3.
O(log n)
4.
O(n log n)

1.
Place them in an array and
sort the array
2.
Place pointers to them in an
To sort many large objects or structures, it would be most array and sort the array
efficient to 3.
Place them in a linked list
and sort the linked list
4.
Place references to them in
an array and sort the array

1.
quick sort
2.
Which of the below given sorting techniques has highest best- selection sort
case runtime complexity − 3.
insertion sort
4.
bubble sort

Which of the following algorithm is not stable? 1.

 115
Bubble Sort
2.
Quick Sort
3.
Merge Sort
4.
Insertion Sort

1.
Quick Sort
2.
Heap Sort
Which of the following sorting procedure is the slowest? 3.
Shell Sort
4.
Bubble Sort

1.
Greedy approach
2.
Divide and conquer
approach
Which of the following uses memoization? 3.
Dynamic programming
approach
4.
None of these

1.
Insertion Sort
2.
Merge Sort
Which one of the below is not divide and conquer approach? 3.
Shell Sort
4.
Heap Sort

1.
Relational
2.
Relational Algebra is a __________ query language that takes
Structural
two relation as input and produces another relation as output of
3.
the query.
Procedural
4.

Fundamental

1.architecture
Which of the following pattern is the basis of interaction
management in many web-based systems? 2. repository pattern
3.model-view-controller
 116
3.model-view-controller

4.different operating system

1. Architectural design

2.High-level design
Which design identifies the software as a system with many
components interacting with each other? 3.Detailed design

4.low-level design

1.
Level-0 DFD
2.
Level-1 DFD
The context diagram is also known as:____ 3.
Level-2 DFD
4.
Level-3 DFD

1.
The number of bits
transmitted per unit time
2.
The number of byted
Baud means? transmitted per unit time
3.
The rate at which the signal
changes
4.
None of above

1.
32 bits
2.
128 bits
How long is an IPv6 address? 3.
128 bytes
4.
64 bits

1.
Attenuation
2.
Propagation
Loss in signal power as light travels down the fiber is called? 3.
Scattering
4.
Interruption

1.
Protocols are?
Agreements on how
communication components
 117
and DTE's are to
communicate
2.
Logical communication
channels for transferring
data
3.
Physical communication
channels sued for
transferring data
4.
Logical communication
channels sued for
transferring data

1.
Alternated between 0 and 1
2.
Always set to 0
Under mark parity,each parity bit is? 3.
Always set to 1
4.
Not used

1.
Bridge
Although they've fallen out of favor, which of the following 2.
Hub
devices is used to connect different network segments and 3.
manage the traffic between them? Gateway
4.
Repeater

1.
Every 2 seconds
2.
Never
How often are BPDUs sent from a layer 2 device? 3.
Every 10 minutes
4.
Every 30 seconds

1.
onlineexam.telephone
network
In dial up remote access a client uses the ---- to create a 2.
physical connection to a part on a remote access server of the Banks branch network
private network. 3.
Private network
4.
onlineexam.local network

In OSI model dialogue control and token management are 1.

responsibilities of ? Session Layer
 118
2.
Network layer
3.
Transport layer
4.
Data link layer

1.
Hub
Star Topology is Based On a Central Device that can be 2.
__________ ? Switch
3.Router 4.
Both Hub and Switch

1.
Network Layer
2.
Data Link Layer
Switch is a Device of _________ Layer of OSI Model. 3.
Application Layer
4.
Session Layer

1.
A network that has only one
entry and exit point.
2.
A network with only one
entry and no exit point.
What is a stub network? 3.
A network with more than
one exit point.
4.
A network with more than
one exit and entry point.

1.
VLAN Trunking Protocol
2.
VLAN
What protocols are used to configure trunking on a switch? 3.
802.1Q
4.
ISL

1.
DNS Server
Which of the following devices takes data sent from one 2.
Switch
network device and forwards it to all devices on the network 3.
regardless of the intended recipient? Hub
4.
Gateway
 119
1.
Hub
Which of the following devices takes data sent from one 2.
Switch
network device and forwards it to the destination node based 3.
on MAC address? Gateway
4.
Modem

1.
DHCP
2.
SMTP
Which of the following services use TCP? 3.
FTP
4.
TFTP

1.
NIC
Which of the following terms is used to describe a hardware- 2.
Gateway
or software-based device that protects networks from outside 3.
threats? Firewall
4.
Hub

1.
TCP
2.
ARP
Which protocol does Ping use? 3.
ICMP
4.
BootP

1.
show all access-lists
2.
Which router command allows you to view the entire contents show access-lists
of all access lists? 3.
show ip interface
4.
show interface

1.
100 kbps
You have 10 users plugged into a hub running 10Mbps half- 2.
duplex. There is a server connected to the switch running 10 Mbps
10Mbps half-duplex as well. How much bandwidth does each 3.
host have to the server? 1 Mbps
4.
2 Mbps
 120
1.
Kruskal's algorithm
................. is a more generalized single source shortest path 2.
Prim's algorithm
algorithm which can find t he shortest path in a graph with 3.
negative weighted edges. Dijkstra algorithm
4.
Bellman ford algorithm

1.Queue as linked list

A ....... is a data structure that organizes data similar to a line in 2.Stack as linked list
the supermarket, where the first one in line is the first one out.
3.Both of them
4.Neither of them

1.
bus network
2.
A distributed network configuration in which all star network
data/information pass through a central computer is 3.
ring network
4.
Point-to-point network

1.
a user computer system
2.
a processor in a large-scale
computer that executes
operating system
instructions
3.
A front-end processor is a minicomputer that relieves
main-frame computers at a
computer centre of
communications control
functions
4.
preliminary processor of
batch jobs

1.
3 Kbps
2.
A noiseless 3 KHz Channel transmits bits with binary level 6 Kbps
signals. What is the maximum data rate? 3.
12 Kbps
4.
24 Kbps

1.
A remote batch-processing operation in which data is solely
Telegraph line
input to a central computer would require a: 2.
Simplex lines
 121
Simplex lines
3.
Mixedband channel
4.duplex lines

1.
hot potato routing
A station in a network forwards incoming packets by placing 2.
Flooding
them on its shortest output queue. What routing algorithm is 3.
being used? static routing
4.
delta routing

1.
100 photons
2.
Avalanche photodiode receivers can detect hits of transmitted 200 photons
data by receiving 3.
300 photons
4.
400 photons

1.
One or more conductors that
serve as a common
connection for a related
group of devices
2.
a continuous frequency
capable of being modulated
or impressed with a second
signal
3.
Carrier is the condition when two or
more sections attempt to use
the same channel at the
same time
4.
a collection of
interconnected functional
units that provides a data
communications service
among stations attached to
the network

1.
One or more conductors that
serve as a common
connection for a related
Contention is group of devices
2.
a continuous frequency
capable of being modulated
 122
or impressed with a second
signal
3.
the condition when two or
more stations attempt to use
the same channel at the
same time
4.
a collection of
interconnected functional
units that provides a data
communications service
among stations attached to
the network

1.
7 slots
Eight stations are competing for the use of a shared channel 2.
using the 'Adaptive tree Walk Protocol'. If the stations 7 and 8 5 slots
are suddenly become ready at once, how many bit slots are 3.
needed to resolve the contention? 10 slots
4.
14 slots

1.
Router
2.
Frames from one LAN can be transmitted to another LAN via Bridge
the device 3.
Repeater
4.
Modem

1.
16 - bits
How many bits internet address is assigned to each host on a 2.
32 - bits
TCP/IP internet which is used in all communications with the 3.
host? 48 - bits
4.
64 - bits

1.
first three
2.
How many digits of the DNIC (Data Network Identification first four
Code) identify the country? 3.
first five
4.
first six

1.
How many hosts are attached to each of the local area
128
networks at your site? 2. 254
 123
254
3.
256
4.
64

1.
a TCP/IP protocol used to
dynamically bind a high level
IP Address to a low-level
physical hardware address
2.
a TCP/IP high level
protocol for transferring
files from one machine
ICMP (Internet Control Message Protocol) is to another
3.
a protocol used to
monitor computers
4.
a protocol that handles
error and control
messages

1.
once
2.
If you get both local and remote echoes, every character you twice
type will appear on the screen 3.
three times
4.
never

1.
equal to the remainder at the
sender
2.
In CRC there is no error if the remainder at the receiver is
zero
_____. 3.
nonzero
4.
the quotient at the sender

1.
Random
2.
Items in a priority queue are entered in a _____________ Order of priority
order 3.
as and when they come
4.
same priority
 124

1.
the method of
determining which
device has access to the
transmission medium at
any time.
Satellite-Switched Time-Division Multiple Access 2.
(SS/TDMA) is a medium access control
technique for multiple access
transmission media
3.
a form of TDMA in which
circuit switching is used to
dynamically change the
channel assignments
4.
All of the above

1.
O(logn)
2.
The floyd-warshall all pairs shortest path algorithm computes O(log 2n)
the shortest paths between each pair of nodes in ....................... 3.
O(n^2)
4.
O(n^3)

1.
allows gateways to send
error a control messages to
other gateways or hosts
2.
provides communication
between the Internet
Protocol Software on one
machine and the Internet
Protocol Software on
The Internet Control Message Protocol (ICMP) another
3.
reports error conditions to
the original source, the
source must relate errors to
individual application
programs and take action to
correct the problem
4.
All of the above

The probability that a single bit will be in error on a typical 1.

public telephone line using 4800 bps modem is 10 to the 0.003
power -3. If no error detection mechanism is used, the residual 2. 0.009
 125
error rate for a communication line using 9-bit frames is 0.009
approximately equal to 3.
0.991
4.
0.999

1.
twisted-pair wire
2.
coaxial cable
The slowest transmission speeds are those of 3.
fiber-optic cable
4.
microwaves

1.
they produce large
volume of data
2.

The synchronous modems are more costly than the they contain clock
asynchronous modems because recovery circuits
3.
they transmit the data with
stop and start bits.
4.
they operate with a larger
bandwidth

1.
cannot talk at once
2.
can receive and send data
The term 'duplex' refers to the ability of the data receiving simultaneously
stations to echo back a confirming message to the sender. In 3.
full duplex data transmission, both the sender and the receiver can send or receive data one
at a time
4.
can do one way data
transmission only

1.
a coaxial cable
2.
To connect a computer with a device in the same room, you a dedicated line
might be likely to use 3.
a ground station
4.
All of the above

Usually, it takes 10-bits to represent one character. How many 1.

characters can be transmitted at a speed of 1200 BPS? 10

120
 126 1.
10
2.
Usually, it takes 10-bits to represent one character. How 12
many characters can be transmitted at a speed of 1200 3.
120
BPS?
4.
1200

1.
300
2.
What are the most commonly used transmission speeds in BPS 1200
used in data communication? 3.
2400
4.
9600

1.
WINS Server
2.
WINS Proxy
What can greatly reduce TCP/IP configuration problems? 3.
DHCP Server
4.
PDC

1.
127.0.0.1
2.
255.0.0.0
What is the default subnet mask for a class C network? 3.
255.255.0.0
4.
255.255.255.0

1.
119
2.
80
What is the port number for NNTP? 3.
79
4.
70

1.
192
2.
What part of 192.168.10.51 is the Network ID, assuming a 192.168.10
default subnet mask? 3.
0.0.0.5
4.
51

1.
When you ping the loopback address, a packet is sent where? On the network
 127
2.
Down through the layers of
the IP architecture and then
up the layers again
3.
Across the wire
4.
through the loopback dongle

1.
Contention
2.
Which of the following condition is used to transmit two Collision
packets over a medium at the same time? 3.
Synchronous
4.
Asynchronous

1.
Hub
2.
Which of the following device is used to connect two systems, bridge
especially if the systems use different protocols? 3.
gateway
4.
repeater

1.
Slower data transmission
2.
higher error rate
Which of the following is not a disadvantage of wireless 3.
LAN? interference of
transmissions from different
computers
4.
All of the above

1.
Modem
2.
Which of the following is used for modulation and Protocols
demodulation? 3.
Gateway
4.
Multiplexer

1.
UDP
Which of the following TCP/IP protocol allows an application 2.
program on one machine to send a datagram to an application VMTP
program on another machine? 3.
X.25
4.
 128
SMTP

1.
FTP
Which of the following TCP/IP protocol is used for 2.
SNMP
transferring electronic mail messages from one machine to 3.
another? SMTP
4.
RPC

1.
a technique used in best-
effort delivery systems to
avoid endlessly looping
packets
2.
a technique used by
protocols in which a lower
level protocol accepts a
message from a higher level
protocol and places it in the
Which of the following technique is used for fragment? data portion of the low level
frame
3.
one of the pieces that results
when an IP gateway divides
an IP datagram into smaller
pieces for transmission
across a network that cannot
handle the original datagram
size
4.
All of these

1.
Root->left sub tree-> right
sub tree
2.
Root->right sub tree-> left
sub tree
Which of the following ways is a pre-order traversal? 3.
right sub tree->left sub
tree->Root
4.
left sub tree-> right sub
tree->Root

You have a class A network address 10.0.0.0 with 40 subnets, 1.

255.240.0.0
but are required to add 60 new subnets very soon. You would
2.
like to still allow for the largest possible number of host IDs 255.248.0.0
per subnet. Which subnet mask should you assign? 3.
 129
255.255.255.255
4.
255.254.0.0

1.
Your company has a LAN in its downtown office and has now Modem
set up a LAN in the manufacturing plant in the suburbs. To 2.
Cable
enable everyone to share data and resources between the two 3.
LANs, what type of device(s) are needed to connect them? Hub
Choose the most correct answer. 4.
Router

1.
Carding
2.
Scutching
Hacking is the term given to__________ operation 3.
Combing
4.
pulling

1.
Bit stuffing
2.
Cyclic redundancy codes
Error detection at the data link layer is achieved by? 3.
Hamming codes
4.
Equalization

1.
1
2.
How many collision domains are created when you segment a 12
network with a 12-port switch? 3.
5
4.
2

1.
Detectors
2.
Modulators
In communication satellite, multiple repeaters are known as? 3.
Stations
4.
Transponders

1.
Bus topology
The topology with highest reliability is ? 2.
Star topology
3.
 130
Ring Topology
4.
Mesh Topology

1.
Simplex
2.
Which data communication method is used to transmit the data Half-duplex
over a serial communication link? 3.
Full-duplex
4.
Half and Full Duplex

1.
Kruskal's algorithm
................ keeps two sets of vertices; S, the set of vertices 2.
whose shortest paths from the source have already been Prim's algorithm
determined and V-S, the remaining vertices. 3.
Dijkstra algorithm
4.
Bellman ford algorithm

1.
Push
2.
Pull
...... is the term used to insert an element into stack. 3.
Pump
4.
Pop

1.
LIFO
2.
FIFO
........ form of access is used to add remove nodes from a stack. 3.
Both A and B
4.
Neither A nor B

1.
LIFO, Last In First Out
2.
......... form of access is used to add and remove nodes from a FIFO, First In First Out
queue. 3.
Both a and b
4.
Neither a nor b

1.
Push
.......... is the term used to delete an element from the stack.
2.
Pull
3.
 131
Pop
4.
Pump

1.
Kruskal's algorithm
2.
................. turns out that one can find the shortest paths from a Prim's algorithm
given source to all points in a graph in the same time. 3.
Dijkstra algorithm
4.
Bellman ford algorithm

1.
complete binary tree
2.
A binary tree whose every node has either zero or two children binary search tree
is called ....... 3.
extended binary tree
4.
data structure

1.
Free graph
2.
No cyclic graph
A connected graph T without any cycles is called ........ 3.
Non cycle graph
4.
Trees

1.
Top
2.
A pointer variable which contains the location at the top Last
element of the stack is called ..... 3.
Final
4.
End

1.
FIFO
2.
FILO
A queue is a ......... 3.
LOFI
4.
LIFO

1.
A sample application of ................. algorithm is to solve DAG application path
critical path problem, i.e. finding the longest path through a algorithm
DAG. 2.
DAG shortest path algorithm
 132
3.
DAG critical path algorithm
4.
Bellman ford algorithm

1.
Root
2.
Leaf
A terminal node in a binary tree is called ............ 3.
Child
4.
Branch

1.
Threaded trees

2.
Binary trees with threads are called as ....... Pointer trees
3.
Special Trees
4.
Special Pointer trees

1.
Binary trees
2.
stacks
Breadth First search is used in 3.
graphs
4.
queues

1.
Front
2.
Rear
Deletion operation is done using ......... in a queue. 3.
Top
4.
List

1.
Antecedents
2.
Every node N in a binary tree T except the root has a unique Predecessor
parent called the ......... of N. 3.
Forerunner
4.
Precursor

1.
Graph G is .............. if for any pair u, v of nodes in G there is a
Leterally connected
path from u to v or path from v to u. 2.
 133
Widely Connected
3.
Unliterally connected
4.
Literally connected

1.
Stacks
2.
Queues
Header node is used in ..... 3.
Linked List
4.
Binary trees

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

1.
Binary tree
2.
In _____________tree, the heights of the two child subtrees of Red Black Tree
any node differ by at most one 3.
Splay tree
4.
AVL tree

1.
Exterior node
2.
Outer node
In a 2-tree, nodes with 0 children are called ............ 3.
External node
4.
Inner node

1.
u is adjacent to v but v is not
adjacent to u
2.
e begins at u and ends at v
In a graph if E=(u,v) means ...... 3.
u is processor and v is
successor
4.
v is processor and u is
successor
 134
1.
End nodes
2.
Terminal nodes
In Binary trees nodes with no successor are called ...... 3.
Final nodes
4.
Last nodes

1.
INFO fields
2.
In liked representation of stack ....... holds the elements of the TOP fields
stack. 3.
LINK fields
4.
NULL fields

1.
Beginning of the stack
2.
In linked representation of stack the null pointer of the last Bottom of the stack
node in the list signals .......... 3.
Middle of the stack
4.
In between some value

1.
Stop pointer
2.
In the linked representation of the stack ......... behaves as the Begin pointer
top pointer variable of stack. 3.
Start pointer
4.
Avail pointer

1.
Hash table
2.
Heaps
Key value pair is usually seen in 3.
Splay trees
4.
Skip lists

1.
4
2.
Linked representation of binary tree needs ......... parallel 2
arrays. 3.
3
4.
5
 135
1.
Front
2.
Back
New nodes are added to the ......... of the queue. 3.
Middle
4.
Both ends

1.
FILO
2.
LIFO
On which principle does queue work? 3.
LILO
4.
FIFO

1.
Direct graph
2.
Digraph
Other name for directed graph is .......... 3.
Dir - graph
4.
Directional graph

1.
kruskal's algorithm
2.
Rather than build a subgraph one edge at a time prim's algorithm
............................... builds a tree one vertex at a time. 3.
dijkstra algorithm
4.
bellman ford algorithm

1.
Array with pointers
2.
Single linear array
Sequential representation of binary tree uses ........ 3.
Two dimensional arrays
4.
Three dimensional arrays

1.
LIFO
2.
FIFO
Stack follows the strategy of ........ 3.
LRU
4.
RANDOM
 136
1.
Relaxation
The ..................... process updates the costs of all the vertices 2.
V, connected to a vertex U, if we could improve the best Improvement
estimate of the shortest path to V by including (U,V) in the 3.
path to V. Shortening
4.
Costing

1.
Hiearchical
2.
Reverse
The elements are removal from a stack in .......... order. 3.
Alternate
4.
Sequential

1.
insert
2.
push
The insertion operation in the stack is called ......... 3.
pop
4.
top

1.
Sorting
2.
The operation of processing each element in the list is known Merging
as ...... 3.
Inserting
4.
Traversal

1.
O(logn)
2.
The result of prim's algorithm is a total time bound of O(m+n logn)
.................. 3.
O(mn)
4.
O(m logn)

1.
push
2.
pop
The retrieval of items in a stack is ........... operation. 3.
retrieval
4.
access
 137
1.
Trees
2.
Stacks
The term enqueue and dequeue is related to 3.
Queues
4.
Linked Lists

1.
Trees
2.
Stacks
The term ParentTree and Child is related to 3.
Queues
4.
Linked Lists

1.
Trees
2.
Stacks
The term push and pop is related to 3.
Queues
4.
Linked Lists

1.
O(n)
2.
The time required in best case for search operation in binary O(1)
tree is 3.
O(2n)
4.
O(log n)

1.
Dequeue
2.
To represent hierarchical relationship between elements, Priority queue
Which data structure is suitable? 3.
Tree
4.
Graph

1.
overflow
2.
underflow
TREE[1]=NULL indicates tree is ........ 3.
Empty
4.
Full
 138
1.
Duplicate
2.
Trees are said .......... if they are similar and have same Carbon copy
contents at corresponding nodes. 3.
Replica
4.
Copies

1.
The new node is placed at
the front of the linked list
2.
The new node is placed at
What happens when you push a new node onto a stack? the back of the linked list
3.
The new node is placed at
the middle of the linked list
4.
No Changes happens

1.
In red-black trees, the root
do not contain data.
2.
In red-black trees, the leaf
nodes are not relevant and
do not contain data.
What is the peculiarity of red black trees? 3.
In red-black trees, the leaf
nodes are relevant but do
not contain data.
4.
The nodes are red and black
in colour

1.
Stacks
2.
Which data structure allows deleting data elements from and Queues
inserting at rear? 3.
Dequeues
4.
Binary Search Tree

1.
Stack
2.
Which data structure is used in breadth first search of a graph Queue
to hold nodes? 3.
Tree
4.
Array
 139
1.
FIRST
2.
FRONT
Which is the pointer associated with the stack? 3.
TOP
4.
REAR

1.
Arrays
2.
Which of the following data structure can't store the non- Records
homogeneous data elements? 3.
Pointers
4.
Stacks

1.
Strings
2.
Lists
Which of the following data structure is non linear type? 3.
Stacks
4.
Graphs

1.
finding factorial
2.
tower of Hanoi
Which of the following is an application of stack? 3.
infix to postfix
4.
all of the above

1.circular doubly linked list

2.
circular linked list
Which of the following linked list below have only last node
3.
of the list pointing to the first node? circular singly linked list
4.
doubly linked list

1.
FIFO
2.
LIFO
Which of the following name does not relate to stacks? 3.
Piles
4.
Push down

Which of the following data structure has cycles? 1.

 140
Graphs
2.
AVL trees
3.
Binary search trees
4.
Heap trees

1.
Polar fleece fabric
2.
Velour fabric
__________ fabric produced from plating terry cam. 3.
Elastic terry fabric
4.
Double face terry fabric

1.
6 X 6 matt weave
2.
2 X 4 warp rib
__________ fabrics have more number of binding points. 3.
1 X 1 plain weave
4.
4 X 2 weft rib

1.
Threading
2.
__________ is a method repairing the garments where yarns Piecing
are worked into the weave 3.
Mending
4.
Darning

1.
Fashion
2.
__________ is the assortment of fashion products that a Collection
company offers for sale at any point in time. 3.
Product range
4.
Gevels

1.
Binders
2.
Folders
__________ is work aids used in automatic pocket sewing 3.
Jigs
4.
Hemmers
 141
1.
scope of defect
2.
Fabric defects are assigned point values based on the length of defect
__________ in the fabric. 3.
width of the defect
4.
depth of defect

1.
Rest position
Identify the needle position during loop formation, the latch is 2.
Cast-off position
closed by the old loop and the new yarn is held by the latch 3.
head. Tucking-in position
4.
Knock-over position

1.
Shoulder and hip should be
narrower
2.
Rib cage and hip shoulder
One of following is the most important point to be considered should be narrower
for drawing female figures compare to male. 3.
Waist and hip shoulder
should be narrower
4.
Neck and shoulder should be
narrower

1.
Fashion cycle
The __________ refers to the rise, wide popularity or 2.
Promotion
acceptance by masses of people, and then the decline in the 3.
acceptance of style Design for caste
4.
Research

1.
Felting
2.
The fabric produced by the bonding and interlocking fibres are Weaving
called as __________ 3.
Netting
4.
Knitting

1.
Just in Time
“One-click-try” concept is applicable for __________ 2.
RFID
3.
 142
Texture Mapping
4.
Virtual fitting

1.
Brahmika sari
Which Indian dress symbolises the synthesis of Hindu-Muslim 2.
Chapkan
dress form? 3.
Nehru jacket
4.
Gandhi's cap

1.
Skirts and hair became
shorter
2.
Women stopped wearing
Which of the following was not a change brought about in jewellery
women's dress as a result of the World Wars? 3.
Bright colours came into
vogue
4.
Clothes became plainer and
simpler

1.
100-200
2.
Build & Fix Model is suitable for programming exercises of 200-400
___________ LOC (Line of Code) 3.
400-1000
4.
above 1000

1.
Relative Application
Development
2.
Rapid Application
RAD stands for _______
Development
3.
Rapid Application Document
4.
Requirement Application
Document

1.
Magnetic disk
2.
__ read the data by reflecting pulses of laser beams on the
Optical disk
surface 3.
Floppy disk
4.
 143
ROM

1.
Prediction
2.
Verification
___ is the process of determining correctness. 3.
correctness
4.
Validation

1.
Software Architecture
Development
2.
Component Based
Development
____ is an industrialized approach to software development 3.
Industrial Architecture
Development
4.
Rapid Architecture
Development

1.
MTTR
2.
Defect rate
____ is usually expressed in terms of bugs/LOC.
3.
MTTF
4.
MHRT

1.
Stimulus response
2.
____ model shows how entities are composed of other Data processing
entities 3.
Composition
4.
Architectural

1.
DMA
2.
____ processor has to check continuously till device becomes Interrupt-initiated I/O
ready for transferring the data ? 3.
IOP
4.
DCP

1.
____ usecase is not complete and has no initiation actors. concrete usecase
 144
2.
Abstract usecase
3.
State
4.
Activity

1.
Data
2.
Deliverables
_____ are project results delivered to customers 3.
Milestones
4.
Output

1.
Cohesion
2.
_____ denotes the measure of strength of association Coupling
established by a connection from one object to another. 3.
Decomposition
4.
Elaboration

1.
Usecase
_____ diagrams show the configuration of run time processing 2.
Deployment
elements and the software components,processes and objects 3.
that live in them Activity
4.
State Chart

1.HP Programming 2.
Pair programming
_____ is an agile software development technique in which 3.
two programmers work together at one workstation Usecase analysis
4.
Prototyping

1.
Swapping
_____ is the concept in which a process is copied into main 2.
Segmentation
memory from the secondary memory according to the 3.
requirement. Paging
4.
Demand paging

1.
_____ is the process of executing a program with the intent of Requirements Verification
finding errors. 2.
Testing
 145
3.
Design verification
4.
Code verification

1.
Data models
2.
Context models
______ are used to illustrate the boundaries of a system 3.
ER models
4.
Entity models

1.
NonFunctional requirements
2.
Design constraints
______ describe system services or functions 3.
attribute
4.
Functional requirements

1.
Boehm
______ describes the spiral model as a "process model 2.
Royce
generator", where choices based on a project's risks generate 3.
an appropriate process model for the project. William Harry
4.
Pareto

1.
Use Case
2.
Attribute
______ is a scenario depicting a user system interaction 3.
Class
4.
Object

1.
Requirements specification
document
2.
______ is a structured document setting out detailed
User manual
descriptions of the system services 3.
Service document
4.
Installation guide

______ is often used for risk management when an 1.

exceptional risk that, though unlikely, would have catastrophic Business usecase plan
consequences. 2.
 146
Contigency plan
3.
Catastrophic plan
4.
Process Plan

1.
Horizontal
2.
Analysis
______ prototype is a simulation of the user interface 3.
Domain
4.
Vertical

1.
Activity charts
2.
Bar chart
______ show task dependencies and the the critical path 3.
State chart
4.
Event chart

1.
Data models
2.
______ show the a system and its relationship with other Context models
systems 3.
Architectural models
4.
Entity models

1.
Traditional software
development approach
______ uses same language to talk about 2.
analysis,design,programming and database design object oriented approach
3.
waterfall approach
4.
spiral approach

1.
Rational Unified Process
2.
_______ acknowledge the programmatic need for milestones, Waterfall model
for keeping a project on track, but encourage iterations 3.
Sequential model
4.
Throw away Prototyping

1.
_______ are a natural way to structure requirements elicitation feasibility study
 147
2.
Viewpoints
3.
activity diagram
4.
component view

1.
Formal specifications
2.
_______ are expressed in a mathematical notation with Data specifications
precisely defined vocabulary, syntax and semantics. 3.
Requirements specification
4.
Design specifications

1.
Component and
Collaboration
2.
_______ diagrams are called as Implementation diagram. Component and State chart
3.
Component and Deployment
4.
Sequence and Collaboration

1.waterfall 2.
_______ is an approach to software development that allows Structured architecture
us to create objects that represent tangible elements of the 3.
business independent of how they are represented to the user Layered Architecture
through an interface or physically stored in a database. 4.
Software architecture

1.
Traditional programming
_______ is an inherent part of most prototype development 2.
systems DOS Programming
3.Fortran Programming 4.
Visual programming

1.
Cohesion
2.
_______ is the number of functions which are called by Coupling
function X 3.
Fan-out
4.
Fan-in

1.
Throw away Prototyping
________ acknowledges that we do not understand all the
2.
requirements and builds only those that are well understood Paper prototyping
3.
 148
Evolutionary prototyping
4.
Storyboarding

1.
Object class
________ are an alternative function-related measure to 2.
Object points
function points when 4Gls or similar languages are used for 3.
development function points
4.
kloc

1.
PERT
________ chart is a tool that depicts project as network 2.
Bar
diagram that is capable of graphically representing main 3.
events of project in both parallel and consecutive way Network
4.
Project

1.
Adjectives
2.
________ in the textual description are considered to be Nouns
methods of classes 3.
Pronouns
4.
Verb

1.
Class
________ is a version of software product developed in the 2.
Prototype
early stages of product's life cycle for specific and 3.
experimental purposes. Object
4.
Requirements

1.
Aggregation
2.
________ is the interaction between software components or Coupling
objects. 3.
Decomposition
4.
Cohesion

1.
Requirement gathering
________ is the process of checking the requirements for
2.
validity, consistency, completeness, realism and verifiability. Requirement specification
3.
 149
Requirement documentation
4.
Requirements validation

1.Bottom up testing 2.
Topup testing
________ is to test every statement in the objects method by 3.
executing it at least once. Statement testing coverage
4.
Integration testing

1.
Requirement analysis
________ techniques include the use of very high-level 2.
Prototyping
languages, database programming and prototype construction 3.
from reusable components Implementation
4.
Design

1.
Gathers
_________ is an effective and decorative way of distributing 2.
Flares
fullness over a given area 3.
Godets
4.
Pleats

1.
Emergent risks
2.
_________ affect the organisation developing or Product risks
procuring the software 3.
People risks
4.
Business risks

1.
objects
2.
class
_________ are responsible for producing or consuming data 3.
Viewpoints
4.
Input device

1.
Systems Engineering
2.
_________ is an engineering discipline which is concerned
Computer engineering
with all aspects of software production. 3.
Software engineering
4.
 150
Production Engineering

1.
Vectored-interrupting

2.Daisy chain
_________ method is used to establish priority by serially
connecting all devices that request an interrupt. 3.
Priority

4.
Polling

1.
Rapid prototype
_________ provides a broad view of an entire system or 2.
Analysis prototype
subsystem, focusing on user interaction more than low-level 3.
system functionality, such as database access. Horizontal prototype
4.
Vetical prototype

1.
AR (Address Register)
2.
_________ register keeps tracks of the instructions stored in XR (Index Register)
program stored in memory. 3.
PC (Program Counter)
4.
AC (Accumulator)

1.
Aggregation
2.
__________ is referred to as generalisation and is Inheritance
shown ‘upwards’ rather than ‘downwards’ in a hierarchy 3.
Composition
4.
Decomposition

1.
Data flow models
2.
__________ may be used to show the processes and the flow ER model
of information from one process to another 3.
Architecture model
4.
Context models

1.
Activity chart
__________ show schedule against calendar time 2.
Bar charts
 151
3.
state chart
4.
event chart

1.
State machine
2.
___________ are used to describe the logical structure of Context model
data processed by the system 3.
Architectural model
4.
Semantic data models

1.
DFD
___________ are rectangles with the name at the top, 2.
State machine
attributes in the middle section and operations in the bottom 3.
section Object classes
4.
Entity

1.
Design
___________ can be created quickly from a set of reusable 2.
Entity
components plus some mechanism to ‘glue’ these component 3.
together Prototypes
4.
Component

1.
System model list
2.
____________ are lists of all of the names used in the system Data dictionaries
models. 3.
HAsh table
4.
Entity list

1.
Deliverables
2.
Milestones
____________ are the end-point of a process activity 3.
Outcome
4.
Output

____________ helps the analyst to understand the 1.

Business modelling
functionality of the system and models are used to 2.
communicate with customers Project scheduling
 152
3.
System modelling
4.
Project planning

1.
Design verification
____________ involves executing the system with test cases 2.
System testing
that are derived from the 3.
specification of the real data to be processed by the system Debugging
4.
Requirements valiudation

1.
Design
2.
_____________ is concerned with modifying the system after Coding
it is in use 3.
Analysis
4.
Evolution

1.
Concrete class
2.
______________ have no instances but define the common Base class
behaviors that can be inherited by more specific classes 3.
Abstract classes
4.
Facade class

1.
Decomposition
______________ provides a scheme for refining the 2.
Design pattern
subsystems or components of a software system or the 3.
relationship among them. Architecture
4.
MVC

1.
Incremental model
_______________ can be suited to projects where 2.
Prototyping model
requirements and scope are fixed, the product itself is firm and 3.
stable, and the technology is clearly understood Waterfall model
4.
Spiral model

1.
vertical prototype
_______________ refers to user interface prototype 2.
domain prototype
 153
3.
analysis prototype
4.
horizontal prototype

1.
Horizontal prototype
2.
_______________clarifies complex requirements by drilling Vertical prototype
down to actual system functionality. 3.
Analysis prototype
4.
Domain protype

1.
Waterfall model
_______________refers to the creation of a model that will 2.
Throwaway prototyping
eventually be discarded rather than becoming part of the final 3.
delivered software. Analysis
4.
Evolutionary prototyping

1.
Validation
2.
Verification
_____________is the task of predicting correspondence 3.
correctness
4.
prediction

1.
ER diagram
2.
_____________models that show the systems response to State machine
events 3.
Context diagram
4.
Event diagram

1.
DBMS
2.
____________are a natural way to structure requirements Viewpoints
elicitation 3.
Process model
4.
Methods

____________checks the consistency of routine and 1.

Database anlysis
procedure declarations and their 2.
use. Interface analysis
 154
3.
Business layer analysis
4.
Path analysis

1.
Class
___________are assumptions or relationships among model 2.
stereotype
elements specifying conditions and propositions that must be 3.
maintained as true. constraints
4.
Node

1.
Usecase diagram
2.
___________in the UML are used to model interaction State machine
between objects 3.
Sequence diagrams
4.
Component diagram

1.
Product risks
2.
Project risks
__________affect schedule or resources 3.
Business risks
4.
Hardware risks

1.
Analyst
2.
Programmers
__________don’t know what they really want 3.
Designers
4.
Stakeholders

1.
Feasibility study
__________is the process of formally documenting the user 2.
Requirements specification
and system requirements and creating a software requirements 3.
document. Requirement verification
4.
Requirement specification

1.
Data processing model
_________shows how entities have common characteristics 2.
Classification model
 155
3.
Architectural model
4.
Stimulus/response model

1.
Static model
________can be viewed as a collection of procedures or 2.
Dynamic model
behaviours that, taken together, reflect the behaviour of a 3.
system over time. Implementation model
4.
Architectural model

1.
Data processing model
2.
Composition model
________shows the system’s reaction to events 3.
Stimulus/response model
4.
Classification model

1.
Behavioural perspective
2.
Structural perspective
________shows the system’s context or environment 3.
Cognitive perspective
4.
External perspective

1.
Initial
________state in a state chart is shown as a circle surrounding 2.Middle 3.
a small dot,a bull’s- eye. Intermediate
4.
Final

1.
Developer
_______may be used to ‘draw’ the interface and simulate its 2.
visual generators
functionality with 3.
components associated with interface entities User interface generators
4.
Program generators

1.
State diagram
______emphasize the use of events and states to determine 2.
the overall activity of the system. Usecase Diagram
3.
Sequence Diagram
 156
4.
Component diagram

1.
Extreme programming
______relies on constant code improvement, 2.
Spiral approach
user involvement in the development team and 3.
pairwise programming . Prototyping
4.
Waterfall approach

1.
usability
2.
______testing exercises the system beyond its maximum stress
design load . 3.
acceptance
4.
beta

1.
SAD
_____approach to systems development rapidly develops 2.
RAD
software to quickly and incrementally implement the design by 3.
using tools such as CASE. MAC
4.
CSC

1.
Process
2.
Data hiding
_____identifies generalities among entities 3.
Partitioning
4.
Abstraction

1.
Data hiding
2.
_____identifies the structural (part-of) relationships between Projection
entities 3.
Partitioning
4.
Abstraction

1.Prototyping
_____model is suitable for software development ,when the 2.Formal specification
requirements are well defined 3.Spiral
4.Waterfall

_____perspective shows the system or data architecture 1.

 157
Source
2.
Structural
3.
Behavioral
4.
External

1.
model
2.
view
____encapsulates core data and functionality. 3.
controller
4.
facade

1.
vertical
2.
analysis
____prototype is an aid for exploring the problem domain 3.
horizontal

4.
domain

1.
5
A 4-way set-associative cache memory unit with a capacity of 2.
16 KB is built using a block size of 8 words. The word length 15
is 32 bits. The size of the physical address space is 4 GB. The 3.
number of bits for the TAG field is _____ 20
4.
25

1.
2 binary cells
2.
4 binary cells
A 8bit flip-flop will have 3.
6 binary cells
4.
8 binary cells

1.
attribute
A _____ is a function or procedure that is defined for a class 2.
method
and typically can access the internal state of an object of that 3.
class to perform some operation class
4.
object
 158
1.
method
2.
attribute
A _____ is an implementation of an object's behavior 3.
class
4.
object

1.
plan
2.
A _______ is a probability that some adverse circumstance risk
will occur. 3.
schedule
4.
milestone

1.
bottom up testing
2.
A _______ strategy can detect the serious flaws early in the testing
implementation. 3.
top down testing
4.
integration testing

1.
class
A _________ is instructive information that captures the 2.
essential structure and insight of a successfully family of pattern
proven solutions to a recurring problem that arises within 3.
certain context and system of forces model
4.
component

1.
biometric system
A __________ is an old system that still provides essential 2.
database system
business services 3.
. legacy system
4.
OBS system

1.
bad test cases
2.
A ___________ is the one that has s high probability of good test cases
detecting an as-yet undiscovered error 3.
average test cases
4.
worst test cases
 159
1.
planning
2.
A _____________decides whether or not the proposed system requirement elicitation
is worthwhile 3.
feasibility study
4.
requirement validation

1.
horizontal prototype
2.
A ____________is a more complete elaboration of a single vertical prototype
subsystem or function 3.
domain prototype
4.
analysis prototype

1.
Dynamic model
A _______can be viewed as a snapshot of a system's 2.
parameters at rest or at a specific point in time. Static model
3.Event model 4.
Working model

1.
root
2.
leaves
A B-tree grows at ............. 3.
branches
4.
stem

1.
mod-5 counter
2.
mod-10 counter
A BCD counter is a 3.
mod-15 counter
4.
mod-20 counter

1.
MSB
2.
A binary number's value changes most drastically when the Frequency
________ is changed. 3.
LSB
4.
Duty Cycle

1.
A binary tree grows at ............... root
 160
2.
leaves
3.
branches
4.
stem

1.
0 only
2.
0 and -1
A binary variable can take values 3.
0 and 1
4.
1 and 2

1.
RAD

2.
A company is developing an advance version of their current Iterative Enhancement
software available in the market, what model approach would 3.
they prefer?
Both a & b

4.
Spiral

A computer has twenty physical page frames which contain

pages numbered 101 through 120. Now a program accesses the 1.Last-in-first-out
pages numbered 1, 2, …, 100 in that order, and repeats the
access sequence THRICE. Which one of the following page 2. First-in-first-out
replacement policies experiences the same number of page
faults as the optimal page replacement policy for this 3.Least-recently-used
program?
4. Most-recently-used

1.
Efficient implementation of
multi-user support is no
longer possible
A computer system supports 32-bit virtual addresses as well as 2.
32-bit physical addresses. Since the virtual address space is of The processor
the same size as the physical address space, the operating cache organization can be
system designers decide to get rid of the virtual memory made more efficient now
entirely. Which one of the following is true? 3.
Hardware support for
memory management is no
longer needed
4.
 161
CPU scheduling can be made
more efficient now

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

1.
A heap can be used but not a
balanced binary search tree
A data structure is required for storing a set of integers such 2.
that each of the following operations can be done in (log n) A balanced binary search
time, where n is the number of elements in the set. tree can be used but not a
o Delection of the smallest element heap
o Insertion of an element if it is not already present in the 3.
set Both balanced binary search
Which of the following data structures can be used for this tree and heap can be used
4.
purpose?
Neither balanced binary
search tree nor heap can be
used

1.
5 states
2.
10 states
A decimal counter has 3.
15 states
4.
20 states

1.
noncoded information into
coded form
2.
coded information into
A decoder converts ________. noncoded form
3.
HIGHs to LOWs
4.
LOWs to HIGHs

1.
one data input and a number
of selection inputs, and they
A demultiplexer has ________. have several outputs
2.
one input and one output
3.
 162
several inputs and several
outputs
4.
several inputs and one
output

1.
n states
2.
tri state
A flipflop can maintain a 3.
binary state
4.
octa state

1.
two inputs and two outputs
2.
A full subtractotwo inputs and two outputsr circuit requires two inputs and three outputs
________. 3.
three inputs and one output
4.
three inputs and two outputs

1.
counter
2.
register
A group of binary cells is called 3.
latch
4.
flipflop

1.
Data Rate
2.
A leaky bucket algorithm shapes bursty traffic into fixed-rate Average Rate
traffic by averaging the 3.
Traffic Rate
4.
Traffic Shaping

1.
stack pointer
2.

A memory buffer used to accommodate a speed differential is

• cache
called
3.
accumulator
4.
disk buffer
 163
1.
stack pointer
2.
A memory buffer used to accommodate a speed differential is cache
called 3.
accumulator
4.
disk buffer

1.
function call
2.
object
A message is much more general than a ______. 3.
class
4.
state

1.
Read
2.
Write
A microprogram is sequencer perform the operation ? 3.
Read and Write
4.
Read and Execute

1.240

2.
A multi-dimensional array array[0:2, 10:20, 3:4, -10:2]
858
contains _________ elements. 3.390

4.160

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

It helps to reduce the

number of page faults in
page replacement
algorithms.
 164
1.
5Mbps
A network with Bandwidth of 10 Mbps can pass only an 2.
average of 12000 frames per minute with each frame carrying 10Mbps
an average of 10000 bits. What is the throughput of this 3.
network 2Mbps
4.
100Mbps

1.
cannot be made to execute in
any area of storage other
than the one designated for
it at the time of its coding or
translation.
2.can itself performs the
A non-relocatable program is one which
relocation of its address-
sensitive portions.

3.consists of a program and

relevant information for its
relocation.

4.None of the above

1.
Denormalized number
2.
A number in scientific notation, that has no leading 0s is called Normalized number
a 3.
Integers
4.
Whole number

1.
Control Packet
2.
A packet which is sent by a node to source to inform it of Congestion Packet
congestion is called 3.
Change Packet
4.
Choke Packet

1.
when the page is not in the
memory
2.
when the page is in the
A page fault occurs ? memory
3.
when the process enters the
blocked state
4.
 165
when the process is in the
ready state

1.
A process executes the code 3
fork(); 2.
4
fork(); 3.
fork(); 7
The total number of child processes created is 4.
8

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

1.
4
A RAM chip has a capacity of 1024 words of 8 bits each (1K 2.
5
× 8). The number of 2 × 4 decoders with enable line needed to 3.
construct a 16K × 16 RAM from 1K × 8 RAM is 6
4.
7

1.
This algorithm is equivalent
to the first-come-first-serve
algorithm
A scheduling algorithm assigns priority proportional to the 2.
waiting time of a process. Every process starts with priority This algorithm is equivalent
zero (the lowest priority). The scheduler re-evaluates the to the round-robin
algorithm.
process priorities every T time units and decides the next 3.
process to schedule. Which one of the following is TRUE if This algorithm is equivalent
the processes have no I/O operations and all arrive at time to the shortest-job-
zero? first algorithm..
4.
This algorithm is equivalent
to the shortest-remaining-
time-first algorithm

1.
Monitor
A self contained block of statements that perform a coherent
2.
task of some kind is called a? Function
3.
 166
Program
4.
Structure

1.
Disk Space
2.
Address Space
A set of physical addresses is also known as 3.
Memory Space
4.
Locations

1.
analysis
A social scientists spends a considerable time observing and 2.
ethnographic analysis
analysing how people actually work is said to be 3.
____________ usecase analysis
4.
design verification

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

1.
assembler
2.
A system program that sets up an executable program in main linker
memory ready for execution is
3.
compiler
4.
loader

A system uses FIFO policy for page replacement. It has 4 page 1.

frames with no 196
pages loaded to begin with . The system first accesses 100 2.
197
distinct pages in some 3.
order and then accesses the same 100 pages but now in the 194
reverse order .How 4.
many page faults will occur ? 198

1.
A system which supports _______ allows object classes to
Multi path inheritance
inherit from several super-classes 2.
 167
Hierarchical inheritance
3.
Multiple inheritance
4.
Simple Inheritence

1.
On per-thread basis, the OS
maintains only CPU register
state
A thread is usually defined as a ‘light weight process’ because 2.
an operating system (OS) maintains smaller data structures for The OS does not maintain a
a thread than for a process. In relation to this, which of the separate stack for each
thread
followings is TRUE? 3.
On per-thread basis, the OS
does not maintain virtual
memory state
4.
On per thread basis, the OS
maintains only scheduling
and accounting information.

1.
Poor change management
According to a statistical report: “over 30% of all software 2.
Poor requirements
projects are cancelled before completion and over 70% of the
management
remainder fail to deliver expected features”. What must be the 3.
reason for such a situation? Poor quality control
4.
All of the mentioned

1.
x
2.
1
According to Boolean algebra x.x is equal to 3.
0
4.
x'

1.
1
2.
0
Adder subtractor operating on mode 1 at (X xor 1) gives 3.
x
4.
x'

1.
Addition of -6 and -13 11101101
2.
 168
11101010
3.
11101110
4.
11111010

1.
Indirect
2.
Addressing mode used in instruction Base
add r1,r2,r3 is 3.
Register
4.
Immediate

1.
0
2.
9
After 9 counts BCD counter goes back to 3.
1
4.
10

After the following code fragment, 1.0

what is the value in fname?
2.2
String str;
int fname; 3.-1
str = "Foolish boy.";
fname = str.indexOf("fool"); 4.4

1.
Ethanography
2.
All key stakeholders gathers together for a short but intensely Requirement workshop
focused period for ____ 3.
Interviewing
4.
Business meeting

1.
are private
All the wrapper classes (Integer, Boolean, Float, Short, Long, 2.
Double and Character) in java are serializable
3.
are immutatable
4.
are final

1.
An empty list is one which has no nodes
2.
 169
data
3.
nodes and data
4.
address

1.
noncoded information into
coded form
2.
coded information into
An encoder converts ________. noncoded form
3.
HIGHs to LOWs
4.
LOWs to HIGHs

1.
x-1
2.
x+1
An identity element w.r.t addition 3.
x-0
4.
x+0

1.
Vectored interrupt
2.
Non-maskable interrupt
An interrupt that can be temporarily ignored is 3.
Maskable interrupt

4.
High priority interrupt

1.
maskable interrupt
An interrupt that is reserved for unrecoverable memory errors 2.
non maskable interrupt
is called……
3.
Both (1) & (2)

4.
None of the above

1.
throw away prototype
2.
An__________, start with the best understood parts evolutionary prototype
3.
design prototype
4.
 170
coding prototype

1.
invert OR
2.
AND invert
AND gates are converted to NAND gates using 3.
NAND invert
4.
NOR

1.
The subnet masks are
different
2.
Anshi's IP address is 192.168.1.21 and uses mask of Because they are in different
255.255.255.240. Jenny's IP is 192.168.1.14/28. Their subnets.
computers are connected together using a crossover Ethernet 3.
cable. Why can' they ping each other? Because the router does not
support subnetting
4.
Because it should be a
straight through cable.

1.
zero
2.
one
Any number with an exponent of zero is equal to: 3.
that number
4.
ten

1.
Real Time
Applications like Banking and reservations require which type 2.
Hard Real Time
of OS? 3.
Soft Real Time
4.
None of the above

1.
2, 4, 5, 1, 6, 3
2.
4, 2, 5, 1, 3, 6
Arrange the following steps to form a basic/general
Engineering Process Model
1. Test, 2. Design, 3. Install, 4. Specification, 3.
5. Manufacture, 6. Maintain 2, 4, 5, 1, 3, 6

4.
4, 2, 5, 1, 6, 3
 171
1.
x'
2.
x
As per Boolean algebra theorem (x')' is equal to 3.
1
4.
0

1.
African standard code for
information interchange
2.
American standard code for
integer interchange
ASCII stands for 3.
American standard code for
information interchange
4.
African standard code for
integer interchange

1.
1111011
2.
1111001
Assign the proper odd parity bit to the code 111001. 3.
0111111
4.
0011111

Assume that a File is an abstract class and has toFile() method. 1.

ImageFile and BinaryFile are concrete classes of the abstract Binary File
class File. 2.
Image File
Also, assume that the method toFile() is implemented in both 3.
Binary File and Image File. Which implementation method Both File and Binary Files
will be called when a File references an ImageFile object in 4.
none
memory and the toFile method is called?

1.
interest = 3929.92
Assume that the value 3929.92 is of type ‘float’. How to 2.
interest = (Float)3929.92
assign this value after declaring the variable ‘interest’ of type 3.
float? interest = 3929.92 (float)
4.
interest = 3929.92f

Assume that there are 3 page frames which are initially empty. 1.
If the page reference string is 1, 2, 3,4, 2, 1, 5, 3, 2, 4, 6, the 5
number of page faults using the optimal replacement policy 2.
is__________. 6
 172
3.
8
4.
7

1.
After thread A is notified, or
after two seconds.
2.
Assume the following method is properly synchronized and After the lock on B is
called from a thread A on an object B: released, or after two
wait(2000); seconds.
After calling this method, when will the thread A become a 3.
candidate to get another turn at the CPU? Two seconds after
thread A is notified.
4.
Two seconds after lock B is
released.

1.
time
2.
Asynchronous sequential logic circuits are used when primary pressure
need is 3.
speed
4.
accuracy

1.
operations only

At Conceptual level Class diagrams should include: 2.

attributes only
3.constants 4.
Variables

1.
enabled
2.
stored
At start of addition carry flag is 3.
cleared
4.
loaded

1.
top
2.
At start of lamp handball game ball (indicator lamp) is placed left
at 3.
bottom
4.
right
 173
1.
binary counter design
2.
binary counter decimal
BCD stands for 3.
binary coded design
4.
binary coded decimal

1.
decoder
2.
encoder
BCD to 7 segment is 3.
mux
4.
demux

1. threads

2.none of the mentioned

Because of virtual memory, the memory can be shared among:
3.instructions

4.processes

1.
AND gate
2.
OR gate
Besides nand gate universal gate is 3.
NOR gate
4.
XOR gate

1.
Two Bits
2.
Binary code that distinguishes ten elements must contain at Three Bits
least 3.
Four Bits
4.
Five Bits

1.
up-down counter
2.
Binary counter that count incrementally and decremently is LSI counters
called 3.
down counter
4.
up counter

Binary logic consists of binary values and 1.

 174
Arithmetic operations
2.
Logical operations
3.
Numeric operations
4.
Addition operations

1.
T flipflop
2.
JK flipflop
Binary ripple counter is made up of 3.
RS flipflop
4.
T and JK flip flop

1.
y>x
2.
x=y
Borrow in two bit (x,y) subtraction is 0, as long as 3.
x>=y
4.
y>=x

1.
1
2.
2
By default counters are incremented by 3.
3
4.
4

1.
CPU and RAM
2.
RAM and ROM
Cache memory acts between 3.
CPU and Hard Disk
4.
CPU and ROM

1.
has greater capacity than
RAM
2.
is f aster to access than CPU
Cache memory- Registers
3.
is permanent storage
4.
faster to access than RAM
 175
1.
first variable
2.
second variable
Change in state from 00 to 11 will cause change in 3.
third variable
4.
all variables

1.
pulse transition
2.
outputs
Change is state occurs during 3.
clock pulses
4.
inputs

1.
61
2.
62
Characters that can be specified in 6-bit code are 3.
63
4.
64

1.
combinational circuit
2.
Circuits that employs memory elements in addition to gates is sequential circuit
called 3.
combinational sequence
4.
series

1.
object
2.
structural
Class diagram is a ___________aspect of collaboration 3.
behavioral
4.
model

1.
class X implements Runnable Thread t = new Thread(X);
{ 2.
Thread t = new Thread(X);
public static void main(String args[])
t.start();
{ 3.
/* Missing code? */ X run = new X(); Thread t =
} new Thread(run); t.start();
public void run() {} 4.
 176
} Thread t = new Thread();
Which of the following line of code is suitable to start a thread x.run();
?

1.
Multiple
2.
class X, class Y and class Z are derived from class BASE. This Multilevel
is _____________ inheritance 3.
Hierarchical
4.
Single

1.
feedback path
2.
gates
Classification of sequential circuit depends on timings of their 3.
signals
4.
complex circuits

1.
feedback path
2.
gates
Clock generator, generates periodic train of 3.
clock pulses
4.
sine pulses

1.
AND-OR gates
2.
AND gates
Code conversion circuits mostly uses
3.
OR gates
4.
XOR gates

1.
BCD code
Code not included in code conversion standard is 2.
gray code
3.
 177
excess3 code
4.
truth table

1.
overflows
2.
Combinations that are not listed for input variables carry
are 3.
dont cares
4.
zero bits

1.
undefined
2.
shifted
Connection from output to one of input gate is
3.
feedback
4.
wire

Consider a disk system with 100 cylinders. The

requests to access the cylinders 1.95ms
occur in following sequence :
4, 34, 10, 7, 19, 73, 2, 15, 6, 20 2.119 ms
Assuming that the head is currently at cylinder 50,
what is the time taken to 3.233 ms
satisfy all requests if it takes 1 ms to move from one
cylinder to adjacent one and 4.276 ms
shortest seek time first policy is used ?

1.
Immediate Addressing
Consider a hypothetical processor with an instruction
of type LW R1, 20(R2), which during execution reads 2.
a 32-bit word from memory and stores it in a 32-bit Register Addressing
register R1. The effective address of the memory
location is obtained by the addition of a constant 20
and the contents of register R2. Which of the following 3.
best reflects the addressing mode implemented by Register Indirect Scaled
this instruction for operand in memory. Addressing
4.
Base Indexed Addressing
 178
1.
First-come-First-Served
2.
Consider a set of n tasks with known runtimes , r1
Round-Robin
r2...... rn to be run on a uniprocessor machine. Which
of the following processor scheduling algorithms 3.
SJF
will result in the maximum throughput ?
4.
Highest-Response-Ratio-
Next

1.
7
Consider a system having m resources of the same 2.
type. These resources are shared by 3 processes A, B 9
and C which have peak demands of 3, 4 and 6
respectively. For what value of m deadlock will not 3.
occur ? 10
4.
13

1.
Consistent

Consider the following Statement: “The output of 2.

a program shall be given within 10secs of event X Verifiable
10% of the time”. What characteristic of SRS is
being depicted here?
3.
Non-verifiable
4.
Correct

1.
Consider the following code fragment: u = x + 10 and v = y

if (fork() == 0)
{ a = a + 5; printf("%d,%d\n", a, &a); } 2.
else { a = a –5; printf("%d, %d\n", a, &a); } u = x + 10 and v != y
3.
u + 10 = x and v = y
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
4.
the following is TRUE?
u + 10 = x and v != y

Consider the following code snippet. What will be 1.

assigned to the variable fourthChar, if the code is ‘a’
 179
executed? 2.
'v'
String str = new String(“Java”); 3.
char fourthChar = str.charAt(4); null characater
4.
throws
StringIndexOutofBoundsE
xception

Consider the following sequence of micro-

operations. 1.Instruction fetch

MBR ← PC
2.Operand fetch
MAR ← X

PC ← Y 3.Conditional branch

Memory ← MBR
4.Initiation of interrupt
Which one of the following is a possible operation service
performed by this sequence?

1.
Context switch time is
longer for kernel level
threads than for user level
threads
2.
Related kernal level
Consider the following statements about user level thread can be scheduled
threads and kernel level on different processors in
a
threads. Which one of the following statements is
multiprocessor system
FALSE? 3.
User level threads do not
need any hardware
support
4.
Blocking one kernel level
thread blocks all related
threads

Consider the following table of arrival time and

burst time for three processes P0, P1 and P2.
1.5.0 ms
Process Arrival time Burst Time
2.4.33 ms
P0 0 ms 9 ms

P1 1 ms 4 ms 3.6.33

P2 2 ms 9 ms
4. 7.33
The pre-emptive shortest job first scheduling
algorithm is used. Scheduling is carried out only at
 180
arrival or completion of processes. What is the
average waiting time for the three processes?

Consider the virtual page reference string

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

Consider three CPU-intensive processes, which 1.

require 10, 20 and 30 time units and arrive at times 1
0, 2 and 6, respectively. How many context switches 2.
are needed if the operating system implements a 2
shortest remaining time first scheduling algorithm? 3.
Do not count the context switches at time zero and 3
4.
at the end.
4

Consider three processes (process id 0, 1, 2 1.

respectively) with compute time bursts 2, 4 and 8 13 units
time units. All processes arrive at time zero. 2.
14units
Consider the longest remaining time first (LRTF)
3.
scheduling algorithm. In LRTF ties are broken by 15 units
giving priority to the process with the lowest 4.
process id. The average turn around time is: 16 units

Consider three processes, all arriving at time zero,

with total execution time of 10, 20 and 30 units,
respectively. Each process spends the first 20% of
execution time doing I/O, the next 70% of time
1. 0%
doing computation, and the last 10% of time doing
I/O again. The operating system uses a shortest
2. 89.4%
remaining compute time first scheduling algorithm
and schedules a new process either when the 3.10.6%
running process gets blocked on I/O or when the
running process finishes its compute burst. Assume 4.30.0%
that all I/O operations can be overlapped as much
as possible. For what percentage of time does the
CPU remain idle?

Constraints on the services or functions offered by 1.

the system such as timing constraints, constraints Functional requirements
 181
on the development process, standards, etc refers 2.
to _________ Non
functional requirement
3.
Benchmarks
4.
ISO standards

1.
shift
2.
Control of shift register labeled as SH/LD =0 will store
3.
load
4.
add

1.
shift
2.
Control of shift register labeled as SH/LD =1 will store
3.
load
4.
add

1.
reset signal
2.
Control unit in serial computer generates a word-time signal
3.
word signal
4.
clear signal

1.
0.1011
2.
Convert (0.6875)10 to binary 0.1011
3.
0.0101
4.
0.0111

1.
EE216
2.
Convert binary 111111110010 to hexadecimal. FF216
3.
2FE16
4.
FD216
 182
1.
0.625
2.
Convert the fractional binary number 0000.1010 to 0.50
decimal. 3.
0.55
4.
0.10

1.
1.40
2.
Convert the fractional binary number 0001.0010 to 1.125
decimal. 3.
1.20
4.
1.80

1.
0111.1100
2.
Convert the fractional decimal number 6.75 to 0110.1010
binary. 3.
0110.1100
4.
0110.0110

1.
1111 1111 1111 1111
1111 1000 0000 000
2.
1111 1111 1111 1111
Converting (-2047)10 into a 32-bit 2 1111 1000 0000 1111
3.
1111 1111 1111 1111
1111 1000 1111 000
4.
0000 1111 1111 1111
1111 1000 0000 000

1.
Commercial Off-The-Shelf
systems
2.
Commercial Off-The-Shelf
COTS stands for_____ states
3.
Commercial Off-The-
System state
4.
Commercial
Off The System
 183
1.
valid counters
2.
Counters that transfer invalid states to valid states self starting counters
are called 3.
invalid counters
4.
undefined counters

1.
program counter
2.
CPU fetches the instruction from memory according status register
to the value of: 3.
instruction register
4.
program status word

1.
Output stream

2.
DataInputStream is an example of I/O stream
3.
Filtered stream
4.
File stream

1.
1 input line
2.
Decimal digit in BCD can be represented by 2 input lines
3.
3 input lines
4.
4 input lines

1.
input
2.
Decimal digits are displayed on output
3.
7 segment
4.
flip flop

1.
110
2.
Decimal number 4 in excess-3 coding is 111
3.
1100
4.
1110
 184
1.
1011
2.
Decimal number 5 in 2421 coding 1001
3.
1010
4.
1100

1.
clear time
2.
Definite time in a flipflop is called pulse time
3.
hold time
4.
reset time

1.
large memory
2.
Delay elements provide outputs
3.
clock pulses
4.
short term memory

1.
(x.y)'=x'y'
2.
Demorgan law over addition is (x+y)'=x+'y'
3.
(x+y)'=x'y'
4.
(x+y)'=x'

1.
10.24 kHz
Determine the output frequency for a frequency 2.
division circuit that contains 12 flip-flops with an 5 kHz
input clock frequency of 20.48 MHz. 3.
30.24 kHz
4.
15 kHz

1.
'//'
2.
Determine which of the following is valid character '\0'
constant ? 3.
'xyz'
4.
'\052'
 185
1.
programmers
2.
Different ___________ may have conflicting designers
requirements 3.
stakeholders
4.
analysts

1.
8
2.
Digital no system is said to be of base or radix 10
3.
2
4.
16

1.
multiple source
2.
Dijkstra algorithm is also called the ...................... single source
shortest path problem. 3.
single destination
4.
multiple destination

1.
Deadlock recovery
2.
Dijkstra’s banking algorithm for resource allocation Deadlock avoidance
3.
is used for
Deadlock detection

4.
Deadlock prevention

1.
1
2.
Down counter decrement value by 2
3.
3
4.
4

1. onlineexam.t
During a class inheritance in CPP, if the visibility
mode or mode 2.protected
of derivation is not provided,
3.private
then by default visibility mode is___________.
4.friend
 186
1.
IR
2.
During the execution of a program which gets MAR
initialized first? 3.
PC
4.
MDR

1.
Cache

2.
During transfer of data between the processor and TLB
memory we use ______
3.
Buffers

4.
Registers

1.
commutative property
2.
e*x=x*e=x is the inverse property
3.
associative property
4.
identity element

1.
1
2.
Each gate has a delay of 2
3.
3
4.
4

1.
1 to 5 ns
2.
Each logic gate gives delay of 2 to 10 ns
3.
3 to 10 ns
4.
3 to 5 ns

1.
Effect of change of input to more than one state is undefined condition
called 2.
race condition
3.
 187
reset condition
4.
ideal condition

1.
hit ratio
2.
Effective access time is directly proportional to: memory access time
3.
page-fault rate
4.
none of the mentioned

1.
Flow of Traffic
2.
Effective bandwidth is bandwidth that network Flow of Data
needs to allocate for the 3.
Flow of Protocol
4.
Flow of Amount

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

1.
client
2.
Events are translated to ____ requests, which are source
sent either to the model or to the view 3.
service
4.
multiple

1.
prime function
2.
Exclusive-OR is an undefined function
3.
even function
4.
odd function

1.
worst fit is used
External fragmentation will not occur when : 2.
first fit is used
3.
 188
no matter which
algorithm is used, it will
always occur
4.
best fit is used

1.
Functional Application
Specification Technique
2.
Fast Application
FAST stands for ________ Specification Technique
3.
Facilitated Application
Specification Technique
4.
Facility Architecture
Software Test

1.
First Application Table
FAT stands for 2.
File Application Table
3.
First Allocation Table
4.
File Allocation Table

1.
stable
2.
Feedback among logic gates make asynchronous unstable
system 3.
complex
4.
combinational

1.
file system with 300 GByte disk uses a file descriptor 3 KBytes
with 8 direct bloc 2.
addresses, I indirect block address and 1 doubly 35 KBytes
3.
indirect block address. The size
280 KBytes
of each disk block is 128 Bytes and the size of each 4.
disk block address is 8 Bytes.
The maximum possible file size in this file system is dependent on the size of
the disk

Fill in the blank to compile the code successfully? 1.

onlineexam.abstract void
showA() { }
abstract class A 2.
onlineexam.void showA()
{ {}
 189
int a = 100; 3.
void showA() { }
public abstract void showA(); } 4.
onlineexam.B showA() { }

public class B extends A

_________ // Fill the blank

public static void main(String []args)

A objA = new B();

objA.showA();

1.
used to reduce waiting
time
2.
easy to understand and
First Come First Serve (FCFS) Scheduling is…….
implement
3.
impossible to implement

4.
None of the Above

1.
Preemptive scheduling
2.
First Come First Serve(FCFS) is Nonpreemptive
scheduling
3.
deadline scheduling
4.

None of the above

1.
level triggered
2.
Flipflops are edge triggered
3.
clock triggered
4.
pulse triggered
 190
1.
Boolean values
2.
Floating point representation is used to store whole numbers
3.
real integers
4.
integers

1.
16
2.
For operation of multiplication hardware needs 32
minimum ALU of 3.
64
4.
128

For the processes listed in the following table, which

of the following scheduling schemes will give the 1.
lowest average turnaround time? First Come First Serve
2.
Process Arrival Time Processing Time Non-preemptive Shortest
Job First
A 0 3
3.
B 1 6 Shortest Remaining Time
4.
C 4 4 Round Robin with
Quantum value two
D 6 2

1.
the dispatching of a task
2.
the creation of a new
Fork is process
3.
the creation of a new job
4.
increasing the priority of
a task

1.
IP Relay
2.
Four different attributes to control traffic have been Data Relay
devised in 3.
Source Relay
4.
Frame Relay

1.
Four gates in a package is called biruple
2.
 191
octruple
3.
dualruple
4.
quadruple

1.
can always be prevented
2.
occurs only if the file
system is used improperly
Fragmentation of the file system 3.
is a characteristic of all
file systems
4.
can be temporarily
removed by compaction

1.
Router
2.
Frames from one LAN can be transmitted to Repeater
another LAN via the device 3.
Modem
4.
Bridge

1.
Bulk transfer of several
kilo-byte
2.
From among the following given scenarios Moderately large data
determine the right one to justify interrupt mode of transfer but more that 1
data-transfer KB
3.
keyboard inputs
4.
Short events like mouse
action

1.
19 and 20
2.
FTP server listens to connections on port 20 and 21
3.
21 and 22
4.
20 and 22

1.
1 half adder
Full adder consists of 2.
2 half adders
3.
 192
3 half adders
4.
4 half adders

1.
Java Compiler
2.
Garbage Collection in java is done by who? Object class
3.
System class
4.
JVM

1. Consumes less power

2. has higher speed

Generally Dynamic RAM is used as main memory in
a computer system as it 3. has lower cell density

4.needs refreshing
circuitry

1.
13410
2.
Give the decimal value of binary 10000110. 14410
3.
11010
4.
12610

1.
610
2.
Give the decimal value of binary 10010. 910
3.
1810
4.
2010

Given the following code snippet;

int salaries[]; 1.
int index = 0; 10000
salaries = new int[4]; 2.
while (index < 4) 40000
{ 3.
salaries[index] = 10000;
4000
4.
index++;
15000
}
What is the value of salaries [3]?
 193
Given the following code, which line will generate an
error ?

class Test

static int x = 100; // line 3 1.

line 3
int y = 200; // line 4 2.
line 4
public static void main(String []args) 3.
line 7
{
4.
final int z; // line 7 line 8

z = x + y; // line 8

System.out.println(z);

Given the following declarations, which assignment

is legal?

// Class declarations :

interface A {}
1.
class B {} c = d;
2.
class C extends B implements A {} d = c;
3.
class D implements A {} A a = d;
4.
d = (D)c;
// Declaration statements :

B b = new B();

C c = new C();

D d = new D();

1.
Structure bolts is nested
Given the statement , maruti.engine.bolts=25 . within structure engine
Which of the following is true? 2.
Structure engine is nested
within structure maruti
3.
 194
Structure maruti is nested
within structure engine
4.
Structure maruti nested
within structure bolts

1.
Linear and Hierarchical
2.
Non-Linear and
Graphs are examples of which type of data Hierarchical
structure 3.
Linear and Non-
Hierarchical
4.
Non-Linear and Non-
Hierarchical

1.
1010
2.
Gray code representation of 14 is 1100
3.
1001
4.
1110

Group 1 contains some CPU scheduling algorithms

and Group 2 contains some applications. Match
entries in Group 1 to entries in Group 2. 1.
P–3Q–2R–1
Group I Group II
2.
(P) Gang Scheduling (1) Guaranteed P–1Q–2R–3
Scheduling 3.
P–2Q–3R–1
(Q) Rate Monotonic Scheduling (2) Real-time 4.
Scheduling P–1Q–3R–2

(R) Fair Share Scheduling (3) Thread Scheduling

1.
Declare the method with
the keyword
How can such a restriction be enforced ?
onlineexam.br>
2.
A method within a class is only accessible by classes Declare the method with
keyword protected
that are defined within the same package as the 3.
class of the method. Declare the method with
keyword private
4.
Without any accessibility
specifiers.
 195
1.
X~() {}
2.
How do we define a destructor? X() {}~
3.
X() ~{}
4.
~X() {}

1.
J = 0, K = 0
2.
How is a J-K flip-flop made to toggle? J = 1, K = 0
3.
J = 0, K = 1
4.
J = 1, K = 1

1.
Multiprocessing
2.
How is the capacity of running several program Multiprogramming
simultaneously known ? 3.
Multisystem
4.
Multi resources

1.
One

How many Scenarios are there in elicitation 2.

activities? Two
3.
Three
4.
Four

1.
8
How many 32K x 1 RAM chips are needed to provide 2.
32
a memory capacity of 256K-bytes?
3.
64
4.
128

1.
2
2.
How many numeric data types are supported in 4
Java? 3.
8
4. 6
 196
6

1.
16
2.
How many subnets are created from a Class C 128
addressing space that is using a /29 subnet mask? 3.
32
4.
64

1.
Unicast, Multicast
2.
HUB is a _________ Device and Switch is a ________ Multicast, Unicast
Device. 3.
Broadcast, Unicast
4.
None of Above

1.
Binary
2.
Human readable base representation of numbers is Decimal
3.
Hex
4.
Hexdecimal

1.
7402
2.
IC no of NOT gate 7404
3.
7401
4.
7406

1.
4 leds
2.
IC of 7 segment display contains 5 leds
3.
6 leds
4.
7 leds

1.
forwarding
2.
ICMP is primarily used for addressing
3.
error and diagnostic
functions
 197
4.
routing

1.
Doesn’t work well for
smaller projects
2.
High amount of risk
analysis
Identify the disadvantage of Spiral Model. 3.
Strong approval and
documentation control
4.
Additional Functionality
can be added at a later
date

1.
HTTP GET request, DNS
query, TCP SYN
Identify the correct sequence in which the following 2.
packets are transmitted on the network by a host DNS query, HTTP GET
when a browser requests a webpage from a remote request, TCP SYN
server, assuming that the host has just been 3.
restarted.
DNS query, TCP SYN,
HTTP GET request
4.
TCP SYN, DNS query,
HTTP GET request

1.
Indirectly mapped
2.
If a block can be placed at every location in cache, Directly mapped
this cache is said to be 3.
Fully associative
4.
Partially associative

1.
RARP
If a host broadcasts a frame that includes a source
2.
and destination hardware address, and its purpose ARPA
is to assign IP addresses to itself, which protocol at 3.
the Network layer does the host use? ICMP
4.
TCP

1.
If an Ethernet port on a router were assigned an IP 172.16.96.0
address of 172.16.112.1/25, what would be the valid 2.
subnet address of this host? 172.16.0.0
3.
172.16.112.0
 198
4.
172.16.255.0

1.
odd
2.
If an odd parity is adopted, parity bit is chosen in even
such that total no of 1's is 3.
positive
4.
negative

1.
verifiable
2.
If every requirement can be checked by a cost- traceable
effective process, then the SRS is 3.
modifiable
4.
complete

1.
cannot be done
2.
If relocation is static and is done at assembly or load must not be done
time, compaction _________. 3.
must be done
4.
can be done

1.
17, byte
2.
If result = 2 + 3 * 5, what is the value and type of 25, byte
‘result’ variable? 3.
17, int
4.
25, int

1.
1111110000
2.
If the data unit is 111111 and the divisor is 1010. In 1111111010
CRC method, what is the dividend at the
transmission before division? 3.
111111000
4.
111111

1.
If the derived class is struct, then default visibility
onlineexam.t public
mode is_______
2.
 199
protected
3.
private
4.
struct can’t inherit class

1.
331
If the disk head is located initially at 32, find the
2.
number of disk moves required with FCFS if the disk 321
queue of I/O blocks requests are 98, 37, 14, 124, 65, 3.
67. 355
4.
361

1.
First in first out
2.
If the quantum time of round robin algorithm is Lottery scheduling
very large, then it is equivalent to: 3.
Shortest Job Next
4.
None of the above

1.
WINWIN Spiral Model

2.
If you were to create client/server applications, Spiral Model
which model would you go for?

3.
Concurrent Model
4.
Incremental Model

1.
both built-in packages
and user-defined
packages into your java
source file.
2.
import only built-in
import keyword is used to? packages into your java
source file
3.
import only user-defined
packages into your java
source file
4.
None of the above
 200
1.
1st
In a men head count, a __________ head end under 2.
the armpit usually includes the shoulder and the 2nd
neck. 3.
3rd
4.
4th

1.
Vcc
2.
In 14 pin gate pin no 14 is Vdd
3.
ground
4.
AC

1.
Vcc
2.
In 14 pin gate pin no 7 is Vdd
3.
ground
4.
AC

1.
Tunnel
2.
In ____ mode, the authentication header is inserted Transport
immediately after the IP header. 3.
Authentication
4.
Both A and B

1.
evolutionary prototyping
In _____,the prototype is developed from an initial 2.
specification, delivered for experiment then throw away prototyping
discarded 3.
design prototyping
4.
user prototyping

1.
top-down testing
In _____________start with high-level system and 2.
integrate from the top-down replacing individual bottom up testing
components by stubs where appropriate 3.
sandwich testing
4.
risk oriented testing
 201
1.
UI prototype
2.
In a ________start with the least well-understood design prototype
parts 3.
throw-away prototype
4.
evolutionary prototype

1.
value in a node is greater
than every value in left
subtree and smaller than
right subtree
2.
value in a node is greater
than the values of its child
In a MAX heap tree ..... nodes
3.
value in a node is smaller
than every value in left
subtree and smaller than
right subtree
4.
value in a node is lesser
than the values of its child
nodes

1.
2 bytes
In a packet switching network, if the message size is
48 bytes and each packet contains a header of 3 2.
bytes. If 24 packets are required to transmit the 1 byte
message, the packet size is ................ 3.
Total number of bytes in message = 48 + (3 x 24) 4 bytes
Total number of bytes in message = 48 + 72
Total number of bytes in message = 120
4.5 bytes
The packet size can be calculated by dividing the total number of bytes in the message by the number of packets required:

Packet size = Total number of bytes / Number of packets

Packet size = 120 / 24 1.
Packet size = 5
initialise program
counter
2.
In a program using subroutine call instruction, it is Clear the accumulator
necessary 3.
Reset the microprocessor
4.
Clear the instruction
register

1.
No path
In a tree, between any two nodes, there is _______- 2.
Atleast one path
3.
Atmost one path

4.
Exactly one path
 202
4.
Exactly one path

1.
1
2.
In adder subtractor circuit when addition exceeds 0
from 15 output carry becomes 3.
x
4.
undefined

1.
Allocation
In an absolute loading scheme, which loader 2.
function(s) is (are) accomplished by programmer Linking
3.
Allocation and Linking
4.
Reallocation

1.
Miss
In associative mapping during LRU, the counter of 2.
the new block is set to ‘0’ and all the others are Hit
incremented by one,when _____ occurs. 3.
Delay
4.
Delayed Hit

1.
inputs
2.
In asynchronous circuits changes occur with change outputs
3.
clock pulses
4.
time

1.
meaning
2.
In BCD no. 1010 has no meaning
3.
value
4.
Vcc

1.
Backward Signaling
In Congestion Control, a bit can be set in a packet 2.
moving in direction opposite to congestion in Implicit Signaling
3.
Source Signaling
 203
4.
Data Signaling

1.
Delay Versus Line
2.
In Congestion Control, DVL stands for Delay Versus Lose
3.
Delay Versus Load
4.
Delay Versus Louden

1.
Checked
2.
In Congestion Control, packet is put at end of input Entered
queue while waiting to be 3.
Reached
4.
Controlled

1.
Control Bit Rate
2.
In Congestion, CBR stands for Constant Bit Rate
3.
Constant Byte Rate
4.
Control Byte Rate

1.
each process is contained
in a single contiguous
section of memory
2.
all processes are
contained in a single
In contiguous memory allocation : contiguous section of
memory
3.
the memory space is
contiguous
4.
the memory space is not
contiguous

In DFDs, user interactions with the system is 1.

denoted by: Circle
2.
Arrow
3.
Rectangle
4.
Triangle
 204
1.
Reminder

In division, two operands (dividend and divisor) and 2.Multiplier

answer (quotient) of divide are accompanied by a
second answer called the

3.
Divisor

4.
Trap

1.
changes
2.
In flipflop if set input is returned to 0, output inverts
3.
remain same
4.
complements

1.
Flow STCP
2.
In Integrated Services, when a source makes a Flow Control
reservation, it needs to define a 3.
Flow Specification
4.
Flow Solution

1.
DES algorithm
2.
In link state routing algorithm after the construction
of link state packets, new routes are computed
Dijkstra's algorithm
using: 3.
RSA algorithm
4.
Packets

1.
present state
2.
In mealy model outputs are functions of input state
3.
next state
4.
present and input state

1.
In moore model outputs are functions of present state
2.
 205
input state
3.
next state
4.
Present state and
inputstate

1.
0V
2.
In most of logic gates 1 means 1V
3.
5V
4.
10 V

1.
Write Virtual function in
parent classes
2.
In Multipath inheritance, in order to remove
Write virtual functions is
duplicate set of records in child class then base class
3.
Make base class as virtual
base class
4.
All of these

1.
Light Weight Process
(LWP)
2.
In Operating Systems, a single thread is termed as Heavy Weight Process
(HWP)
3.
Both (1) & (2)
4.
None of the above

1.
network layer
2.
In OSI network architecture, the dialogue control session layer
and token management are responsibilities of ? 3.
transport layer
4.
data link layer

1.
a HIGH = 1, a LOW = 0
In positive logic, ________. 2.
a LOW = 1, a HIGH = 0
3.
only HIGHs are present
 206
4.
only LOWs are present

1.
Data Flow
2.
In Quality of Service, Jitter is variation in delay for Same Flow
packets belonging to the 3.
Protocol Flow
4.
IP Flow

1.
increases
2.
In round robin CPU scheduling as time quantum is decreases
increased the average turn around time 3.
remains constant
4.
varies irregularly

1.
(00100) 2
2.
In signed-magnitude binary division, if the dividend (10100) 2
is (11100) 2 and divisor is (10011) 2 then the result is 3.
(11001) 2
4.
(01100) 2

1.
Pop
2.Push
In stack organization the insertion operation is
known as ? 3.
Down
4.
Upper

1.
0
2.
In T flipflop when state of T flipflop has to be 1
complemented T must be 3.
t
4.
t+1

1.
file names
In Unix, “cat” command is used to display …… 2.
folder names
3.
 207
file contents
4.
None of the above

1.
file name
In Unix, “file” command is used to determine …… 2.
file type
3.
file content
4.
None of the above

1.
is the hardware necessary
In virtual memory systems, Dynamic address to implement paging
translation 2.
stores pages at a specific
location on disk
3.
is part of the operating
system paging algorithm
4.
is useless when swapping
is used

1.
is the hardware necessary
to implemented paging
2.
is useless when swapping
In virtual memory systems, Dynamic address is used.
translation 3.
stores pages at a specifies
location on disk
4.
is part of the operating
system paging algorithm

1.Larger RAMs are faster

2.Virtual memory
Increasing the RAM of a computer typically increases
improves performance because:
3.Fewer page faults occur

4.Fewer segmentation
faults occur

1.
Individual components are tested is termed Regression testing
as_________ 2.
System testing
3.
 208
Module testing
4.
Sub-system testing

1.
Miss rate
Information when is written in cache, both to block 2.
in cache and block present in lower-level memory, Write-back
refers to 3.
Write-through
4.
Dirty bit

1.
attributes
Inheritance is the property of object-oriented 2.
systems that allows objects to be built from other objects
____________ 3.
method
4.
class

1.
table
2.
Instability condition can be determined from map
3.
graph
4.
logic diagram

1.
Commands
2.
Instruction that are used for reading from memory Pulses
by an IOP called ? 3.
Blocks
4.
Interrupt

1.
2
2.
int a[10] will occupy ________ number of bits in the 10
memory 3.
12
4.
20

1.
full state
Internal state and input values altogether are called 2.
total state
3.
 209
initial state
4.
output state

1.
organizational
requirement
Interoperability requirements, legislative 2.
requirements are examples of __________ Product requirements
3.
External requirements
4.
Process requirements

1.
allows processes to
synchronize activity
2.
Interprocess communication is required for all
processes

3.
is usually done via disk
drives
4.
is never necessary

1.
minimal
2.
Interrupt latency should be…… for Real Time
maximum
Operating Systems (RTOS)?
3.
zero

4.
None of the above

1.
Batch processing

2.
Interrupts form an important part of _____ systems Multitasking

3.
Real-time processing

4.
Multi-user

1.
ISO recommended international testing condition is: 200C & 65% RH
2.
 210
300C & 65% RH
3.
200C & 75% RH
4.
300C & 75% RH

1.
changed
2.
J=K=0 will make flip-flops reversed
3.
unchanged
4.
stopped

1.
Objectcodes
2.
Java source codes are compiled and converted to Assemblycodes
3.
Binarycodes
4.
Bytecodes

1.
Divide and Conquer
2.
Kruskal algorithm follows ___________ approach. Dynamic programming
3.
Greedy
4.
Backtracking

1.
unidirectional shift
register
2.
Lamp handball game uses application of bidirectional shift register
3.
serial shift register
4.
parallel shift register

1.
level triggered
2.
Latches are edge triggered
3.
clock triggered
4.
pulse triggered
 211
1.
product risk
2.
Late delivery of hardware or support software is an people risk
example for __________ 3.
technology risk
4.
organizational risk

1.
Multiport Hub
2.
Layer-2 Switch is also called Multiport Switch
3.
Multiport Bridge
4.
Multiport NIC

1.
light emitting diode
2.
LED stands for light emitting device
3.
light electronic diode
4.
light electronic device

1.
wall
2.
Left most position in lamp handball game is the fence
3.
ball
4.
indicator

Let the page fault service time be 10ms in a 1.21ns

computer with average memory access time being
20ns. If one page fault is generated for every 10^6 2.30ns
memory accesses, what is the effective access time
for the memory?
3.23ns
4.35ns

1.
t1 > t2
Let the time taken to switch between user the 2.
kernel modes of execution be t1 = t2
3.
t1 while the time taken to switch between two
t1 < t2
processes be t2. Which of the 4.
following is TRUE? nothing can be said about
the relation between t1
and t2
 212
1.
Straight line array
2.One-dimensional array
Linear arrays are also called
3.Vertical array

4.Horizontal array

1.
Design traceability
2.
Links between dependent requirements refers to Requirement traceability
_____ 3.
Source traceability
4.
Feature traceability

1.
Design
2.
Links from the requirements to the design refers to Requirements
______traceability 3.
Source
4.
Destination

1.
testing
2.
Logic probe is used for debugging
3.
monitoring
4.
controlling

1.
CPU scheduler
Long Term Scheduler is a…… 2.
process swapping
scheduler
3.
job scheduler
4.
None of the above

1.
2^m-1 states
2.
M flip-flops produces 2-1 states
3.
2^m+1 states
4.
2^m states
 213
1.to use primary memory
efficiently

2.to do intra
process communication
Main function of shared memory is:
3.to do inter
process communication

4.
to use secondary memory
efficiently

1.
2 steps
2.
Making of transition table consists of 4 steps
3.
5 steps
4.
6 steps

1.
product requirements
2.
Mandating a particular IDE, programming language process requirements
or development method are examples of ___________ 3.
organisational
requirement
4.
benchmarks

Match the following: 1.

A--->3, B---->1, C---->2
A. Repeaters 1. Data Link Layer 2.A --->2, B--->3, C--->1
B. Bridges 2. Network Layer
3.A--->3, B----->2, C---->1
C. Routers 3. Physical Layer
4.A---->1, B---->2, C---->3

Match the following:

1.
1. Segments A. Associated with Data 1--->A; 2---->B; 3 --->C
Link Layer 2.
1--->A; 2---->C; 3 --->B
2. Packets B. Associated with Network
3.
Layer 1--->C; 2---->A; 3 --->B
3. Frames C. Associated with Transport 4.
1--->C; 2---->B; 3 --->A
Layer

MAX heap can be used to sort the data in an 1.

____________ Ascending order
2.
 214
Descending order
3.
Both ascending or
descending order
4.
Random order

1.
standard sum
2.
Maxterms are also called standard product
3.
standard division
4.
standard subtraction

1.
Scroll in, Scroll out
2.
Fetch in, Fetch out
Medium term scheduler is based on
3.
Swap in, Swap out
4.
None of the above

1.
not used
in modern operating
system

2.
replaced with virtual
memory on current
Memory management is : systems
3.
not used on
multiprogramming
systems

4.
critical for even the
simplest operating
systems

1.
ROM
2.
Memory that is called a read write memory is EPROM
3.
RAM
4.
Registers

Memory unit accessed by content is called 1.

 215
Read only memory
2.
Programmable Memory
3.
Virtual Memory
4.
Associative Memory

1.
Shell
2.
Message queuing is managed by? Kernel
3.

Fork
4.
None of the above

1.
5
2.
Minimum number of queues required for priority 4
queue implementation? 3.
3
4.
2

1.
white box testing
2.
Misunderstandings between software users and testing
developers are exposed by _________ 3.
coding
4.
prototypying

1.
feedback path
2.
Momentary change in state of flipflop is called tri state
3.
signals
4.
trigger

1.
parenthesis
2.
Most preceded operator is AND
3.
OR
4.
NOT
 216
1.
overflow
2.
Most significant bit of arithmetic addition is called carry
3.
output
4.
zero bit

1.
5V
2.
Mostly gates works on 4V
3.
3V
4.
2V

1.
To remove ambiguity and
provide more
maintainable and clear
design.
Multiple inheritance is not supported in Java 2.
because? Java is a Object oriented
language.
3.
Multiple inheritance is not
an important feature.
4.
All of above

1.
inverted or function
2.
Multiple variable xor is defined as prime function
3.
even function
4.
odd function

1.
Are easier to develop
than single programming
systems
2.
Execute each job faster
Multiprogramming systems:
3.
Are used only one large
mainframe computers.
4.
Execute more jobs in the
same time period
 217
1.
Memento View
Controller
2.
MVC stands for ______ Model View Controller
3.
Model View Component
4.
Movie View Controller

1.
transition table
2.
Naming states is done in stable state
3.
flow table
4.
excitation table

1.
1
2.
NAND latch works when both inputs are 0
3.
inverted
4.
dont cares

1.
clock
2.
negative edge
Negative transition in flip-flops are referred to as 3.
positive edge
4.
positive edge and
negative edge

1.
B(t-1)
2.
Next state of B(t) will be B(t+1)
3.
B(t-2)
4.
B(t+2)

1.
7000
2.
No of NAND gate is 7200
3.
7400
4.
 218
7800

1.
and function
2.
Nor function is dual of or function
3.
xor function
4.
nand function

1.
AND gate
2.
Not operation is obtained by using one input OR gate
3.
NAND gate
4.
XOR gate

1.
Methods
2.
Nouns in the textual description are considered to Class
be _______. 3.
File
4.
Node

1.
Classes
2.
Objects are grouped into ______ Methods
3.
Procedures
4.
Records

1.
Normalized system
2.
Old, valuable systems must be maintained and Concurrent systems
updated are termed as___________ 3.
Distributed systems
4.
Legacy systems

1.
byte
2.
One hex digit is sometimes referred to as a(n): nibble
3.
grouping
4.
 219
instruction

1.
commutative
2.
One that is not postulate of Boolean algebra duality
3.
associative
4.
identity element

1.
x+(y.z)=(x.y)+(x.z)
2.
One that shows distributive law of addition over x+(y.z)=(x+y).(x+z)
multiplication 3.
x+(y.z)=(x.y).(x+z)
4.
x.(y+z)=(x+y).(x+z)

1.
One to Many model
One userlevel thread is mapped to many kernel 2.
level thread is known as…. One to One model
3.
Many to One model
4.
None of the above

1.
each process
2.
Operating System maintains the page table for: each thread
3.
each instruction
4.
each address

1.
invert OR
2.
OR gates are converted to NAND gates using AND invert
3.
NAND invert
4.EX-OR

1.
x and y
2.
Outputs of SR latch are a and b
3.
s and r
4.
q and q'
 220
1.
Out-of-Order Ones
2.
Packets wait in a buffer (queue) until node is ready First-in First out
to process them in 3.
Out-of-Reach Ones
4.
First-in-First Ones

1.
When a requested page is
in memory
2.
When a requested page is
Page fault occurs when not in memory
3.
When a page is corrupted
4.
When an exception is
thrown

1.
is a sign of an
efficient system
2.
should be the
tuning goal
Page stealing 3.
is taking page
frames from other
working sets

4.
Dis taking larger disk
spaces for pages paged
out

1.

A. Presence
Page table level that says if page has been modified,
is known as
2.
Dirty
3.Read/Write 4.
Page size

1.
1 cycle
2.
Parallel load transfer is done in 2 cycle
3.
3 cycle
4.
4 cycle
 221
1.
detection
2.
Parity checker is used for testing
3.
debugging
4.
error

1.
instruction pointer
2.memory pointer
PC Program Counter is also called ................... 3.
data counter
4.
file pointer

1.
Frames

Physical memory is divided into sets of finite size 2.Pages

called as ______ .
3.
Blocks
4.

Vectors

1.
fetch instruction
2.
Pipeline implement decode instruction
3.
fetch operand
4.
calculate operand

1.
programmable lead array
2.
programmable logic
PLA stands for agency
3.
predicted logic array
4.
programmable logic array

1.
product
poor relationships amongst team member is 2.
________risk people
3.
business
 222
4.
technology

1.
to allow starving
processes to run
2.
Pre-emptive scheduling is the strategy of before the CPU time slice
temporarily suspending a running process expires
3.
when it requests I/O
4.
to avoid collision

Predict Output, if the below code is run with given command?

Command Line : java myprog good morning everyone

1.
myprog

public class myprog 2.

good
{
3.
public static void main(String argv[]) morning
{ 4.
System.out.println(argv[1]) everyone

}
}

Predict the output of following C++ program

#include
using namespace std;
1. A non-zero value
class Empty {}; 2. Compiler Error
3. Runtime Error
int main()
{
cout << sizeof(Empty);
return 0;
}

Predict the output of following program. 1.Compiler Error in show()

#include because x is protected in
using namespace std; class A
class A
{ 2. Compiler Error in show()
protected: because y is private in class b
 223
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.
secondary variables
2.
primary variables
Present states of asynchronous circuits are also called
3.
excitation variables
4.
short term memory

1.
Global
2.
Local
Prim's algorithm follows ___________ search
3.
Binary
4.
Linear

1.
map
2.
logic gates
Primed or unprimed variable is
3.
literal
4.
graph
 224
1.
Program Control Block
2.
Process Control Block (PCB) is also called…… Memory Control Block
3.
Task Control Block
4.
None of the above

1.
Bounded Buffer Problem
2.
Producer – Consumer problem, one of the classical problems of Readers Writers Problem
synchronization is
3.
also called……
Dining Philosophers
Problem

4.
None of the above

1.
110111
2.
110011
Product of 1011 and 101
3.
111011
4.
111100

1.logical address

2. physical address
Program always deals with:
3.absolute address
4.
relative address

1.
requirements validation
2.
Prototyping is an important technique of ____________
requirement specification
3.
feasibility study
 225
4.
coding

1.
interrupt recognised
2.
execution of RST instruction
PSW is saved in stack when there is a
3.
Execution of CALL instruction
4.
Execution of RET instruction

1.
public class MyRunnable implements Runnable new
{ Runnable(MyRunnable).start();

public void run() 2.

new Thread(MyRunnable).run();
{
3.
// some code here new Thread(new
} MyRunnable()).start();

} 4.
new MyRunnable().start();
which of these will create and start this thread?

1.
in time
2.
with acceptable quality
Purpose of process is to deliver software
3.
that is cost efficient
4.
both a & b

1.
synchronous logic circuit
2.
asynchronous logic circuit
Race condition is present in
3.
ideal logic circuit
4.
both a and b
 226
1.
critical race
2.
identical race
Race in which stable state depends on order is called
3.
non critical race
4.
defined race

1.
input
2.
Rate of movement of light in lamp handball game is frequency
determined by clock's 3.
voltage
4.
current

1.
NAND-NOR
2.
NAND-OR
Rather than AND-OR gates combinational circuits are made by
3.
OR only
4.
AND only

1.
Circular definition
2.
Complex definition
Recursion is sometimes called ?
3.
Proceedure
4.
Union

1.
reduction
2.
Reduction of flip-flops in a sequential circuit is referred to as state reduction
3.
next state
4.
 227
Assignment

1.
as an alternative to register
allocation at compile time

2.
Register renaming is done in pipelined processors for efficient access to function
parameters and local variables

3.to handle certain kinds of

hazards

4.
as part of address translation

1.
timing diagram
2.
Relationship between clock output and master slave output map
gives 3.
chart
4.
table

1.
design constraint
2.
Reliability, Response time and Storage requirements are functional requirement
examples of ____ 3.
non functional requirement
4.
process standard

1.
1000_0111_1110_0000
2.
Representation of 8620 in binary is 1000_0110_0010_0000
3.
1000_0110_1010_0000
4.
1011_0110_0010_0000

1.
The waterfall model
2.
Requirements can be refined using: prototyping model
3.
the evolutionary model
4.
the spiral model
 228
1.
Mutable requirements
2.
Requirements that change due to the system’s environment is Compatibility requirements
said to be _______ 3.
Emergent requirements
4.
Consequential requirements

1.
Mutable requirements

Requirements that emerge as understanding of the 2.Emergent requirements

system develops is termed as_________
3.
Consequential requirements
4.
Compatibility requirements

1.
stable requirement
2.
Requirements which change during development or when the volatile requirement
system is in use are said to be _____________ 3.
functional requirement
4.
non functional requirement

1.
design constraint
2.
Requirements which specify that the delivered product must product requirement
behave in a particular way is ________ 3.
organisational requirement
4.
external requirement

1.
Loader
Resolution of externally defined symbols is performed by 2.
Assembler
3.
Linker
4.
Compiler

1.
mutual exclusion
Resources are allocated to the process on non-sharable basis is 2.
circular wait
3.
hold and wait
4.
no pre-emption
 229
1.
Boolean equation
2.
Ripple counter can not be described by clock duration
3.
graph
4.
flow chart

1.
SSI counters
2.
Ripple counters are also called asynchronous counters
3.
synchronous counters
4.
VLSI counters

1.
spiral
2.
Risks are explicitly assessed and resolved throughout the prototyping
process in ______model 3.
prototyping
4.
waterfall

1.
FIFO
Round robin scheduling is essentially the preemptive version 2.Shortest job first
of ________ ?
3.Shortest remaining

4.Longest time first

1.
Real Time Operating Systems
2.
Embedded Operating Systems
Round Robin(RR) scheduling algorithm is suitable for…… 3.
Distributed Operating Systems
4.

Time Sharing Operating Systems

1.
2 inputs
2.
RS flipflop works on 3 inputs
3.
4 iputs
4.
5 inputs
 230
1.
memory management unit
2.
Run time mapping from virtual to physical address is done by: PCI
3.
CPU
4.
semaphore tool

1.
accessing virtual function through
the pointer of base class.
2.
Runtime polymorphism can be achieved by by accessing virtual function
through the object
3.
Accessing physical function.
4.
none of these

1.
encoder
2.
Serial adder can be converted to serial adder subtract or using demux
3.
multiplier
4.
mode control

1.
shift register
2.
Serial addition can be done with serial load
3.
load
4.
ring shift register

1.
feedback shift register
2.
Shift register whose input is connected to select output is bidirectional shift register
called 3.
unidirectional shift register
4.
ring shift register

1.
2 clock pulses
Shift registers having four bits will enable shift control signal 2.
for 3 clock pulses
3.
4 clock pulses
4.
 231
5 clock pulses

1.
counter
2.
Simplest registers only consists of EPROM
3.
latch
4.
flipflop

1.
c=xy+xz+yz
2.
Simplified expression of full adder carry is c=xy+xz
3.
c=xy+yz
4.
c=x+y+z

1.
c=xy+x
2.
Simplified expression of half adder carry is c=y+x
3.
c=xy+y
4.
c=xy

1.
productivity
2.
Software must be usable by the users for which it was usability
designed is termed as ____________ 3.
reliability
4.
efficiency

1.
productivity
2.
Software should not make wasteful use of system resources is usability
termed as_________ 3.
efficiency
4.
reliability

1.
larger than the hole itself
2.
Sometimes the overhead of keeping track of a hole might be : larger than the memory
3.
very small
4.small or big depends on os
 232
1.
1 input
2.
SR latch consists of 2 inputs
3.
3 inputs
4.
4 inputs

1.
Software requirements definition
2.
SRD stands for: Structured requirements definition
3.
Software requirements diagram
4.
Structured requirements diagram

1.
Y=x
2.
Stable condition in transition table is given by expression X=x
3.
Y=y
4.
X=y

1.
Last in First out
2.
STACK IS ALSO CALLED First In last Out
3.
First In First Out
4.
Last In Last Out

1.
LAN
2.
Star topology is used in WAN
3.
MAN
4.
Internetwork

1.
input signal
2.
State of flipflop can be switched by changing its output signal
3.
momentary signals
4.
all signals
 233
1.
requirement analysis
2.
Static analysers are software tools for ________________ diagram generators
3.
source text processing
4.
database management system

1.
enable
2.
Strobe S in a mux acts as reset
3.
clear
4.
stop

1.
requirement gathering
2.
Structured charts are a product of requirement analysis
3.
design
4.
coding

1.
output
2.
Subtraction of two binary numbers is done by taking subtract
complementing 3.
subtrahend
4.
remainder

1.
1's complement
2.
Subtraction of two signed numbers is performed with 2's complement
3.
9's complement
4.
10's complement

1.
complemented
2.
Subtractor also have output to check if 1 has been borrowed
3.
shifted
4.
primed
 234
1.
to refer to immediate child class of
a class.
2.
to refer to immediate parent class
super keyword in Java is used for? of a class.
3.
to refer to current class object.
4.
to refer to static member of parent
class.

1.
Aggregation
2.
Superclass -subclass relationships, also known as __________ Association
3.
Generalization
4.
Communication

1.
never used
2.
required to perform any I/O
3.
Supervisor state is entered by programs when they
enter the processor

4.
only allowed to the operating
system

1.
Suppose n processes, P1, …. Pn share m identical resource ∑i=1nSi< m+n
units, which can be reserved and released one at a time. The 2.
maximum resource requirement of process Pi is Si, where Si > ∑i=1nSi> n
0. Which one of the following is a sufficient condition for 3.
ensuring that deadlock does not occur? ∑i=1nSi< m*n
4.
∑i=1nSi< m

1.
clock
2.
Switch which clears flipflop to its initial state is called invert
3.
hold
4.
clear

1.
Synchronous counter is a type of SSI counters
2.
 235
LSI counters
3.
MSI counters
4.
VLSI counters

1.
is always quite simple
2.
System generation: requires extensive tools to be
understandable
3.
is always very difficult
4.
varies in difficulty between
systems

1.
Feasibility study
2.
Systematic manual analysis of the requirements are termed Requirements reviews
as______
3.
Requirements elicitation
4.
Requirements speciufication

1.
truth table
2.
Table that lists inputs for required change of states is called excitation table
3.
state table
4.
clock table

1.
system testing
2.
Testing with customer data to check that it is acceptable is module testing
termed as ________ testing 3.
acceptance testing
4.
integration testing

1.
Requirement analysis
2.
The philosophy behind __________is defect avoidance rather Design verification
than defect removal . 3.
Clean room software development
4.
Testing
 236
1.
Cast
2.
The ........ operator is a technique to forcefully convert one data Conversion
type to the other ? 3.
Type
4.
Unary

1.
Spiral model
2.
The _______ is an iterative software development process Rational Unified Process
framework created by the Rational Software Corporation 3.
Rational Prototyping
4.
Waterfall

1.
includes association
2.
The __________ is used when you have one case that is similar to extends association
another use case but does a bit more specialized 3.
fix association
4.
realize association

1.
pattern
2.
The ____________ may be used for user training before a final prototype
system is delivered 3.
architecture
4.
testcase

1.
design process
2.
The ______________ is a software development process intended business process
to produce software with a certifiable level of reliability. 3.
software engineering process
4.
cleanroom software engineering
process

1.
CM plan
2.
The ___defines the types of documents to be managed and a project plan
document naming scheme 3.
Baseline
4.
CI plan
 237
1.
Relocation
2.
The address mapping is done, when the program is initially Dynamic relocation
loaded is called ? 3.
Static relocation
4.
Executable relocation

1.
Absolute
2.
The addressing mode used in an instruction of the form ADD X indirect
Y, is 3.
register direct
4.
direct

The atomic fetch-and-set x, y instruction unconditionally sets

the memory location x to 1 and fetches the old value of x in y 1.
without allowing any intervening access to The implementation may not work
the memory location x. consider the following implementation if context switching is disabled in
of P and V functions on a binary semaphore . P.
2.
void P (binary_semaphore *s) {
Instead of using fetch-and-set, a
unsigned y; unsigned *x = &(s->value); pair of normal load/store can be
used
do { fetch-and-set x, y; } while (y);} 3.
void V (binary_semaphore *s) { The implementation of V is wrong
4.
S->value = 0;} The code does not implement a
binary semaphore
Which one of the following is true?

1.
Physical address

The binary address issued to data or instructions are called as 2.

______. Location

3.
Relocatable address
4.
Logical address

1.
protected
2.
extends Throwable
The class java.lang.Exception is 3.
implements Throwable
4.
serializable
 238
The code snippet
1.compile and display “Equal”
if( "Welcome".trim() == "Welcome".trim() )
System.out.println("Equal"); 2.compile and display “Not Equal”
else
System.out.println("Not Equal"); 3.cause a compiler error

will 4.compile and display NULL

1.
Red box testing
2.
The concept of__________ is used to represent a system whose black box testing
inside workings are not available for inspection. 3.
Glass box testing
4.
White box testing

1.
The operation has resulted in an
error
2.
The operation requires an
interrupt call
The condition flag Z is set to 1 to indicate,
3.
The result is zero

4.
There is no empty register
available

1.
start condition
2.
The conditions that must be present in order to start a use precondition
case is ____________ 3.
postcondition
4.
event tracking

1.
small pits and bumps
2.
The data on a DVD is held in the form of ....... on the disc. small bits
3.
small bytes
4.
None of These

1.
The decoded instruction is stored in Instruction Register
2.
Program Counter
 239
3.
Register
4.
Memory Data Register

1.
n log n
2.
The depth of a complete binary tree is given by n log n + 1
3.
log n
4.
log n + 1

1.
::
2.
The derivation of Child class from Base class is indicated by :
____ symbol. 3.
;
4.
|

1.
architectural design
The design process for identifying the subsystems making up 2.
a system and the framework form design
3.
for sub-system control and communication is ___________
layer design
4.
design

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

1.
4
2.
The DMA controller has _______ registers 3
3.
2
4.
1

1.
The DMA transfer is initiated by _____ Processor
2.
 240
The process being executed

3.
I/O devices

4.
OS

1.
-6
2.
The expression X=4+2%-8 evaluates ? 6
3.
2
4.
-2

1.
Nylon
2.
The fibre that will float on water. Polyester
3.
Acrylic
4.
Polypropylene

The following program is an example for?

class Student{
int id;
1.Parameterized constructor
String name;
void display(){System.out.println(id+" "+name);}
2.Default Constructor
public static void main(String args[]){
Student s1=new Student();
3.Overloading Constructor
Student s2=new Student();
s1.display();
4.None of the above
s2.display();
}
}

1.
Primitive data types
The following two statements illustrate the difference between 2.
a primitive data type and an object
of a wrapper class
int x = 25;
3.
Integer y = new Integer(33);
Wrapper class
4.
None of the above

1.
The high paging activity is called………
Fragmentation
2.
Segmentation
 241
3.
Thrashing
4.
memory allocation

1.
Placing the data from the address
in MAR into MDR

2.
Placing the address of the data into
MAR
The Instruction fetch phase ends with,
3.
Completing the execution of the
data and placing its storage
address into MAR

4.
Decoding the data in MDR and
placing it in IR

1.
Program control instructions.
The instructions which copy information from one location to 2.
another either in the processor’s internal register set or in the Input-output instructions
external main memory are called 3.
Data transfer instructions.
4.
Logical instructions.

1.Data line

The interrupt-request line is a part of the 2.Control line

3.Address line
4.None of the above

1.
the more tedious its removal
becomes
2.
the more costly it is to detect and
The longer a fault exists in software correct
3.
the less likely it is to be properly
corrected
4.
All of the mentioned
 242
1.
n
2.
The maximum number of processes that can be in Ready state n2
for a computer system with n CPUs is 3.
2n
4.
Independent of n

1.
coupling
2.
The measure of the average length of words and sentences in Fog index
documents is termed as __________. 3.
cohesion
4.
fan in

1.
Abstraction

The mechanism that binds code and data together to keep 2.

them secure from outside world is known as encapsulation
3.
Inheritance
4.
Polymorphism

1.
segmentation
The memory allocation scheme subject to "external" 2.
fragmentation is swapping
3.
multiple contiguous fixed
partitions
4.
pure demand paging

1.
The most appropriate matching for the following pairs X—1 Y—2 Z-3
X: depth first search 1: heap 2.
X—3 Y—1 Z-2
Y: breadth-first search 2: queue 3.
X—3 Y—2 Z-1
Z: sorting 3: stack 4.
X—2 Y—3 Z-1

1.
immediate
The most common addressing techiniques employed by a CPU 2.
is direct
3.
indirect
4.
 243
register

1.
(812) 10
The multiplicand register & multiplier register of a hardware 2.
circuit implementing booth's algorithm have (11101) & (-12) 10
(1100). The result shall be 3.
(12) 10
4.
(-812) 10

1.
To covert binary stream into
character stream
2.
The object of DataInputStream is used to to covert character stream into
binary stream
3.
To write data onto output object
4.
All of the above

1.
designing
2.
The objective of ____________ is to deliver a working system to testing
end-users 3.
throw away prototyping
4.
evolutionary prototyping

1.
they are in different memory
spaces
2.
they are in different logical
The operating system and the other processes are protected addresses
from being modified by an already running process because : 3.
they have a protection algorithm
4.
every address generated by the
CPU is being checked against the
relocation and limit registers

1.
Virtual computers
2.
The operating system creates _____ from the physical computer Virtual space
3.
Virtual device

4.
None
 244
1.
in the low memory
2.
The operating system is : in the high memory
3.
•
Secondary memory
4.
either a or b (depending on the
location of interrupt vector)

1.base address of each page in

physical memory

The page table contains: 2. page size

3. page offset

4.PTBR

1.
first page of a process
2.
The pager concerns with the: entire thread
3.
individual page of a process
4.
entire process

1.
Miss ratio.
2.
The performance of cache memory is frequently measured in Hit ratio.
terms of a quantity called 3.
Latency ratio.
4.
Read ratio.

1.quantum
The performance of Round Robin(RR) scheduling depends
2. priority
on……
3. preemption

4. None of the above

1.
Hit Ratio
2.
The performance of the cache memory is measured in terms of Chat Ratio
? 3.
Copy Ratio
4.
Data Ratio
 245
1.
elaboration phase
2.
The primary objective of _____________ is to scope the system construction phase
adequately as a basis for validating initial costing and budgets. 3.
inception phase
4.
transistion phase

1.
inception
2.
The primary objective of________ phase is to mitigate the key elaboration
risk items identified by analysis up to the end of this phase. 3.
construction
4.
transistion

1.
Loading
2.
The process of storing and restoring from PCB is called Relocation
3.
context switch.
4.
Dispatcher

1.
Waiting State
2.
The process that is currently being executed is called Running State
3.
Ready state
4.

None of the above

1.patterns
The recurring aspects of designs are called design……………. 2. documents
3.objects
4.classes

1.providing more address space to

processes

2.a different address space to

processes
The relocation register helps in :
3.
to save the process state in PCB

4.to protect the address spaces of

processes
 246
1.
Compiler
2.
The resolution of externally defined symbols is performed by?
Assembler
3.
Linker
4.
None of the above

1.
four
2.
The RUP has determined a project life-cycle consisting of____ five
phases. 3.
six
4.
seven

1.20 Bits

2.12 Bits
The size of the Multiplier Quotient in IAS machine is
3.40 Bits

4.8 Bits

1.
12
2.
The size of the Program Counter in IAS machine is 20
3.
40
4.
8

1.
its structure and style are such that
any changes to the requirements
can be made easily while retaining
the style and structure
2.
every requirement stated therein
The SRS is said to be consistent if and only if: is one that the software shall meet
3.
every requirement stated therein
is verifiable
4.
no subset of individual
requirements described in it
conflict with each other

The strategy of allowing processes that are logically runnable 1.

to be temporarily suspended is called preemptive scheduling
 247
2.
non preemptive scheduling
3.
shortest job first
4.
first come first served

1.
110011
2.
The sum of 11101 + 10111 equals ________. 100001
3.
110100
4.
100100

1.
Cycle stealing

2.
The technique where the controller is given complete access to Memory stealing
main memory is
3.
Memory Con

4.
Burst mode

1.
Paging
2.
The techniques which move the program blocks to or from the Virtual memory organisation
physical memory is called as ______.
3.
Overlays
4.
Framing

1.
throughput
2.
The total number of processes completed per unit time is
response time
termed as
3.
waiting time
4.
Turn around time

1.
Instruction decoding and storage
The two phases of executing an instruction are,

2.
 248
Instruction fetch and instruction
execution

3.
Instruction execution and storage

4.
Instruction fetch and Instruction
processing

1.
ALU
The unit which decodes and translates each instruction and 2.
generates the necessary enable signals for ALU and other units Control Unit
is called 3.
CPU
4.
Logical Unit

1.
Secondary storage

2.
Disks
The virtual memory basically stores the next segment of data
to be executed on the _________.
3.
RAM

4.
ROM

1.
data out
2.
data in
The …… register is read by the host to get input
3.
flow out
4.
None

1.
data out
2.
The …… register is read by the host to get input data in
3.
flow out
4.
None of the above

The memory address of the first element of an array is called 1.floor address
 249
2.foundation address

3.first address

4.base address

1.
LOC(Array[5]=Base(Array)+w(5-
lower bound), where w is the
number of words per memory cell
for the array
2.
LOC(Array[5])=Base(Array[5])+(5-
lower bound), where w is the
number of words per memory cell
for the array
The memory address of fifth element of an array can be
calculated by the formula
3.
LOC(Array[5])=Base(Array[4])+(5-
Upper bound), where w is the
number of words per memory cell
for the array

4.
None of these

1.
K
2.
The___notation is a mature technique for model-based F
specification. 3.
Z
4.
R

1.
determining feedback loop
2.
Third step of making transition table is designating output of loops
3.
deriving functions of Y
4.
plotting Y

Thrashing 1.
is a natural consequence of virtual
memory systems
2.
always occurs on large computers
 250
3.
can be caused by poor paging
algorithms
4.
can always be avoided by
swapping

1.
When a page fault occurs
2.
Processes on system frequently
access pages not memory
Thrashing occurs when 3.
Processes on system are in
running state
4.
Processes on system are
in waiting state

1.
java.io package
2.
java.lang package
Thread class is available in 3.
java.awt package
4.
java.util package

Three concurrent processes X, Y, and Z execute three different 1.

code segments that access and update certain shared X: P(a)P(b)P(c) Y:P(b)P(c)P(d)
variables. Process X executes the P operation (i.e., wait) on Z:P(c)P(d)P(a)
semaphores a, b and c; process Y executes the P operation on 2.
semaphores b, c and d; process Z executes the P operation on X: P(b)P(a)P(c) Y:P(b)P(c)P(d)
semaphores c, d, and a before entering the respective code Z:P(a)P(c)P(d)
segments. After completing the execution of its code segment, 3.
each process invokes the V operation (i.e., signal) on its three X: P(b)P(a)P(c) Y:P(c)P(b)P(d)
semaphores. All semaphores are binary semaphores initialized Z:P(a)P(c)P(d)
to one. Which one of the following represents a deadlockfree 4.
order of invoking the P operations by the processes? X: P(a)P(b)P(c) Y:P(c)P(b)P(d)
Z:P(c)P(d)P(a)

1.
bit duration
2.
Time between clock pulses are called clock duration
3.
duration
4.
bit time

1.
Time delay device is memory element of unclocked flip-flops
2.
 1.
251 unclocked flip-flops
2.

Time delay device is memory element of clocked flip-flops

3.
synchronous circuits
4.
asynchronous circuits

1.
state table
2.
Time sequence for flip-flop can be enumerated by map
3.
truth table
4.
graph

1.
dot ( . )
2.
To access a structure element using a pointer, ......... operator is pointer ( & )
used? 3.
pointer ( * )
4.
arrow ( -> )

To avoid the race condition, the number of

1.8
processes that
2.10
may be simultaneously inside their critical section 3.1
is 4.0

1.
toggle switch
2.
To clear flip-flops we use push button
3.
mux
4.
demux

1.
the keyword synchronize is used
2.
the keyword synchronizable is
used
To execute the threads one after another
3.
the keyword synchronized is used
4.
None of the above

1.
To implement Boolean function with NAND gates we convert AND logic
function to 2.
OR logic
 252
3.
NOR logic
4.
NAND logic

1.
1
2.
To load data to shift register its SH/LD pin should be 0
3.
reset
4.
undefined

1.
0
2.
To start counting enable input should be 1
3.
reset
4.
clear

1.
maximum rate
2.
Token bucket allows bursty traffic to be regulated at minimum rate
3.
both
4.
none

1.
Upper -CASE
2.
Tools to support later activities such as Lower-CASE
programming,debugging and testing are ______________ 3.
CASE
4.
Middle-CASE

1.
Upper-CASE
Tools to support the early process activities of requirements 2.
and Lower-CASE
3.
design are _________
Middle-CASE
4.
CASE

1.
Traditional software development approach is based on___ classes and methods
2.
Objects and Isolated data
 253
3.
functions and procedures
4.
attributes

1.
Intra-register transfer operation
2.
Transference of information from one register to another is Inter-register transfer operation
3.
Out register transfer operation
4.
In register transfer operation

1.
sequence
2.
Transition table that terminates in total stable state gives series
3.
unique sequence
4.
unique series

1.
Linear and Hierarchical
2.
Trees are examples of which type of data structure Linear and Non-Hierarchical
3.
Non-Linear and Hierarchical
4.
Non-Linear and Non-Hierarchical

1.
ripple carry adder
2.
Two bit addition is done by carry sum adder
3.
full adder
4.
half adder

1.
demux
2.
Two bit subtraction is done by mux
3.
full subtractor
4.
half subtractor

1.
Two cross coupled NAND gates make SR Latch
2.
RS flipflop
 254
3.
D flipflop
4.
master slave flipflop

1.
tables arrays
2.
Two dimensional arrays are also called matrix arrays
3.
tables and matrix arrays
4.attributes

1.
Matrices
2.
Two dimensional arrays are also called ? Tables
3.
Matrices and Tables
4.
Neither Matrices nor table

1.
same name and same number of
parameter but different return
type.
2.
Two methods are said to be overloaded if they have, they have same name.
3.
they have different name but same
number of argument.
4.
have same name but different
parameters.

1.
Data Link Control, Physical Layer
Control
2.
Logical Link Control, Data Link
Two sub layers of OSI Data Link layer are which of the Control
following? 3.
Media Access Control, Physical
Layer Control
4.
Logical Link Control, Media Access
Control

1.
-69272
Using 10's complement 3250-72532 is 2.
-69282
3.
-69252
 255
4.
-69232

1.
Prototyping
2.
Using an executable model of the system to check Requirement reviews
requirements is termed as ________. 3.
Requirement validation
4.
Requirement analysis

1.
Large secondary memory
2.
Large main memory
Virtual memory is
3.
Illusion of large main memory
4.
None of the above

1.
an extremely large main memory
2.
an extremely large secondary
memory
Virtual memory is 3.
an illusion of an extremely large
memory
4.
a type of memory used in super
computers

1.
Known, Unknown, Undreamed
2.
User, Developer
What are the types of requirement in Quality Function
Deployment(QFD)
3.
Functional, Non-Functional
4.
Normal, Expected, Exciting

1.
Transform
2.
Data Store
What DFD notation is represented by the Rectangle?

3.
Function
 256
4.
Data read

1.
Declarations of the standard input-
output library functions.
2.
What does the file iostream contain? Definitions of the standard input-
output library functions.
3.
Both
4.
None of the Above

1.
design model

What incorporates data, architectural, interface, and 2.

procedural representations of the software? user’s model
3.
mental image
4.
system image

1.
Only dynamic routes that it is
using
2.
What information does EIGRP share with neighboring routers? All routes that it has learned
3.
All EIGRP routes that it has learned
4.
Only routes that it is using

1.
is a hardware component
2.
What is a shell ? It is a command interpreter
3.
It is a part in compiler
4.
It is a tool in CPU scheduling

1.
A network with only one entry and
no exit point.
2.
What is a stub network? A network with more than one exit
point.
3.
A network with more than one exit
and entry point.
 257
4.
A network that has only one entry
and exit point.

1.
An object with only primitive
attributes
2.
An instance of a class which has
What is an aggregate object? only static methods
3.
An instance which has other
objects
4.
None of the above

1.
a technique for overcoming
internal fragmentation
2.
a paging technique
What is compaction? 3.
a technique for overcoming
external fragmentation
4.
a technique for overcoming fatal
error

1.
private member is not inheritable
and not accessible in derived class
2.
protected member is inheritable
What is difference between protected and private access and also accessible in derived class
specifiers in inheritance? 3.
Both are inheritable but private is
accessible in the derived class
4.
Both are inheritable but protected
is not accessible in the derived
class

1.
It describes when a router sets the
metric for a downed link to infinity
2.
It sends back the protocol received
What is route poisoning? from a router as a poison pill,
which stops the regular updates.
3.
It is information received from a
router that can't be sent back to
the originating router.
4.
 258
It prevents regular update
messages from reinstating a route
that has just come up.

1.
Information about a route should
not be sent back in the direction
from which the original update
came.
2.
It splits the traffic when you have a
What is split horizon? large bus (horizon) physical
network.
3.
It holds the regular updates from
broadcasting to a downed link.
4.
It prevents regular update
messages from reinstating a route
that has gone down

1.
Highly specialized & skilled
developers/designers are required
2.
Increases re-usability of
What is the major drawback of using RAD Model? components.
3.
Encourages customer/client
feedback.

4.
Both a & c.

1.
255.0.0.0
2.
What is the default subnet mask for a class C network? 127.0.0.1
3.
255.255.255.0
4.
255.255.0.0

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

1.
 259
What is the difference between overloaded functions and Overloading is a static or compile-
overridden functions? time binding and Overriding is
dynamic or run-time binding
2.
Overloading is a dynamic or run-
time binding and Overriding is
static or compile-time binding
3.
Redefining a function in a friend
class is called function overriding
while Redefining a function in a
derived class is called a overloaded
fucntion.
4.
Redefining a function in a friend
class is called function overloading
while Redefining a function in a
derived class is called as
overridden fucnion.

1.private member is not

inheritable and not accessible in
derived class

2.protected member is inheritable

What is the difference between protected and private access and also accessible in derived class
specifiers in inheritance?
3.Both are inheritable but private
is accessible in the derived class

4.Both are inheritable but

protected is not accessible in the
derived class

1.
process to process message
delivery
2.
What is the main function of transport layer? node to node delivery
3.
synchronization
4.
updating and maintenance of
routing tables

1.
16
What is the maximum number of IP addresses that can be 2.
assigned to hosts on a local subnet that uses the 30
255.255.255.224 subnet mask? 3.
15
4.
14
 260
1.
Working system
2.
What is the name given to the organized collection of software Operating system
that controls the overall operation of a computer?
3.
Controlling system
4.
Peripheral system

What is the output of the program

#include<iostream.h>

void main() 1.
{ Print natural numbers 0 to 99
int n=1; 2.
cout<<endl<<"The numbers are;"<<endl; Print natural numbers 1 to 99
do
{ 3.
Print natural numbers 0 to 100
cout <<n<<"\t"; 4.
n++; Print natural numbers 1 to 100
} while (n<=100);
cout <<endl;
}

What is the output of this code?

package pkg;
class display {
int x;
void show() {
if (x > 1)
System.out.print(x + " "); 1.0
}
} 2.1
class packages {
public static void main(String args[]) { 3.2
display[] arr=new display[3];
for(int i=0;i<3;i++)
arr[i]=new display();
4.0 1 2
arr[0].x = 0;
arr[1].x = 1;
arr[2].x = 2;
for (int i = 0; i < 3; ++i)
arr[i].show();
}
}

1.
What is the output of this program?
4
#include <iostream> 2.
5
 261
using namespace std; 3.
int main() 6
4.
{ 7
int arr[] = {4, 5, 6, 7};
int *p = (arr + 1);
cout << *p;
return 0;
}

What is the output of this program?

class array_output {
public static void main(String args[])
{ 1.
02468
int array_variable [] = new int[10]; 2.
for (int i = 0; i < 10; ++i) { 13579
3.
array_variable[i] = i; 0123456789
System.out.print(array_variable[i] + " "); 4.
1 2 3 4 5 6 7 8 9 10
i++;
}
}
}

What is the output of this program?

class average {
public static void main(String args[])
1.
{ 16.34
2.
double num[] = {5.5, 10.1, 11, 12.8, 56.9, 2.5};
16.5555
double result; 3.
result = 0; 16.46666666666667
4.
for (int i = 0; i < 6; ++i) 16.4666666666
result = result + num[i];
System.out.print(result/6);
 262
}
}

What is the output of this program?

class conversion {
public static void main(String args[])
1.
{ 38 43
2.
double a = 295.04;
39 44
int b = 300; 3.
byte c = (byte) a; 295 300
4.
byte d = (byte) b; 295.4 300.6
System.out.println(c + " " + d);
}
}

What is the output of this program?

class increment { 1.
24
public static void main(String args[]) 2.
{ 25
3.
int g = 3; 32
System.out.print(++g * 8); 4.
33
}
}

1.
Test( )
What is the prototype of the default constructor for given 2.
class? onlineexam.Test( ) public Test( )
public class Test { } 3.
Test(void)
4.
onlineexam.Test(void)

1.
What is the purpose of domain name system (DNS)? To map private IPv4 addresses
to onlineexam.IPv4 addresses
2.
 263
To map MAC addresses to
hostnames
3.
To map IPv4 addresses to
hostnames
4.
To map IPv4 address to
NetBIOS names

What is the result of compiling and running this program?

class Mammal{
void eat(Mammal m){
System.out.println("Mammal eats food");
}
}
class Cattle extends Mammal{
void eat(Cattle c){
System.out.println("Cattle eats hay");
1.
} prints "Mammal eats food"
2.
}
prints "Cattle eats hay"
class Horse extends Cattle{ 3.
void eat(Horse h){ Class cast Exception at runtime
4.
System.out.println("Horse eats hay"); None of these
}
}
public class Test{
public static void main(String[] args){
Mammal h = new Horse();
Cattle c = new Horse();
c.eat(h);
}
}

1.
What is the swap space in the disk used for? Saving temporary html pages

2.
 264
Saving process data
3.
Storing the super-block
4.
Storing device drivers

What is the value of ‘number’ after the following code 1.

fragment execution?
5
int number = 0; 2.
int number2 = 12; 12
while (number < number2) 3.
{ 21
number = number + 1; 4.
} 13

1.
Counter
2.
What kind of logic device or circuit is used to store Register
information? 3.
Inverter
4.
Buffer

1.
Multiuser system
What kind of system is it that several users can use 2.
simultaneously? Multilevel user system
3.
single user system
4.
Multiprocessing user system

1.
NCP
2.
What PPP protocol provides dynamic addressing, HDLC
authentication, and multilink? 3.
X.25
4.
LCP

What will be the output of the following program? 1.

100
2.
class B 101
{ 3.
Error in line 13
 265
static int count = 100; 4.
public void increment() 0

{
count++;
}
public static void main(String []args)
{
B b1 = new B();
b1.increment();
B b2 = new B();
System.out.println(b2.count); // line 13
}
}

What will be the output of the program ?

class A
{
int x = 10;
public void assign(int x) 1.
10
{ 2.
x = x; 100
3.
System.out.println(this.x); 0
} 4.
compile-time error
public static void main(String[] args)
{
new A().assign(100);
}
}

What will be the output of the sample code?

1.Finally

public class Foo 2.Compilation fails.

{ 3.The code runs with no output.
public static void main(String[] args)
 266
{ 4.An exception is thrown at
try runtime.

{
return;
}
finally
{
System.out.println( "Finally" );
}
}
}

What will be the output of the sample program?

public class X
{
public static void main(String [] args)
{
try
{
1.
badMethod();
ABCD
System.out.print("A"); 2.
Compilation fails.
}
3.
catch (Exception ex) C is printed before exiting with
{ an error message.
4.
System.out.print("B"); BC is printed before exiting
} with an error message.
finally
{
System.out.print("C");
}
System.out.print("D");
}
public static void badMethod()
 267
{
throw new Error();
}
}

What will be the output of the sample program?

try
{
int x = 0;
int y = 5 / x;
1. finished
}
catch (Exception e) 2.Exception
{
3.Compilation fails.
System.out.println("Exception");
} 4.Arithmetic Exception
catch (ArithmeticException ae)
{
System.out.println(" Arithmetic Exception");
}
System.out.println("finished");

What will be the output of the this program?

#include <iostream>

using namespace std;

int main ()
1.25
{
int array[] = {0, 2, 4, 6, 7, 5, 3};
2.26

int n, result = 0; 3.27

for (n = 0 ;n < 5 ;n++)
4.none of the above
{
result += billy[n];
}
cout << result;
 268
return 0;
}

What will be the Output?

class A
{
public void m1()
{ System.out.println("A"); }
}
1.
public class B extends A runtime error
2.
{
A
void m1() 3.
{ System.out.println("B"); } B
4.
compilation error
public static void main(String []args)
{
A a = new B();
a.m1();
}
}

What will happen if you try to compile and run the following
code ?

class Test
1.
{
Program exits without printing
int x; anything
Test(int n)
2.
Compilation error at line 10
{ 3.
System.out.println(x=n); // line 6 Compilation error at line 6
4.
} Run-time exception

public static void main(String []args)

{
 269
Test n = new Test(); // line 10
}
}

1.
segmentation fault occurs
2.
When a program tries to access a page that is mapped in no error occurs
address space but not loaded in physical memory, then? 3.
page fault occurs
4.
fatal error occurs

1.
stack pointer
2.
When a subroutine is called, the address of the instruction accumulator
following the CALL instructions stored in/on the 3.
program counter
4.
stack

1.
1
2.
When both inputs are 1 output of xor is 0
3.
x
4.
10

1.Interrupt mode
2.
When CPU is executing a Program that is part of the Operating System mode
System, it is said to 3.
Half mode
4.
Simplex mode

1.
1
2.
When J and complement of K are 1, flipflop QA after shift 0
3.
reset
4.
defined
 270
1.
A-B
2.
When mode of adder subtract or is 0 it will give A+B
3.
A/B
4.
A*B

1.
adds
2.
When mode of adder subtractor is 0 it subtracts
3.
divides
4.
multiply

1.
adds
2.
When mode of adder subtractor is 1 it subtracts
3.
divides
4.
multiply

1.
Zero
2.
When overloading unary operators using Friend function, it One
requires_____ argument/s. 3.
Two
4.
None of these.

1.
external fragmentation occurs
2.
internal fragmentation occurs
When the memory allocated to a process is slightly larger than 3.
the process, then : both External and Internal
Fragmentation occurs
4.
neither External nor Internal
Fragmentation occurs

When using Branching, the usual sequencing of the PC is

altered. A new instruction is loaded which is called as ______ 1.
 271
Branch target

2.
Loop target

3.
Forward target

4.
Jump instruction

1.
In to the String Pool
2.
When we create String with new() Operator, where is it It is created in Heap but not
stored? added to String Pool
3.
Not stored anywhere
4.
None of the above

1.
Across the wire
2.
On the network
When you ping the loopback address, a packet is sent where? 3.
Down through the layers of the
IP architecture and then up the
layers again
4.
through the loopback dongle

1.
Save it
2.
Whenever CPU detects an interrupt, what it do with current Discard it
state ? 3.
Depends system to system
4.
First finish it

1.
LRU Page Replacement Policy
2.
Where can the Belady’s anomaly occur? FIFO Page Replacement Policy
3.
MRU Page Replacement Policy
4.
 272
Optimal Page Replacement
Policy

1.
application
2.
Where does routing occur within the DoD TCP/IP reference internet
model? 3.
network
4.
transport

1.
Disk
2.
Where does the swap space reside ?
RAM
3.
ROM
4.
On-chip cache

1.RAM

2.Disk
Where does the swap space reside?

3.ROM

4.On-chip cache

1.
Push
2.
Which of the following is not the operation on stack? Pop
3.
Peep
4.
Pull

1.
Which of the following is/are the operations performed by i, and ii only
kruskal's algorithm. 2.
i) sort the edges of G in increasing order by length ii) keep a ii and iii only
subgraph S of G initially empty iii) builds a tree one vertex at a 3.
time i and iii only
4.
All i, ii and iii
 273
1.
Entry level personnel
2.
Which according to you is the most important stakeholder Middle level stakeholder
from the following? 3.
Managers
4.
Users of the software

1.
additional reference bit
algorithm
Which algorithm chooses the page that has not been used for 2.
the longest period of time whenever the page required to be least recently used algorithm
replaced? 3.
first in first out algorithm
4.
counting based page
replacement algorithm

1.
Class A
2.
Which class of IP address provides a maximum of only 254 Class B
host addresses per network ID? 3.
Class C
4.
Class D

1.
Object
2.
Thread
Which class or interface defines
the wait(), notify() and notifyAll() methods? 3.
Runnable
4.
Class

1.
Storage
2.
Which classes allow primitive types to be accessed as objects? Virtual
3.
Wrapper
4.
Friend

Which component performs the main or key tasks of operating 1.

system ? Kernel
 274
2.
Shell
3.
File system
4.
Device driver

1.
derived class
2.
Which constructor will initialize the base class data member? base class
3.
class
4.
None of the mentioned

1.
OSPF
2.
Which dynamic routing protocol uses cost as its metric? BGP
3.
RIP
4.
EIGRP

1.
finalize()
2.
Which function is used to perform some action when the delete()
object is to be destroyed? 3.
None of the above mentioned
4.
main()

1.
Polling
2.
Priority interrupt
Which interrupt establishes a priority over the various sources
to determine which request should be entertained first ? 3.
Daisy chaining

4.
chaining

1.
Which IPv6 address is the equivalent of the IPv4 interface 0::/10
loopback address 127.0.0.1? 2.
2000::/3
 275
3.
::
4.
::1

1.
Which is a protocol that one program can use to request a Remote Procedure Call
service from a program of 2.
another computer on a network?
I/O Virtualization
3.
Memory Virtualization

4.
ParaVirtualization

1. public static short stop = 23

onlineexam.static short stop =
23;
2.
Which is a valid declaration within an Interface? protected short stop = 23;
3.
transient short stop = 23;
4.
final void start(short stop);

1.
Requirements elicitation
2.
Which is not a step of requirement engineering? Requirements analysis
3.
Requirements design
4.
Requirements documentation

1.
process Management
2.
Which is not a function of an OS?
I/O Management
3.
Memory Management
4.
Networking

1.
running
Which is not a valid state of a thread? 2.

blocked
3.
 1.
running
2.
276 blocked
3.
parsing
Which is not a valid state of a thread?
4.
None of the above

1.
64
2.
Which is not a word size? 28
3.
16
4.
8

1.
System software
2.
Operating system
Which is the first program run on a computer when the
computer boots up?
3.
System operations

4.
system hardware

1.
Primary
2.
Which is used for this and known as high speed buffer exist Secondary
with almost each process ? 3.
Cache
4.
RAM

1.
import
2.
Which keyword is used by method to refer to the object that catch
invoked it? 3.
abstract
4.
this

1.
Interrupt
Which method is used to establish priority by serially 2.
connecting all devices that request an interrupt ? Polling
3.Priority

4.

Daisy chaining
 277
Daisy chaining

1.
onlineexam.class B extends A {
onlineexam.void showA(){} }
2.
onlineexam.class B implements
A { onlineexam.abstract void
Which of following is a valid class using the given code?
showA(){} }
public interface A { public void showA(); } 3.
onlineexam.class B implements
A { void showA(){} }
4.
onlineexam.class B implements
A { onlineexam.void showA(){}
}

1.
RTM

2.
Which of the following is not a Requirement Management DOORS
workbench tool?

3.
Rational Suite
4.
RDD 100

1.
Support structured analysis and
design (SA/SD)
2.
Maintains the data dictionary
Which of the following is not a use of a CASE tool? 3.
Checks whether DFDs are
balanced or not
4.
It complies with the available
system

1.
User, task, and environment
analysis and modeling
Which of the following is not a user interface design process? 2.
Interface design
3.
Knowledgeable, frequent users
 278
4.
Interface validation

1.
Spiral

2.
Which of the following life cycle model can be chosen if the Waterfall
development team has less experience on similar projects?
3.
RAD

4.
Iterative Enhancement Model

1.
Verifiable

Which of the following property does not correspond to a good 2.

Software Requirements Specification (SRS)? Complete
3.
Ambiguous
4.
Traceable

1.
Modules are robust
2.
Which of the property of software modularity is incorrect with Module can use other modules
respect to benefits software modularity? 3.
Modules Can be separately
compiled and stored in a library.
4.
Modules are mostly dependent

1.
ascending
Which of the following addressing modes, facilitates access to 2.
an operand whose location is defined relative to the beginning sorting
of the data structure in which it appears?
3.
index
4.
indirect

Which of the following are loaded into main memory when the 1.
computer is booted? external command instructions
2.
 279
word processing
instructions
3.
utility programs
4.
internal command instructions

1.
ssh
Which of the following command is used to create terminal 2.
connection to another
scp
host in Unix?
3.
telnet
4.
None of the above

1.
mkdir
Which of the following command is used to print current 2.
working directory in Unix?
pwd
3.
rm
4.
None of the above

1.
Hold and Wait
2.
Which of the following condition leads to deadlock? Preemption
3.
Rollback

4.
Hold

1.
Which of the following data structures are indexed structures? linear arrays
2.
linked lists
3.Array 4.Stack

1.
repeater
2.
Which of the following device is used to connect two systems, hub
especially if the systems use different protocols? 3.
bridge
4.
gateway
 280
1.
DHCP Server
2.
Which of the following devices assigns IP address to devices NIC
connected to a network that uses TCP/IP? 3.
Gateway
4.
Hub

1.
Router
Which of the following devices direct network traffic based not 2.
by MAC addresses but by software-configured network Hub
addresses? 3.
Bridge
4.
NIC

1.
Bridge
2.
Which of the following devices is a PC component that NIC
connects the computer to the network? 3.
DNS Server
4.
Gateway

1.
Router
Which of the following devices modulates digital signals into 2.
analog signals that can be sent over traditional telephone Gateway
lines? 3.
Switch
4.
Modem

1.
DNS Server
2.
Which of the following devices translates hostnames into IP Hub
addresses? 3.
DHCP Server
4.
Firewall

Which of the following DMA transfer modes and interrupt 1.Transparent DMA and Polling
handling mechanisms will enable the highest I/O band-width? interrupts
 281
2.Cycle-stealing and Vectored
interrupts

3.Block transfer and Vectored

interrupts

4.Block transfer and Polling

interrupts

1.
Stack pointer
Which of the following holds the data currently being worked 2.
on?
Program Counter
3.
Accumulator
4.Instruction Pointer

1.
The list must be sorted
2.
there should be the direct access
to the middle element in any
sublist
Which of the following is not the required condition for binary 3.
search algorithm? There must be mechanism to
delete and/or insert elements in
list

4.
none of these

1.
finalize
2.
Which of the following is a method having same name as that delete
of its class? 3.
class
4.
constructor

1.
Which of the following is a scheduling algorithm that allows a Round Robin(RR) scheduling
process to move up 2.
and down between queues? first Come First Served (FCFS)
scheduling
3.
 282

Multilevel feedback queue

scheduling
4.

Shortest Job First (SJF)

scheduling

1.
Thread
Which of the following is a solution to fragmentation problem? 2.
Kernel
3.
Paging
4.
Multi-programming

1.
Binary Semaphore
2.
Which of the following is a type of Semaphores?
Counting Semaphore
3.
Both(1) & (2)
4.
None of the above

1.
Lynx OS

2.
Which of the following is an example of Batch Processing Mac OS
Operating Systems? 3.

UNIX

4.windows

1.
Which of the following is an example of Cooperative Lynx OS
MultiTasking 2.
OS? Mac OS
3.
MS DOS
4.
None of the above

Which of the following is an example of Real Time Operating 1.

Systems? Lynx OS
2.
 283
Mac OS
3.
UNIX
4.
windows

1. import pkg.

Which of the following is correct way of importing an entire 2. Import pkg.

package ‘pkg’?
3. import pkg.*

4.Import pkg.*

1.
Interfaces specifies what class
must do but not how it does.
2.
Interfaces are specified
onlineexam.if they are to be
accessed by any code in the
Which of the following is incorrect statement about packages? program.
3.
All variables in interface are
implicitly final and static.
4.
All variables are static and
methods are onlineexam.if
interface is defined pubic

1.
Settle time
2.
Which of the following is major part of time taken when Rotational latency
accessing data on the disk? 3.
Seek time
4.
Waiting time

1.
many to many relationship
2.
many to one relationship
Which of the following is multi threading model?
3.
one to One relationship

4.
All of the above
 284
1.
onlineexam.void exit()
2.
onlineexam.void run()
Which of the following is not a method of the Thread class. 3.
onlineexam.void start()
4.
onlineexam.final int
getPriority()

1.
boolean
2.
void
Which of the following is not a return type?
3.
onlineexam./span>

4.
Button

1.
final onlineexam.class Test {}
2.
Which of the following is not a valid declaration of a Top level class $Test{}
class ? 3.
static class Test {}
4.
onlineexam.abstract class _Test
{}

1.
must use a sorted array
2.
requirement of sorted array is
expensive when a lot of
insertion and deletions are
Which of the following is not a limitation of binary search needed
algorithm? 3.
there must be a mechanism to
access middle element directly
4.
binary search algorithm is not
efficient when the
data elements are more than
1000.

1.
Which of the following is not an advantage of software reuse? lower costs
2.
 285
faster software development
3.
high effectiveness
4.
lower risks

1.
Smaller sizes of executable files
2.
Lesser overall page fault rate in
Which of the following is NOT an advantage of using shared, the system
dynamically linked libraries as opposed to using statically 3.
linked libraries ?
Faster program startup
4.
Existing programs need not be
re-linked to take advantage of
newer versions of libraries

1.
In deadlock prevention, the
request for resources is always
granted if the resulting state is
safe
2.
In deadlock avoidance, the
request for resources is always
Which of the following is NOT true of deadlock prevention and granted if the result state is safe
deadlock avoidance schemes? 3.
Deadlock avoidance is less
restrictive than deadlock
prevention

4.
Deadlock avoidance requires
knowledge of resource
requirements a priori

1.
192.168.24.43
2.
Which of the following is private IP address? 168.172.19.39
3.
172.15.14.36
4.
12.0.0.1

1.
Which of the following is standard print command in Unix?
ncftp
2.
 286
lpr
3.
ls

4.
grep

1.
Set
2.
Which of the following is synchronized? LinkedList
3.
vector
4.
WeakHashMap

1.
Compression
2.
Which of the following is the creation of a virtual rather than
actual version of
Virtualization
3.
an operating system? Synchronization

4.
Multithreading

1.
Linear array
2.
Which of the following is the least simple data structure? Two dimensional array
3.
Three dimensional array
4.
Multi-dimensional array

1. All objects of a class share all

data members of class

2.Objects of a class do not share

non-static members. Every
Which of the following is true? 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 these
 287
1.
Pi (Greek)
2.

Which of the following is used to denote the selection Sigma (Greek)

operation in relational algebra ? 3.

Lambda (Greek)

4.
Omega (Greek)

1.
Preemption
2.
Mutual Exclusion
Which of the following is used to remove deadlock? 3.

Circular Wait

4.
None of the above

1. Layered Architecture

Which of the following is/are commonly used architectural 2.Model-View-Controller

pattern(s)?
3.Client–server

4.Model-View-Component

1.
(ii) and (iv) only
Which of the following is/are example(s) of stateful
2.
application layer protocols?
(i) and (ii) only
(i) HTTP (ii) FTP (iii) TCP (iv) 3.
POP3 (ii) and (iii) only
4.
(iv) only

1.
Segmentation
Which of the following memory allocation scheme suffers from 2.
external fragmentation ? swapping
3.
demand Swapping
4.
context switch
 288
1.
Paging
2.
Which of the following memory management scheme loads Demand paging
all pages of a program from disk into main memory? 3.
Demand segmentation.
4.
Segmentation with paging

1.
Hub
2.
Which of the following network devices/systems translates DHCP Server
data from one format to another? 3.
Gateway
4.
NIC

1.
assignment operator
2.
Which of the following numerical value is invalid constant ? relational operator
3.
logical operator
4.
bitwise shift operator

1.
?
2.
?:
Which of the following operators allow to define the member
functions of a class outside the class? 3.
::
4.
;

1.
LFU
Which of the following page replacement algorithm use the 2.
technique of replace that page which is not used in the near LRU
future? 3.
FIFO
4.
OPR

1.
Which of the following page replacement algorithms suffers FIFO
from Belady’s anomaly? 2.
LRU
 289
3.
Optimal Page Replacement
4.
Both LRU and FIFO

1.
Kernel
2.
Which of the following plays an important role in modern
Operating Systems(OS)?
Shell
3.
Fork
4.
none

1.
FIFO
2.
Which of the following process scheduling algorithm may lead Round Robin
to starvation 3.
Shortest Job Next
4.
none

1.
Round Robin (RR)
Which of the following scheduling algorithms provide 2.
minimum average waiting
First come First Serve (FCFS)
time?
3.
Shortest Job First Scheduling
4.
None of the above

1.
Compilation
2.
Protection
Which of the following service is not supported by the OS?
3.
I/O Operation
4.
None of the above

1.
Shell sort
2.
Which of the following sorts does not use an array structure ? Bucket Sort
3.
Radix Sort
4.
 290
Heap Sort

1.
Methods inside Interface can be
static, final, native or strictfp.
2.
Interface can not extend one or
Which of the following statement is true about an Interface? more other interface
3.
Interface cannot implement a
class.
4.
Interface can not be nested
inside another interface.

1.
I only
Which of the following statements are true ? 2.
I Shortest remaining time first scheduling may cause
I and III only
starvation
II Preemptive scheduling may cause starvation 3.
II Round robin in better than FCFS in terms of response time II and III only
4.
I, II and III

1.
Which of the following statements are true?
I only
I. Shortest remaining time first scheduling may cause 2.
starvation I and III only
II. Preemptive scheduling may cause starvation 3.
II and III only
III. Round robin is better than FCFS in terms of response time 4.
I, II and III

1.
Virtual memory implements the
translation of a program’s
address space
into physical memory address
Which of the following statements is false ?
space.
2.
Virtual memory increases the
degree of multi-programming
3.
Virtual memory allows each
program to exceed the size of
the primary
memory.
4.
 291
Virtual memory reduces the
context switching overhead.

1.
Security software
2.
Which of the following systems software does the job of Networking software
merging the records from two files into one? 3.
Documentation system
4.
Utility program

1.
SMTP
Which of the following TCP/IP protocol is used for 2.
transferring electronic mail messages from one machine to SNMP
another? 3.
FTP
4.
RPC

1.
Is the applications software you
want to use compatible with it ?
2.
Which of the following will determine your choice of systems Is it expensive ?
software for your computer? 3.
Is it compatible with
your hardware ?
4.
Both 1 and 3

1.
start()
2.
Which of the methods should be implemented if any class run()
implements the Runnable interface? 3.
wait()
4.
notify() and notifyAll()

1.
An abstract class is a class that
contains one or more abstract
Which of the statement is false about an abstract class? methods.
2.
An abstract class cannot have
normal method.
3.
 292
An abstract class cannot be
instantiated.
4.
An abstract class can be
extended.

1.
class
2.
Which of these cannot be declared static? variable
3.
object
4.
method

1.
List
2.
Which of these interface is not a part of Java’s collection Set
framework? 3.
SortedMap
4.
SortedList

1.
Object
2.
Which of these is a mechanism for naming and visibility Packages
control of a class and its content? 3.
Interfaces
4.
None of the Mentioned.

1.
Which of these is an example of a virtual resource? Virtual machine
2.
Print server
3.
Virtual memory
4.
Scanner

1.
Monitor
Which of these is not a term describing the collection of 2.
Operating Programs Kernel
3.
Supervisor
4.
 293
server

1.onlineexam.p>

2.
Which of these is used to access member of class before object static
of that class is created? 3.
private
4.
protected

1.
rand()
2.
Which of these methods can randomize all elements in a list? randomize()
3.
shuffle()
4.
ambigous()

1.
elicitation

2.
Which one of the following is not a step of requirement design
engineering?

3.
analysis
4.
documentation

1.
10.10.14.118
2.
Which one of the following is a Class C IP address? 191.200.199.199
3.
135.23.112.57
4.
204.67.118.54

1.physical address

2.absolute address
Which one of the following is the address generated by CPU?
3.logical address

4.Main memory address

 294
1.
ARP
2.
Which one of the following protocols is NOT used to resolve DHCP
one form of address to another one? 3.
DNS
4.
RARP

1.
Short Term Scheduler
2.
Long Term Scheduler
Which one of the following scheduler controls the degree of
3.
multiprogramming?
Medium Term Scheduler
4.

Average Term Scheduler

1.
ternary operator
2.
Which operator is used to check object-type at runtime? instanceof operator
3.
type operator
4.
length operator

1.
Which OS employs the techniques of fault tolerance and
Batch Processing
graceful degradation to ensure continuity of operation?
2.
Multi-processor
3.
Distributed
4.
Time sharing

1.
ARP
2.
Which protocol working at the Transport layer provides a TCP
connectionless service between hosts? 3.
IP
4.
UDP

Which register can interact with the secondary storage 1.

PC
 295
2.
MAR
3.
MDR
4.
IR

1.
The logic level at the D input is
transferred to Q on NGT
of CLK.
2.
The Q output is ALWAYS
Which statement BEST describes the operation of a negative- identical to the CLK input if
edge-triggered D flip-flop? the D input is HIGH.
3.
The Q output is ALWAYS
identical to the D input
when CLK = PGT.
4.
The Q output is ALWAYS
identical to the D input.

1.
IOP
2.
Which technique helps processor to run a program DMA
concurrently with input output operations ? 3.
Interrupt driven I/O
4.
DCA

1.
push() and pop()
2.
Which two methods you need to implement to use an Object as get() and set()
key in HashMap? 3.
equals() and hashcode()
4.
put() and get()

1.
Waterfall & RAD

Which two models doesn’t allow defining requirements early

in the cycle? 2.
Prototyping & Spiral
3.
Prototyping & RAD
 296
4.
Waterfall & Spiral

1.
Medium Term Scheduler
Which type of scheduler is used in batch systems? 2.
Short Term Scheduler
3.
Long Term Scheduler

4.
None of the above

1.
Short Term Scheduler
Which type of scheduler typically uses a FIFO or Priority 2.
queue?
Medium Term Scheduler
3.
Long Term Scheduler
4.
Job Scheduler

1.
Dennis Richie
2.
Who is considered as the creator of JAVA ? Ken Thompson
3.
James Gosling
4.
Bjarne Stroupstrup

1.
Store large volume of data that
exceed the capacity of main
memory
2.
Why we need to have secondary storage ? Perform arithmetic and logical
operations
3.
To give power to the system too
4.
To help processor in processing

1.
1 ns
Wire introduces delay of 2.
2 ns
3.
3 ns
 297
4.
4 ns

1.
less than
2.
With relocation and limit registers, each logical address must greater than
be _______ the limit register. 3.
equal to
4.
twice of

1.
Virtual memory
2.
Write Through technique is used in which memory for Main memory
updating the data 3.
Auxiliary memory
4.
Cache memory

1.
x
2.
x+x'y= y
3.
x-y
4.
x+y

1.
inverse law
2.
x+xy=x is known as commutative law
3.
distributive law
4.
absorption law

1.
AND
2.
X+y=z represents operation that is OR
3.
NOT
4.XOR

X=1010100 and Y=1000011 using 1's complement Y-X is 1.

-10111
 298
2.
-10011
3.
-10001
4.
-11001

1.
10111
2.
X=1010100 and Y=1000011 using 2's complement X-Y is 101101
3.
10011
4.
10001

1.
import keyword
2.
You can import only static members of a class present in some import static keyword
other package using __________? 3.
package keyword
4.
static import keyword

1.
1 Mbps
You have 10 users plugged into a hub running 10Mbps half- 2.
duplex. There is a server connected to the switch running 100 kbps
10Mbps half-duplex as well. How much bandwidth does each 3.
host have to the server?
10 Mbps
4.
2 Mbps

1.
126 subnets and 510 hosts
You have an IP of 156.233.42.56 with a subnet mask of 7 bits. 2.
How many hosts and subnets are possible assuming that 128 subnets and 512 hosts
subnet 0 is not used? 3.
510 subnets and 126 hosts
4.
512 subnets and 128 hosts

1.
You have been assigned a network ID of 172.16.0.0/26. If you 172.16.0.65
utilize the first network resulting from this ID, what would be 2.
the last legitimate host address in this subnet? 172.16.0.62
3.
172.16.0.63
 299
4.
172.16.0.64

1.
Counters which indicate how
long ago their associated pages
have been referenced. (
2.
Registers which keep track of
‘Aging registers’ are when the program was last
accessed.
3.
Counters to keep track of last
accessed instruction.
4.
Counters to keep track of the
latest data structures referred.

1.
….. commands are automatically loaded into main memory External
when the booting process 2.
gets completed.
Internal
3.
Both Internal & external
4.
Not internal & not external

1.
Await
….. is a system call that causes the caller to block. 2.
sleep
3.
Wakeup
4.
None of the above

1.
Kernel
….. occur commonly in multitasking when two or more threads 2.
waiting for each Shell
other. 3.
Fork
4.

Deadlock

….. process checks to ensure the components of the computer 1.

are operating and Editing
connected properly. 2.
 300
Saving
3.
Booting
4.
None of the above

1.
Accumulator
2.
Stack Pointer
…… holds the address of the next instruction to be executed? 3.

Status Register

4.
Program Counter

1.
Spawn
2.
…… is a special system software that is used to handle process Scheduler
scheduling in 3.
different ways. fork

4.
none

1.
fork
…… is a system call that runs an executable file into an existing 2.
process. wait
3.
exec
4.
None of the above

1.
Fragmentation
2.
…… is a technique used to speed up communication with slow Caching
devices. 3.
Segmentation
4.
paging

…… is a way of processing data serially. 1.

spooling
2.
Paging
 301
3.
caching
4.
segmentation

1.
Software
2.
…… is mainly responsible for allocating the resources as per RAM
process requirement?

3.
Operating Systems
4.
Compiler

1.
Software
2.
…… is mainly responsible for allocating the resources as per RAM
process requirement? 3.
Operating Systems
4.
Compiler

1.
Process handling
…… is the process of switching of CPU from one thread to 2.
another.
interrupt handling
3.
Context switching
4.
none

1.
Compiler
…… is the smallest unit for processing that consists of a 2.
program counter, a stack & Thread
a set of registers. 3.
Heap
4.
Stack

1.
…… occurs in a dynamic memory allocation system when most Paging
of the free blocks are 2.
too small to satisfy any request? Segmentation
3.
Fragmentation
 302
4.
none

1.
Synchronization
2.
…… provides an Interface between the process and the
System call
Operating System
3.
Segmentation
4.
None of the above

1.
Real Time Operating Systems
2.
……. are required to complete a critical task within a
guaranteed amount of time. Multi Tasking Operating
Systems
3.
Distributed Operating Systems
4.
None of the above

1.
……. is a classic synchronization problem that involves the Bounded Buffer Problem
allocation of limited 2.
resources amongst a group of processes in a deadlock free and
Dining Philosophers Problem
starvation free
manner. 3.
Readers Writers Problem
4.
None of the above

1.
getpid
2.
……. is a system call that returns the process ID of current
process.
wait
3.
getppid
4.
None of the above

1.
getpid
……. is a system call that returns the process ID of the parent of 2.
the current process.
wait
3.
 303

getppid

4.
None of the above

1.
Ordinary files
2.
…….files represent physical devices like printers, terminals Directory files
etc.,
3.
Special files

4.
None of the above

1.
Shell
……… is a system call of OS that is used to create a new 2.
process?
Kernel
3.
Fork
4.
Thread