Q5➡| Computer Architecture In ________ addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction.
Q7➡| Database Management System Which of the following statements is/are True regarding some advantages that an object-oriented DBMS (OODBMS) offers over a relational database ? I. An OODBMS avoids the“impedance mismatch” problem. II. An OODBMS avoids the “phantom” problem. III. An OODBMS provides higher performance concurrency control than most relational databases. IV. An OODBMS provides faster access to individual data objects once they have been read from disk.
Q8➡| Database Management System The Global conceptual Schema in a distributed database contains information about global relations. The condition that all the data of the global relation must be mapped into the fragments, that is, it must not happen that a data item which belongs to a global relation does not belong to any fragment, is called:
Q9➡| Database Management System Suppose database table T1(P, R) currently has tuples {(10, 5), (15, 8), (25, 6)} and table T2 (A, C) currently has {(10, 6), (25, 3), (10, 5)}. Consider the following three relational algebra queries RA1, RA2 and RA3:
The number of tuples in the resulting table of RA1, RA2 and RA3 are given by:
Q10➡| Database Management System Consider the table R with attributes A, B and C. The functional dependencies that hold on R are : A → B, C → AB. Which of the following statements is/are True ? I. The decomposition of R into R1(C, A) and R2(A, B) is lossless. II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.
Q11➡| Consider the following ORACLE relations : One (x, y) = {<2, 5>, <1, 6>, <1, 6>, <1, 6>, <4, 8>, <4, 8>} Two (x, y) = {<2, 55>, <1, 1>, <4, 4>, <1, 6>, <4, 8>, <4, 8>, <9, 9>, <1, 6>} Consider the following two SQL queries SQ1 and SQ2 : SQ1 : SELECT * FROM One) EXCEPT (SELECT * FROM Two); SQ2 : SELECT * FROM One) EXCEPT ALL (SELECT * FROM Two); For each of the SQL queries, what is the cardinality (number of rows) of the result obtained when applied to the instances above ?
Q13➡| Computer Graphics Consider a raster grid having XY-axes in positive X-direction and positive upward Y-direction with Xmax = 10, Xmin = –5, Ymax = 11, and Ymin = 6. What is the address of memory pixel with location (5, 4) in raster grid assuming base address 1 (one) ?
Q14➡| Computer Graphics Consider a N-bit plane frame buffer with W-bit wide lookup table with W > N. How many intensity levels are available at a time ?
Q15➡| Computer Graphics Consider the Bresenham’s line generation algorithm for a line with gradient greater than one, current point (xi, yi) and decision parameter, di. The next point to be plotted (xi+1, yi+1) and updated decision parameter, di+1, for di < 0 are given as _.
i ➥xi+1 = xi +1 yi+1 = yi di+1 = di+ 2 dy
ii ➥ xi+1 = xi yi+1 = yi +1 di+1 = di+ 2 dx
iii ➥xi+1 = xi yi+1 = yi +1 di+1 = di+ 2(dx -dy)
iv ➥xi+1 = xi +1 yi+1 = yi +1 di+1 = di+ 2(dy -dx)
Q17➡| Computer Graphics In perspective projection (from 3D to 2D), objects behind the centre of projection are projected upside down and backward onto the view-plane. This is known as _.
Q18➡| Computer Graphics The Liang-Barsky line clipping algorithm uses the parametric equation of a line from (x1, y1) to (x2, y2) along with its infinite extension which is given as : x = x1 + ∆x.u y = y1 + ∆y.u Where ∆x = x2– x1, ∆y = y2– y1, and u is the parameter with 0 ≤ u ≤ 1. A line AB with endpoints A(–1, 7) and B(11, 1) is to be clipped against a rectangular window with xmin = 1, xmax = 9, ymin = 2, and ymax = 8. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :
Q21➡| Assume that the program ‘P’ is implementing parameter passing with ‘call by reference’. What will be printed by following print statements in P? Program P( ) { x = 10; y = 3; funb (y, x, x) print x; print y; } funb (x, y, z) { y = y + 4; z = x + y + z; }
Q24➡| Consider the following identities for regular expressions: (a) (r + s)* = (s + r)* (b) (r*)* = r* (c) (r* s*)* = (r + s)* Which of the above identities are true?
Q25➡| Suppose transmission rate of a channel is 32 kbps. If there are ‘8’ routes from source to destination and each packet p contains 8000 bits. Total end to end delay in sending packet P is _
Q26➡| Consider the following statements : A. High speed Ethernet works on optic fiber. B. A point to point protocol over Ethernet is a network protocol for encapsulating PPP frames inside Ethernet frames. C. High speed Ethernet does not work on optic fiber. D. A point to point protocol over Ethernet is a network protocol for encapsulating Ethernet frames inside PPP frames. Which of the following is correct ?
Q27➡| In CRC checksum method, assume that given frame for transmission is 1101011011 and the generator polynomial is G(x) = x4 + x + 1. After implementing CRC encoder, the encoded word sent from sender side is _.
Q28➡| A slotted ALOHA network transmits 200 bits frames using a shared channel with 200 kbps bandwidth. If the system (all stations put together) produces 1000 frames per second, then the throughput of the system is _.
Q29➡| An analog signal has a bit rate of 8000 bps and a baud rate of 1000. Then analog signal has _ signal elements and carry _ data elements in each signal.
Q30➡| The plain text message BAHI encrypted with RSA algorithm using e = 3, d = 7 and n = 33 and the characters of the message are encoded using the values 00 to 25 for letters A to Z. Suppose character by character encryption was implemented. Then, the Cipher Text message is _.
i ➥ABHI
ii ➥ HAQC
iii ➥IHBA
iv ➥BHQC
Show Answer With Best Explanation
Answer: None of the above Explanation: Upload Soon
Q31➡| Consider the problem of a chain < A1, A2, A3, A4 > of four matrices. Suppose that the dimensions of the matrices A1, A2, A3 and A4 are 30 × 35, 35 × 15, 15 × 5 and 5 × 10 respectively. The minimum number of scalar multiplications needed to compute the product A1A2A3A4 is __.
Q32➡| Consider a hash table of size m = 10000, and the hash function h(K) = floor (m(KA mod1)) for A = ( √(5) – 1)/2. The key 123456 is mapped to location __.
Q33➡| Consider a weighted complete graph G on the vertex set {ν1, ν2, …. νn} such that the weight of the edge (νi, νj) is 4 | i – j|. The weight of minimum cost spanning tree of G is :
Q34➡| A priority queue is implemented as a max-heap. Initially, it has ve elements. The level-order traversal of the heap is as follows: 20, 18, 15, 13, 12 Two new elements ‘10’ and ‘17’are inserted in the heap in that order. The level-order traversal of the heap after the insertion of the element is:
Q43➡| An Operating System (OS) crashes on the average once in 30 days, that is, the Mean Time Between Failures (MTBF) = 30 days. When this happens, it takes 10 minutes to recover the OS, that is, the Mean Time To Repair (MTTR) = 10 minutes. The availability of the OS with these reliability figures is approximately :
Q48➡| Which of the following is/are CORRECT statement(s) about version and release ? I. A version is an instance of a system, which is functionally identical but non-functionally distinct from other instances of a system. II. A version is an instance of a system, which is functionally distinct in some way from other system instances. III. A release is an instance of a system, which is distributed to users outside of the development team. IV. A release is an instance of a system, which is functionally identical but non-functionally distinct from other instances of a system.
Q49➡| The Unix Operating System Kernel maintains two key data structures related to processes, the process table and the user structure. Now, consider the following two statements : I. The process table is resident all the time and contain information needed for all processes, even those that are not currently in memory. II. The user structure is swapped or paged out when its associated process is not in memory, in order not to waste memory on information that is not needed. Which of the following options is correct with reference to above statements ?
Q50➡| Consider a system which have ‘n’ number of processes and ‘m’ number of resource types.The time complexity of the safety algorithm, which checks whether a system is in safe state or not, is of the order of:
Q51➡| An operating system supports a paged virtual memory, using a central processor with a cycle time of one microsecond. It costs an additional one microsecond to access a page other than the current one. Pages have 1000 words, and the paging device is a drum that rotates at 3000 revolutions per minute and transfers one million words per second.Further, one percent of all instructions executed accessed a page other than the current page. The instruction that accessed another page, 80% accessed a page already in memory and when a new page was required, the replaced page was modi ed 50% of the time. What is the effective access time on this system, assuming that the system is running only one process and the processor is idle during drum transfers?
Q52➡| Consider the following page reference string : 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3,6 Which of the following options, gives the correct number of page faults related to LRU,FIFO, and optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially empty ?
Q53➡| Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy?
Q54➡| Given the following two languages : L1 = {uwwRν | u, v, w ∈ {a, b}+} L2 = {uwwRν | u, ν, w ∈ {a, b}+, |u| > |ν|} Which of the following is correct ?
i ➥L1 is regular language and L2 is not regular language.
ii ➥ L1 is not regular language and L2 is regular language.
Q55➡| An experimental file server is up 75% of the time and down for 25% of the time due to bugs. How many times does this file server have to be replicated to give an availability of at least 99% ?
Q56➡| Given a Turing Machine M = ({q 0 , q 1 }, {0, 1}, {0, 1, B}, δ, B, {q1 }) Where δ is a transition function de ned as δ(q 0 , 0) = (q 0 , 0, R) δ(q 0 , B) = (q 1 , B, R) The language L(M) accepted by Turing machine is given as :
Q57➡| Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → ν, with |ν| = k > 1. The derivation tree for any string W ∈ L (G) has a height such that
Q61➡| Consider the following linear programming problem : Max. z = 0.50 x2 – 0.10x1 Subject to the constraints 2x1 + 5x2 < 80 x1 + x2 < 20 and x1, x2 > 0 The total maximum profit (z) for the above problem is :
Q62➡| Consider the following statements : (a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution. (b) If primal (dual) problem has an unbounded optimal solution, then its dual (primal) has no feasible solution at all. (c) Both primal and dual problems may be infeasible. Which of the following is correct ?
Q63➡| Consider the following statements : (a) Assignment problem can be used to minimize the cost. (b) Assignment problem is a special case of transportation problem. (c) Assignment problem requires that only one activity be assigned to each resource. Which of the following options is correct ?
Q67➡| Consider the following operations to be performed in Unix : “The pipe sorts all files in the current directory modified in the month of “June” by order of size and prints them to the terminal screen. The sort option skips ten fields then sorts the lines in numeric order.” Which of the following Unix command will perform above set of operations ?
Q69➡| Which of the following statement(s) is/are True regarding ‘nice’ command of UNIX ? I. It is used to set or change the priority of a process. II. A process’s nice value can be set at the time of creation. III. ‘nice’ takes a command line as an argument.
Q70➡| Let ν(x) mean x is a vegetarian, m(y) for y is meat, and e(x, y) for x eats y. Based on these, consider the following sentences : I. ∀x ν(x ) ⇔ (∀y e(x, y) ⇒ ¬m(y)) II. ∀x ν(x ) ⇔ (¬(∃ym(y) ∧e(x, y))) III. ∀x (∃y m(y) ∧e(x, y)) ⇔ ¬ν(x) One can determine that
Q74➡| Consider the following logical inferences : I1 : If it is Sunday then school will not open. The school was open. Inference : It was not Sunday. I2 : If it is Sunday then school will not open. It was not Sunday. Inference : The school was open. Which of the following is correct ?
i ➥Both I1 and I2 are correct inferences.
ii ➥ I1 is correct but I2 is not a correct inference.
iii ➥ I1 is not correct but I2 is a correct inference.
