Questions Choices

1.
ptr is array of pointers to 10 integers
2.
ptr is a pointer to an array of 10 integers
What does the following declaration mean? int (*ptr)[10];
3.
ptr is an array of 10 integers
4.
ptr is an pointer to array

1.
memory.h
2.
Which header file should be included to use functions like malloc() and dos.h
calloc()? 3.
string.h
4.
stdlib.h

1.
rem = 3.14 % 2.1;
2.
rem = modf(3.14, 2.1);
Which of the following statements should be used to obtain a remainder
after dividing 3.14 by 2.1 ? 3.
rem = fmod(3.14, 2.1);
4.
Remainder cannot be obtain in floating point
division.

1.
& operator
2.
Which bitwise operator is suitable for turning off a particular bit in a && operator
number? 3.
|| operator
4.
! operator

1.
remove(var-name);
2.
free(var-name);
How will you free the allocated memory ?
3.
delete(var-name);
4.
dalloc(var-name);
Questions Choices

1.
strnstr()


 2.

 laststr()
The library function used to find the last occurrence of a character in a 3.
string is strrchr()
4.
strstr()

1.
'c' means argument count 'v' means argument
vector
2.
'c' means argument count 'v' means argument
vertex

What do the 'c' and 'v' in argv stands for? 3.

'c' means argument control 'v' means argument
vector
4.
'c' means argument configuration 'v' means
argument visibility




1.
* (asterisk)
2.

 | (pipeline)
Which of the following special symbol allowed in a variable name? 3.
- (hyphen)
4.
_ (underscore)

1.
J = 0, K = 0
2.
J = 0, K = 1
How is a J-K flip-flop made to toggle?
3.
J = 1, K = 0
4.
J = 1, K = 1

1.
each flip-flop
2.
all flip-flops and gates
A ripple counter's speed is limited by the propagation delay of.
3.
only circuit gates
4.
none
Questions Choices

1.
latches
2.
flipflop
Memory elements in clocked sequential circuits are called.
3.
signals
4.
gates

1.
Tell the time of the day
2.
Tell how much time has elapsed since the
The clock signals are used in sequential logic circuits to system was turned on
3.
Carry parllel data signals
4.
Synchronize events in various parts of system

1.
External clock is to be provided
2.
It is more complex
It is difficult to design asynhronous sequential circuit because.
3.
It is using Flip flops
4.
Generally they involve stability problem

1.
Commutative Law
2.
Distributive Law
NOR Gate does NOT follow
3.
Associative Law
4.
DeMorgan’s Theorem

1.
All canonical form are standard form
2.
All standard form are canonical forms
Which statement is true: 3.
Standard form must consists of minterms
4.
Canonical form can consist of a term with a
literal missing
Questions Choices

1.
One literal

The combination of Sixteen adjacent squares in four variable K-map 2.

represent the function equal to
 Unity

 3.
Zero
4.
Four literal

1.
84-2-1
2.
8421
K-map follow following code for marking adjacent variables
3.
Gray Code
4.
2421

1.
merge sort


2.
Which data structure is used during recursion stack
3.
list
4.
linear search

1.
selection sort
2.
merge sort


Divide and conquire mechanism is used in 3.

quick sort and merge sort


4.
indexed sequential search


1.
if(new_node==null) 


How will you handle the overflow condition of a linked stack through 2.
code(note: new_node is a newly created node in a memory)
 if(new_node==0)
3.
if(top==size)
4.
none
Questions Choices

1.
O(log n) 


2.
O(n) 


What is the worst case for Selection sort

3.
O(2n) 


4.
O(n^2) 


1.
Un sorted array to be the input


2.
Have to consider only n/2 elements 

What is the precondition for binary search

3.
all elements should be sorted
4.
none

1.
O(log n)


2.
O(2n)


What is the best case for Selection sort

3.
O(1)


4.
O(n^2)


1.
left child = 2n+1 right child= 2n+2
2.
For a node at position n its left and right child are given by the relations left child = 2n+2 right child= 2n+1

________________________________________(consider the index starts
from 0) 3.
left child = 2n-1 right child= 2n-2
4.
None
Questions Choices

1.
Radix search


2.
Linear search
Which searching technique is better, if unsorted array is given as input
3.
Binary search
4.
Indexd sequential search


1.
B+ Tree


2.
Which of the following tree may have smaller elements in its left subtree AVL Tree
and larger element in its right subtree
3.
Binary Tree
4.
Binary Search Tree

1.
Kruskal's algorithm


2.

 Prim's algorithm

Which of the following algorithm is used to find the shortest path between
two nodes in graph
3.
Dijiktra's algorithm
4.
Merge algorithm

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

1.
Traversal


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

1.
Array
2.
Tree
Which of the following data structure is linear data structure?
3.
Graph
4.
None

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

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

1.
overflow
2.
underflow
The situation when in a linked list START=NULL is
3.
housefull
4.
saturated

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

1.
Linked lists
2.

 Stacks
A data structure where elements can be added or removed at either end but
not in the middle 3.
Queues
4.
Deque

1.
FAEKCDBHG
2.
FAEKCDHGB
Given inorder :EACKFHDBG, Find the preorder
3.
EAFKHDCBG
4.
FEAKDCHBG

1.
Counting the maximum memory needed by the
algorithm
2.
Counting the minimum memory needed by the
The space factor when determining the efficiency of algorithm is measured algorithm
by 3.
Counting the average memory needed by the
algorithm
4.
Counting the maximum disk space needed by
the algorithm

1.
10


2.
-10

What will be the output of the following code: int a = 10; printf("%d",&a);
3.
10.000


4.
none

1.
10
2.
unsingned int a = 10;
-10
printf("%d",a-20);

3.
20
4.
-20
Questions Choices

1.
printf("\*3s","VIT UNIVERSITY");


2.

 printf("\3s", "VIT UNIVERSITY");
In the following print statement, without changing the string "VIT
UNIVERSITY", how do you print "VIT" alone in the output. 3.
printf("%3s", "VIT UNIVERSITY"); 


4.
printf("%.3s", "VIT UNIVERSITY");

1.
Not possible


2.

 if a>b return a else b
How do you print largest of two numbers in the following statement:
#define big(a,b) ................? printf("%d",big(5,77)); 3.
a>b ? a:b


4.
None

1.
printf("%x", &i);


2.
printf("%u", &i);



How can you access the address of register variable in C? ex: register int i;
3.
printf("%d", &i);


4.
None

1.
same 


Write the answer of the following statement: (note: program have no errors) 2.
char a[5]="vit"; char b[] = {'v','i','t'}; if(a==b) printf("same"); else not same
printf("not same"); 3.
None
4.
error
Questions Choices

1.
break(0);


2.
for (; ; );



Identify the invalid statement from the following 3.
if (1)


4.
while(false)


1.
-2
2.
0
Choose the correct answer for the given expression: 1+2-3*4%5
3.
1
4.
-1

1.
Tells the computer components what to do
2.
Application software...
 Let's the computer interact with the user
3.
Let's the user perform a task
4.
Is encoded on a piece of hardware

1.
Integer
2.

 Integer pointer
In the following code, the P2 is Integer Pointer or Integer? typedef int *ptr;
ptr p1, p2; 3.
Error in declaration
4.
None

1.
a;
2.
Which of the following gives the memory address of a variable pointed to *a;
by pointer a? 3.
&a;
4.
address(a);
Questions Choices

1.
500

What will be the output of the following code #include<stdio.h> void 2.

main() { int i; int a[3]=5; for (i=2;i>=0;i--) 5 null null
{ printf(“%d\n”,a[i]); } }
 3.
5 garbage garbage
4.
005

1.
complexity of calculations to be performed
2.
Which of the following factors does not affect the total time taken to ower of the processor
generate by using computers? 3.
speed of the printer
4.
place where the computer is kept

1.
D flip flop
2.
JK flip flop
_______ is used to store data in registers
3.
SR flip flop
4.
None

1.
a = 0, b = 0, c = 1, d = 0
2.
a = 0, b = 0, c = 0, d = 0
3.
a = 0, b = 1, c = 1, d = 0
4.
a = 0, b = 1, c = 1, d = 1
Questions Choices

1.
1, 2, 3 and 4
2.
1
3.
2
4.
3 and 4

1.
Yes
2.
No
3.
None
4.
Error

1.
In a C program, following variables are defined: printf("%f %Lf %lLf",x,y,z);
2.
printf("%f %lf %Lf",x,y,z);
float x = 2.17;
3.
double y = 2.17; printf("%f %ff %Lff",x,y,z);
long double z = 2.17; 4.
Which of the following is correct way for printing these variables via printf. printf("%f %lf %LLf",x,y,z);
Questions Choices

1.
Infinite loop
2.
987654321
3.
97531
4.
9753

Predict the output of the above code

Predict the output

1.
16 21
2.
7 12 17 22
3.
5 10 15 20
4.
9753
Questions Choices

1.
No compile error and it will not print anything
2.
Compile Error because any goto label isn’t
allowed in for loop in C
3.
No compile error but behaviour of the program
would depend on C compiler due to
nondeterministic behaviour of goto statement
4.
No compile error and it will print GeeksQuiz 10
times because goto label LOOP wouldn’t come
in effect

Consider the following program fragment 1.

a<=b
if(a > b)
2.
if(b > c) a > b and b <= c
s1; 3.
b>c
else s2;
4.
s2 will be executed if b >= c and a <= b

Consider the following program fragment

i=6720;

j=4;
1.
9
while (i%j)==0 2.
4
3.
{
8
4.
i=i/j; 6720

j=j+1;

}
On termination j will have the value
Questions Choices

1.
compiler error
2.
runtime error
What does the following C statement mean?
scanf("%10d", &a); 3.
Read maximum 10 characters from console
4.
Read exactly 10 characters from console

Find the output

#include <stdio.h>
1.
1
int main()
2.
{ 2
    int i = 1, 2, 3; 3.
     3

    printf("%d", i); 4.
error
    

    return 0;
}

Find out the output

1.
IF
2.
ELSE IF
3.
ELSE
4.
error
Questions Choices

Find the output

#include <stdio.h>
1.
1
int main()
2.
{ 2
    int i = (1, 2, 3); 3.
     3

    printf("%d", i); 4.
error
    
    return 0;
}

Find the output

1.
1
2.
0
3.
5
4.
error
Questions Choices

1.
10 10 10 10 10
2.
10 11 12 13 14
3.
error
4.
10

Find the output of the below program

1.
Quiz
2.
program
3.
compile time error
4.
run time error

Output of following program?

1.
81
2.
123456788
3.
123456781
4.
error
Questions Choices

What is the output of the below program?

#include <stdio.h>

1.
welcome
2.
Quiz
3.
sjt419
4.
error

Predict the output of below program?

1.
03
2.
05
3.
3
4.
5
Questions Choices

Find the output of the below code

1.
"raj % kumar % c"
2.
raj % kumar % c
3.
raj kumar
4.
error

What is the output of the following code snippet?

#include<stdio.h>

main()
{

int x = 5; 1.compile error


2.
Hi
if(x=5) 3.
HelloHi
{
4.
if(x=5) break; runtime error
printf("Hello");
}

printf("Hi");
}

What is the output of following program?

1.
# include <stdio.h> n1 = 10, n2 = 9

int main()
2.
{ n1 = 9, n2 = 9
   char str1[] = "GeeksQuiz";
   char str2[] =
{'G', 'e', 'e', 'k', 's', 'Q', 'u', 'i', 'z'}; 3.
   int n1 = sizeof(str1)/sizeof(str1[0]); n1 = 10, n2 = 10
   int n2 = sizeof(str2)/sizeof(str2[0]);
   printf("n1 = %d, n2 = %d", n1, n2);
   return 0; 4.
n1 = 9, n2 = 10
}
Questions Choices

In below program, what would you put in place of “?” to print “Quiz”? 1.
arr
#include <stdio.h>
int main() 2.
{ (arr+5)
  char arr[] = "GeeksQuiz";
3.
  printf("%s", ?);
(arr+4)
  return 0;
} 4.
not possible

1.
object code
2.
executable code
Linker generates ___ file
3.
assembly code
4.
error

1.
A human readable
2.
What is the common issue in signed numbers and 1’s complement 2 representations for 0

representation


 3.
2 representations for 1


4.
2 representations for every number

1.
01010
2.
Perform the subtraction with the following unsigned binary numbers by 1100
taking the 2's complement of the subtrahend 11010 - 10000 is 3.
101010
4.
1011

1.
subtract multiplicand from partial product
2.
add multiplicand to partial product
When Qn and Qn+1 = 01 then the action taken is
3.
arithmetic shift right
4.
logical shift right
Questions Choices

1.
restoring algorithm


2.
Which algorithm is not used for performing binary division non-restoring division
3.
booth's algorithm
4.
comparison method

1.
56
2.
Subtract the two floating numbers 0.67880e+4 and .67320e+4. What is the 0.56e-2
value of the number after normalization? 3.
560
4.
0.056

1.
Exponent is equal to zero
2.
Exponent is greater than 127
What is exponent underflow in IEEE 754 single precision format?
3.
Exponent is smaller than -127
4.
Exponent is equal to 127

1.
Serial access medium
2.
Random access medium
Magnetic tape is a
3.
A parallel access medium
4.
None

1.
Random Access
2.
Sequential Access
In which Access method , Cycle time is Same for all the blocks of memory
3.
Direct Access
4.
Semi Random Access
Questions Choices

1.
Sign-magnitude


2.

 one's complement

Memory Address locations are specified using which data representation
3.
Unsigned
4.
two's complement

1.
Implied
2.
The address where data is available as part of the instruction is called as Immediate
……… addressing mode 3.
Indirect
4.
Direct

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

1.
the dispatching of a task
2.
the creation of a new job
Fork is
3.
the creation of a new process
4.
increasing the priority of a task

1.
is a natural consequence of virtual memory
systems
2.
Thrashing can always be avoided by swapping
3.
always occurs on large computers
4.
can be caused by poor paging algorithms
Questions Choices

1.
is required for all processes
2.

 is usually done via disk drives
Interprocess communication 3.
is never necessary
4.
allows processes to synchronize activity

1.
Reenterable
2.

 non reusable
The principle of locality of reference justifies the use of 3.
virtual memory
4.
cache memory

1.
occurs only if the file system is used improperly
2.
can always be prevented
Fragmentation of the file system
3.
can be temporarily removed by compaction
4.
is a characteristic of all file systems

1.
is a sign of an efficient system
2.

 is taking page frames from other working sets
Page stealing 3.
should be the tuning goal
4.
is taking larger disk spaces for pages paged out

1.
Synchronization


 2.

 Mutual Exclusion
.. .............. refers to a situation in which a process is ready to execute but is 3.
continuously denied access to a processor in deference to other processes. Dead lock
4.
Starvation
Questions Choices

1.
Paging method
2.

 Segmentation method
........................ provides a larger sized of virtual memory but require virtual
memory which provides multidimensional memory. 3.
Paging and segmentation method
4.
Demand paging

1.
SCAN
2.

 C-SCAN
The ............... policy restricts scanning to one direction only 3.
N-Step SCAN
4.
LOOK

1.
IR
2.
PC
The decoded instruction is stored in ______
3.
Registers
4.
MDR

1.
Little Endian
2.

 Big Endian
The type of memory assignment used in Intel processors is _____ 3.
Medium Endian
4.
None

1.
MAR
2.

 MMU
To get the physical address from the logical address generated by CPU we
use ____ 3.
Overlays
4.
TLB
Questions Choices

1.
Cache
2.
TLB
During transfer of data between the processor and memory we use ______
3.
Buffers
4.
Registers

1.
OP-Code
2.
Operators
The instructions like MOV or ADD are called as ______
3.
Commands
4.
None

1.
Redundant instructions
2.
Instructions which wont appear in the object program are called as _____
 Exceptions
3.
Comments
4.
Assembler Directives

1.
Frames
2.
Segments
The program is divided into operable parts called as _________
3.
Pages
4.
Sheets

1.
Superscalar operation
2.
Assembly line operation
The pipelining process is also called as ______
3.
Von neumann cycle
4.
None
Questions Choices

1.
1
2.
2
Each stage in pipelining should be completed within ____ cycle
3.
3
4.
4

1.
40
2.
5
3.
15
4.
10

1.
idle
2.
If the task executes the service codes and gets the system resources at that running
instance, it is said to be in 3.
blocked
4.
ready

1.
turnaround time
2.
response time
The time elapsed between the job submission and its completion is
3.
burst time
4.
waiting time

1.
cache
2.
Which of the following level of storage is not managed by operating register
system? 3.
magnetic disk
4.
solid state disk
Questions Choices

1.
multilevel queue
2.
first come first served
Which of the following process scheduling algorithm may lead to starvation
3.
shortest job next
4.
round robin

1.
1
Consider three CPU-intensive processes, which require 10, 20 and 30 time 2.
units and arrive at times 0, 2 and 6, respectively. How many context 2
switches are needed if the operating system implements a shortest
remaining time first scheduling algorithm? Do not count the context 3.
switches at time zero and at the end. 3
4.
4

