Recent questions tagged normal
Register

Recent questions tagged normal

Recent questions tagged normal
4 votes
4 answers 1.4k views
GATE CSE 2021 Set 2 | Question: 33 | Video Solution
Arjun asked in Probability Feb 18, 2021
by Arjun
1.4k points
1.4k views
0 votes
2 answers 746 views
GATE CSE 2021 Set 2 | Question: 35 | Video Solution
Arjun asked in Programming Feb 18, 2021
by Arjun
1.4k points
746 views
2 votes
2 answers 569 views
GATE CSE 2021 Set 1 | Question: 4 | Video Solution
Arjun asked in Compiler Design Feb 18, 2021
by Arjun
1.4k points
569 views
0 votes
0 answers 156 views
GATE2008-67 Video Solution
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
admin asked in Operating System Apr 18, 2020
by admin
585 points
156 views
0 votes
0 answers 81 views
GATE2004-47 Video Solution
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
81 views
0 votes
0 answers 34 views
GATE2016-1-8 Video Solution
We want to design a synchronous counter that counts the sequence $0-1-0-2-0-3$ and then repeats. The minimum number of $\text{J-K}$ flip-flops required to implement this counter is _____________.
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
34 views
0 votes
0 answers 57 views
GATE2009-57, ISRO2016-75 Video Solution
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
57 views
0 votes
0 answers 39 views
GATE2005-68 Video Solution
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
39 views
0 votes
0 answers 62 views
GATE2013-45 Video Solution
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 ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
62 views
0 votes
0 answers 35 views
GATE2014-1-39 Video Solution
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
admin asked in Algorithms Apr 18, 2020
by admin
585 points
35 views
0 votes
0 answers 40 views
GATE2003-78 Video Solution
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
admin asked in Operating System Apr 18, 2020
by admin
585 points
40 views
0 votes
0 answers 31 views
GATE2015-2-7 Video Solution
The minimum number of JK flip-flops required to construct a synchronous counter with the count sequence (0, 0, 1, 1, 2, 2, 3, 3, 0, 0, ...) is _______.
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
31 views
0 votes
0 answers 28 views
GATE2013-52 Video Solution
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 ... size is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$
admin asked in Operating System Apr 18, 2020
by admin
585 points
28 views
0 votes
0 answers 31 views
GATE2016-2-40 Video Solution
The number of ways in which the numbers $1, 2, 3, 4, 5, 6, 7$ can be inserted in an empty binary search tree, such that the resulting tree has height $6$, is _________. Note: The height of a tree with a single node is $0$.
admin asked in DS Apr 18, 2020
by admin
585 points
31 views
0 votes
0 answers 36 views
GATE2005-70 Video Solution
Consider a disk drive with the following specifications: $16$ surfaces, $512$ tracks/surface, $512$ sectors/track, $1$ KB/sector, rotation speed $3000$ rpm. The disk is operated in cycle stealing mode whereby whenever one $4$ byte word is ready it is sent ... $40$ nsec. The maximum percentage of time that the CPU gets blocked during DMA operation is: $10$ $25$ $40$ $50$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
36 views
0 votes
0 answers 33 views
GATE2016-1-54 Video Solution
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
33 views
0 votes
0 answers 64 views
GATE2007-IT-29 Video Solution
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$
admin asked in DS Apr 18, 2020
by admin
585 points
64 views
0 votes
0 answers 37 views
GATE2012-45 Video Solution
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... . Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
37 views
0 votes
0 answers 27 views
GATE2010-48 Video Solution
A computer system has an $L1$ cache, an $L2$ cache, and a main memory unit connected as shown below. The block size in $L1$ cache is $4$ words. The block size in $L2$ cache is $16$ ... ? $2 \hspace{0.1cm} nanoseconds$ $20 \hspace{0.1cm} nanoseconds$ $22 \hspace{0.1cm}nanoseconds$ $88 \hspace{0.1cm} nanoseconds$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 24 views
GATE2014-1-27 Video Solution
Let the size of congestion window of a TCP connection be $32$ KB when a timeout occurs. The round trip time of the connection is $100$ msec and the maximum segment size used is $2$ KB. The time taken (in msec) by the TCP connection to get back to $32$ KB congestion window is _________.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 26 views
GATE2004-IT-12, ISRO2016-77 Video Solution
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 24 views
GATE2001-2.23 Video Solution
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
admin asked in Databases Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 20 views
GATE2016-1-39 Video Solution
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
admin asked in Algorithms Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 26 views
GATE2008-46 Video Solution
You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1, 2, \dots, n$. You have to determine the unique binary search tree that has $P$ as its postorder traversal. What is the time complexity of the most efficient algorithm ... $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ None of the above, as the tree cannot be uniquely determined
admin asked in DS Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 32 views
GATE2012-38 Video Solution
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
32 views
0 votes
0 answers 26 views
GATE2015-1-46 Video Solution
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3$, $7$ and $20$ ... 1st millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
admin asked in Operating System Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 35 views
GATE2014-2-47 Video Solution
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
admin asked in Linear Algebra Apr 18, 2020
by admin
585 points
35 views
0 votes
0 answers 31 views
GATE2005-65 Video Solution
Consider a three word machine instruction $ADD A[R_0], @B$ The first operand (destination) $A[R_0]$ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) [email protected]$ uses indirect addressing mode. $A$ and $B$ are ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
31 views
0 votes
0 answers 24 views
GATE2009-28 Video Solution
Consider a $4$ stage pipeline processor. The number of cycles needed by the four instructions $I1, I2, I3, I4$ in stages $S1, S2, S3, S4$ is shown below: $\begin{array}{|c|c|c|c|c|} \hline \textbf{} & \textbf {$S _1$} &\textbf {$ ... number of cycles needed to execute the following loop? For $(i=1$ to $2)$ {I1; I2; I3; I4;} $16$ $23$ $28$ $30$
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 22 views
GATE2016-1-33 Video Solution
Consider a carry look ahead adder for adding two n-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 20 views
GATE2016-1-19 Video Solution
Consider the following code segment. x = u - t; y = x * v; x = y + w; y = t - z; y = x * y; The minimum number of total variables required to convert the above code segment to static single assignment form is __________.
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 19 views
GATE1994-1.6, ISRO2008-29 Video Solution
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
admin asked in Graph Theory Apr 18, 2020
by admin
585 points
19 views
Page:
Ask a Question
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun