GATE 2013 CS Computer Science and information technology

[Q1 – Q25 carry ONE mark each ]

Q1➡ | Engineering Mathematics
A binary operation ⊕ on a set of integers is defined as x ⊕ y = x2 + y2. Which one of the following statements is TRUE about ⊕?
i ➥ Commutative but not associative
ii ➥ Both commutative and associative
iii ➥ Associative but not commutative
iv ➥ Neither commutative nor associative

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Set Theory Help-Line

Q2➡ | Engineering Mathematics
Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than 3 cars during any given minute in this interval?
i ➥ 8/(2e3)
ii ➥ 9/(2e3)
iii ➥ 17/(2e3)
iv ➥ 26/(2e3)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Probability Help-Line

Q3➡ | Engineering Mathematics
Which one of the following does NOT equal to
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Linear Algebra Help-Line

Q4➡ | Digital Logic Design
The smallest integer that can be represented by an 8-bit number in 2’s complement form is
i ➥ -256
ii ➥ -128
iii ➥ -127
iv ➥ 0

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Number System Help-Line

Q5➡ | Digital Logic Design
In the following truth table, V = 1 if and only if the input is valid.

What function does the truth table represent?
i ➥ Priority encoder
ii ➥ Decoder
iii ➥ Multiplexer
iv ➥ Demultiplexer

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Combinational Circuits Help-Line

Q6➡ | Algorithms
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
i ➥ O(log n)
ii ➥ O(n)
iii ➥ O(n log n)
iv ➥ O(n2)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Sorting Help-Line

Q7➡ | Algorithms
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
i ➥ O(1)
ii ➥ O(log n)
iii ➥ O(n)
iv ➥ O(n log n)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Sorting Help-Line

Q8➡ | Theory of Computation
Consider the languages L1 = ϕ and L2 = {a}. Which one of the following represents L1L2* ∪ L1?
i ➥ {є}
ii ➥ ϕ
iii ➥ a
iv ➥ {є,a}

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Regular Language Help-Line

Q9➡ | Compiler Design
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A → є and A → a) to parse a string with n tokens?
i ➥ n/2
ii ➥ n-1
iii ➥ 2n-1
iv ➥ 2n

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Parsers Help-Line

Q10➡ | Operating Systems
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
i ➥ This algorithm is equivalent to the first-come-first-serve algorithm.
ii ➥ This algorithm is equivalent to the round-robin algorithm.
iii ➥ This algorithm is equivalent to the shortest-job-first algorithm.
iv ➥ This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More Discussion Explanation On YouTube CPU Scheduling Help-Line

Q11➡ | Software Engineering
Match the problem domains in GROUP I with the solution technologies in GROUP II
i ➥ P-1, Q-2, R-3, S-4
ii ➥ P-3, Q-4, R-2, S-1
iii ➥ P-3, Q-1, R-4, S-2
iv ➥ P-4, Q-3, R-2, S-1

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion Explanation On YouTube Matching Help-Line

Q12➡ | Computer Network
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
i ➥ TCP, UDP, UDP and TCP
ii ➥ UDP, TCP, TCP and UDP
iii ➥ UDP, TCP, UDP and TCP
iv ➥ TCP, UDP, TCP and UDP

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion Explanation On YouTube Trasport Layer ProtocolHelp-Line

Q13➡ | Computer Network
Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ> , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
i ➥ Encryption: X’s private key followed by Y’s private key; Decryption: X’s public key followed by Y’s public key
ii ➥ Encryption: X’s private key followed by Y’s public key; Decryption: X’s public key followed by Y’s private key
iii ➥ Encryption: X’s public key followed by Y’s private key; Decryption: Y’s public key followed by X’s private key
iv ➥ Encryption: X’s private key followed by Y’s public key; Decryption: Y’s private key followed by X’s public key

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion Explanation On YouTube Network Security Help-Line

Q14➡ | Computer Network
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
i ➥ Network layer – 4 times and Data link layer – 4 times
ii ➥ Network layer – 4 times and Data link layer – 3 times
iii ➥ Network layer – 4 times and Data link layer – 6 times
iv ➥ Network layer – 2 times and Data link layer – 6 times

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeNetwork Layer Help-Line

Q15➡ | Database Management System
An index is clustered, if
i ➥ it is on a set of fields that form a candidate key.
ii ➥ it is on a set of fields that include the primary key.
iii ➥ the data records of the file are organized in the same order as the data entries of the index.
iv ➥ the data records of the file are organized not in the same order as the data entries of the index.

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeFile Structure Help-Line