1.
stack
2.
file descriptor table
Which of the following is not shared by the threads of the same process?
3.
address space
4.
message queue

1.
Distributed computing
All resources are shared and integrated within one OS, in computing 2.
paradigm named
 Parallel computing



 3.
Cloud computing
4.
Centralized computing

1.
Memory sharing
2.
None
In a distributed system, information is exchanged through
3.
Message passing
4.
Exceptions
Questions Choices

1.
Cloud computing
2.
All resources are tightly coupled in computing paradigm of
 Centralized computing


3.
Distributed computing
4.
Parallel computing

1.
Tightly coupled

A set of highly integrated machines that run same process in parallel is 2.

known to be
 Loosely coupled

 3.
Space based
4.
Peer-to-Peer

1.
Data-level processing
2.
Degree-level processing
DLP stands for
3.
Data-level parallelism
4.
Degree-level parallelism

1.
HPC
2.
Cloud computing and web service platforms are focused on applications HTC
like 3.
HCC
4.
HRC

1.
Message retrieving
2.
Message passing
RPC connectors and message queues are mechanisms for
3.
Message delivering
4.
Message Sync-ing
Questions Choices

1.
Parallelized services
2.
Innovative services
Grid and cloud platforms are regarded as
3.
Utility service providers
4.
Cyber services

1.
Dependently
2.
In grid computing model, servers or personal computers run
 Independently


3.
Concurrently
4.
Horizontally

1.
High-turning computing
2.
High-tabulation computing
HTC stands for
3.
High-technology computing
4.
High-throughput computing

1.
Critical computed code
2.
Tabulated code
One of first uses of grid computing was breaking of a
3.
Cryptographic code
4.
Decryptographic code

1.
Tflops
2.
Pflops
Speed of HPC systems has enhanced from Gflops to
3.
Eflops
4.
Mflops
Questions Choices

1.
Minicomputers
2.
Mainframe computers

Centralized computing covers many data centers and 3.

Supercomputers
4.
Microcomputers




1.
Low-flux computing
2.
Primary goal for HTC paradigm is to provide
 High-flux computing


3.
Computer utilities
4.
High ratio Identification

1.
Computer architecture deals with the functional
behaviour of a computer system as viewed by a
programmer & Computer organization deals
with structural relationships that are not visible
to the programmer
2.
Computer organization deals with the functional
behaviour of a computer system as viewed by a
programmer & Computer Architecture deals
Differentiate between Computer Architecture & Computer Organization with structural relationships that are not visible
to the programme
3.
Computer organization deals with Functional
operation of the individual hardware units
within a computer system, and the flow of
information and control among them &
Computer Architecture deals with clock
frequency or the size of the physical memory
4.
None

1.
Indirect addressing mode
2.
Index addressing mode
The addressing mode which makes use of in-direction pointers is ______
3.
Relative addressing mode
4.
Offset addressing mode
Questions Choices

1.
26
2.
If the memory address space is 256 MB and the word size is 16 bits, then 24
bits needed to access each word 3.
27
4.
28

1.
10001110
2.
01111110
Represent (-14) in signed magnitude form
3.
11111110
4.
10000001

1.
1,0
2.

 0,0
Add the numbers in signed magnitude and give the value of AVF in each
case? (a) (+45) + (+31) (b) (+45) - (+31) 3.
0,1
4.
1,1

1.
divide stop
2.
Provide an Interrupt Request

The best way to avoid divide overflow condition is
3.
Suspend the Program
4.
Floating point representation of data

1.
Look Aside cache
2.
The memory reference is intercepted and the cache is checked first for a hit, Look through Cache
and if a miss occurs then the access to main memory is started. A cache that
operates in this manner is called a ………………………… 3.
Look inside only cache
4.
Look outside cache
Questions Choices

1.
Direct mapping
2.
In which cache organization, index field is not required during block set associative
identification 3.
fully associative
4.
2-way associative

1.
PI=1 & RF=1 then PO=0
2.
PI=1 & RF=0 then PO=1

In an daisy chain priority interrupt the condition to pass the acknowledge
signal to the next device is
3.
PI=0 & RF=1 then PO=0
4.
PI=0 & RF=0 then PO=0

1.
memory space.
2.
address space.

In a virtual memory system, the addresses used by the programmer belongs
to
3.
main memory address.
4.
physical addresses.

1.
Write-through



 2.
The method for updating the main memory as soon as a word is removed write-back
from the Cache is called 3.
protected write
4.
cache-write

1.
RISC architecture.
2.
CISC architecture.
Zero address instruction format is used for
3.
Von-Neuman architecture.
4.
Stack-organized architecture.
Questions Choices

1.
memory management software.
2.
assembler.
Address symbol table is generated by the
3.
match logic of associative memory.
4.
generated by operating system.

1.
Hardware interrupt.
2.
External interrupt.
Stack overflow causes
3.
Internal interrupt.
4.
Software interrupt.

1.
Produces the same result as obtained with
logical shift left operation.
2.
Causes the sign bit to remain always
unchanged.
Arithmetic shift left operation
3.
Needs additional hardware to preserve the sign
bit.
4.
Is not applicable for signed 2's complement
representation.

1.
Release all resources before requesting a new
resource
2.
Number the resources uniquely and never
request a lower numbered resource than the last
Which of the following is NOT a valid deadlock prevention scheme? one requested.
3.
Never request a resource after releasing any
resource
4.
Request and all required resources be allocated
before execution.
Questions Choices

Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be

processes.

Suppose each process P[i] executes the following:
1.
wait (m[i]); wait(m[(i+1) mode 4]);
Thrashing
2.
------ Deadlock
3.
Starvation, but not deadlock
release (m[i]); release (m[(i+1)mod 4]);
4.
None
This could cause

1.
Always decrease the number of page faults
2.
Consider a virtual memory system with FIFO page replacement policy. Always increase the number of page faults
For an arbitrary page access pattern, increasing the number of page
frames in main memory will 3.
Some times increase the number of page faults
4.
Never affect the number of page faults

1.
Register
2.
Cache
Which of the following requires a device driver?
3.
Main memory
4.
Disk

1.
a program in execution
2.
a job in secondary memory
Process is
3.
contents of main memory
4.
program in High level language kept on disk

1.
loader
2.
A system program that sets up an executable program in main memory linker
ready for execution is 3.
assembler
4.
compiler
Questions Choices

1.
can be temporarily removed by compaction
2.
is a characteristic of all file systems
Fragmentation of the file system
3.
can always be prevented
4.
occurs only if the file system is used improperly

A single processor system has three resource types X, Y and Z, which

are shared by three processes. There are 5 units of each resource type.
Consider the following scenario, where the column alloc denotes the
number of units of each resource type allocated to each process, and the
column request denotes the number of units of each resource type
requested by a process in order to complete execution. Which of these 1.
processes will finish LAST?
 P0
2.
P1

alloc request 3.
P2
X Y Z X Y Z
4.
P0 1 2 1 1 0 3 none
P1 2 0 1 0 1 2
P2 2 2 1 1 2 0

1.
13 units
Consider three processes (process id 0, 1, 2 respectively) with compute 2.
time bursts 2, 4 and 8 time units. All processes arrive at time zero. 14 units
Consider the longest remaining time first (LRTF) scheduling algorithm.
In LRTF ties are broken by giving priority to the process with the 3.
lowest process id. The average turn around time is: 15 units
4.
16 units

1.
I/O protection is ensured by operating system
routine(s)
Normally user programs are prevented from handling I/O directly by I/
O instructions in them. For CPUs having explicit I/O instructions, such 2.
I/O protection is ensured by having the I/O instructions privileged. In a I/O protection is ensured by a hardware trap
CPU with memory mapped I/O, there is no explicit I/O instruction. 3.
Which one of the following is true for a CPU with memory mapped I/ I/O protection is ensured during system
O? configuration
4.
I/O protection is not possible
Questions Choices

1.
collection of files 


2.
A database is a collection of data
3.
collection of interrelated data
4.
collection of multimedia data

1.
User data
2.
System data
Data Dictionary stores
3.
Data about data
4.
different view of data

1.
varchar
2.

 varchar2
The following data type is specific to Oracle product 3.
integer
4.
number(p,s)

1.
physical level
2.
conceptual level
The data mapping is done at 3.
view level


4.
high level

1.
sequence of instructions
2.
A transaction is a
 sequence of instructions for a task
3.
sequence of instructions for a sequence of job
4.
sequence of instructions for consistent database
Questions Choices

1.
Single user dbms
2.
Multi-user dbms
Concurrency control is handled in the following environment 3.
client-server dbms 


4.
Multi-tier dbms

1.
S-Lock
2.
A following is the lock meant for a single user operations
 X-Lock
3.
I-Lock
4.
none

1.
bits
2.

 bytes
The basic i/o in database is done in terms of 3.
blocks
4.
words

1.
physical level
2.
conceptual level
ODBC component is used in the following level
3.
view level
4.
high level

1.
Primary Key
2.
Unique Key
Relationship between entity sets of cardinality either 1:1 or 1:M or M:1 is
mapped into relational schema by 3.
Foreign Key


4.
Composite Key
Questions Choices

1.
a weak enity set is associated with its strong
entity set 


2.
an entity set participate in relationship more
than once in differenc roles
A relationship is said to be recursive if

3.
more than one entity set participate in
relationship


4.
an entity set is totally participating in a
relationship


1.
to separate DML and host language statements
in application program


2.
to separate high level DML statements from
low level DML statements in application
The job of pre-compiler component of database systems is
 program
3.
to club DML and host language statements in
application program 


4.
to club high level DML statements and low
level DML statements in application program


1.
Equi Join
2.

 Theta Join
Join operation that involves in-equality in it is called 3.
Inner Join
4.
Outer Join

1.
Atomcity
2.

 Consistency
Which among the following is not desirable property of a transaction in
database system? 3.
Insulation
4.
Durability
Questions Choices

1.
Shadow Paging
2.
Which recovery scheme in database system is not going to make use of Immediate Update
system log? 3.
Differed Update
4.
Delayed Update

1.
Data Isolation
2.

 Data Insulation
The concept that gives freedom to modify schema at one level with out need
to make those changes at schemas at higher levels is called 3.
Data Inconsistency
4.
Data Independence

1.
It is virtual in nature and consumes no memory
2.
It is non-virtual in nature and consumes
Which among the following is true with respect to view of the database? memory
3.
It is physical in nature and consumes memory
4.
It is logical in nature and consumes memory

1.
Operations belong to different transactions,
both accessing different data items and atleast
one of them be write operation
2.
Operations belong to same transaction, both
accessing different data items and at least one

 of them be read operation
Which pair of operations in a schedule of transactions is called conflict
operations? 3.
Operations belong to different transactions,
both accessing different data items and at least
one of them be write operation
4.
Operations belong to different transactions,
both accessing different data items and at least
one of them be read operation

1.
read lock
2.
write lock
Which among the following locks is an exclusive lock?
3.
binary lock
4.
multi-mode lock
Questions Choices

1.
Transaction- management component
2.
Recovery- management component
Which is responsible for ensuring Isolation property
3.
Concurrency control component
4.
None

1.
Closed Hashing
2.

 open Hashing
If the bucket for the record is already full then the record is placed in other
bucket based on some policy called ----- 3.
open Hashing and Closed Hashing
4.
None

1.
Younger transactions are executed first
2.
Older transaction are restarted


In Basic Timestamp Ordering algorithm 3.
Older transactions are executed first
4.
Both older and younger transactions are
restarted

1.
Basic 2PL
2.

 Strict 2PL
Which of the following methods is used to avoid cascading rollback?

3.
Linear 2PL
4.
None

1.
Primary
2.
Indexes whose search key specifies an order that is different from sequential Secondary
order of the file are called ______ index. 3.
Non key
4.
None
Questions Choices

1.
Basic timestamp ordering does not ensure
conflict serializability
2.
Strict timestamp ordering ensures freedom from
Which of the following is true for timestamp ordering? deadlock
3.
Thomas’ write rule enforces conflict
serializability
4.
None

1.
Strict two-phase locking protocol
2.

 Tree locking protocol
Cascading rollback is avoided in all protocol except

3.
Two-phase locking protocol
4.
Validation based protocol

1.
well structured
2.
If one attribute is determiant of second , which in turn is a determinant of in 1 NF
third, then the relation cannot be 3.
in 2 NF
4.
in 3 NF

1.
Removing overlapping composite keys
2.
Splitting into relations which do not have more
than one independent multivalued dependency
A 3 NF relation is split into 4 NF by
3.
Removing multivalued dependency
4.
By putting dependent non-key attribute in a
separate table

1.
DA->C
2.
A->C
The FD A->B, DB->C implies 3.
B->A
4.
DB->A

Questions Choices

1.
A->B, B->CD


2.
R(A,B,C,D) is a relation. Which of the following does not have a lossless A->B, B->C, C->D

join dependency preserving BCNF decomposition
3.
AB->C, C->AD
4.
A->BCD

1.
Functional dependency
2.
Multivalued dependency
Fifth Normal form is concerned with
3.
Join dependency
4.
Domain-key

1.
Union
2.
Which of the following relational algebra operations do not require the Intersection
participating tables to be union-compatible? 3.
Difference
4.
Join

1.
Using the below data:

1
EMPNO ENAME SAL

A822 RAMASWAMY 3500
 2.
A812 NARAYAN 5000
 0
A973 UMESH

A500 BALAJI 5750
 3.
Select count(sal) from Emp will retrieve
 3


4.
4
Questions Choices

1.
Software engineering belongs to Computer
science


2.
Software engineering is a part of more general
form of System Engineering

Which of these is incorrect ?

3.
Computer science belongs to Software
engineering


4.
Software engineering is concerned with the
practicalities of developing and delivering
useful software

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


1.
Build & Fix Model


2.
Which one of the following models is not suitable for accommodating any Prototyping Model

change?

3.
RAD Model


4.
Waterfall Model

1.
PCustomer_name(s balance >1000(Deposit))
2.

 s Customer_name(Pbalance >1000(Deposit))
Using Relational Algebra the query that finds customers, who have a
balance of over 1000 is 3.
PCustomer_name(s balance >1000(Borrow))
4.
s Customer_name(Pbalance >1000(Borrow))
Questions Choices

1.
m
2.
m+1
A B-tree of order m has maximum of _____________ children
3.
m-1
4.
m+2

1.
Waterfall Model


2.
Prototyping Model

Which model can be selected if user is involved in all the phases of SDLC?


3.
RAD Model


4.
both b & c

1.
Dependency preserving but not lossless join
2.
Consider a schema R(A, B, C, D) and functional dependencies A ? B and Dependency preserving and lossless join
C ? D. Then the decomposition R1(A, B) and R2(C, D) is 3.
Lossless Join but not dependency preserving
4.
Lossless Join

1.
Software is set of programs


2.
Software is documentation and configuration of
What is a Software ?
 data


3.
a,b


4.
None of the mentioned

1.
mn
2.
Consider the join of a relation R with relation S. If R has m tuples and S has m+n
n tuples,then the maximum size of join is: 3.
(m+n)/2
4.
2(m+n)
Questions Choices

1.
True


2.
False

Functional requirements capture the intended behavior of the system.
3.
All


4.
None

1.
Entry level personnel


2.
Middle level stakeholder

Which is one of the most important stakeholder from the following ?


3.
Managers


4.
Users of the software

1.
Sparse
2.
In the case of a --- the index record is created only for some search key Dense
values 

3.
Primary
4.
None

1.
system context model


2.
Which of the following is a dynamic model that shows how the system interaction model

interacts with its environment as it is used?

3.
environmental model


4.
both system context and interaction
Questions Choices

1.
Specification delays


2.
Product competition

Which of the following is not considered as a risk in project management?


3.
Testing


4.
Staff turnover

1.
Execution phase
2.
Which phase is not a part of the optimistic technique?
 Read phase
3.
write phase
4.
Validation phase

1.
Sequence Diagram + Collaboration Diagram


2.
Activity Diagram + State Chart Diagram

Interaction Diagram is a combined term for


3.
Deployment Diagram + Collaboration Diagram


4.
None of the mentioned

1.
deleted


2.
eliminated

According to ISO 9001, the causes of nonconforming product should be


3.
identified


4.
eliminated and identified
Questions Choices

1.
Software Product Engineering


2.
In CMM, the life cycle activities of requirements analysis, design, code, and Software Quality Assurance

test are described in

3.
Software Subcontract Management


4.
Software Quality Management

1.
3
2.
4
How many stages are there in process improvement?
3.
5
4.
6

1.
Process metric


2.
The documentation of a process which records the tasks, the roles and the Process analysis

entities used is called

3.
Process modelling


4.
None of the mentioned

1.
PERT


2.
Which of the following is a project scheduling method that can be applied CPM

to software development?

3.
CMM


