Q1➡| Engineering Mathematics How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women?
Q2➡| Engineering Mathematics Which of the following statement(s) is/are false ? (a) A connected multigraph has an Euler Circuit if and only if each of its vertices has even degree. (b) A connected multigraph has an Euler Path but not an Euler Circuit if and only if it has exactly two vertices of odd degree. (c) A complete graph (K n ) has a Hamilton Circuit whenever n ≥ 3. (d) A cycle over six vertices (C 6 ) is not a bipartite graph but a complete graph over 3 vertices is bipartite.
Q3➡| Engineering Mathematics Which of the following is/are not true? (a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c)The set of even integers is countable. (d)The set of real numbers between 0 and 1⁄2 is countable.
Q5➡| Engineering Mathematics A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, 2,….n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful? A.
Q6➡| Engineering Mathematics Which of the following arguments are not valid ? (a) “If Gora gets the job and works hard, then he will be promoted. If Gora gets promotion, then he will be happy. He will not be happy, therefore, either he will not get the job or he will not work hard”. (b) “Either Puneet is not guilty or Pankaj is telling the truth. Pankaj is not telling the truth, therefore, Puneet is not guilty”. (c) If n is a real number such that n >1, then n 2 >1. Suppose that n 2 >1, then n >1.
Q7➡| Artificial-intelligence Let P(m, n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a)∃m ∀n P(m, n) (b)∀n P(1, n) (c) ∀m ∀n P(m, n)
Q10➡| Engineering Mathematics Which of the following property/ies a Group G must hold, in order to be an Abelian group? (a)The distributive property (b)The commutative property (c)The symmetric property
Q11➡| Programming Consider the following program : include main( ) { int i, inp; float x, term=1, sum=0; scanf(“%d %f ”, &inp, &x); for(i=1; i<=inp; i++) { term = term * x/i; sum = sum + term ; } printf(“Result = %f\n”, sum); } The program computes the sum of which of the following series?
Q12➡| OOPS Consider the following two statements: (a) A publicly derived class is a subtype of its base class. (b) Inheritance provides for code reuse.
i ➥Both the statements (a) and (b) are correct.
ii ➥ Neither of the statements (a) and (b) are correct
iii ➥ Statement (a) is correct and (b) is incorrect
iv ➥Statement (a) is incorrect and (b) is correct.
Q13➡| Database management system Consider a “CUSTOMERS” database table having a column “CITY” filled with all the names of Indian cities (in capital letters). The SQL statement that finds all cities that have “GAR” somewhere in its name, is:
i ➥Select * from customers where city = ‘%GAR%’;
ii ➥ Select * from customers where city = ‘$GAR$’;
iii ➥Select * from customers where city like ‘%GAR%’;
Q16➡| A three dimensional array in ‘C’ is declared as int A[x][y][z]. Here, the address of an item at the location A[p][q][r] can be computed as follows (where w is the word length of an integer):
Q20➡| Database management system A relation R = {A, B, C, D, E, F,G} is given with following set of functional dependencies: F = {AD → E, BE → F, B → C, AF → G} Which of the following is a candidate key ?
Q23➡| Four channels are multiplexed using TDM. If each channel sends 100 bytes/second and we multiplex 1 byte per channel, then the bit rate for the link is ________.
Q24➡| In a typical mobile phone system with hexagonal cells, it is forbidden to reuse a frequency band in adjacent cells. If 840 frequencies are available, how many can be used in a given cell?
Q26➡| A virtual memory has a page size of 1K words. There are eight pages and four blocks. The associative memory page table contains the following entries: Which of the following list of virtual addresses (in decimal) will not cause any page fault if referenced by the CPU ?
Q27➡| Suppose that the number of instructions executed between page fault is directly proportional to the number of page frames allocated to a program. If the available memory is doubled, the mean interval between page faults is also doubled. Further, consider that a normal instruction takes one microsecond, but if a page fault occurs, it takes 2001 microseconds. If a program takes 60 sec to run, during which time it gets 15,000 page faults, how long would it take to run if twice as much memory were available?
Q28➡| Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk?
Q31➡| A data cube C, has n dimensions, and each dimension has exactly p distinct values in the base cuboid. Assume that there are no concept hierarchies associated with the dimensions. What is the maximum number of cells possible in the data cube, C?
Q32➡| Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1 / 50000 , and that the proportion of people having stiff neck is 1 / 20. Then the percentage of people who had meningitis and complain about stiff neck is:
Q33➡| Database management system ______ system is market oriented and is used for data analysis by knowledge workers including Managers, Executives and Analysts.
Q36➡| In the following graph, discovery time stamps and finishing time stamps of Depth First Search (DFS) are shown as x/y, where x is discovery time stamp and y is finishing time stamp.
It shows which of the following depth first forest?
Q42➡| What will be the hexadecimal value in the register ax (32-bit) after executing the following instructions? mov al, 15 mov ah, 15 xor al, al mov cl, 3 shr ax, cl
i ➥Top-down parsers are LL parsers where first L stands for left – to – right scan and second L stands for a leftmost derivation.
ii ➥ (000)* is a regular expression that matches only strings containing an odd number of zeroes, including the empty string.
iii ➥Bottom-up parsers are in the LR family, where L stands for left – to – right scan and R stands for rightmost derivation.
iv ➥The class of context – free languages is closed under reversal. That is, if L is any context- free language, then the language L R = {w R : w∈L} is context – free.
Q49➡| A unix file system has 1-KB blocks and 4-byte disk addresses. What is the maximum file size if i-nodes contain 10 direct entries and one single, double and triple indirect entry each?
