GATE 2015 SET-1 CS Computer Science and information technology

[Q1 – Q25 carry ONE mark each ]

Q1➡ | Engineering Mathematics
If g(x) = 1 – x and h(x)= x/x-1 , then g(h(x)) / h(g(x)) is:
i ➥ h(x)/g(x)
ii ➥ -1/x
iii ➥ g(x)/h(x)
iv ➥ x/(1-x)2

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Calculus Help-Line

Q2➡ | Engineering Mathematics
.
i ➥
ii ➥ 0
iii ➥ 1
iv ➥ not defined

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLimit Help-Line

Q3➡ | Algorithms
i ➥ P-iii, Q-ii, R-iv, S-i
ii ➥ P-i, Q-ii, R-iv, S-iii
iii ➥ P-ii, Q-iii, R-iv, S-i
iv ➥ P-ii, Q-i, R-iii, S-iv

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Matching Help-Line

Q4➡ | Algorithms
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options below, c is a constant.
i ➥ T(n) = 2T(n/2) + cn
ii ➥ T(n) = T(n – 1) + T(1) + cn
iii ➥ T(n) = 2T(n – 1) + cn
iv ➥ T(n) = T(n/2) + cn

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Quick Sort Help-Line

Q5➡ | Data Structure
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are
i ➥ 63 and 6, respectively
ii ➥ 64 and 5, respectively
iii ➥ 32 and 6, respectively
iv ➥ 31 and 5, respectively

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Tree Help-Line

Q6➡ | Software Engineering
Match the following:
i ➥ P-ii, Q-iii, R-i, S-iv
ii ➥ P-iii, Q-iv, R-ii, S-i
iii ➥ P-iii, Q-i, R-iv, S-ii
iv ➥ P-iii, Q-i, R-ii, S-iv

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Software Testing Help-Line

Q7➡ | Data Structure
Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)

I. 3,5,7,8,15,19,25
II. 5,8,12,10,15,25
III. 2,7,10,8,14,16,20
IV. 4,6,7,9,18,20,25

i ➥ I and VI only
ii ➥ II and III only
iii ➥ II and IV only
iv ➥ II only

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Binary Search Tree Help-Line

Q8➡ | Compiler Design
Which one of the following is True at any valid state in shift-reduce parsing?
i ➥ Viable prefixes appear only at the bottom of the stack and not inside
ii ➥ Viable prefixes appear only at the top of the stack and not inside
iii ➥ The stack contains only a set of viable prefixes
iv ➥ The stack never contains viable prefixes

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion Explanation On YouTube Parsers Help-Line

Q9➡ | Engineering Mathematics
Which one of the following is NOT equivalent to p↔q?
i ➥ ( ⌉p∨q)∧(p∨ ⌉q)
ii ➥ ( ⌉p∨q)∧(p→q)
iii ➥ ( ⌉p ∧ q) ∨ (p ∧ ⌉q)
iv ➥ ( ⌉p ∧ ⌉q) ∨ (p ∧ q)

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion Explanation On YouTube Propositional Logic Help-Line

Q10➡ | Engineering Mathematics
i ➥ I and III only
ii ➥ II and III only
iii ➥ I,II and III only
iv ➥ I,II and IV only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More Discussion Explanation On YouTube Set Theory Help-Line

Q11➡ | Digital Logic Design
Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is
i ➥ 0, 1, 3, 7, 15, 14, 12, 8, 0
ii ➥ 0, 1, 3, 5, 7, 9, 11, 13, 15, 0
iii ➥ 0, 2, 4, 6, 8, 10, 12, 14, 0
iv ➥ 0, 8, 12, 14, 15, 7, 3, 1, 0

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More Discussion Explanation On YouTube Sequential Circuits Help-Line

Q12➡ | Computer Organization
For computers based on three-address instruction formats, each address field can be used to specify which of the following:
(S1) A memory operand
(S2) A processor register
(S3) An implied accumulator register
i ➥ Either S1 or S2
ii ➥ Either S2 or S3
iii ➥ Only S2 and S3
iv ➥ All of S1, S2 and S3

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More Discussion Explanation On YouTube Machine Instructions Help-Line

Q13➡ | Computer Network
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are False with respect to the TCP connection?