4.
both PERT and CPM
Questions Choices

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.
document.getElementById("demo").innerHTM
L="Hello!";


2.
What is the correct JavaScript syntax to change the content of the HTML document.getElementByClass("demo").innerH
element below?
 TML="Hello!";

<p id="demo">IWP demo</p>
3.
document.getElementByName("demo").innerH
TML="Hello!";
4.
#demo.innerHTML="Hello!";

1.function =
How do you create a function in JavaScript? myfunction() 2.function:myfunction() 3.functio
n myfunction() 4.func myfunction()

1.var cars = ["a", "b", "c"]; 2.var cars = "a", "b",

What is the correct way to write a JavaScript array? "c"; 3.var cars = ("a", "b", "c"); 4.var cars = a,
b, c;

1.onchange 2.onmouseclick 3.onclick 4.

Which event occurs when the user clicks on an HTML element?
onmouseover

How do you declare a JavaScript integer variable as "i"? 1. var i; 2.int i; 3.variable i; 4.$i;

Consider the following code snippet : var a = [1,2,3,4,5]; x=a.slice(0,3);

1.1,2,3 2.4,5 3.1,2,3,4 4.1,2,3,4,5
What is the value of x in the given code snippet ?

What will be the output of the following Javascript code? var val1=[1,2,3];
1.1,2,3 2.Error 3.1,2,3,6,7,8 4.123
var val2=[6,7,8]; var result=val1.concat(val2); document.writeln(result);

What will be the output of the following Javascript code? var

1.1 2.2 3.3 4.Error
values=["1","2","3"]; var ans=values.shift(); document.writeln(ans);

What will be the output of the following Javascript code? function info()
1.1 2.2 3.3 4.Error
{ int a=1; int b=2; return a*b; } document.write(info());
Questions Choices

1.
setTimeout()


2.
Which function among the following lets to register a function to be setTotaltime()

invoked once?

3.
setInterval()


4.
settime()

1.
clearInvocation()


2.
Which method receives the return value of setInterval() to cancel future cancelInvocation()

invocations?



3.
clearInterval()


4.
clear()

1.
Window


2.
Position

To which object does the location property belong?

3.
Element


4.
Document


1.
yes
What will be the output of the following Javascript code?

function output(option)
 2.
{
 No
return (option ? "yes" : "no");

}
 3.
bool ans=true;
 Run time error
console.log(output(ans));
4.
Compile time error
Questions Choices

1.
hi

What will be the output of the following Javascript code?
 2.

string a = "hi";
 there
string b ="there";
 3.
alert(a+b); hithere
4.
undefined

What will be the output of the following Javascript code?


function getcube()
 1.
{ 
 9
var number=document.getElementById("number").value; 
 2.
alert(number*number*number); 
 27
} 

<form> 
 3.
Enter No:<input type="text" id="number" name="number" error
value="3" /><br/> 

<input type="button" value="Cube" onclick="getcube()"/> 
 4.
</form> undefined

1.
modify()


2.
Which is the method that removes the current document from the browsing assign()

history before loading the new document?

3.
replace()


4.
remove()

1.
What will be the output of the following Javascript code?

1.1
<p>1</p>

<p>2</p>
 2.
<p>3</p>
 2
function myFunction()

{
 3.
var x = document.getElementsByTagName("P").item(0);
 3
alert(x.innerHTML);
 4.
} error

1.
What will be the output of the following Javascript code?

1
<p>1</p>

<p>2</p>
 2.
<p>3</p>
 2
function myFunction()

{
 3.
var l = document.getElementsByTagName("P").length;
 3
alert(l);
 4.
} error

1./pattern/quantifiers 2./quantifiers/pattern 3./

Java script regular expressions has the following syntax
modifiers/pattern 4./pattern/modifiers

Select the quantifiers of java script regular expression 1.i 2.g 3.m 4.n+
Questions Choices

1.Matches any string that is followed by a

sp 2.Matches any string that ends with a
In java script regular expressions ?=n means specific string n 3.Excludes any string that is
followed by a specific string n 4.Excludes any
string that ends with a specific string n

Pick a statement that matches any string that is not followed by a specific
1.?=n 2.^n 3.?!n 4.n$
string n in java script regular expression

Select the quantifier of java script regular expression 1.>= 2.<= 3.* 4./

select the modifier of java script regular expression 1.* 2.h 3.+ 4.i

1.Matches any string that contains zero or more

occurrences of n 2.Matches any string that
The quantifier n* represents in java script regular expression is contains zero or one occurrences of n 3.Matches
any string that contains at least one n 4.Matches
any string that contains a sequence of X n's

1.Matches any string that contains zero or more

occurrences of n 2.Matches any string that
contains zero or one occurrences of n 3.
The quantifier n+ represents in java script regular expression is
Matches any string that contains at least one
n 4.Matches any string that contains a sequence
of X n's

1.Matches any string that contains zero or more

occurrences of n 2.Matches any string that
The quantifier n? represents in java script regular expression is contains zero or one occurrences of n 3.Matches
any string that contains at least one n 4.Matches
any string that contains a sequence of X n's

1.Matches any string that contains zero or more

occurrences of n 2.Matches any string that
The quantifier n{X} represents in java script regular expression is contains zero or one occurrences of n 3.Matches
any string that contains at least one n 4.Matches
any string that contains a sequence of X n's

1.Matches any string with n at the end of

it 2.Matches any string with n at the beginning
The quantifier n$ represents in java script regular expression is of it 3.Matches any string that contains at least
one n 4.Matches any string that contains a
sequence of X n's

The execution of java script regular expression pattern results is true or

1.exec() 2.Compile () 3.Test () 4.toString ()
false. Which of the following function does it?

The execution of java script regular expression pattern results in returning

1.exec() 2.Compile () 3.Test () 4.match ( )
the first match. Which of the following function does it?

1.Matches any string with n at the end of

it 2.Matches any string with n at the beginning
The quantifier n^ represents in java script regular expression is of it 3.Matches any string that contains at least
one n 4.Matches any string that contains a
sequence of X n's

1.Onchange ( ) 2.OnClick ( ) 3.OnLoad ( ) 4.

The following function does the initializations before the page is loaded
Onmouseover ()
Questions Choices

1.Must contain at least one number and one

uppercase and lowercase letter, and at least 8 or
more characters 2.Must contain more number
and one uppercase and lowercase letter, and at
HTML patter attribute pattern="(?=.*\d)(?=.*[a-z])(?=.*[A-Z]).{8,} least 8 or more characters 3.Must contain more
represents number and more uppercase and lowercase
letter, and at least 8 or more characters 4.Must
contain at least one number and more uppercase
and lowercase letter, and at least 8 or more
characters

In AJAX the open method is always accompanied with _______ method 1.create () 2.send () 3.close ( ) 4.abort ( )

1.Selects all the

elements 2.Selects the

The jquery $("p:first") statement does first element 3.Selects the last
element 4.Selects the middle
element

1.define(name, value); 2.constant(name,

How can we set a constant in PHP
value); 3.none 4.#define(name, value);

The following piece of script will output $n1=011; $n2=9; $n=$n1+$n2;

1.020 2.20 3.18 4.none
print($n);

Which of following function return 1 when output is successful 1.echo 2.print( ) 3.both echo and print() 4.None

1.Get 2.Post 3.Both Get and Post 4.there is no

Which of the following method is suitable when you need to send larger
direct way for larger form. You need to store
data of form submissions_________
them in a file and retrieve

1.count($array_name) 2.sizeof($array_name) 3.
Which of the following php function returns the number of elements in an
length($array_name) 4.both
array
count($array_name) and sizeof($array_name)

Which of the following variables is not a global variable in php 1.$_get 2.$_ask 3.$_request 4.$_post

1.
a is false


2.
$a is true

If a boolean variable $a= 5;
3.
$a is overflow


4.
the statement is not valid

The output of the following script would be
 1.

$GVAR=0;
 GVAR is 15
function INCRIT() {

GLOBAL $GVAR;
 2.
$GVAR++;
 GVAR is 16
$GVAR--;
 3.
$GVAR++;
 GVAR is 1
echo "GVAR is $GVAR";

}
 4.
INCRIT(); GVAR is $GVAR.
Questions Choices

1.
$5
2.
If the variable $a is equal to 5 and variable $b is equal to "a", what’s the 5
value of $$b?

3.
$100
4.
$a

1.
sort()
2.
asort()
Which of the functions is used to sort an array in descending order?
3.
rsort()
4.
dsort()

1.
array_unshift()


2.
into_array()

Which in-built function will add a value to the end of an array?
3.
array_push()


4.
array_shift()

1.
True
What will be the output of the following PHP code?

