0 of 50 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 50 questions answered correctly
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)
The Boolean function [~ (~p˄q)˄~(~p˄~q)]˅(p˄r) is equal to the Boolean function:
Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q).
Then, the prefix expression and post-fix expression determined using this ordered tree are given as ……….. and …………. respectively.
Let A and B be sets in a finite universal set U. Given the following:
|A – B|, |A XOR B|, |A|+|B| and |AUB|
Which of the following is in order of increasing size ?
What is the probability that a randomly selected bit string of length 10 is a palindrome?
Given the following graphs :
Which of the following is correct?
The octal number 326.4 is equivalent to
Which of the following is the most efficient to perform arithmetic operations on the numbers?
The Karnaugh map for a Boolean function is given as
The simplified Boolean equation for the above Karnaugh Map is
Which of the following logic operations is performed by the following given combinational circuit ?
Match the following:
List – I List – II
a. Controlled Inverter i. a circuit that can add 3 bits
b. Full adder ii. a circuit that can add two binary numbers
c. Half adder iii. a circuit that transmits a binary word or its 1’s complement
d. Binary adder iv. a logic circuit that adds 2 bits
Given i= 0, j = 1, k = – 1
x = 0.5, y = 0.0
What is the output of given ‘C’ expression ?
x * 3 & & 3 || j | k
The following ‘C’ statement :
int * f[ ]( );
declares :
If a function is friend of a class, which one of the following is wrong ?
In C++, polymorphism requires:
A function template in C++ provides ………… level of generalization.
DBMS provides the facility of accessing data from a database through
Relational database schema normalization is NOT for:
Consider the following statements regarding relational database model:
(a) NULL values can be used to opt a tuple out of enforcement of a foreign key.
(b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is also in BCNF.
(c) The difference between the project operator (P) in relational algebra and the SELECT keyword in SQL is that if the resulting table/set has more than one occurrences of the same tuple, then P will return only one of them, while SQL SELECT will return all.
One can determine that:
Consider the following Entity-Relationship (E-R) diagram and three possible relationship sets (I, II and III) for this E-R diagram
If different symbols stand for different values (e.g., t1 is definitely not equal to t2), then which of the above could not be the relationship set for the E-R diagram ?
Consider a database table R with attributes A and B. Which of the following SQL queries is illegal ?
Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the representation, which of the following operation cannot be implemented in O(1) time ?
Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j) | 1 ≤ i ≤ 12, 1 ≤ j ≤ 12}. There is an edge between (a, b) and (c, d) if |a – c| ≤ 1 or |b–d| ≤ 1. The number of edges in this graph is
The runtime for traversing all the nodes of a binary search tree with n nodes and printing them in an order is
Consider the following statements :
S1: A queue can be implemented using two stacks.
S2: A stack can be implemented using two queues.
Which of the following is correct ?
Given the following prefix expression:
* + 3 + 3 ↑ 3 + 3 3 3
What is the value of the prefix expression?
In a fast Ethernet cabling, 100 Base-TX uses ……….. cable and maximum segment size is …………
A network with bandwidth of 10 Mbps can pass only an average of 12,000 frames per minute with each frame carrying an average of 10,000 bits. What is the throughput of this network ?
Match the following:
List – I List – II
a. Session layer i. Virtual terminal software
b. Application layer ii. Semantics of the information transmitted
c. Presentation layer iii. Flow control
d. Transport layer iv. Manage dialogue control
Which of the following protocols is used by email server to maintain a central repository that can be accessed from any machine?
Which of the following statements is not true with respect to microwaves?
The number of strings of length 4 that are generated by the regular expression (0+1+|2+3+)*, where | is an alternation character and {+, *} are quantification characters, is:
The content of the accumulator after the execution of the following 8085 assembly language program, is
MVI A, 35H
MOV B, A
STC
CMC
RAR
XRA B
In compiler optimization, operator strength reduction uses mathematical identities to replace slow math operations with faster operations. Which of the following code replacements is an illustration of operator strength reduction?
Which of the following are the principles tasks of the linker?
I. Resolve external references among separately compiled program units.
II. Translate assembly language to machine code.
III. Relocate code and data relative to the beginning of the program.
IV. Enforce access-control restrictions on system libraries.
Which of the following is FALSE?
Consider a system with seven processes A through G and six resources R through W.
Resource ownership is as follows:
process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U
Is the system deadlocked ? If yes, …………. processes are deadlocked.
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, ………….. number of page faults occur with the reference string.
0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1
Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur?
Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in …………. order to minimize average response time if 3 < x < 5.
Consider three CPU intensive processes P1, P2, P3 which require 20, 10 and 30 units of time, arrive at times 1, 3 and 7 respectively. Suppose operating system is implementing Shortest Remaining Time first (pre-emptive scheduling) algorithm, then ………….. context switches are required (suppose context switch at the beginning of Ready queue and at the end of Ready queue are not counted).
Which of the following is used to determine the specificity of requirements ?
Where n1 is the number of requirements for which all reviewers have identical interpretations, n2 is number of requirements in a specification.
The major shortcoming of waterfall model is
The quick design of a software that is visible to end users leads to …………
For a program of k variables, boundary value analysis yields ………….. test cases.
The extent to which a software performs its intended functions without failures, is termed as
An attacker sits between the sender and receiver and captures the information and re-transmits to the receiver after some time without altering the information. This attack is called as …………..
…………….. is subject oriented, integrated, time variant, non-volatile collection of data in support of management decisions.
In Data mining, classification rules are extracted from …………..
Discovery of cross sales opportunities is called as ……………
In Data mining, ………….. is a method of incremental conceptual clustering.