Q1➡| Computer organization A hierarchical memory system that uses cache memory has cache access time of 50 nano seconds, main memory access time of 300 nanoseconds, 75% of memory requests are for read, hit ratio of 0.8 for read access and the write-through scheme is used. What will be the average access time of the system both for read and write requests ?
i ➥ 157.5 n.sec.
ii ➥ 110 n.sec.
iii ➥ 75 n.sec.
iv ➥ 82.5 n.sec.
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q3➡| In a dot matrix printer to print a character is 6 m.sec., time to space in between characters is 2 m.sec., and the number of characters in a line are 200. The printing speed of the dot matrix printer in characters per second and the time to print a character line are given by which of the following options ?
i ➥ 125 chars/second and 0.8 seconds
ii ➥ 250 chars/second and 0.6 seconds
iii ➥ 166 chars/second and 0.8 seconds
iv ➥ 250 chars/second and 0.4 seconds
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q7➡| Location transparency allows : I. Users to treat the data as if it is done at one location. II. Programmers to treat the data as if it is at one location. III. Managers to treat the data as if it is at one location. Which one of the following is correct ?
i ➥ I, II and III
ii ➥ I and II only
iii ➥ II and III only
iv ➥ II only
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q8➡| Which of the following is correct ? I. Two phase locking is an optimistic protocol. II. Two phase locking is pessimistic protocol III. Time stamping is an optimistic protocol. IV. Time stamping is pessimistic protocol.
i ➥ I and III
ii ➥ II and IV
iii ➥ I and IV
iv ➥ II and III
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q9➡| _____ rules used to limit the volume of log information that has to be handled and processed in the event of system failure involving the loss of volatile information
i ➥ Write-ahead log
ii ➥ Check-pointing
iii ➥ Log buffer
iv ➥ Thomas
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q11➡| Consider the following statements : I. Re-construction operation used in mixed fragmentation satisfies commutative rule. II. Re-construction operation used in vertical fragmentation satisfies commutative rule Which of the following is correct
i ➥ I
ii ➥ II
iii ➥ Both are correct
iv ➥ None of the statements are correct
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q16➡| Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point P(–1, –1). The coordinates of the new triangle obtained after rotation shall be ______
i ➥
ii ➥
iii ➥
iv ➥
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q17➡| In Cyrus-Beck algorithm for line clipping the value of t parameter is computed by the relation : (Here P1 and P2 are the two end points of the line, f is a point on the boundary, n1 is inner normal)
i ➥ (P1 – fi) × ni / (P2 – P1) × ni
ii ➥ (fi – P1) × ni / (P2 – P1) × ni
iii ➥ (P2 – fi) × ni / (P1 – P2) × ni
iv ➥ (fi – P2) × ni / (P1 – P2) × ni
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q19➡| Consider the following statements S1, S2 and S3 : S1 : In call-by-value, anything that is passed into a function call is unchanged in the caller’s scope when the function returns. S2 : In call-by-reference, a function receives implicit reference to a variable used as argument. S3 : In call-by-reference, caller is unable to see the modified variable used as argument.
i ➥ S3 and S2 are true.
ii ➥ S3 and S1 are true.
iii ➥ S2 and S1 are true.
iv ➥ S1, S2, S3 are true.
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q25➡| How many characters per second (7 bits + 1 parity) can be transmitted over a 3200 bps line if the transfer is asynchronous ? (Assuming 1 start bit and 1 stop bit)
i ➥ 300
ii ➥ 320
iii ➥ 360
iv ➥ 400
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q27➡| What is the propagation time if the distance between the two points is 48,000 ? Assume the propagation speed to be 2.4 × 108 metre/second in cable.
i ➥ 0.5 ms
ii ➥ 20 ms
iii ➥ 50 ms
iv ➥ 200 ms
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q32➡| Dijkstra algorithm, which solves the single-source shortest–paths problem, is a , and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a
i ➥ Greedy algorithm, Divide-conquer algorithm
ii ➥ Divide-conquer algorithm, Greedy algorithm
iii ➥ Greedy algorithm, Dynamic programming algorithm
iv ➥ Dynamic programming algorithm, Greedy algorithm
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q33➡| Consider the problem of a chain < A1, A2, A3> of three matrices. Suppose that the dimensions of the matrices are 10 × 100, 100 × 5 and 5 × 50 respectively. There are two different ways of parenthesization : (i) ((A1 A2)A3) and (ii) (A1(A2 A3)). Computing the product according to the first parenthesization is _______ times faster in comparison to the second parenthesization.
i ➥ 5
ii ➥ 10
iii ➥ 20
iv ➥ 100
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q34➡| Suppose that we have numbers between 1 and 1000 in a binary search tree and we want to search for the number 365. Which of the following sequences could not be the sequence of nodes examined ?
i ➥ 4, 254, 403, 400, 332, 346, 399, 365
ii ➥ 926, 222, 913, 246, 900, 260, 364, 365
iii ➥ 927, 204,913, 242, 914, 247, 365
iv ➥ 4, 401, 389, 221, 268, 384, 383, 280, 365
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q42➡| To compute function points (FP), the following relationship is used FP = Count – total × (0.65 + 0.01 × Σ(Fi)) where Fi (i = 1 to n) are value adjustment factors (VAF) based on n questions. The value of n is
i ➥ 12
ii ➥ 14
iii ➥ 16
iv ➥ 18
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q43➡| Assume that the software team defines a project risk with 80% probability of occurrence of risk in the following manner : Only 70 percent of the software components scheduled for reuse will be integrated into the application and the remaining functionality will have to be custom developed. If 60 reusable components were planned with average component size as 100 LOC and software engineering cost for each LOC as $ 14, then the risk exposure would be
i ➥ $ 25,200
ii ➥ $ 20,160
iii ➥ $ 17,640
iv ➥ $ 15,120
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q48➡| How many disk blocks are required to keep list of free disk blocks in a 16 GB hard disk with 1 kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in 32 bits.
i ➥ 1024 blocks
ii ➥ 16794 blocks
iii ➥ 20000 blocks
iv ➥ 1048576 blocks
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q49➡| Consider an imaginary disk with 40 cylinders. A request come to read a block on cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for cylinders 1, 36, 16, 34, 9 and 12 in that order. The number of arm motions using shortest seek first algorithm is
i ➥ 111
ii ➥ 112
iii ➥ 60
iv ➥ 61
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q50➡| An operating system has 13 tape drives. There are three processes P1, P2 & P3. Maximum requirement of P1 is 11 tape drives, P2 is 5 tape drives and P3 is 8 tape drives. Currently, P1 is allocated 6 tape drives, P2 is allocated 3 tape drives and P3 is allocated 2 tape drives. Which of the following sequences represent a safe state ?
i ➥ P2 P1 P3
ii ➥ P2 P3 P1
iii ➥ P1 P2 P3
iv ➥ P1 P3 P2
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q51➡| Monitor is an Interprocess Communication (IPC) technique which can be described as
i ➥ It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package.
ii ➥ It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations
iii ➥ It uses two primitives, send and receive which are system calls rather than language constructs.
iv ➥ It consists of the IPC primitives implemented as system calls to block the process when they are not allowed to enter critical region to save CPU time.
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q54➡| An A* algorithm is a heuristic search technique which
i ➥ is like a depth-first search where most promising child is selected for expansion
ii ➥ generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.
iii ➥ saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.
iv ➥ none of the above
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q58➡| A computer based information system is needed : I. as it is difficult for administrative staff to process data. II. due to rapid growth of information and communication technology. III. due to the growing size of organizations which need to process large volumes of data. IV. as timely and accurate decisions are to be taken. Which of the above statement(s) is/are true ?
i ➥ I and II
ii ➥ III and IV
iii ➥ II and III
iv ➥ II and IV
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q59➡| Given the recursively enumerable language (LRE), the context sensitive language (LCS), the recursive language (LREC), the context free language (LCF) and deterministic context free language (LDCF). The relationship between these families is given by
i ➥ LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC
ii ➥ LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE
iii ➥ LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC
iv ➥ LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q61➡| According to pumping lemma for context free languages : Let L be an infinite context free language, then there exists some positive integer m such that any w ∈ L with | w | ≥ m can be decomposed as w = u v x y z
i ➥ with | vxy | ≤ m such that uvi xyi z ∈ L for all i = 0, 1, 2
ii ➥ with | vxy | ≤ m such that uvi xyi z ∈ L for all i = 0, 1, 2
iii ➥ with | vxy | ≥ m, and | vy | ≤ 1, such that uvi xyi z ∈ L for all i = 0, 1, 2, …….
iv ➥ with | vxy | ≥ m, and | vy | ≥ 1, such that uvi xyi z ∈ L for all i = 0, 1, 2, …….
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
The Laplacian of an image at all points (x, y) can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ?
i ➥ only S1
ii ➥ only S2
iii ➥ Both S1 and S2
iv ➥ None of these
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q67➡| Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :
Find out the minimum time required to complete all the jobs.
i ➥ 5
ii ➥ 11
iii ➥ 13
iv ➥ 15
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
Q68➡| Consider the following statements about a perception : I. Feature detector can be any function of the input parameters . II. Learning procedure only adjusts the connection weights to the output layer. Identify the correct statement out of the following :
i ➥ I is false and II is false.
ii ➥ I is true and II is false.
iii ➥ I is false and II is true.
iv ➥ I is true and II is true.
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
i ➥ A program that performs a legitimate function that is known to an operating system or its user and also has a hidden component that can be used for nefarious purposes like attacks on message security or impersonation.
ii ➥ A piece of code that can attach itself to other programs in the system and spread to other systems when programs are copied or transferred.
iii ➥ A program that spreads to other computer systems by exploiting security holes like weaknesses in facilities for creation of remote processes
iv ➥ All of the above
Show Answer With Best Explanation
Answer: I (Marks to all ) Explanation: Upload Soon