<?php
 2.
$state = array ("Karnataka", "Goa", "Tamil Nadu",
 1
"Andhra Pradesh");
 3.
echo (array_search ("Tamil Nadu", $state) );
 False
?>
4.
2

1.
echo "\$x";


2.
echo "$$x";

Which statement will output $x on the screen?

3.
echo "/$x";




4.
echo "$x";
Questions Choices

1.
0
What will be the output of the following PHP code ?
 2.
< ?php
 1
int $one = 1;

echo "$one";
 3.
?> $one
4.
error

1.
11
What will be the output of the following PHP code ?

<?php
 2.
$a = 12;
 10
--$a;
 3.
echo $a++;
 12
?>
4.
error

1.
0
What will be printed?
 2.
$a = array();
 1
if ($a[0])

echo "null";
 3.
echo count($a); 2
4.
error

What will be the output of the following PHP code?
 1.

<?php
 I am b

function a() 

{

function b()
 2.
{
 I am bI am a

echo 'I am b';

}
 3.
echo 'I am a';
 Error

}

b();

a();
 4.
?> I am a
Questions Choices

1.
Read/Write. Creates a new file. Returns FALSE
and an error if file already exists


2.
Write only. Creates a new file. Returns TRUE
and an error if file already exists
What is x+ mode in fopen() used for?




3.
Read/Write. Opens and clears the contents of
file


4.
Write. Opens and clears the contents of file

1.
a,fedcb


2.
What is the output of PHP code <?php $rest = substr("abcdef", -1); echo f,abcde

$rest.","; $rest = substr("abcdef", 0, -1); echo $rest; ?>

3.
b,abcdef


4.
a,abcde

1.
enctype='text/plain'
2.
enctype='singlepart/data'
Which of the following attribute is needed for file upload via form?

3.
enctype='multipart/form-data'


4.
enctype='form-data/file'

1.
filesize


2.
You need to check the size of a file in PHP function. $size = X(filename); size

Which function will suitably replace 'X'?

3.
sizeofFile


4.
getSize
Questions Choices

1.
Today is Tuesday


2.
What is the output of PHP code <?php
 Today is 3

echo "Today is " . date("3"); . "<br>"; ?>

3.
Today is 3rd day


4.
Error

1.
date("h");


2.
Which one of the following function will print current time in 24 hours date("h:I:S");

format with minutes and seconds

3.
date("H");


4.
date("H:i:s");

1.
default_timezone_set()


2.
Which of the following function which is used to set default time zone in default_date_timezone_set()

PHP

3.
date_default_timezone_set()


4.
set_default_timezone()

1.
strtotime("tomorrow");


2.
strtotime("next Saturday");

Which is a valid strtotime() function in PHP


3.
All of them


4.
strtotime("+3 Months");
Questions Choices

1.
89
What is the output of PHP code<?php

//Assume today is september 6th 2019
 2.
$d1=strtotime("December 04");
 90
$d2=ceil(($d1-time())/60/60/24);
 3.
echo $d2;
 88
?>
4.
Error//75

1.
Using readfile()


2.
Using both readfile and get_file_contents()

How to read a entire file in one line PHP script


3.
Using read_file()


4.
Using get_file_contents()

1.
1
2.
2
Totally how many arguments are mandatory for mail() function
3.
3
4.
4

1.
r
2.
w
Which of the following is not a valid file mode in PHP
3.
x+
4.
y+

1.
filemtime()


2.
fileinode()

Which function is used, for seeing last time modification of a file
3.
lchgrp()


4.
lchown()
Questions Choices

1.
When you open a file for reading, if the file
does not exist, an error occurs.


2.
When you open a file for writing, if the file
does not exist, a new file is created.


Which of the following statements is false regarding the opening modes of a

file?
 3.
When you open a file for reading, if the file
does not exist, the program will open an empty
file.


4.
When you open a file for writing, if the file
exists, the existing file is overwritten with the
new file.


1.
OOOOO My God
2.
What will be the output of the following PHP code <?php
 OOOO My God
echo str_pad("O", 5,"O")." My God.";

?> 3.
Error
4.
Warning

1.
Alter
2.
Which statement can be used for modifying the definition of an existing Modify
table? 3.
Select
4.
Update

1.
360
2.
What is the default number of seconds that cached session pages are made 180
available before the new pages are created? 3.
3600
4.
1800
Questions Choices

1.
connects_errno()


2.
connects_error()

Which one of the following methods can be used to diagnose and display
information about a MySQL connection error?

3.
mysqli_connect_errno()




4.
mysqli_connects_error()

1.
database host


2.
user ID

mysql_connect( ) does not take following parameter


3.
password


4.
database names

1.
mysqliquery()


2.
send_query()

Which one of the following methods is responsible for sending the query to
the database?

3.
sendquery()




4.
mysqli_query()

1.
session_name( )


2.
A function that takes no arguments and return a string, which is unique key session_params( )

corresponding to a particular session

3.
session_id( )


4.
id( )
Questions Choices

1.
3600 sec


2.
If the directive session.cookie_lifetime is set to 3600, the cookie will live 3600 min

until ____________

3.
3600 hrs


4.
the browser is restarted

1.
Physical


2.
Logical

_______ address is an internetwork address with universal jurisdiction.


3.
MAC Address


4.
IC Address

1.
static mapping


2.
In _______, a table associating a logical address with a physical address is dynamic mapping

updated manually

3.
physical mapping


4.
Social mapping

1.
0x000000000000


2.
0.0.0.0

The target hardware address on an Ethernet is _______ in an ARP request
3.
variable


4.
class dependent
Questions Choices

1.
broadcast
2.
unicast
An ARP request is normally _______
3.
multicast
4.
semi multicast

1.
cache controller


2.
The ARP component that sends an IP packet to a queue is the _______. input module


3.
output module


4.
Processor Module

1.
first
2.
TCP assigns a sequence number to each segment that is being sent. The last
sequence number for each segment is the number of the _______ byte
carried in that segment. 3.
middle
4.
between

1.
an IP datagram


2.
an Ethernet frame

A TCP segment is encapsulated in __________.


3.
a UDP user datagram


4.
Token ring Frame

1.
Process-to-process communication


2.
Which of the following functions does UDP perform?
 Host-to-host communication



3.
End-to-end reliable data delivery


4.
Interface-to-interface communication.
Questions Choices

1.
16
2.
8
UDP packets have fixed-size header of .......... bytes.
3.
32
4.
64

1.
Finding the IP address from the DNS


2.
Finding the IP address of the default gateway


The address resolution protocol (ARP) is used for


3.
Finding the IP address that corresponds to a
MAC address


4.
Finding the MAC address that corresponds to
an IP addres

1.
It is possible for a computer to have multiple IP
addresses


2.
IP packets from the same source to the same
destination can take different routes in the
network

Which of the following assertions is FALSE about the Internet Protocol (IP)

3.


packet source cannot set route of an outgoing
packets;the route is determined only by the
routing tables in the routers on the way
4.
IP ensures that a packet is discarded if it is
unable to reach its destination within a given
number of hops

1.
Checksum


2.
Which one of the following fields of an IP header is NOT modified by a Source address

typical IP router?

3.
Time to Live (TTL)


4.
Length
Questions Choices

1.
6
2.
In class C , if subnet mask is 255.255.255.224 then calculates number of 8
subnet? 3.
4
4.
12

1.
TCP, UDP, UDP and TCP


2.
The transport layer protocols used for real time multimedia, file transfer, UDP, TCP, TCP and UDP

DNS and email, respectively are:
3.
UDP, TCP, UDP and TCP




4.
TCP, UDP, TCP and UDP

1.
Bind
2.
Listen
Which of the following system calls results in the sending of SYN packets?
3.
socket
4.
Connect

1.
00111110


2.
00110010

What is the value of opad in the HMAC structure?


3.
10110110


4.
01011100
Questions Choices

1.
Message Field
2.

Message Digest
When a hash function is used to provide


message authentication, the hash function 3.
value is referred to as
Message Score

4.
Message Leap
Questions Choices

1.

A scheme in which the

password is jumbled and
stored



2.

A scheme in which the

password is XOR with a key
and stored



What is a one-way password file? 3.

A scheme in which the hash

of the password is stored



4.

A scheme in which the

password is passed through
a PRF, which is then stored
Questions Choices

1.
One-way password file


2.

Key wrapping



3.
Which one of the following is not an
application hash functions?
virus Detection



4.
Intrusion detection
Questions Choices

1.

2^140



2.

2^150



3.

For a 150-bit message and a 10-bit MAC, how 2^15

