The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by minal
User minal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User minal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+7
votes
1
GATE19901ivb
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 ___________, if the scale factor is represented in excess64 format.
answered
Jun 28, 2018
in
Digital Logic

810
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
+3
votes
2
Proper subset and subset
Please solve this question along with explanation.
answered
May 1, 2018
in
Mathematical Logic

165
views
sets
+1
vote
3
SET THEORY
If R=P(phi) and T=P({1,2}) where P is power set Then cardinality for S=R * T is ? What i know is phi *{Any set} = phi so above cardinality must be zero too.
answered
Apr 30, 2018
in
Set Theory & Algebra

84
views
+11
votes
4
GATE19901iva
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 ___________
answered
Aug 22, 2017
in
Digital Logic

2.7k
views
gate1990
descriptive
digitallogic
numberrepresentation
floatingpointrepresentation
+10
votes
5
Kenneth Rosen Edition 6th Exercise 5.5 Question 46 (Page No. 381)
46) A shelf holds 12 books in a row. How many ways are there to choose five books so that no two adjacent books are chosen?
answered
Apr 21, 2017
in
Combinatory

349
views
kennethrosen
discretemathematics
permutationandcombination
0
votes
6
cil2017 RQ10
answered
Apr 9, 2017
in
Numerical Ability

54
views
cil2017
+2
votes
7
cil2017 RQ18
answered
Apr 9, 2017
in
Numerical Ability

50
views
cil2017
+4
votes
8
Relation composition
$R$ and $S$ are two relations on a set $A$ $\begin{align*} M_R = \begin{bmatrix} 1 & 0 & 1 \\ 1 & 0 & 0 \\ 0 & 1 & 0 \\ \end{bmatrix} \qquad M_S = \begin{bmatrix} 0 & 1 & 1 \\ 0 & 1 & 0 \\ 1 & 1 & 0 \\ \end{bmatrix} \end{align*}$ Then matrices for $R \cap S$ and $R \cup S$ ?
answered
Dec 14, 2016
in
Set Theory & Algebra

132
views
relations
discretemathematics
+3
votes
9
#mathsGeneratingFunction
x31⋅(1−x16)⋅(1−x15)⋅(1−x26)⋅$\frac{1}{(1x)^{3}}$ find the coefficient of x52 ??
answered
Dec 10, 2016
in
Mathematical Logic

128
views
+2
votes
10
Permutation and combination
The number of ways can 10 balls be selected from urn contain 10 identical red balls 5 identical green balls and 3 identical blue balls ?
answered
Dec 7, 2016
in
Combinatory

414
views
permutationandcombination
+3
votes
11
Os
Which of the following determines which programs are admitted to the system for execution and when and which ones should be exited ? Long Term Scheduler Mid term scheduler Short term Scheduler Both 2 and 3
answered
May 21, 2016
in
Operating System

111
views
+3
votes
12
Prog \ What is the output of the following program?
#include<stdio.h> int main() { int a = 5; int b = ++a * a++; printf("%d ",b); return 0; } (a) 25 (b) 30 (c) 36 (d) Undefined Behavior
answered
May 16, 2016
in
Programming

265
views
programminginc
output
interview
+4
votes
13
GATE2013 AE: GA6
Velocity of an object fired directly in upward direction is given by ܸ$V\mathit{}=8032 t\mathit{}$, where $t\mathit{}$ (time) is in seconds. When will the velocity be between $32 \;m/sec$ and $64 \;m/sec$? $\left(1, \dfrac{3}{2}\right)$ $\left(\dfrac{1}{2}, 1\right)$ $\left(\dfrac{1}{2},\dfrac{3}{2}\right)$ $\left(1, 3\right)$
answered
May 15, 2016
in
Numerical Ability

522
views
gate2013ae
numericalability
speedtimedistance
+8
votes
14
GATE2013 AE: GA7
Following table gives data on tourist from different countries visiting India in the year $2011$ ... of the total number of tourists who visited India in $2011$? USA and Japan USA and Australia England and France Japan and Australia
answered
May 15, 2016
in
Numerical Ability

401
views
gate2013ae
numericalability
datainterpretation
normal
tabulardata
+3
votes
15
AVL tree
minimum no of nodes n AVL tree of height 11 is a)230 b)231 c)232 c)233
answered
May 14, 2016
in
Programming

