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)
Infrared signals can be used for short range communication in a closed area using ………………. propagation.
A bridge has access to …………… address in the same network.
The minimum frame length for 10 Mbps Ethernet is …………. bytes and maximum is ……………. bytes.
. The bit rate of a signal is 3000 bps. If each signal unit carries 6 bits, the baud rate of the signal is ……………
Match the following:
List – I List – II
a. Physical Layer i. Allow resources to network access
b. Datalink Layer ii. Move packets from one destination to other
c. Network Layer iii. Process to process message delivery
d. Transport Layer iv. Transmission of bit stream
e. Application Layer v. Formation of frames
A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A → α | β
I. First (α) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.
II. First (α) ∩ First (β) ≠ λ
III. First (α) ∩ Follow(A) = φ if λ є First (β)
Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar ?
A shift reduce parser suffers from
The context free grammar for language L = {anbmck | k = |n – m|, n≥0,m≥0,k≥0} is
The regular grammar for the language L = {w |na(w) and nb(w) are both even, wє{a, b}*} is given by :
(Assume, p, q, r and s are states)
KPA in CMM stands for
Which one of the following is not a risk management technique for managing the risk due to unrealistic schedules and budgets?
……………. of a system is the structure or structures of the system which comprise software elements, the externally visible properties of these elements and the relationship amongst them.
In function point analysis, the number of complexity adjustment factors is
Regression testing is primarily related to
How many different truth tables of the compound propositions are there that involve the propositions p & q ?
A Boolean function F is called self-dual if and only if
How many Boolean functions of degree n are self-dual ?
Which of the following statement(s) is(are) not correct ?
i. The 2’s complement of 0 is 0.
ii. In 2’s complement, the left most bit cannot be used to express a quantity.
iii. For an n-bit word (2’s complement) which includes the sign bit, there are 2n-1 positive integers, 2n+1 negative integers and one 0 for a total of 2n unique states.
iv. In 2’s complement the significant information is contained in the 1’s of positive numbers and 0’s of the negative numbers.
The notation ∃!xp(x) denotes the proposition “there exists a unique x such that P(x) is true”.
Give the truth values of the following statements :
I. ∃!xP(x) → ∃xP(x)
II. ∃!x ¬ P(x) → ¬∀xp(x)
Give a compound proposition involving propositions p, q and r that is true when exactly two of p, q and r are true and is false otherwise.
Consider the graph given below as :
Which one of the following graph is isomorphic to the above graph?
The upper bound and lower bound for the number of leaves in a B-Tree of degree K with height h is given by:
Consider a complete bipartite graph km,n. For which values of m and n does this, complete graph have a Hamilton circuit
Big-O estimates for the factorial function and the logarithm of the factorial function i.e. n! and log n! is given by
How many cards must be chosen from a deck to guarantee that atleast
iii. two cards of the same kind are chosen.
Match the following with respect to the mobile computing technologies :
List-I List-II
a b c d
Object Request Broker (ORB) is
III. A software program that runs on the application server, where most of the components reside.
A software agent is defined as
III. An open source software for accomplishing a given task.
Match the following:
List-I List-II
Codes:
a b c d
SET, an open encryption and security specification model that is designed for protecting credit card transactions on the internet, stands for
In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is
Match the following:
List-I List-II
Codes:
a b c d
Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0, the following snapshot of the system has been taken :
Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be
Match the following:
List-I List-II
Codes:
a b c d
Which of the following out commands will output “onetwothree”?
Merge sort makes two recursive calls. Which statement is true after these two recursive calls finish, but before the merge step?
A text is made up of the characters α, β, γ, δ and σ with the probability 0.12, 0.40, 0.15, 0.08 and 0.25 respectively. The optimal coding technique will have the average length of
Searching for an element in the hash table requires O(1) time for the …………… time, whereas for direct addressing it holds for the …………. time.
An algorithm is made up of 2 modules M1 and M2. If time complexity of modules M1 and M2 are h(n) and g(n) respectively, the time complexity of the algorithm is
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by
( () (()) (()) )
Match the following:
List-I List-II
between different function calls.
to the block in which the variable is defined.
Codes:
a b c d
When we pass an array as an argument to a function, what actually gets passed ?
While (87) printf(“computer”);
The above C statement will
A friend function can be used to
Which of the following is the correct value returned to the operating system upon the successful completion of a program?
Manager’s salary details are hidden from the employee. This is called as
Which of the following statements is false ?
A clustering index is created when …………….
Let R ={A, B, C, D, E, F} be a relation schema with the following dependencies C→F,E→A,EC→D,A→B
Which of the following is a key for R ?
Match the following:
List-I List-II
a.DDL i. LOCK TABLE
b. DML ii. COMMIT
c. TCL iii. Natural Difference
d. BINARY Operation iv. REVOKE
Codes:
a b c d