many values are the MAC value dependent
on?



4.
2^10
Questions Choices

1.
2^4
For a 100 bit key and a 32 bit tag, how many 2.
possible keys can be produced in the 3rd 2^8
round? 3.
2^16
4.
2^32
Questions Choices

1.

W0,W3,W7,W13



2.

W3,W7,W11,W15



3.

W0,W1,W9,W14

In SHA-512, W16 is dependent on




4.
W0,W1,W10,W13
Questions Choices

1.
DSA
2.
AES
PGP makes use of which cryptographic algorithm?
3.
ECC
4.
RSA

1.

Public-Key Certificates



2.

Public announcements



3.

Publicly available directories

Which of these systems use timestamps as an expiration date?

4.
Public-Key authority
Questions Choices

1.
Public-Key Certificates


2.
Public announcements

Which system uses a trusted third party interface?


3.
Publicly available directories


4.
Public-Key authority

1.
Statement is correct


2.
Statement is incorrect

Cryptographic hash functions execute faster in software than block ciphers.


3.
Depends on the hash function


4.
Depends on the processor

1.
output feedback mode


2.
Which mode of operation is used in the DAA (Data Authentication electronic code block mode

Algorithm)?

3.
cipher block chaining mode


4.
cipher feedback mode

1.
00111110


2.
00110010

hat is the value of ipad in the HMAC structure?


3.
10110110


4.
01110110
Questions Choices

1.
cryptographic codebreak


2.
cryptographic codesum

Another name for Message authentication codes is


3.
cryptographic checksum


4.
cryptographic checkbreak

1.
If the tag is larger than the key length


2.
If the tag is shorter than the key length

In CMAC (cipher based MAC), which scenario is a different key K2 is used
instead of K1?


 3.
In the last step of the algorithm


4.
If the plaintext/message is not an integer
multiple of the cipher clock length


1.PKI is a combination of digital certificates,

public-key cryptography, and certificate
authorities that provide enterprise wide security.






2.
PKI uses private and public keys but does not
Which of the following is true about Public Key Infrastructure?
 use digital certificates.

 3.PKI uses two-way symmetric key encryption
with digital certificates, and Certificate
Authority.










4.PKI uses CHAP authentication.


Questions Choices

1.
PKCS #1




Which of the following describes APIs for devices such as smartcards that 2.
contain other cryptographic information?
 PKCS #5


 





3.
PKCS #7


4.
PKCS #11

1.
2^4


2.
For a 100 bit key and a 32 bit tag, how many possible keys can be produced 2^32

in the 3rd round?

3.
2^16


4.
2^64

1.
sender


2.
receiver

In asymmetric key cryptography, the private key is kept by


3.
sender and receiver


4.
all the connected devices to the network

1.
stream control transmission protocol (SCTP)


2.
Which one of the following is a cryptographic protocol used to secure transport layer security (TSL)

HTTP connection?

3.
explicit congestion notification (ECN)


4.
resource reservation protocol
Questions Choices

1.
A5/2 cipher


2.
b5/4 cipher

Voice privacy in GSM cellular telephone protocol is provided by


3.
b5/6 cipher


4.
b5/8 cipher

1.
KD


2.
LD

Divide (HAPPY)26 by (SAD)26. We get quotient –


3.
JC


4.
MC

1.
O(log2 n)


2.
The time required to convert a k-bit integer to its representation in the base O(log n)

10 in terms of big-O notation is

3.
O(log2 2n)


4.
O(2log n)

1.
308915776


2.
The estimated computations required to crack a password of 6 characters 11881376

from the 26 letter alphabet is-

3.
456976


4.
8031810176
Questions Choices

1.
Poly-alphabetic Cipher


2.
Mono-alphabetic Cipher

Caesar Cipher is an example of


3.
Multi-alphabetic Cipher


4.
Bi-alphabetic Cipher

1.
Hash Algorithm


2.
Caesars Cipher

DES follows


3.
Feistel Cipher Structure


4.
SP Networks

1.
4
2.
The DES Algorithm Cipher System consists of ____________rounds 8
(iterations) each with a round key 3.
16
4.
24

1.
32
2.
128
The DES algorithm has a key length of
3.
64
4.
256

1.
8x8
2.
16x16
The Initial Permutation table/matrix in DES is of size
3.
32 x32
4.
64 x64
Questions Choices

1.
Scaling of the existing bits


2.
In the DES algorithm the Round Input is 32 bits, which is expanded to 48 Duplication of the existing bits

bits via

3.
Addition of zeros


4.
Addition of ones

1.
Simplicity


2.
Transparency to users

The main disadvantages of packet-filtering Router:


3.
Lack of Authentication


4.
Durability

1.
2256
2.
What is the number of operation required to come up with 2 messages 2152
having the same message digest in SHA-512? 3.
21024
4.
2128

1.
It is computationally infeasible to find any pair
(x, y) such that H(x) = H(y)


2.
For any given block x, it is computationally
infeasible to find y not equal to x, with H(y) =
The second pre-image resistant property is
 H(x)


3.
For any given hash value h it is computationally
infeasible to find y such that H(y) = h


4.
H(x,y) = H(y,x)
Questions Choices

1.
2N


Suppose that everyone in a group of N people wants to communicate 2.

secretly with the N–1 others using symmetric key cryptographic system. N(N – 1)

The communication between any two persons should not be decodable by
the others in the group. The number of keys required in the system as a
whole to satisfy the confidentiality requirement is
 3.
N(N – 1)/2


4.
(N – 1)2

1.
Anarkali’s public key.


2.
Anarkali digitally signs a message and sends it to Salim. Verification of the Salim’s public key.

signature by Salim requires

3.
Salim’s private key.


4.
Anarkali’s private key.

1.
O(logn)


2.
Exponentiation is a heavily used operation in public key cryptography. O(√n)

Which of the following options is the tightest upper bound on the number of
multiplications required to compute bn mod m,0≤b,n≤m ?

3.
O(n/logn)


4.
O(n)

1.
N


2.
If there are N people in the world and are using secret key encryption/ (N – 1)

decryption for privacy purpose, then number of secret keys required will be:

3.
N (N – 1) / 2
4.


N (N + 1) / 2
Questions Choices

1.
Masquerade Attack


2.
An attacker sits between customer and Banker, and captures the Replay Attack

information from thecustomer and retransmits to the banker by altering the
information. This attack is called as ______.

3.
Passive Attack


4.
Denial of Service Attack

1.
Proves that she knows the secret without
revealing it


2.
In Challenge-Response authentication the claimant ________.
 Proves that she doesn’t know the secret


3.
Reveals the secret


4.
Gives a challenge

1.
Advanced Encryption Standard


2.
Which of the following encryption algorithms is based on the Fiestal RSA public key cryptographic algorithm

struture?

3.
Data Encryption Standard


4.
RC4

1.
X.25


2.
X.301

The standard for certificates used on internet is


3.
X.409


4.
X.509
Questions Choices

1.
16
2.
How many distinct stages are there in DES algorithm, which is 17
parameterized by a 56-bit key? 3.
18
4.
19

1.
A
Consider that B wants to send a message m that is digitally signed to A. Let 2.
the pair of private and public keys for A and B be denoted
 B
represent the operation of encrypting m with a key Kx and H(m) represent
the message digest. Which one of the following indicates the CORRECT 3.
way of sending the message m along with the digital signature to A?
 C
4.


D

1.
n(n-1) and 2n


2.
The total number of keys required for a set of n individuals to be able to 2n and ((n(n – 1))/2)

communicate with each other using secret key and public key crypto-
systems, respectively are:


 3.
((n(n – 1))/2) and 2n




4.
((n(n – 1))/2) and n

1.
256 bits


2.
160 bits

SHA-1 produces a hash value of


3.
180 bits


4.
128 bits

1.
64
2.
What is the number of round computation steps in the SHA-256 algorithm?
 80
3.
128
4.
256
Questions Choices

1.
1024


2.
In SHA-512, the message is divided into blocks of size ___ bits for the hash 512

computation.

3.
256


4.
1248

1.
576


2.
In SHA-3, for a message digest size of 256, what is the bitrate ‘r’ (capacity 1088

= 512) ?

3.
1152


4.
832

1.
2n


2.
2-n

What is the effectiveness of an n-bit hash value?


3.
22n


4.
2-2n

1.
128
2.
160
MD5 produces __ bits hash data
3.
64
4.
256

1.
16
2.
In MD5, the process block divides the 512 bits into ________ sub blocks.
 32
3.
48
4.
64
Questions Choices

1.
MD5


2.
SHA1

The RSA signature uses which hash algorithm?


