Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Year
Exams
Recent questions tagged descriptive
0
votes
0
answers
GATE19907b Video Solution
In a twolevel virtual memory, the memory access time for main memory, $t_{M}=10^{8}$ sec, and the memory access time for the secondary memory, $t_D=10^{3}$ sec. What must be the hit ratio, $H$ such that the access efficiency is within $80$ percent of its maximum value?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate1990
descriptive
operatingsystem
virtualmemory
videosolution
0
votes
0
answers
GATE200012 Video Solution
An instruction pipeline has five stages where each stage take 2 nanoseconds and all instruction use all five stages. Branch instructions are not overlapped. i.e., the instruction after the branch is not fetched till the branch instruction is ... 50% of the conditional branch instructions are such that the branch is taken, calculate the average instruction execution time.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate2000
coandarchitecture
pipelining
normal
descriptive
videosolution
0
votes
0
answers
GATE19942.5 Video Solution
The number of edges in a regular graph of degree $d$ and $n$ vertices is ____________
asked
Apr 19
in
Graph Theory
by
admin
(
3.6k
points)

1
view
gate1994
graphtheory
easy
graphconnectivity
descriptive
videosolution
0
votes
0
answers
GATE200112 Video Solution
Consider a $5$stage pipeline  IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate2001
coandarchitecture
pipelining
normal
descriptive
videosolution
0
votes
0
answers
GATE19907a Video Solution
A blockset associative cache memory consists of $128$ blocks divided into four block sets. The main memory consists of $16, 384$ blocks and each block contains $256$ eight bit words. How many bits are required for addressing the main memory? How many bits are needed to represent the TAG, SET and WORD fields?
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

3
views
gate1990
descriptive
coandarchitecture
cachememory
videosolution
0
votes
0
answers
GATE200726 Video Solution
Consider the set $S =\{ a , b , c , d\}.$ Consider the following $4$ partitions $π_1,π_2,π_3,π_4$ on $S : π_1 =\{\overline{abcd}\},\quad π_2 =\{\overline{ab}, \overline{cd}\},$ ... $π_i \prec π_j$ if and only if $π_i$ refines $π_j$. The poset diagram for $(S',\prec)$ is:
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

1
view
gate2007
settheory&algebra
normal
partialorder
descriptive
videosolution
0
votes
0
answers
GATE200219 Video Solution
A computer uses $32bit$ virtual address, and $32bit$ physical address. The physical memory is byte addressable, and the page size is $4$ $\text{kbytes}$ . It is decided to use two level page tables to translate from virtual address ... that can be contained in each page? How many bits are available for storing protection and other information in each page table entry?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2002
operatingsystem
virtualmemory
normal
descriptive
videosolution
0
votes
0
answers
GATE20018 Video Solution
Consider a disk with the following specifications: 20 surfaces, 1000 tracks/surface, 16 sectors/track, data density 1 KB/sector, rotation speed 3000 rpm. The operating system initiates the transfer between the disk and the memory sectorwise. Once the head has ... What is the maximum percentage of time the CPU is held up for this disk I/O for cyclestealing DMA transfer?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

2
views
gate2001
operatingsystem
disks
normal
descriptive
videosolution
0
votes
0
answers
GATE20019 Video Solution
A CPU has $32bit$ memory address and a $256 \ KB$ cache memory. The cache is organized as a $4way$ set associative cache with cache block size of $16$ bytes. What is the number of sets in the cache? What is the size (in bits) of ... are required to find the byte offset within a cache block? What is the total amount of extra memory (in bytes) required for the tag bits?
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate2001
coandarchitecture
cachememory
normal
descriptive
videosolution
0
votes
0
answers
GATE20029 Video Solution
Consider the following $32bit$ floatingpoint representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ for negative values), a $24 bit$ fraction field ( ... hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

1
view
gate2002
digitallogic
numberrepresentation
normal
descriptive
videosolution
0
votes
0
answers
GATE199824 Video Solution
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par beginpar end}$ to represent the precedence graph shown below.
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate1998
operatingsystem
processschedule
descriptive
videosolution
0
votes
0
answers
GATE200120 Video Solution
Consider a disk with the $100$ tracks numbered from $0$ to $99$ rotating at $3000$ rpm. The number of sectors per track is $100$ and the time to move the head between two successive tracks is $0.2$ millisecond. Consider a set of disk ... at track $0$ and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

