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)
Considering an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die?
In how many ways can 15 indistinguishable fish be placed into 5 different ponds, so that each pond contains at least one fish ?
Consider the following statements:
(a) Depth – first search is used to traverse a rooted tree.
(b) Pre – order, Post-order and Inorder are used to list the vertices of an ordered rooted tree.
(c) Huffman’s algorithm is used to find an optimal binary tree with given weights.
(d) Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true ?
Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ?
(a) deg(v) ≥ n/2 for each vertex of G
(b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges
(c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge
Consider the following statements :
(a) Boolean expressions and logic networks correspond to labelled acyclic digraphs.
(b) Optimal Boolean expressions may not correspond to simplest networks.
(c) Choosing essential blocks first in a Karnaugh map and then greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of these statement(s) is/ are correct?
Consider a full-adder with the following input values:
(a) x=1, y=0 and Ci(carry input) = 0
(b) x=0, y=1 and Ci = 1
Compute the values of S(sum) and C0 (carry output) for the above input values.
“lf my computations are correct and I pay the electric bill, then I will run out of money. If I don’t pay the electric bill, the power will be turned off. Therefore, if I don’t run out of money and the power is still on, then my computations are incorrect.”
Convert this argument into logical notations using the variables c, b, r, p for propositions of computations, electric bills, out of money and the power respectively. (Where ¬ means NOT)
Match the following:
List – I List – II
(a) (p →q) ⇔ (¬q→¬p) (i) Contrapositive
(b) [(p∧q)→r]⇔[p→ (q→r)] (ii) Exportation law
(c) (p→q)⇔[(p∧¬q)→o] (iii) Reductio ad absurdum
(d) (p⇔q)⇔[(p→q)∧(q→p)] (iv) Equivalence
Consider a proposition given as:
“x≥6, if x ^{2}≥25 and its proof as:
If x≥6, then x ^{2}=x.x=6.6=36≥25
Which of the following is correct w.r.to the given proposition and its proof ?
(a) The proof shows the converse of what is to be proved.
(b) The proof starts by assuming what is to be shown.
(c) The proof is correct and there is nothing wrong.
What is the output of the following program ?
(Assume that the appropriate pre-processor directives are included and there is no syntax error)
main()
{
char S[ ] = “ABCDEFGH”;
printf (“%C”,* (& S[3]));
printf (“%s”, S+4);
printf (“%u”, S);
/* Base address of S is 1000 */ }
Which of the following, in C++, is inherited in a derived class from base class ?
Given that x=7.5, j=-1.0, n=1.0, m=2.0
the value of –x+j == x>n>=m is:
Which of the following is incorrect in C++ ?
When the inheritance is private, the private methods in base class are……………… in the derived class (in C++).
An Assertion is a predicate expressing a condition we wish database to always satisfy. The correct syntax for Assertion is :
Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock ?
(a) 2-phase Locking
(b) Time stamp – ordering
Drop Table cannot be used to drop a Table referenced by ……………… constraint.
(a) Primary key (b) Sub key (c) Super key (d) Foreign key
Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems
(a) Data redundancy and inconsistency
(b) Difficulty in accessing Data
(c) Data isolation
(d) Integrity problems
For a weak entity set to be meaningful, it must be associated with another entity set in combination with some of their attribute values, is called as :
Consider the given graph:
Its Minimum Cost Spanning Tree is ………………
The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is …………
Level order Traversal of a rooted Tree can be done by starting from root and performing:
The average case occurs in the Linear Search Algorithm when:
To determine the efficiency of an algorithm the time factor is measured by:
Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions?
Match the following port numbers with their uses:
List – I List – II
(a) 23 (i) World wide web
(b) 25 (ii) Remote Login
(c) 80 (iii) USENET news
(d) 119 (iv) E-mail
Which of the following is not associated with the session layer ?
What is the size of the ‘total length’ field in IPv 4 datagram ?
Which of the following is/are restriction(s) in classless addressing ?
Match the following:
List – I List – II
(a) Forward Reference Table (i) Assembler directive
(b) Mnemonic Table (ii) Uses array data structure
(c) Segment Register Table (iii) Contains machine OP code
(d) EQU (iv) Uses linked list data structure
The translator which performs macro calls expansion is called :
If all the production rules have single non – terminal symbol on the left side, the grammar defined is :
Which one from the following is false ?
Which phase of compiler generates stream of atoms ?
A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes 6 msec per cyclinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?
Let Pi and Pj be two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two processes Pi and Pj, which of the following conditions is not true?
A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0 1 7 2 3 2 7 1 0 3 if the four frames are initially empty?
What does the following command do?
grep −vn “abc” x
The Unix Kernel maintains two key data structures related to processes, the process table and the user structure. Which of following information is not the part of user structure?
Match the following:
List – I List – II
(a) Size-oriented metrics (i) uses number of external interfaces as one of the measurement parameter.
(b) Function-oriented metrics (ii) originally designed to be applied to business information systems.
(c) Extended Function Point Metrics (iii) derived by normalizing quality and/or productivity measures by considering the size of the software.
(d) Function point (iv) uses algorithm characteristics as of the measurement parameter.
In which testing strategy requirements established during requirements analysis are validated against developed software?
Which process model is also called as classic life cycle model?
Cohesion is an extension of:
Which one from the following is highly associated activity of project planning?
In the case of parallelization, Amdahl’s law states that if P is the proportion of a program that can be made parallel and (1-P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is:
Which of the following statements is incorrect for Parallel Virtual Machine (PVM)?
Which of the following algorithms sort n integers, having the range 0 to (n ^{2}-1), in ascending order in O(n) time ?
Which of the following statements is FALSE about weak entity set ?
Which of the following is not valid with reference to Message Passing Interface (MPI)?
How many strings of 5 digits have the property that the sum of their digits is 7 ?