3.
SHA2


4.
MD5 and SHA-1

1.
MD5


2.
SHA1

The digital signature standard uses which hash algorithm?


3.
SHA2


4.
RC4

1.
SHA-1


2.
Which one of the following message digest algorithms is considered flawed MD2

and should no longer be used?

3.
MD4


4.
MD5

1.
SHA-1


2.
Which one of the following message digest algorithms is the current U.S. MD2

government standard in use by secure federal information processing
systems?

3.
MD4


4.
MD5
Questions Choices

1.
his public key


2.
his private key

Hashed message is signed by a sender using


3.
receiver’s public key


4.
receiver’s private key

1.
hash function used


2.
The responsibility of a certification authority for digital signature is to private keys of subscribers

authenticate the

3.
public keys of subscribers


4.
key used in DES

1.
i and ii


A hashing function for digital signature


(i) must give a hashed message which is shorter than the original message 2.
(ii)must be hardware implementable
 ii and iii

(iii) two different messages should not give the same hashed message

(iv) is not essential for implementing digital signature
 3.

 i and iii


4.
iii and iv

1.
Public-Key Certificates


2.
Hashing Certificates

Which one of the following is not a public key distribution means?


3.
Publicly available directories


4.
Public-Key authority
Questions Choices

1.
AES


2.
digital signature

Hash value encrypted by the sender’s private key is ____________

3.
DES




4.
3DES algorithm

1.
X509


2.
The standard used in digital signatures and defines its structure , fields, and Kerberos

values is

3.
Cryptography


4.
PKI

1.
Replaced


2.
A hash function guarantees integrity of a message. It guarantees that Over view

message has not be

3.
Changed


4.
Violated

1.
Hashing followed by encryption (H→E)


2.
Which Authentication Encryption approach is taken by the SSL/TLS Encryption followed by authentication (E→A)

protocol?

3.
Authentication followed by encryption (A→E)


4.
Independently encrypt and authenticate (E + A)
Questions Choices

1.
Public key cryptography


2.
Digital signature

Kerberos is an authentication scheme that can be used for


3.
Hash function


4.
Single sign on

1.
Transport


The _____ mode of IPsec, take the whole IP packet to form secure 2.
communication
 Tunnel

between two gateways


 3.
Either (a) or (b)


4.
Both (a) and (b)

1.
Application


2.
Data link

IPsec services are available in ______ Layer.


3.
Network


4.
Transport

1.
Secure Socket Layer Protocol


2.
Encapsulating Security Payload (ESP) belongs to which Internet Security Secure IP Protocol

Protocol?

3.
Secure Http Protocol


4.
Transport Layer Security Protocol
Questions Choices

1.12


2.10

Total no. of messages used in SSL Handshake Protocol is
3.8


4.14


1.
RSA


2.
DES

X.509 certificate recommends which cryptographic algorithm?


3.
AES


4.
Rabin

1.
Spoofing


2.


Name the network attack that floods it with useless traffic.
 Trojan Horse
3.
Denial of Service attack


4.
Virus

1.
(4, 1)


2.
(4, 11)

Let us assume that a point P=(4,2) lies on the Elliptic Curve y2 = x3 + x +
1, over Z13, find the inverse of point P (-P),
3.
(11, 4)


4.
(1, 4)

1.
7
2.
Let us assume that points P = (4, 2) and Q = (10, 6) lies on the Elliptic 4
Curve y2 = x3 + x + 1, over Z13, find the slop value λ=(((y_2-y_1 ))/((x_2-
x_1 ) ))mod p for the given points 3.
13
4.
5
Questions Choices

1.
λ=(((y_2-y_1 ))/((x_2-x_1 ) ))


2.
λ=(((3x_1^2+a))/((〖2y〗_1 ) ))

If the points P=Q then the slop value λ for the P and Q is computed,
3.
λ=(((x_2-x_1 ))/((y_2-y_1 ) ))


4.
λ=(((3y_1^2+a))/((〖2x〗_1 ) ))

1.
y^3+b_1 xy+b_2 y=3x^3+a_1 x^2+a_2 x+a_3


2.
y^2+b_1 x+b_2 y=x^2+a_1 x^2+a_2

What is the general equation for elliptic curve systems?

3.


y^2+b_1 xy+b_2 y=x^3+a_1 x^2+a_2 x+a_3


4.
y^2+b_1 xy+b_2 y=x^3+a_1 x^2+a_2 x+a_3

1.
2150
2.
For a 150-bit message and a 10-bit MAC, how many values are the MAC 2140
value dependent on? 3.
150
4.
140

1.
2k


2.
2n

For an n-bit tag and a k-bit key, the level of effort required for brute force
attack on a MAC algorithm is
3.
min(2k,2n)


4.
2k/2n
Questions Choices

1.
Many to one


2.
In Digital Signature, there is _____ relationship between signature and One to many

message.

3.
Many to many


4.
One to One

1.
DES encryption algorithm


2.
AES encryption algorithm

Differential Cryptanalysis can be mounted on


3.
RSA encryption algorithm


4.
Deffie-Hellman key exchange algorithm

1.
AES


2.
If an efficient algorithm for factoring large number is discovered which of Diffle-Hellman

this following schemes will be known to be not secure?

3.
RSA


4.
EI Gammal

1.
3

Suppose that two parties A and B wish to setup a common secret key (D-H 2.
key) between themselves using the Diffie-Hellman key exchange technique. 4
They agree on 7 as the modulus and 3 as the primitive root. Party A chooses 3.
2 and party B chooses 5 as their respective secrets. Their D-H key is 5
4.
6
Questions Choices

1.
(390, 691, 470)

Alice and Bob agree to use the prime p = 941 and the primitive root g =
627. Alice chooses the secret key a = 347 and computes, A ≡ 627347 (mod 2.
941)=X. Similarly, Bob chooses the secret key b = 781 and computes B ≡ (351, 655, 357)

627781 (mod 941)=Y. Alice sends Bob the number X and Bob sends Alice
the number Y. Both of these transmissions are done over an insecure
channel, so both (X, Y) should be considered public knowledge. Then Alice 3.
and Bob are both able to compute the Secret Key value (378, 648, 397)

SK=X781.347=Y347.781(mod 941), then what is the value of (X, Y, SK)
4.
(389, 657, 465)

1.
Fortezza


2.
In the Phase 2 of the Handshake Protocol Action, the step Anonymous Diffie-Hellman

server_key_exchange is not required for which of the following cipher
systems?

3.
Fixed Diffie-Hellman


4.
RSA

1.
MD5


2.
SHA-2

he DSS signature scheme uses, which of the Hash Algorithm


3.
SHA-1


4.
DSS does not use Hash Algorithms

1.
I and III


Which of the following are the possible size of MAC’s
 2.

I. 12 Bytes,
 II only

II. 16 Bytes,

III. 20 Bytes

IV. 24 Bytes
 3.
I and II


4.
II, III and IV
Questions Choices

1.
1,024 bits


2.
2,048 bits

If a 2,048-bit plaintext message was encrypted with the El-Gamal public
key cryptosystem, how long would the resulting cipher text message be?
3.
4,096 bits


4.
8,192 bits

1.
160 bits


2.
Acme Widgets currently uses a 1,024-bit RSA encryption standard 512 bits

companywide. The company plans to convert from RSA to an elliptic curve
cryptosystem. If it wishes to maintain the same cryptographic strength, what
ECC key length should it use? 3.
1,024 bits


4.
2,048 bits

1.
128 bits


2.
John would like to produce a message digest of a 2,048-byte message he 512 bits

plans to send to Mary. If he uses the SHA-1 hashing algorithm, what size
will the message digest for this particular message be? 3.
1,024 bits


4.
160 bits

1.
Signature based IDSs.


2.
Anomaly based IDSs.

Which of the following attempts to detect attacks based on known
signatures or patterns?
3.
Host based IDSs.


4.
Network based IDSs.
Questions Choices

1.
Identifying the patterns of unauthorized
behaviour to predict and detect subsequent
similar attempts


2.
Identifying the activities of unauthorized
behaviour to prevent

Misuse signature Detection is used for __________

3.
Network Firewall design with behaviour
analysis


4.
Network monitoring and Traffic Pattern
Analysis

1.
It can provide digital signature and encryption
functionality


2.
It uses fewer resources and encrypts as fast as
What is an advantage of RSA over DSS?
 possible


3.
It is a block cipher versus a stream cipher
scheme


4.
It employs a one-time key generation phase

1.
Public key system


2.
Private key system

For digital signature generation needs :


3.
Public and private key system


4.
Hash algorithms