Q16➡ | Operating Systems
Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X
executes the P operation (i.e., wait) on semaphores a, b and c; process Y executes the P operation on semaphores b, c and d; process Z
executes the P operation on semaphores c, d, and a before entering the respective code segments. After completing the execution of
its code segment, each process invokes the V operation (i.e., signal) on its three semaphores. All semaphores are binary semaphores
initialized to one. Which one of the following represents a deadlock-free order of invoking the P operations by the processes?
i ➥ X: P(a)P(b)P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
ii ➥ X: P(b)P(a)P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
iii ➥ X: P(b)P(a)P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
iv ➥ X: P(a)P(b)P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProcess ManagementHelp-Line

Q17➡ | Theory of Computation
Which of the following statements is/are FALSE?
1. For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
2. Turing recognizable languages are closed under union and complementation.
3. Turing decidable languages are closed under intersection and complementation.
4. Turing recognizable languages are closed under union and intersection.
i ➥ 1 and 4 only
ii ➥ 1 and 3 only
iii ➥ 2 only
iv ➥ 3 only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTurning Machine Help-Line

Q18➡ | Algorithms
Which of the following statements are TRUE?
1. The problem of determining whether there exists a cycle in an undirected graph is in P.
2. The problem of determining whether there exists a cycle in an undirected graph is in NP.
3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
i ➥ 1, 2 and 3
ii ➥ 1 and 2 only
iii ➥ 2 and 3 only
iv ➥ 1 and 3 only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeNP-Complete Help-Line

Q19➡ | Algorithms
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
i ➥ Θ(n2)
ii ➥ Θ(n2 log n)
iii ➥ Θ(n3)
iv ➥ Θ(n3 log n)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBellman – Ford Help-Line

Q20➡ | Computer Organization
In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
i ➥ (j mod v) * k to (j mod v) * k + (k-1)
ii ➥ (j mod v) to (j mod v) + (k-1)
iii ➥ (j mod k) to (j mod k) + (v-1)
iv ➥ (j mod k) * v to (j mod k) * v + (v-1)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCache Memory Help-Line

Q21➡ | Digital Logic Design
Which one of the following expressions does NOT represent exclusive NOR of x and y?
i ➥ xy+x’y’
ii ➥ x⊕y’
iii ➥ x’⊕y
iv ➥ x’⊕y’

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBoolean Algebra Help-Line

Q22➡ | Engineering Mathematics
Which one of the following functions is continuous at x = 3?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCalculus Help-Line

Q23➡ | Engineering Mathematics
Function f is known at the following points:

The value of computed using the trapezoidal rule is
i ➥ 8.983
ii ➥ 9.003
iii ➥ 9.017
iv ➥ 9.045

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTrapezoidal Rule Help-Line

Q24➡ | Engineering Mathematics
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the expected number of unordered cycles of length three?
i ➥ 1/8
ii ➥ 1
iii ➥ 7
iv ➥ 8

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Graph Theory Help-Line

Q25➡ | Engineering Mathematics
Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
i ➥ P only
ii ➥ Q only
iii ➥ Both P and Q
iv ➥ Neither P nor Q

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Graph Theory Help-Line

[Q26 – Q55 carry TWO mark each ]

Q26➡ | Engineering Mathematics
The line Graph L(G) of a simple graph G is defined as follows:
. There is exactly one vertex v(e) in L(G) for each edge e in G
. For any two edge e and e’ in G, L(G) has an edge between v(e) and v(e’), if and only if e and e’ are incident with the same vertex in G.

Which of the following statements is/ are TRUE?
(P) The line Graph of a cycle is a cycle.
(Q) The line Graph of a clique is a clique.
(R) The line Graph of a planar graph is planar.
(S) The line Graph of a Tree is Tree.
i ➥ P only
ii ➥ P and R only
iii ➥ R only
iv ➥ P, Q and S only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Graph Theory Help-Line

Q27➡ | Engineering Mathematics
What is the logical translation of the following statement?
“None of my friends are perfect.”
i ➥ ∃x(F(x)∧¬P(x))
ii ➥ ∃x(¬F(x)∧P(x))
iii ➥ ∃x(¬F(x)∧¬P(x))
iv ➥ ¬∃x(F(x)∧P(x))

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Prepositional Logic Help-Line

Q28➡ | Computer Organization
Consider the following sequence of micro-operations.
MBR ← PC
MAR ← X
PC ← Y
Memory ← MBR
Which one of the following is a possible operation performed by this sequence?
i ➥ Instruction fetch
ii ➥ Operand fetch
iii ➥ Conditional branch
iv ➥ Initiation of interrupt service

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeMirco Operation Help-Line

Q29➡ | Computer Organization
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
i ➥ 1281
ii ➥ 1282
iii ➥ 1283
iv ➥ 1284

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSecondary Memory Help-Line

Q30➡ | Algorithms
The number of elements that can be sorted in Θ(log n) time using heap sort is
i ➥ Θ(1)
ii ➥ Θ(√log⁡n)
iii ➥ Θ (log⁡n/log⁡log⁡n)
iv ➥ Θ(log n)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Sorting Help-Line