I. If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1.
II. If the estimated round trip time at any given point of time is t sec, the value of the retransmission timeout is always set to greater than or equal
to t sec.
III. The size of the advertised window never changes during the course of the TCP connection.
IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.
i ➥ III only
ii ➥ I and III only
iii ➥ I and IV only
iv ➥ II and IV only

Show Answer With Best Explanation

Answer: II

Explanation:
Statement(I): If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1.(False)
1 Byte of Data consumes 1 Sequence number.If Sequence number of segment is m, then the Sequence number of subsequent segment is m+1,only if 1 Byte of Data is transferred. But it is already given that Host transfer karge file. So, the statement is False.

Statement(II): If the estimated round trip time at any given point of time is t sec, the value of the retransmission timeout is always set to greater than or equal to t sec.(True)
TCP sets a timeout when it sends Data and if Data is not acknowledged before timeout expires it retransmit data. Timeout is based on RTT. Timeout is always set to greater than or equal to RTT.

Statement(III): The size of the advertised window never changes during the course of the TCP connection.(False)
Receiver’s window buffer is never changed.But depending upon the available window size, Advertised window is keep changing.
Let’s undestand it with example,
Suppose receiver window size is 1000B, so the size of advertised window is 1000B. Again suppose sender have 400B of data to sent, it sends to receiver. Now receiver window have (1000-400) 600B of available space. Now receiver will sent acknowlege to sender with advertised window of 600B. So, The size of the advertised window keep change during the course of the TCP connection.

Statement(IV): The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.(True)
Because sender will never sends number of Byte greater than the advertised window.

So, Option(II) is correct.

More DiscussionExplanation On YouTubeTCP Help-Line

Q14➡ | Computer Network
Suppose that everyone in a group on N people wants to communicate secretly with the (N – 1) others using symmetric Key cryptographic system. The communication between any two person should not be decodable by the others in the group. The numbers of keys required in the system as a whole to satisfy the confidentiality requirement is
i ➥ 2N
ii ➥ N(N−1)
iii ➥ N(N−1) / 2
iv ➥ (N−1) / 2

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeNetwork Security Help-Line

Q15➡ | Web Technologies
Which of the following statement is/are FALSE?

I. XML overcomes the limitations in HTML to support a structured way of organizing content.
II. XML specification is not case sensitive while HTML specification is case sensitive.
III. XML supports user defined tags while HTML uses pre-defined tags.
IV. XML tags need not be closed while HTML tags must be closed.
i ➥ Ⅱ only
ii ➥ Ⅰ only
iii ➥ II and IV only
iv ➥ III and IV only

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeXML Help-Line

Q16➡ | Computer Network
Which one of the following fields of an IP header is NOT modified by a typical IP router?
i ➥ Checksum
ii ➥ Source address
iii ➥ Time to Live (TTL)
iv ➥ Length

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeIPV4 Header Help-Line

Q17➡ | Computer Network
In one of the pairs of protocols given below , both the protocols can use multiple TCP connections between the same client and the server. Which one is that?
i ➥ HTTP, FTP
ii ➥ HTTP, TELNET
iii ➥ FTP, SMTP
iv ➥ HTTP, SMTP

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProtocols Help-Line

Q18➡ | Theory of Computation
For any two languages L1 and L2 such that L1 is context-free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true?

I. L’1 (Complement of L1) is recursive.
II. L’2 (Complement of L2) is recursive.
III. L’1 is context Free
IV. L’1 U L2 is recursive Enumerable.
i ➥ I only
ii ➥ III only
iii ➥ III and IV only
iv ➥ I and IV only

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLanguages Help-Line

Q19➡ | Operating System
Consider a system with byte-addressable memory, 32-bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is___________.

Show Answer With Best Explanation

Answer: 4
Explanation: Upload Soon

More DiscussionExplanation On YouTube Paging Help-Line

Q20➡ | Operating System
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.

The number of distinct values that B can possibly take after the execution is

Show Answer With Best Explanation

Answer: 3
Explanation: Upload Soon

More DiscussionExplanation On YouTube Process Synchronization Help-Line

Q21➡ | Database Management System
SELECT operation in SQL is equivalent to
i ➥ The selection operation in relational algebra
ii ➥ The selection operation in relational algebra, except that SELECT in SQL retains duplicates
iii ➥ The projection operation in relational algebra
iv ➥ The projection operation in relational algebra, except that SELECT in SQL retains duplicates

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSQL Help-Line