5
views
gate2001
operatingsystem
disks
normal
descriptive
videosolution
0
votes
0
answers
GATE200216 Video Solution
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M, ... above decomposition dependencypreserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

2
views
gate2002
databases
databasenormalization
normal
descriptive
videosolution
0
votes
0
answers
GATE199823 Video Solution
Let the attribute ‘$val$’ give the value of a binary number generated by $S$ in the following grammar: $S \rightarrow L.L \mid L$ $L \rightarrow LB \mid B$ $B \rightarrow 0 \mid 1$ For example, an input $101.101$ gives $S.val = 5.625$ Construct a syntax directed translation scheme using only synthesized attributes, to determine $S.val$.
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

1
view
gate1998
compilerdesign
syntaxdirectedtranslation
normal
descriptive
videosolution
0
votes
0
answers
GATE20021.17 Video Solution
In the C language: At most one activation record exists between the current activation record and the activation record for the main The number of activation records between the current activation record and the activation records from the main ... activation record for the recursive function to be saved in a different stack before the recursive function can be called.
asked
Apr 19
in
Programming
by
admin
(
3.6k
points)

2
views
gate2002
programming
programminginc
easy
descriptive
videosolution
0
votes
0
answers
GATE19901iva Video Solution
A 32bit floatingpoint number is represented by a 7bit signed exponent, and a 24bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

3
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
videosolution
0
votes
0
answers
GATE198710b Video Solution
What is the generating function $G(z)$ for the sequence of Fibonacci numbers?
asked
Apr 19
in
Combinatory
by
admin
(
3.6k
points)

10
views
gate1987
permutationandcombination
generatingfunctions
descriptive
videosolution
0
votes
0
answers
GATE200020 Video Solution
a. Fill in the boxes below to get a solution for the readerwriter problem, using a single binary semaphore, mutex (initialized to $1$) and busy waiting. Write the box numbers ($1$, $2$ and $3$), and their contents in your answer book. L1: int R = 0, W ... ...../*do the write*/ wait( mutex); W=0; signal (mutex); } b. Can the above solution lead to starvation of writers?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2000
operatingsystem
processsynchronization
normal
descriptive
videosolution
0
votes
0
answers
GATE200017 Video Solution
An array contains four occurrences of $0$, five occurrences of $1$, and three occurrences of $2$ in any order. The array is to be sorted using swap operations (elements that are swapped need to be adjacent). What is the minimum number of swaps ... case? Give an ordering of elements in the above array so that the minimum number of swaps needed to sort the array is maximum.
asked
Apr 19
in
Algorithms
by
admin
(
3.6k
points)

3
views
gate2000
algorithms
sorting
normal
descriptive
videosolution
0
votes
0
answers
GATE199818 Video Solution
For a setassociative Cache organization, the parameters are as follows: $\begin{array}{cl} \hline \text {$t _c$} & \text{Cache Access Time }\\\hline \text{$ ... $1 < m \leq l$. Give the value of the hit ratio for $l = 1$.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

1
view
gate1998
coandarchitecture
cachememory
descriptive
videosolution
0
votes
0
answers
GATE200113 Video Solution
Consider the following C program: void abc(char*s) { if(s[0]=='\0')return; abc(s+1); abc(s+1); printf("%c",s[0]); } main() { abc("123"); } What will be the output of the program? If $abc(s)$ is called with a nullterminated string $s$ of length $n$ characters (not counting the null ('\0') character), how many characters will be printed by $abc(s)$?
asked
Apr 19
in
Programming
by
admin
(
3.6k
points)

1
view
gate2001
programming
recursion
normal
descriptive
videosolution
0
votes
0
answers
GATE199811 Video Solution
Suppose $A = \{a, b, c, d\}$ and $\Pi_1$ is the following partition of A $\Pi_1 = \left\{\left\{a, b, c\right\}\left\{d\right\}\right\}$ List the ordered pairs of the equivalence relations induced by $\Pi_1$. Draw the graph of the above ... $\left\langle\left\{\Pi_1, \Pi_2, \Pi_3, \Pi_4\right\}, \text{ refines } \right\rangle$.
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

2
views
gate1998
settheory&algebra
normal
partialorder
descriptive
videosolution
0
votes
0
answers
GATE19986b Video Solution
Consider the grammar S $\rightarrow Aa \mid b$ A $\rightarrow Ac \mid Sd \mid \epsilon$ Construct an equivalent grammar with no left recursion and with minimum number of production rules.
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

1
view
gate1998
compilerdesign
grammar
descriptive
videosolution
0
votes
0
answers
GATE198912a Video Solution
Fig.7 shows a $B+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B+$ tree. Obtain the modified $B+$ tree after insertion.
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

2
views
descriptive
gate1989
databases
btree
videosolution
0
votes
0
answers
GATE199317 Video Solution
Out of a group of $21$ persons, $9$ eat vegetables, $10$ eat fish and $7$ eat eggs. $5$ persons eat all three. How many persons eat at least two out of the three dishes?
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

3
views
gate1993
settheory&algebra
easy
sets
descriptive
videosolution
0
votes
0
answers
GATE200217 Video Solution
The following table refers to search items for a key in $B$trees and $B^+$ ... $(2,11)$ and $(11,6)$ are now inserted into $R.$ What are the additional tuples that are inserted in $V$?
asked
Apr 19
in
Databases
by
admin
(
3.6k
points)

1
view
gate2002
databases
btree
normal
descriptive
videosolution
0
votes
0
answers
GATE20027 Video Solution
Express the function $f(x,y,z) = xy' + yz'$ with only one complement operation and one or more AND/OR operations. Draw the logic circuit implementing the expression obtained, using a single NOT gate and one or more AND/OR gates. Transform ... (without expressing its switching function) into an equivalent logic circuit that employs only $6$ NAND gates each with $2$inputs.
asked
Apr 19
in
Digital Logic
by
admin
(
3.6k
points)

1
view
gate2002
digitallogic
normal
descriptive
digitalcircuits
videosolution
0
votes
0
answers
GATE20006 Video Solution
Let $S$ be a set of $n$ elements $\left\{1, 2,....., n\right\}$ and $G$ a graph with 2$^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

1
view
gate2000
settheory&algebra
normal
descriptive
sets
videosolution
0
votes
0
answers
GATE19891v Video Solution
The number of possible commutative binary operations that can be defined on a set of $n$ elements (for a given n) is ___________.
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

2
views
gate1989
descriptive
settheory&algebra
binaryoperation
videosolution
0
votes
0
answers
GATE199115,b Video Solution
Consider the following first order formula: ... Does it have finite models? Is it satisfiable? If so, give a countable model for it.
asked
Apr 19
in
Mathematical Logic
by
admin
(
3.6k
points)

1
view
gate1991
firstorderlogic
descriptive
videosolution
0
votes
0
answers
GATE199713 Video Solution
Let $F$ be the set of onetoone functions from the set $\{1, 2, \dots, n\}$ to the set $\{1, 2,\dots, m\}$ where $m\geq n\geq1$. How many functions are members of $F$? How many functions $f$ in $F$ satisfy the property $f(i)=1$ for some $i, 1\leq i \leq n$? How many functions $f$ in $F$ satisfy the property $f(i)<f(j)$ for all $i,j \ \ 1\leq i \leq j \leq n$?
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

3
views
gate1997
settheory&algebra
functions
normal
descriptive
videosolution
0
votes
0
answers
GATE19968 Video Solution
Let $F$ be the collection of all functions $f: \{1, 2, 3\} \to \{1, 2, 3\}$. If $f$ and $g \in F$, define an equivalence relation $\sim$ by $f\sim g$ if and only if $f(3) = g(3)$. Find the number of equivalence classes defined by $\sim$. Find the number of elements in each equivalence class.
asked
Apr 19
in
Set Theory & Algebra
by
admin
(
3.6k
points)

2
views
gate1996
settheory&algebra
relations
functions
normal
descriptive
videosolution
0
votes
0
answers
GATE200119 Video Solution
Two concurrent processes $P1$ and $P2$ want to use resources $R1$ and $R2$ in a mutually exclusive manner. Initially, $R1$ and $R2$ ... deadlock. Exchange the statements $Q1$ and $Q3$ and statements $Q2$ and $Q4$. Is mutual exclusion guaranteed now? Can deadlock occur?
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2001
operatingsystem
resourceallocation
normal
descriptive
videosolution
0
votes
0
answers
GATE200220 Video Solution
The following solution to the single producer single consumer problem uses semaphores for synchronization. #define BUFFSIZE 100 buffer buf[BUFFSIZE]; int first = last = 0; semaphore b_full = 0; semaphore b_empty = BUFFSIZE void producer() { ... immediately after $c1$ and immediately before $c2$ so that the program works correctly for multiple producers and consumers.
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

1
view
gate2002
operatingsystem
processsynchronization
normal
descriptive
videosolution
0
votes
0
answers
GATE200218a Video Solution
Draw the process state transition diagram of an OS in which (i) each process is in one of the five states: created, ready, running, blocked (i.e., sleep or wait), or terminated, and (ii) only nonpreemptive scheduling is used by the OS. Label the transitions appropriately.
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

3
views
gate2002
operatingsystem
processsynchronization
normal
descriptive
videosolution
0
votes
0
answers
GATE200210 Video Solution
In a C program, an array is declared as $\text{float} \ A[2048]$. Each array element is $4 \ \text{Bytes}$ in size, and the starting address of the array is $0x00000000$. This program is run on a computer that has a direct ... ? Justify your answer briefly. Assume that the data cache is initially empty and that no other data or instruction accesses are to be considered.
asked
Apr 19
in
CO & Architecture
by
admin
(
3.6k
points)

2
views
gate2002
coandarchitecture
cachememory
normal
descriptive
videosolution
0
votes
0
answers
GATE20005 Video Solution
A multiset is an unordered collection of elements where elements may repeat any number of times. The size of a multiset is the number of elements in it, counting repetitions. What is the number of multisets of size $4$ that can be ... n distinct elements so that at least one element occurs exactly twice? How many multisets can be constructed from n distinct elements?
asked
Apr 19
in
Combinatory
by
admin
(
3.6k
points)

4
views
gate2000
permutationandcombination
normal
descriptive
videosolution
0
votes
0
answers
GATE19907c Video Solution
A certain moving arm diskstorage device has the following specifications: Number of tracks per surface=$404$ Track storage capacity=$130030$ bytes. Disk speed=$3600$ rpm Average seek time=$30$ m secs. Estimate the average latency, the disk storage capacity and the data transfer rate.
asked
Apr 19
in
Operating System
by
admin
(
3.6k
points)

3
views
descriptive
operatingsystem
disks
gate1990
videosolution
0
votes
0
answers
GATE200019 Video Solution
Consider the syntax directed translation scheme (SDTS) given in the following. Assume attribute evaluation with bottomup parsing, i.e., attributes are evaluated immediately after a reduction. E$\rightarrow $ E$_{1}$ * T {E.val = E$_{1}$.val * ... SDTS given, without changing the grammar, to find $E.red$, the number of reductions performed while reducing an input to $E$.
asked
Apr 19
in
Compiler Design
by
admin
(
3.6k
points)

1
view
gate2000
compilerdesign
syntaxdirectedtranslation
normal
descriptive
videosolution
0
votes
0
answers
GATE200013 Video Solution
Suppose a stack implementation supports, in addition to PUSH and POP, an operation REVERSE, which reverses the order of the elements on the stack. To implement a queue using the above stack implementation, show how to implement ENQUEUE using a single operation and DEQUEUE using a sequence ... $5 \ 2 * 3 \ 4 + 5 \ 2$ At the end of evaluation
asked
Apr 19
in
DS
by
admin
(
3.6k
points)

1
view
gate2000
datastructures
stack
normal
descriptive
videosolution
Page:
1
2
3
4
...
7
next »
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.
Top Users
Jul 2020
Shaik Masthan
39 Points
hiteshpujari
9 Points
fazin
7 Points
srestha
7 Points
gaurav2697
6 Points
Venkatesh Akhouri
6 Points
Meghana518
6 Points
athenahermes
6 Points
bittujash
6 Points
Pawan_k
6 Points
7,557
questions
1,783
answers
10,868
comments
90,491
users