Q31➡ | Programming
Consider the following function:
i ➥ Θ(n2)
ii ➥ Θ(n2 log n)
iii ➥ Θ(n3)
iv ➥ Θ(n3 logn)

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Program Help-Line

Q32➡ | Theory of Computation
Consider the following languages.
L1 = {0p1q0r | p,q,r≥0}
L2 = {0p1q0r | p,q,r≥0, p≠r}
Which one of the following statements is FALSE?
i ➥ L2 is context-free.
ii ➥ L1∩ L2 is context-free.
iii ➥ Complement of L2 is recursive.
iv ➥ Complement of L1 is context-free but not regular.

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLanguage Help-Line

Q33➡ | Theory of Computation
Consider the DFA given:

Which of the following are FALSE?
1. Complement of L(A) is context-free.
2. L(A) = L((11*0+0)(0 + 1)*0*1*)
3. For the language accepted by A, A is the minimal DFA.
4. A accepts all strings over {0, 1} of length at least 2.
i ➥ 1 and 3 only
ii ➥ 2 and 4 only
iii ➥ 2 and 3 only
iv ➥ 3 and 4 only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeRegular Language Help-Line

Q34➡ | Operating System
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
i ➥ -2
ii ➥ -1
iii ➥ 1
iv ➥ 2

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Process Synchronization Help-Line

Q35➡ | Database Management System
Consider the following relation schema


Which of the following queries are equivalent to this query in English?
“Find the distinct names of all students who score more than 90% in the course numbered 107”

(I) SELECT DISTINCT S.sname FROM Students as S,Registration as R WHERE R.rollno = S.roll AND R.courseno = 107 AND R.percent > 90

(II) Πsnamecourseno=107∧percent>90(Registration ⋈ Students))

(III) {T|∃S ∈ Students, ∃R ∈ Registration (S.rollno = R.rollno ∧ R.courseno = 107 ∧ R.percent > 90 ∧ T.sname = S.sname)}

(IV) {〈SN〉| ∃SR ∃RP(〈SR,SN〉 ∈ Students ∧ 〈SR,107,RP〉 ∈ Registration ∧ RP>90)}
i ➥ I, II, III and IV
ii ➥ I, II and III only
iii ➥ I, II and IV only
iv ➥ II, III and IV only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Relational Algebra and SQLHelp-Line

Q36➡ | Computer Network
Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.
i ➥ 1
ii ➥ 2
iii ➥ 2.5
iv ➥ 5

Show Answer With Best Explanation

Answer: II

Explanation:
Given,
Data rate (or Bandwidth) = 500 Mbps = 500 x 106 bps
Frame size = 10,000 bits
Speed = 200,000 km/sec

Ask,
Distance =?
Formula,
Length = 2 * Tp * Bandwidth

Calculation,
=> L = 2 * Tp * Bandwidth
=> L = 2 *(Distance/Speed) * Bandwidth


So, Option(II) is correct.

More Discussion Explanation On YouTube Flow Control Help-Line

Q37➡ | Computer Network
In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are
i ➥ Last fragment, 2400 and 2789
ii ➥ First fragment, 2400 and 2759
iii ➥ Last fragment, 2400 and 2759
iv ➥ Middle fragment, 300 and 689

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Fragmentation Help-Line

Q38➡ | Software Engineering
The following figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles represent attributes. If method m is moved to module M2 keeping the attributes where they are, what can we say about the average cohesion and coupling between modules in the system of two modules?
i ➥ There is no change.
ii ➥ Average cohesion goes up but coupling is reduced.
iii ➥ Average cohesion goes down and coupling also reduces.
iv ➥ Average cohesion and coupling increase.

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCohesion and CouplingHelp-Line

Q39➡ | Operating System
A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i]=g(a[i]) for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two
binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below.

Which one of the following represents the CORRECT implementations of ExitX and EntryY?
i ➥
ii ➥
iii ➥
iv ➥

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProcess SynchronizationHelp-Line

Q40➡ | Compiler Design
Consider the following two sets of LR(1) items of an LR(1) grammar.
X -> c.X, c/d
X -> .cX, c/d
X -> .d, c/d
X -> c.X, $
X -> .cX, $
X -> .d, $
Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE?
1. Cannot be merged since look aheads are different.
2. Can be merged but will result in S-R conflict.
3. Can be merged but will result in R-R conflict.
4. Cannot be merged since goto on c will lead to two different sets.
i ➥ 1 only
ii ➥ 2 only
iii ➥ 1 and 4 only
iv ➥ 1, 2, 3 and 4

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeParsers Help-Line

