0 of 60 questions completed
Questions:
General instruction:
1. The clock will be set at the server. The countdown timer at the top right corner of screen will display the remaining time available for you to complete the examination. When the timer reaches zero, the examination will end by itself. You need not terminate the examination or submit your paper.
2. The Question Palette displayed on the right side of screen will show the status of each question using one of the following symbols.
(White)You have not answered the question
(Green)You have answered the question
(Orange)You have NOT answered the question, but have marked the question for review.
The Mark for Review status for a question simply indicates that you would like to look0 at that question again. If a question is answered, but marked for review, then the answer will be considered for evaluation unless the status is modified by the candidates.
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading…
You must sign in or sign up to start the quiz.
You must first complete the following:
0 of 60 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 marks, (0)
Earned Point(s): 0 of 0, (0)
0 Essay(s) Pending (Possible Point(s): 0)
Correct expression tor UDP user datagram length is
In binary search tree which traversal is used for getting ascending order values ?
The automaton which allows transformation to a new state without consuming any input symbols :
Complement of a DFA can be obtained by :
Concatenation Operation refers to which of the following set operations :
Which of the following statements is true ?
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system?
Microprocessors are used in which generation of computers?
Operating System maintains the page table for :
The function \( \frac{x^{2}-1}{x-1} \) at x=1 is :
Closed – Loop control mechanism try to :
In classless addressing, there are no classes but addresses are still granted in :
Which multiple access technique is used by IEEE 802.11 standard for wireless LAN ?
PGP encrypts data by using a block cipher called :
If L1 and L2 are regular sets then intersection of these two will be :
The smallest integer that can be represented by an 8-bit number in 2’s complement form is :
Non-contiguous memory allocation splits program into blocks of memory called ________ that can be loaded in non-adjacent holes in main memory.
In a full binary tree number of nodes is 63 then the height of the tree is :
Let P,Q,R be a regular expression over Σ. If P does not contain null string, then R=Q+RP has a unique solution ___________
Total number of simple graphs that can be drawn using six vertices are:
The 2−3−4 tree is a self-balancing data structure, which is also called :
Which type of algorithm is used to solve the “8 Queens” problem ?
A 3.5 inch micro floppy high density disk contains the data _________ .
A subnet mask in class C can have _____________ 1’s with the remaining bits 0’s.
What is the value of acknowledgement field in a segment
The number (25)_{6}, in base 6 is equivalent to _________ in binary number system.
Which of the following is a class B host address ?
There is a need to create a network that has 5 subnets, each with at least 16 hosts. Which one is used as classful subnet mask ?
What is Compaction ?
How can we set a Cookie visibility scope to local storage ?
A finite automaton accepts which type of language :
Which NetWare protocol provides link – state routing ?
Which layer connects the network support layers and user support layers ?
Process is in a ready state _______ .
(0+ε)(1+ε) represents :
The average search time of hashing, with linear probing will be less if the load factor :
How many times the word “PROCESS” will be printed when executing the following program ?
main(){
printf(“PROCESS”)
fflush();
fork();
fork();
}
If a planner graph, having 25 vertices divides the plane into 17 different regions. Then how many edges are used to connect the vertices in this graph.
Merge sort uses :
What is the relation between DFA and NFA on the basis of computational power ?
If a random coin is tossed 11 times, then what is the probability that for 7th toss head appears exactly 4 times?
When we use slow-start algorithm, the size of the congestion window increases _______ until it reaches a threshold.
If X,Y and Z are three exhaustive and mutually exclusive events related with any experiment and the P(X)=0.5 P(Y) and P(Z) = 0.3P(Y). Then P(Y) = ___________ .
In IPv4 Addresses, classfull addressing is replaced with :
An Ethernet destination address 07−01−12−03−04−05 is :
Which of the following is illegal declaration in C language?
The open file table has a/an __________ associated with each file.
The process of loading the operating system into memory is called :
Why is one – time password safe ?
The demerits of the fragmentation are :
The address field of linked list :
Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :
How many DFA’s exits with two states over input alphabet {0,1}
Complement of (a+b)∗ will be :
In Boolean algebra 1+1+1+1……800 times ones = ______ .
1
0
11
800
In a particular system it is observed that, the cache performance gets improved as a result of increasing the block size of the cache. The primary reason behind this is :
Starvation can be avoided by which of the following statements:
By using shortest job first resource allocation policy .
By using first come first serve resources allocation policy.
Page fault frequency in an operating system is reduced when the :
The expression 5−2−3∗–2 will evaluate to 18, if :
Finite automata requires minimum ____________ number of stacks.
1
0
2