Q5➡| The _______ addressing mode is similar to register indirect addressing mode, except that an offset is added to the contents of the register. The offset and register are specified in the instruction.
Q8➡| In distributed databases, location transparency allows for database users, programmers and administrators to treat the data as if it is at one location. A SQL query with location transparency needs to specify:
Q9➡| Consider the relations R(A, B) and S(B, C) and the following four relational algebra queries over R and S: I. ΠA, B (R ⨝ S) II. R ⨝ ΠB(S) III. R ∩ (ΠA(R) × ΠB(S)) IV. ΠA, R.B (R × S) where R⋅B refers to the column B in table R. One can determine that:
Q10➡| Which of the following statements is TRUE? D1 : The decomposition of the schema R(A, B, C) into R1(A, B) and R2 (A, C) is always lossless. D2 : The decomposition of the schema R(A, B, C, D, E) having AD → B, C → DE, B → AE and AE → C, into R1 (A, B, D) and R2 (A, C, D, E) is lossless.
Q11➡| Consider the following ORACLE relations : R (A, B, C) = {<1, 2, 3>, <1, 2, 0>, <1, 3, 1>, <6, 2, 3>, <1, 4, 2>, <3, 1, 4> } S (B, C, D) = {<2, 3, 7>, <1, 4, 5>, <1, 2, 3>, <2, 3, 4>, <3, 1, 4>}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : SELECT R⋅B, AVG (S⋅B) FROM R, S WHERE R⋅A = S⋅C AND S⋅D < 7 GROUP BY R⋅B; SQ2 : SELECT DISTINCT S⋅B, MIN (S⋅C) FROM S GROUP BY S⋅B HAVING COUNT (DISTINCT S⋅D) > 1; If M is the number of tuples returned by SQ1 and N is the number of tuples returned by SQ2 then
Q13➡| Consider the Breshenham’s circle generation algorithm for plotting a circle with centre (0, 0) and radius ‘r’ units in first quadrant. If the current point is (xi , yi ) and decision parameter is pi then what will be the next point (xi + 1, yi + 1 + 1) and updated decision parameter pi + 1 for pi ≥ 0?
i ➥xi + 1 = xi+ 1 yi + 1 = yi pi + 1 = pi + 4xi + 6
ii ➥ xi + 1 = xi + 1 yi + 1 = yi – 1 pi + 1 = pi + 4(xi – yi) + 10
iii ➥xi + 1 = xi yi+ 1 = yi – 1 pi + 1 = pi + 4(xi – yi) + 6
iv ➥ xi + 1 = xi – 1 yi + 1 = yi pi + 1 = pi + 4(xi – yi) + 10
Q15➡| Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has a lower left-hand corner at (– 5, 1) and upper right-hand corner at (3, 7). Consider the following three lines for clipping with the given endpoint coordinates: Line AB : A (– 6, 2) and B (–1, 8) Line CD : C (– 1, 5) and D (4, 8) Line EF : E (–2, 3) and F (1, 2) Which of the following line(s) is/are candidate for clipping?
Q16➡| In perspective projection, if a line segment joining a point which lies in front of the viewer to a point in back of the viewer is projected to a broken line of infinite extent. This is known as _______.
Q17➡| Let us consider that the original point is (x, y) and new transformed point is (x′, y′). Further, Shx and Shy are shearing factors in the x and y directions. If we perform the y-direction shear relative to x = xref then the transformed point is given by _______.
Q18➡| Which of the following statement(s) is/are correct with reference to curve generation? I. Hermite curves are generated using the concepts of interpolation. II. Bezier curves are generated using the concepts of approximation. III. The Bezier curve lies entirely within the convex hull of its control points. IV. The degree of Bezier curve does not depend on the number of control points.
Q19➡| Given the following statements: (A) To implement Abstract Data Type, a programming language require a syntactic unit to encapsulate type definition. (B) To implement ADT, a programming language requires some primitive operations that are built in the language processor. (C) C++, Ada, Java 5.0, C#2005 provide support for parameterised ADT. Which one of the following options is correct ?
Q22➡| The symmetric difference of two sets S1 and S2 is defined as S1⊖S2 = {x|x ∈ S1 or x ∈ S2, but x is not in both S1 and S2} The nor of two languages is defined as nor (L1, L2) = {w|w |∈L1 and w |∈ L1}. Which of the following is correct?
i ➥The family of regular languages is closed under symmetric difference but not closed under nor.
ii ➥ The family of regular languages is closed under nor but not closed under symmetric difference.
iii ➥The family of regular languages are closed under both symmetric difference and nor.
iv ➥The family of regular languages are not closed under both symmetric difference and nor.
Q26➡| Given the following statements: (A) Frequency Division Multiplexing(FDM) is a technique that can be applied when the bandwidth of a link is greater than combined bandwidth of signals to be transmitted. (B) Wavelength Division Multiplexing (WDM) is an analog multiplexing Technique to combine optical signals. (C) WDM is a Digital Multiplexing Technique. (D) TDM is a Digital Multiplexing Technique. Which of the following is correct?
Q27➡| A pure ALOHA Network transmits 200 bit frames using a shared channel with 200 Kbps bandwidth. If the system (all stations put together) produces 500 frames per second, then the throughput of the system is ________.
Q29➡| Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is _____.
i ➥ 1.636 Kbps
ii ➥ 1.636 Mbps
iii ➥ 3.272 Mbps
iv ➥3.272 Kbps
Show Answer With Best Explanation
Answer: None of the above Explanation: Upload Soon
Q32➡| Let A[1…n] be an array of n distinct numbers. If i < j and A[i] > A[j], then the pair (i, j) is called an inversion of A. What is the expected number of inversions in any permutation on n elements ?
Q35➡| Suppose that we have numbers between 1 and 1,000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined ?
Q36➡| A triangulation of a polygon is a set of T chords that divide the polygon into disjoint triangles. Every triangulation of n-vertex convex polygon has _____ chords and divides the polygon into _____ triangles.
Q40➡| Which of the following statements is correct? (1) Every class containing abstract method must not be declared abstract. (2) Abstract class cannot be directly initiated with ‘new’ operator. (3) Abstract class cannot be initiated. (4) Abstract class contains definition of implementation.
Q43➡| A server crashes on average once in 30 days, that is, the Mean Time Between Failures (MTBF) is 30 days. When this happens, it takes 12 hours to reboot it, that is, the Mean Time to Repair (MTTR) is 12 hours. The availability of server with these reliability data values is approximately :
Q48➡| The number of function points of a proposed system is calculated as 500. Suppose that the system is planned to be developed in Java and the LOC/FP ratio of Java is 50. Estimate the effort (E) required to complete the project using the effort formula of basic COCOMO given below : E = a(KLOC)b Assume that the values of a and b are 2.5 and 1.0 respectively.
Q50➡| In Unix operating system, when a process creates a new process using the fork () system call, which of the following state is shared between the parent process and child process?
Q54➡| Suppose that the time to do a null remote procedure call (RPC) (i.e. 0 data bytes) is 1.0 msec, with an additional 1.5 msec for every 1K of data. How long does it take to read 32 K from the file server as 32 1K RPCs ?
Q55➡| Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has _ equivalence classes.
Q57➡| Given a Turing Machine M = ({q0, q1, q2, q3}, {a, b}, {a, b, B}, δ, B, {q3}) Where δ is a transition function defined as δ(q0, a) = (q1, a, R) δ(q1, b) = (q2, b, R) δ(q2, a) = (q2, a, R) δ(q3, b) = (q3, b, R) The language L(M) accepted by the Turing Machine is given as:
Q58➡| Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel; H(x|y) is the amount of uncertainty remaining on x knowing y; and I (x; y) is the information transmission. Which of the following does not define the channel capacity of a discrete memoryless channel ?
Q59➡| Consider a source with symbols A, B, C, D with probability 1/2, 1/4, 1/8, 1/8 respectively. What is the average number of bits per symbol for the Huffman code generated from above information ?
Q61➡| The region of feasible solution of a linear programming problem has a _______ property in geometry, provided the feasible solution of the problem exists.
Q62➡| Consider the following statements: (a) Revised simplex method requires lesser computations than the simplex method. (b) Revised simplex method automatically generates the inverse of the current basis matrix. (c) Less number of entries are needed in each table of revised simplex method than usual simplex method. Which of these statements are correct?
Q65➡| Compute the value of adding the following two fuzzy integers : A = {(0.3, 1), (0.6, 2), (1, 3), (0.7, 4), (0.2, 5)} B = {(0.5, 11), (1, 12), (0.5, 13)} Where fuzzy addition is defined as μA+B (z)= maxx + y = z(min (μA(x), μB(x))) Then, f (A + B) is equal to
Q66➡| A perceptron has input weights W1 = – 3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2 ?
Q69➡| In Unix, files can be protected by assigning each one a 9-bit mode called rights bits. Now, consider the following two statements: I. A mode of 641 (octal) means that the owner can read and write the file, other members of the owner’s group can read it, and users can execute only. II. A mode of 100 (octal) allows the owner to execute the file, but prohibits all other access. Which of the following options is correct with reference to the above statements ?
Q73➡| Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning ?
Q74➡| Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state which of the following state cannot be reached?