Q41➡ | Theory of Computation
Which of the following is/are undecidable?
G is a CFG. Is L(G) = Φ?
G is a CFG. Is L(G) = Σ*?
M is a Turing machine. Is L(M) regular?
A is a DFA and N is an NFA. Is L(A) = L(N)?
i ➥ 3 only
ii ➥ 3 and 4 only
iii ➥ 1, 2 and 3 only
iv ➥ 2 and 3 only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeUndecidability Help-Line

Q42➡ | Programming
What is the return value of f(p,p), if the value of p is initialized to 5 before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value.
i ➥ 3024
ii ➥ 6561
iii ➥ 55440
iv ➥ 161051

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubePass by value and Pass by referenceHelp-Line

Q43➡ | Data Structure
The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?
i ➥ 10, 20, 15, 23, 25, 35, 42, 39, 30
ii ➥ 15, 10, 25, 23, 20, 42, 35, 39, 30
iii ➥ 15, 20, 10, 23, 25, 42, 35, 39, 30
iv ➥ 15, 10, 23, 25, 20, 35, 42, 39, 30

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTree Traversal Help-Line

Q44➡ | Data Structure
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.

What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue?
i ➥ Θ(n)
ii ➥ Θ(n + k)
iii ➥ Θ(nk)
iv ➥ Θ(n2)

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeQueue Help-Line

Q45➡ | Computer Organization
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There
are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions I1, I2, I3, I4 …, I12 is executed in this pipelined processor. Instruction I4 is the only branch instruction and its branch target is I9. If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is
i ➥ 132
ii ➥ 165
iii ➥ 176
iv ➥ 328

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Pipelining Help-Line

Q46➡ | Computer Organization
A RAM chip has a capacity of 1024 words of 8 bits each (1K×8). The number of 2×4 decoders with enable line needed to construct a 16K×16 RAM from 1K×8 RAM is
i ➥ 4
ii ➥ 5
iii ➥ 6
iv ➥ 7

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCache Memory Help-Line

Q47➡ | Engineering Mathematics
Which one of the following is NOT logically equivalent to ¬∃x(∀y(α) ∧ ∀z(β))?
i ➥ ∀x(∃z(¬β)→∀y(α))
ii ➥ ∀x(∀z(β)→∃y(¬α))
iii ➥ ∀x(∀y(α)→∃z(¬β))
iv ➥ ∀x(∃y(¬α)→∃z(¬β))

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubePrepositional Logic Help-Line

Q48➡ | Computer Organization
Common Data for Questions 48 and 49 :
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment.

Suppose the instruction set architecture of the processor has only two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code?
i ➥ 0
ii ➥ 1
iii ➥ 2
iv ➥ 3

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCode Segment Help-Line

Q49➡ | Computer Organization
Common Data for Questions 48 and 49 :
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment.

What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation.
i ➥ 3
ii ➥ 4
iii ➥ 5
iv ➥ 6

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCode Segment Help-Line

Q50➡ | Software Engineering
Common Data for Questions 50 and 51:
The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array newc. Array A has a fixed length of five characters, while arrays oldc and newc contain three characters each. However, the procedure is flawed

The procedure is tested with the following four test cases
(1) oldc = "abc", newc = "dab" (2) oldc = "cde", newc = "bcd"
(3) oldc = "bca", newc = "cda" (4) oldc = "abc", newc = "bac"

The tester now tests the program on all input strings of length five consisting of characters ‘a’, ‘b’, ‘c’, ‘d’ and ‘e’ with duplicates allowed. If the tester carries out this testing with the four test cases given above, how many test cases will be able to capture the flaw?
i ➥ Only one
ii ➥ Only two
iii ➥ Only three
iv ➥ All four

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGeneral Help-Line

Q51➡ | Software Engineering
Common Data for Questions 50 and 51:
The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array newc. Array A has a fixed length of five characters, while arrays oldc and newc contain three characters each. However, the procedure is flawed

The procedure is tested with the following four test cases
(1) oldc = "abc", newc = "dab" (2) oldc = "cde", newc = "bcd"
(3) oldc = "bca", newc = "cda" (4) oldc = "abc", newc = "bac"

If array A is made to hold the string “abcde”, which of the above four sest cases will be successful in exposing the flaw in this procedure?
i ➥ None
ii ➥ 2 only
iii ➥ 3 and 4 only
iv ➥ 4 only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGeneral Help-Line

Q52➡ | Operating Systems
Statement for Linked Answer Questions 52 and 53:

A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table (T1), which occupies exactly one page. Each entry of T1 stores the base address of a page of the second-level table (T2). Each entry of T2 stores the base address of a page of the third-level table (T3). Each entry of T3 stores a page table entry (PTE). The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set associative virtually indexed physically tagged cache. The cache block size is 64 bytes.

What is the size of a page in KB in this computer?
i ➥ 2
ii ➥ 4
iii ➥ 8
iv ➥ 16

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Memory Management Help-Line

Q53➡ |