Q22➡ | Database Management System
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Than that index is called
i ➥ Dense
ii ➥ Sparse
iii ➥ Clustered
iv ➥ Unclustered

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTubeFile Structure Help-Line

Q23➡ | Engineering Mathematics
In the LU decomposition of the matrix ,if the diagonal elements of U are both 1, then the lower diagonal entry l22 of L is

Show Answer With Best Explanation

Answer: 5
Explanation: Upload Soon

More DiscussionExplanation On YouTube Linear Algebra Help-Line

Q24➡ | Programming
The output of the following C program is __________.

Show Answer With Best Explanation

Answer: -5
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q25➡ | Data Structure
What are the worst-case complexities of insertion and deletion of a key in a binary search tree?
i ➥ Θ(logn) for both insertion and deletion
ii ➥ Θ(n) for both insertion and deletion
iii ➥ Θ(n) for insertion and Θ(logn) for deletion
iv ➥ Θ(logn) for insertion and Θ(n) for deletion

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBinary Search Tree Help-Line

[Q26 – Q55 carry TWO mark each ]

Q26➡ | Computer Network
Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _________.

Show Answer With Best Explanation

Answer: 320
Explanation:
Given,
Bit rate (or Bandwidth) = 64 kilobits =64 x 103 bps
Processing Delay (or Tp) = 20ms
Link utilization (or Efficiency) = 50% = 1/2

Ask,
Frame size = ?

Formula,
For stop-wait protocol,
Efficiency (η) = Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _________.
where,
Consider a 128 × 103 bits/ second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is _________.
Tp = Propogation Delay
Tt = Transmission Delay = Consider a 128 × 103 bits/ second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is _________.
Calculation,
η = Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _________.
=> Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _________.
=> 1+2a = 2
=> Tt =2*Tp
=> Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _________.
=> L = 2 * Tp * Bw
=> L = 2* 20 ms * 64 x 103 bps
=> L = 2* 20* 10-3 s * 64 x 103 bps
=> L = 40 * 64 / 8 Byte = 320 Byte

More Discussion Explanation On YouTube Flow Control Help-Line

Q27➡ | Data Structure
Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4.

Now consider that a value 35 is inserted into this heap. After insertion, the new heap is
i ➥ 40, 30, 20, 10, 15, 16, 17, 8, 4, 35
ii ➥ 40, 35, 20, 10, 30, 16, 17, 8, 4, 15
iii ➥ 40, 30, 20, 10, 35, 16, 17, 8, 4, 15
iv ➥ 40, 35, 20, 10, 15, 16, 17, 8, 4, 30

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeHeap Help-Line

Q28➡ | Software Engineering
Consider the following C program segment.

The cyclomatic complexity of the program segment is ________.

Show Answer With Best Explanation

Answer: 5
Explanation: Upload Soon

More DiscussionExplanation On YouTubeCyclomatic Complexity Help-Line

Q29➡ | Computer Network
Consider a LAN with four nodes S1, S2, S3 and S4. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probabilities of generation of a frame in a time slot by S1, S2, S3 and S4 are 0.1, 0.2, 0.3 and 0.4, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is _________.

Show Answer With Best Explanation

Answer: 0.40 to 0.46
Explanation: Upload Soon

More DiscussionExplanation On YouTubeAccess Control Help-Line

Q30➡ | Digital Logic Design
The binary operator ≠ is defined by the following truth table

Which one of the following is true about the binary operator ≠?
i ➥ Both commutative and associative
ii ➥ Commutative but not associative
iii ➥ Not commutative but associative
iv ➥ Neither commutative nor associative

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Boolean Expression Help-Line

Q31➡ | Engineering Mathematics

Show Answer With Best Explanation

Answer: 0.99
Explanation: Upload Soon

More DiscussionExplanation On YouTube Calculus Help-Line

Q32➡ | Engineering Mathematics
Suppose L = {p, q, r, s, t} is a lattice represented by the following Hasse diagram:

For any x, y ∈ L, not necessarily distinct, x ∨ y and x ∧ y are join and meet of x, y respectively. Let L3 = {(x,y,z): x, y, z ∈ L} be the set of all ordered triplets of the elements of L. Let pr be the probability that an element (x,y,z) ∈ L3 chosen equiprobably satisfies x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z).
Then
i ➥ pr = 0
ii ➥ pr = 1
iii ➥ 0 < pr ≤ 1/5
iv ➥ 1/5 < pr < 1

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTube Set Theory Help-Line