1.1k
views
avltree
+11
votes
16
Is CLR(1) grammar and LR(1) grammar are same?
Whether LR(1) grammar is same as that of CLR(1) grammar. If yes then please explain and if not then what is the difference between them?
answered
May 14, 2016
in
Compiler Design

4.6k
views
compilerdesign
parsing
+11
votes
17
ISRO201374
The number of elements in the power set of the set {{A, B}, C} is $7$ $8$ $3$ $4$
answered
May 13, 2016
in
Set Theory & Algebra

1.9k
views
isro2013
settheory&algebra
sets
+2
votes
18
LOGIC BASICS
let p = you have the flu q: you miss the final examination r: you pass the course express it: (p⋀q) ⋁ ( not q ⋀ r )
answered
May 9, 2016

83
views
mathematicallogic
+5
votes
19
Kenneth Rosen Edition 6th Exercise 1.1 Question 11 (Page No. 17)
Let p, q, and r be the propositions p : Grizzly bears have been seen in the area. q : Hiking is safe on the trail. r : Berries are ripe along the trail. Write these propositions using p, q, and r and logical ... . Hiking is not safe on the trail whenever grizzly bears have been seen in the area and berries are ripe along the trail.
answered
May 8, 2016
in
Mathematical Logic

246
views
kennethrosen
mathematicallogic
+3
votes
20
Kenneth Rosen Edition 6th Exercise 1.1 Question 10 (Page No. 17)
Let p, q, and r be the propositions p : You get an A on the final exam. q : You do every exercise in this book. r : You get an A in this class. Write these propositions using p, q, and r and logical connectives (including ... get an A in this class if and only if you either do every exercise in this book or you get an A on the final.
answered
May 8, 2016
in
Mathematical Logic

304
views
kennethrosen
mathematicallogic
discretemathematics
+1
vote
21
Kenneth Rosen Edition 6th Exercise 1.1 Question 9 (Page No. 17)
Let p and q be the propositions p : You drive over 65 miles per hour. q : You get a speeding ticket. Write these propositions using p and q and logical connectives (including negations). You do not drive over 65 miles per ... not drive over 65 miles per hour. Whenever you get a speeding ticket, you are driving over 65 miles per hour.
answered
May 8, 2016
in
Mathematical Logic

268
views
kennethrosen
mathematicallogic
discretemathematics
+8
votes
22
GATE2011 GG: GA4
If $m$ students require a total of $m$ pages of stationery in $m$ days, then $100$ students will require $100$ pages of stationery in $100$ days $m /100$ days $100/m$ days $m$ days
answered
May 6, 2016
in
Numerical Ability

665
views
gate2011gg
numericalability
ratioproportion
+6
votes
23
GATE2011 GG: GA9
The quality of services delivered by a company consists of six factors as shown below in the radar diagram. The dots in the figure indicate the score for each factor on a scale of $0$ to $10.$ The standardized coefficient for each factor is given in the parentheses. ... the above factors to the overall quality of services delivered by the company is $10\%$ $20\%$ $24\%$ $40\%$
answered
May 6, 2016
in
Numerical Ability

433
views
gate2011gg
difficult
numericalability
datainterpretation
+28
votes
24
GATE200777
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{8}, \dfrac{1}{16}, \dfrac{1}{32}, \dfrac{1}{32}$, respectively. What is the average length of the Huffman code for the letters $a, \,b, \,c, \,d, \,e, \,f$? $3$ $2.1875$ $2.25$ $1.9375$
answered
Apr 23, 2016
in
Algorithms

2.4k
views
gate2007
algorithms
greedyalgorithm
normal
huffmancode
+5
votes
25
GATE2014 AG: GA5
The population of a new city is $5$ million and is growing at $20\%$ annually. How many years would it take to double at this growth rate? $34$ years $45$ years $56$ years $67$ years
answered
Apr 19, 2016
in
Numerical Ability

2.5k
views
gate2014ag
numericalability
simplecompoundinterest
normal
+4
votes
26
TestBook Test Series: Compiler Design  Grammar
answered
Apr 8, 2016
in
Compiler Design

448
views
testbooktestseries
compilerdesign
grammar
+9
votes
27
CFG for lexical analysis
A context free grammar can be used to model the lexical concerns of a HLL. This is not normally done and a regular grammar is used for the structure of lexemes because (A) The cfg will blow up unnecessarily (B) The structure of lexemes can be described by the simpler regular grammar (C) There is a separation of concerns which controls complexity. (D) All of the above
answered
Apr 3, 2016
in
Compiler Design

875
views
compilerdesign
lexicalanalysis
0
votes
28
GATE 2015 Aptitude
Q.7 Given below are two statements followed by two conclusions. Assuming these statements to be true, decide which one logically follows. Statements: I. All film stars are playback singers. II. All film directors are film stars. Conclusions: I. All film directors are ... of Film directors is empty ? What if there is no film director at all ? Then how can statement II) is true ?
answered
Feb 3, 2016
in
Numerical Ability

