August 2016 UGC NET Paper III
| Q1➡ | Computer Architecture A ripple counter is a (n): |
| i ➥ Synchronous Counter |
| ii ➥ Asynchronous counter |
| iii ➥ Parallel counter |
| iv ➥ None of the above |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Sequential Circuits | Help-Line |
| Q2➡ | Computer Architecture 8085 microprocessor has ______ bit ALU. |
| i ➥ 32 |
| ii ➥ 16 |
| iii ➥ 8 |
| iv ➥ 4 |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Microprocessor | Help-Line |
| Q3➡ | Computer Architecture The register that stores the bits required to mask the interrupts is ________. |
| i ➥ Status register |
| ii ➥ Interrupt service register |
| iii ➥ Interrupt mask register |
| iv ➥ Interrupt request register |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Mask Register | Help-Line |
| Q4➡ | Computer Architecture Which of the following in 8085 microprocessor performs HL = HL + HL? |
| i ➥ DAD D |
| ii ➥ DAD H |
| iii ➥ DAD B |
| iv ➥ DAD SP |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Microprocessor | Help-Line |
| 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. |
| i ➥ Register direct |
| ii ➥ Register indirect |
| iii ➥ Base indexed |
| iv ➥ Displacement |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Addressing Mode | Help-Line |
| Q6➡ | Digital Logic Design The output of the following combinational circuit.  |
| i ➥ X.Y |
| ii ➥ X+Y |
| iii ➥ X⊕Y |
| iv ➥ (X⊕Y)’ |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Boolean Algebra | Help-Line |
| 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. |
| i ➥ II and III only |
| ii ➥ I and IV only |
| iii ➥ I, II, and III only |
| iv ➥ I, III and IV only |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Object Oriented DBMS | Help-Line |
| 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: |
| i ➥ Disjointness condition |
| ii ➥ Completeness condition |
| iii ➥ Reconstruction condition |
| iv ➥ Aggregation condition |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Distributed database | Help-Line |
| 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: |
| i ➥ 2, 4, 2 respectively |
| ii ➥ 2, 3, 2 respectively |
| iii ➥ 3, 3, 1 respectively |
| iv ➥ 3, 4, 1 respectively |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Relational Algebra | Help-Line |
| 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. |
| i ➥ Only I |
| ii ➥ Only II |
| iii ➥ Both I and II |
| iv ➥ Neither I nor II |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ 2 and 1 respectively |
| ii ➥ 1 and 2 respectively |
| iii ➥ 2 and 2 respectively |
| iv ➥ 1 and 1 respectively |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q12➡ | Which one of the following pairs is correctly matched in the context of database design? |
| i ➥ I-D, II-A, III-B, IV-C |
| ii ➥ I-D, II-C, III-B, IV-A |
| iii ➥ I-C, II-D, III-A, IV-B |
| iv ➥ I-C, II-A, III-D, IV-B |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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) ? |
| i ➥ 150 |
| ii ➥ 151 |
| iii ➥ 160 |
| iv ➥ 161 |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ 2N |
| ii ➥ 2W |
| iii ➥ 2N+W |
| iv ➥ 2N-1 |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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) |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q16➡ | Computer Graphics A point P(2, 5) is rotated about a pivot point (1, 2) by 60°. What is the new transformed point P’ ? |
| i ➥ (1, 4) |
| ii ➥ (–1, 4) |
| iii ➥ (1, – 4) |
| iv ➥ (– 4, 1) |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 _. |
| i ➥ Topological distortion |
| ii ➥ Vanishing point |
| iii ➥ View confusion |
| iv ➥ Perspective foreshortening |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 : |
| i ➥ (0, 2/3) |
| ii ➥ (1/6 , 5/6) |
| iii ➥ (0, 1/3) |
| iv ➥ (0, 1) |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q19➡ | Match the following with reference to Functional programming history: |
| i ➥ a-iv, b-i, c-iii, d-ii |
| ii ➥ a-i, b-iv, c-ii, d-iii |
| iii ➥ a-iii, b-ii, c-iv, d-i |
| iv ➥ a-ii, b-i, c-iv, d-iii |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q20➡ | Aliasing in the context of programming languages refers to: |
| i ➥ Multiple variables having the same location |
| ii ➥ Multiple variables having the same identifier |
| iii ➥ Multiple variables having the same value |
| iv ➥ Multiple use of same variable |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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; } |
| i ➥ 10, 7 |
| ii ➥ 31, 3 |
| iii ➥ 10, 3 |
| iv ➥ 31, 7 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q22➡ | The regular grammar for the language L = {anbm | n + m is even} is given by |
| i ➥ S → S1 | S2 S1 → a S1| A1 A1 → b A1| λ S2 → aaS2| A2 A2 → b A2| λ |
| ii ➥ S → S1 | S2 S1 → a S1| aA1 S2 → aaS2 | A2 A1 → b A1| λ A2 → b A2| λ |
| iii ➥ S → S1 | S2 S1 → aaa S1| aA1 S2 → aaS2| A2 A1 → b A1| λ A2 → b A2| λ |
| iv ➥ S → S1 | S2 S1 → aa S1 | A1 S2 → aaS2 | aA2 A1 → bbA1 | λ A2 → bbA | b |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q23➡ | Let Σ = {a, b} and language L = {aa, bb}. Then, the complement of L is |
| i ➥ {λ, a, b, ab, ba} ∪ {w∈{a, b}* | |w| > 3} |
| ii ➥ {a, b, ab, ba} ∪ {w∈{a, b}* | |w| > 3} |
| iii ➥ {w ∈ { a, b}* | |w| > 3} ∪ {a, b, ab, ba} |
| iv ➥ {λ, a, b, ab, ba} ∪ {w ∈ {a, b}* | |w| ≥ 3} |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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? |
| i ➥ (a) and (b) only |
| ii ➥ (b) and (c) only |
| iii ➥ (c) and (a) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 _ |
| i ➥ 2 sec |
| ii ➥ 3 sec |
| iii ➥ 4 sec |
| iv ➥ 1 sec |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ A and B are true; C and D are false. |
| ii ➥ A and B are false; C and D are true. |
| iii ➥ A, B, C and D are true. |
| iv ➥ A, B, C and D are false. |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 _. |
| i ➥ 11010110111110 |
| ii ➥ 11101101011011 |
| iii ➥ 11101101011011 |
| iv ➥ 110101111001111 |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 _. |
| i ➥ 0.268 |
| ii ➥ 0.468 |
| iii ➥ 0.368 |
| iv ➥ 0.568 |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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. |
| i ➥ 256, 8 bits |
| ii ➥ 128, 4 bits |
| iii ➥ 256, 4 bits |
| iv ➥ 128, 8 bits |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 __. |
| i ➥ 14875 |
| ii ➥ 21000 |
| iii ➥ 9375 |
| iv ➥ 11875 |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 __. |
| i ➥ 46 |
| ii ➥ 41 |
| iii ➥ 43 |
| iv ➥ 48 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 : |
| i ➥ 4n2 |
| ii ➥ n |
| iii ➥ 4n-4 |
| iv ➥ 2n-2 |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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: |
| i ➥ 20, 18, 17, 15, 13, 12, 10 |
| ii ➥ 20, 18, 17, 12, 13, 10, 15 |
| iii ➥ 20, 18, 17, 10, 12, 13, 15 |
| iv ➥ 20, 18, 17, 13, 12, 10, 15 |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q35➡ | If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, …,k}, radix sort can sort the numbers in: |
| i ➥ O (k (n + d)) |
| ii ➥ O(d (n + k)) |
| iii ➥ O((n + k) lg d) |
| iv ➥ O((n + d) lg k) |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q36➡ | Match the following: |
| i ➥ a-i, b-iii, c-iv, d-ii |
| ii ➥ a-i, b-iii, c-ii, d-iv |
| iii ➥ a-iii, b-i, c-iv, d-ii |
| iv ➥ a-iii, b-i, c-ii, d-iv |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q37➡ | Constructors have _ return type. |
| i ➥ void |
| ii ➥ char |
| iii ➥ int |
| iv ➥ no |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q38➡ | Method overriding can be prevented by using final as a modifier at __. |
| i ➥ The start of the class. |
| ii ➥ The start of method declaration. |
| iii ➥ The start of derived class. |
| iv ➥ The start of the method declaration in the derived class. |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q39➡ | Which of the following is a correct statement? |
| i ➥ Composition is a strong type of association between two classes with full ownership. |
| ii ➥ Composition is a strong type of association between two classes with partial ownership. |
| iii ➥ Composition is a weak type of association between two classes with partial ownership. |
| iv ➥ Composition is a weak type of association between two classes with strong ownership. |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q40➡ | Which of the following is not a correct statement? |
| i ➥ Every class containing abstract method must be declared abstract. |
| ii ➥ Abstract class can directly be initiated with ‘new’ operator. |
| iii ➥ Abstract class can be initiated. |
| iv ➥ Abstract class does not contain any de nition of implementation. |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q41➡ | Which of the following tag in HTML is used to surround information, such as signature of the person who created the page ? |
| i ➥ < body > < / body > |
| ii ➥ < address > < / address > |
| iii ➥ < strong > < / strong > |
| iv ➥ < em > < / em > |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q42➡ | Java uses threads to enable the entire environment to be __. |
| i ➥ Symmetric |
| ii ➥ Asymmetric |
| iii ➥ Synchronous |
| iv ➥ Asynchronous |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 : |
| i ➥ 96.97% |
| ii ➥ 97.97% |
| iii ➥ 99.009% |
| iv ➥ 99.97% |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q44➡ | Match each software lifecycle model in List – I to its description in List – II: |
| i ➥ I-e, II-b, III-a, IV-c, V-d |
| ii ➥ I-e, II-c, III-a, IV-b, V-d |
| iii ➥ I-d, II-a, III-b, IV-c, V-e |
| iv ➥ I-c, II-e, III-a, IV-b, V-d |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q45➡ | Match each software term in List – I to its description in List – II: |
| i ➥ I-d, II-a, III-b, IV-c, V-e |
| ii ➥ I-b, II-a, III-d, IV-c, V-e |
| iii ➥ I-d, II-e, III-b, IV-a, V-c |
| iv ➥ I-e, II-c, III-b, IV-a, V-d |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q46➡ | The ISO quality assurance standard that applies to software Engineering is |
| i ➥ ISO 9000 : 2004 |
| ii ➥ ISO 9001 : 2000 |
| iii ➥ ISO 9002 : 2001 |
| iv ➥ ISO 9003 : 2004 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q47➡ | Which of the following are external qualities of a software product? |
| i ➥ Maintainability, reusability, portability, efficiency, correctness. |
| ii ➥ Correctness, reliability, robustness, efficiency, usability. |
| iii ➥ Portability, interoperability, maintainability, reusability. |
| iv ➥ Robustness, efficiency, reliability, maintainability, reusability. |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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. |
| i ➥ I and III |
| ii ➥ II and IV |
| iii ➥ I and IV |
| iv ➥ II and III |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ Only (I) is correct. |
| ii ➥ Only (II) is correct. |
| iii ➥ Both (I) and (II) are correct. |
| iv ➥ Both (I) and (II) are wrong. |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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: |
| i ➥ O(mn) |
| ii ➥ O(m2 n2 ) |
| iii ➥ O(m2 n) |
| iv ➥ O(mn2 ) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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? |
| i ➥ 30 microseconds |
| ii ➥ 34 microseconds |
| iii ➥ 60 microseconds |
| iv ➥ 68 microseconds |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ 10, 14, 8 |
| ii ➥ 8, 10, 7 |
| iii ➥ 7, 10, 8 |
| iv ➥ 7, 10, 7 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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? |
| i ➥ 1 |
| ii ➥ 101 |
| iii ➥ 27 |
| iv ➥ 0 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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. |
| iii ➥ Both L1 and L2 are regular languages. |
| iv ➥ Both L1 and L2 are not regular languages. |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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% ? |
| i ➥ 2 |
| ii ➥ 4 |
| iii ➥ 8 |
| iv ➥ 16 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 : |
| i ➥ 0* 1* |
| ii ➥ 00* |
| iii ➥ 10* |
| iv ➥ 1*0* |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 |
| i ➥ h<((|W| – 1)/k-1) |
| ii ➥ logk|W| < h |
| iii ➥ logk|W| < h < ((|W| – 1)/k-1) |
| iv ➥ logk|W| < h < ((|W| – 1)/k-1) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q58➡ | Which of the following is not used in standard JPEG image compression? |
| i ➥ Huffman coding |
| ii ➥ Run length encoding |
| iii ➥ Zig-zag scan |
| iv ➥ K-L Transform |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q59➡ | Which of the following is a source coding technique? |
| i ➥ Huffman coding |
| ii ➥ Arithmetic coding |
| iii ➥ Run-length coding |
| iv ➥ DPCM |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q60➡ | If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is __. |
| i ➥ Dark |
| ii ➥ Good contrast |
| iii ➥ Bright |
| iv ➥ Very low contrast |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 : |
| i ➥ 6 |
| ii ➥ 8 |
| iii ➥ 101 |
| iv ➥ 12 |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (c) only |
| iii ➥ (b) and (c) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ (a) and (b) only |
| ii ➥ (a) and (c) only |
| iii ➥ (b) and (c) only |
| iv ➥ (a), (b) and (c) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q64➡ | What are the following sequence of steps taken in designing a fuzzy logic machine? |
| i ➥ Fuzzi cation → Rule evaluation → Defuzzi cation |
| ii ➥ Fuzzi cation → Defuzzi cation → Rule evaluation |
| iii ➥ Rule evaluation → Fuzzi cation → Defuzzi cation |
| iv ➥ Rule evaluation → Defuzzi cation → Fuzzi cation |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q65➡ | Which of the following 2 input Boolean logic functions is linearly inseparable ? (a) AND (b) OR (c) NOR (d) XOR (e) NOT XOR |
| i ➥ (a) and (b) |
| ii ➥ (b) and (c) |
| iii ➥ (c), (d) and (e) |
| iv ➥ (d) and (e) |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q66➡ | Let R and S be two fuzzy relations defined as Then, the resulting relation, T, which relates elements of universe of X to elements of universe of Z using max-product composition is given by |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 ? |
| i ➥ ls – l | grep “June” | sort +10n |
| ii ➥ ls – l | grep “June” | sort +10r |
| iii ➥ ls – l | grep – v “June” | sort +10n |
| iv ➥ ls – l | grep – n “June” | sort +10x |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q68➡ | Which of the following statements is incorrect for a Windows Multiple Document Interface (MDI) ? |
| i ➥ Each document in an MDI application is displayed in a separate child window within the client area of the application’s main window. |
| ii ➥ An MDI application has three kinds of windows namely a frame window, an MDI client window and number of child windows. |
| iii ➥ An MDI application can support more than one kind of document. |
| iv ➥ |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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. |
| i ➥ I, II only |
| ii ➥ II, III only |
| iii ➥ I, II, III |
| iv ➥ I, III only |
Show Answer With Best Explanation
Answer: III
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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 |
| i ➥ Only I and II are equivalent sentences |
| ii ➥ Only II and IIIare equivalent sentences |
| iii ➥ Only I and III are equivalent sentence |
| iv ➥ I, II, and III are equivalent sentences. |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q71➡ | Match each Artificial Intelligence term in List-I that best describes a given situation in List-II |
| i ➥ I-d, II-a, III-b, IV-c |
| ii ➥ I-d, II-c, III-a, IV-b |
| iii ➥ I-d, II-c, III-b, IV-a |
| iv ➥ I-c, II-d, III-a, IV-b |
Show Answer With Best Explanation
Answer: IV
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q72➡ | In Artificial Intelligence , a semantic network |
| i ➥ is a graph-based method of knowledge representation where nodes represent concepts and arcs represent relations between concepts. |
| ii ➥ is a graph-based method of knowledge representation where nodes represent relations between concepts and arcs represent concepts. |
| iii ➥ represents an entity as a set of slots and associated rules. |
| iv ➥ is a subset of rst-order logic. |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q73➡ | Criticism free idea generation is a factor of _. |
| i ➥ Decision Support System |
| ii ➥ Group Decision Support System |
| iii ➥ Enterprise Resource Support System |
| iv ➥ Artificial Intelligence |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| 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. |
| iv ➥ Both I1 and I2 are not correct inferences. |
Show Answer With Best Explanation
Answer: II
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q75➡ | Which formal system provides the semantic foundation for Prolog? |
| i ➥ Predicate calculus |
| ii ➥ Lambda calculus |
| iii ➥ Hoare logic |
| iv ➥ Propositional logic |
Show Answer With Best Explanation
Answer: I
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |
| Q27➡ | |
| i ➥ |
| ii ➥ |
| iii ➥ |
| iv ➥ |
Show Answer With Best Explanation
Answer: I (Marks to all )
Explanation: Upload Soon
| More Discussion | Explanation On YouTube | Learn Topic Wise | Help-Line |