Q33➡ | Engineering Mathematics
Consider the operations
f(X, Y, Z) = X’YZ + XY’ + Y’Z’ and g(X′, Y, Z) = X′YZ + X′YZ′ + XY
Which one of the following is correct?
i ➥ Both {f} and {g} are functionally complete
ii ➥ Only {f} is functionally complete
iii ➥ Only {g} is functionally complete
iv ➥ Neither {f} nor {g} is functionally complete

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTube Set Theory Help-Line

Q34➡ | Engineering Mathematics
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is __________.

Show Answer With Best Explanation

Answer: 24
Explanation: Upload Soon

More DiscussionExplanation On YouTubeGraph Theory Help-Line

Q35➡ | Engineering Mathematics
Let an represent the number of bit strings of length n containing two consecutive 1s. What is the recurrence relation for an?
i ➥ an-2 + an-1 + 2n-2
ii ➥ an-2 + 2an-1 + 2n-2
iii ➥ 2an-2 + an-1 + 2n-2
iv ➥ 2an-2 + 2an-1 + 2n-2

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTube Reccurence Relation Help-Line

Q36➡ | Compiler Design
A variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously:
i. There exists a statement Sj that uses x
ii. There is a path from Si to Sj in the flow graph corresponding to the program
iii. The path has no intervening assignment to x including at Si and Sj


The variables which are live both at the statement in basic block 2 and at the statement in basic block 3 of the above control flow graph are
i ➥ p, s, u
ii ➥ r, s, u
iii ➥ r, u
iv ➥ q, v

Show Answer With Best Explanation

Answer: III
Explanation: Upload Soon

More DiscussionExplanation On YouTube Control Flow Graph Help-Line

Q37➡ | Compiler Design
The least number of temporary variables required to create a three-address code in static single assignment form for the expression q + r/3 + s – t * 5 + u * v/w is ________.

Show Answer With Best Explanation

Answer: 8
Explanation: Upload Soon

More DiscussionExplanation On YouTubeStatic Single AssignmentHelp-Line

Q38➡ | Database Management System
Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m:n relationship R12, E1 and E3 are connected by a 1:n (1 on the side of E1 and n on the side of E3) relationship R13.
E1 has two single-valued attributes a11 and a12 of which a11 is the key attribute. E2 has two single-valued attributes a21 and a22 is the key attribute. E3 has two single-valued attributes a31 and a32 of which a31 is the key attribute. The relationships do not have any attributes.

If a relational model is derived from the above ER model, then the minimum number of relations that would be generated if all the relations are in 3NF is __________.

Show Answer With Best Explanation

Answer: 4
Explanation: Upload Soon

More DiscussionExplanation On YouTubeE-R ModelHelp-Line

Q39➡ | Theory of Computation


Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is _____.

Show Answer With Best Explanation

Answer: 1
Explanation: Upload Soon

More DiscussionExplanation On YouTubeDFA Help-Line

Q40➡ | Theory of Computation
Consider the NPDA 〈Q = {q0, q1, q2}, Σ = {0, 1}, Γ = {0, 1, ⊥}, δ, q0, ⊥, F = {q2}〉, where (as per usual convention) Q is the set of states, Σ is the input alphabet, Γ is stack alphabet, δ is the state transition function, q0 is the initial state, ⊥ is the initial stack symbol, and F is the set of accepting states, The state transition is as follows:

Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automaton?
i ➥ 10110
ii ➥ 10010
iii ➥ 01010
iv ➥ 01001

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubePDA Help-Line

Q41➡ | Engineering Mathematics
Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For x ∈ V, let d(x)denote the shortest distance in G from s to x. A breadth first search (BFS) is performed starting at s. Let T be the resultant BFS tree. If (u, v) is an edge of G that is not in T, then which one of the following CANNOT be the value of d(u) – d(v) ?
i ➥ -1
ii ➥ 0
iii ➥ 1
iv ➥ 2

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeBFS Help-Line

Q42➡ | Operating Systems
Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T1, T2 and T3 requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1st millisecond and task preemptions are allowed, the first instance of T3 completes its execution at the end of ___________ milliseconds.

Show Answer With Best Explanation

Answer: 12
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProcess Scheduling Help-Line