283
views
+1
vote
29
DAG
it is very confusing in upper part,someone xplain in details
answered
Jan 14, 2016
in
Compiler Design

280
views
compilerdesign
+3
votes
30
referential Integrity
answered
Jan 2, 2016
in
Databases

281
views
databases
+4
votes
31
Subnetting
I want to have an idea about how the divisions are done.Please explain An Internet Service Provider (ISP) is granted a block of addresses starting with 145.75.0.0/16. The ISP needs to distribute these addresses to three groups of customers as follows: (a) The first group has 128 customers ... 24, 32768 (B) 145.75.159.192/26, 16384 (C) 145.75.159.192/26, 32768 (D) 145.75.191.128/25, 16384
answered
Dec 28, 2015
in
Computer Networks

661
views
+4
votes
32
Number of candidate keys
A relation $R$ with $5$ attributes $A_1,A_2,A_3,A_4,A_5$. Given the following FDs $A_1\rightarrow A_2$ $A_2A_3\rightarrow A_5$ $A_4A_5\rightarrow A_1$ the number of candidates keys that includes attribute $A_3$ is ________________.
answered
Dec 27, 2015
in
Databases

294
views
databases
databasenormalization
+24
votes
33
GATE19955
A computer installation has 1000k of main memory. The jobs arrive and finish in the following sequences. Job 1 requiring 200k arrives Job 2 requiring 350k arrives Job 3 requiring 300k arrives Job 1 finishes Job 4 requiring 120k arrives Job 5 ... 80k arrives Draw the memory allocation table using Best Fit and First Fit algorithms Which algorithm performs better for this sequence?
answered
Dec 10, 2015
in
Operating System

2.3k
views
gate1995
operatingsystem
memorymanagement
normal
+1
vote
34
huffman coding
we use huffman encoding to encode a b c with frequency fa fb fc.Which of the following code sequence is not possible? code 1={0,10,11} code 2={0,00,1} code 3={10,00,01}
answered
Dec 5, 2015
in
Algorithms

832
views
+3
votes
35
toc
$L1$ is a Context free language (CFL), $L2$ is a Deterministic Context free language (DCFL) and , $L = L1 \cap\overline{L2}$ then $L$ is a) Need not be CFL b) not CFL c)DCFL
answered
Dec 2, 2015
in
Theory of Computation

303
views
contextfreelanguages
closureproperty
+3
votes
36
Memory management
If page fault service time is 50 milli second and memory access time is 100 ns, then what will be EMAT, if the probability of page fault is $p$ ? a) $500000 + 100p$ ns b) $100 + 500000p $ ns c) $10^{7}  5 p\times 10^{2}$ seconds d) $10^{7} + 49.9p \times 10^{3}$ seconds
answered
Nov 12, 2015
in
Operating System

441
views
operatingsystem
memorymanagement
+56
votes
37
GATE2014231
Consider the procedure below for the ProducerConsumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while(true) { semWait ... s when the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlockfree operation.
answered
Nov 10, 2015
in
Operating System

4.2k
views
gate20142
operatingsystem
processsynchronization
normal
+45
votes
38
GATE200606, ISRO200914
Consider three CPUintensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $1$ $2$ $3$ $4$
answered
Nov 8, 2015
in
Operating System

4.6k
views
gate2006
operatingsystem
processschedule
normal
isro2009
Page:
1
2
3
next »
50,833
questions
57,713
answers
199,428
comments
107,715
users