Q43➡ | Digital Logic Design
A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.
i ➥ 0110110…
ii ➥ 0100100…
iii ➥ 011101110…
iv ➥ 011001100…

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSequential Circuits Help-Line

Q44➡ | Computer Organization
Consider a disk pack with a seek time of 4 milliseconds and rotational speed of 10000 rotations per minute (RPM). It has 600 sectors per track and each sector can store 512 bytes of data. Consider a file stored in the disk. The file contains 2000 sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is _________.

Show Answer With Best Explanation

Answer: 14020
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSecondary Storage Help-Line

Q45➡ | Computer Organization
Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to 2 gigahertz. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is _______.

Show Answer With Best Explanation

Answer: 3.2
Explanation: Upload Soon

More DiscussionExplanation On YouTubePipelinig Help-Line

Q46➡ | Operating Systems
Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution)
is _________ tracks.

Show Answer With Best Explanation

Answer: 10
Explanation: Upload Soon

More DiscussionExplanation On YouTubeDisk Scheduling Help-Line

Q47➡ | Operating Systems
Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First-In-First Out (FIFO) and Least Recently Used (LRU)?
i ➥ Both incur the same number of page faults
ii ➥ FIFO incurs 2 more page faults than LRU
iii ➥ LRU incurs 2 more page faults than FIFO
iv ➥ FIFO incurs 1 more page faults than LRU

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubePage Replacement AlgorithmHelp-Line

Q48➡ | Engineering Mathematics

Show Answer With Best Explanation

Answer: -1
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLinear Algebra Help-Line

Q49➡ | Engineering Mathematics
Consider the following 2 × 2 matrix A where two elements are unknown and are marked by a and b. The eigenvalues of this matrix are –1 and 7. What are the values of a and b?
i ➥ a=6, b=4
ii ➥ a=4, b=6
iii ➥ a=3, b=5
iv ➥ a=5, b=3

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeLinear Algebra Help-Line

Q50➡ | Algorithms
An algorithm performs (log N)1/2 find operations, N insert operations, (log N)1/2 delete operations, and (log N)1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?
i ➥ Unsorted array
ii ➥ Min-heap
iii ➥ Sorted array
iv ➥ Sorted doubly linked list

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeTime Complexity Help-Line

Q51➡ | Database Management System
Consider the following relations:

Consider the following SQL query.
SELECT S. Student_Name, sum(P.Marks)
FROM Student S, Performance P
WHERE S.Roll_No = P.Roll_No
GROUP BY S.Student_Name

The number of rows that will be returned by the SQL query is ______.

Show Answer With Best Explanation

Answer: 2
Explanation: Upload Soon

More DiscussionExplanation On YouTubeSQL Help-Line

Q52➡ | Programming
What is the output of the following C code? Assume that the address of x is 2000 (in decimal) and an integer requires four bytes of memory.
int main()
{
unsigned int x[4][3] =
{{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}};
printf(“%u, %u, %u”, x+3, *(x+3), *(x+2)+3);
}
i ➥ 2036, 2036, 2036
ii ➥ 2012, 4, 2204
iii ➥ 2036, 10, 10
iv ➥ 2012, 4, 6

Show Answer With Best Explanation

Answer: I
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q53➡ | Algorithms
The graph shown below 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is _______.

Show Answer With Best Explanation

Answer: 69
Explanation: Upload Soon

More DiscussionExplanation On YouTubeMinimum Spanning Tree Help-Line

Q54➡ | Programming
Consider the following C function.

Which one of the following most closely approximates the return value of the function fun1?
i ➥ n3
ii ➥ n(log n)2
iii ➥ nlog n
iv ➥ nlog (log n)

Show Answer With Best Explanation

Answer: IV
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

Q55➡ | Programming
Consider the following pseudo code, where x and y are positive integers.
begin
q := 0
r := x
while r >= y do

begin
r := r – y
q := q + 1
end

end
The post condition that needs to be satisfied after the program terminates is
i ➥ {r = qx + y ∧ r< y}
ii ➥ {x = qy + r ∧ r<y}
iii ➥ {y = qx + r ∧ 0<r< y}
iv ➥ {q +1 < r – y ∧ y > 0}

Show Answer With Best Explanation

Answer: II
Explanation: Upload Soon

More DiscussionExplanation On YouTubeProgram Help-Line

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?