The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Answers by Dharmendra Lodhi
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
ACE TEST SERIES QUESTION
answered
Dec 29, 2018
in
Set Theory & Algebra

34
views
+1
vote
2
grade up
Assuming that a pointer take 4 bytes and the size of an integer is 2 bytes. What is the size of the *a in declaration: int (*a) [10][2] ? 4 80 20 40
answered
Dec 26, 2018
in
Programming

99
views
+1
vote
3
GATEBOOK2019LA118
If $E=\begin{bmatrix} 1 & 2 & 1 & 0 \\ 3 & 4 & 0 & 1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{bmatrix}$ then $E^{1}$ ...
answered
Dec 26, 2018
in
Linear Algebra

108
views
gb2019la1
0
votes
4
GATE20004
Let $S= \{0, 1, 2, 3, 4, 5, 6, 7\}$ and $⊗$ denote multiplication modulo $8,$ that is, $x ⊗ y= (xy) \mod 8$ Prove that $( \{ 0, 1\}, ⊗)$ is not a group. Write three distinct groups $(G, ⊗)$ where $G ⊂ S$ and $G$ has $2$ elements.
answered
Nov 4, 2018
in
Set Theory & Algebra

742
views
gate2000
settheory&algebra
descriptive
groups
0
votes
5
self doubt
The uPC is not incremented in the following cases : (i)When an end microinstruction is encountered. (ii)When a new instruction is loaded into IR(instruction register) (iii)When a branch microinstruction is encountered and branch condition is satisfied. Someone, please explain the last point. I didn't get why it will not be incremented. These statements are from the standard book
answered
Nov 4, 2018
in
CO & Architecture

15
views
+2
votes
6
GATE199214b
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent? group ring field lattice
answered
Nov 4, 2018
in
Set Theory & Algebra

808
views
gate1992
settheory&algebra
groups
normal
0
votes
7
TIFR2017B11
Given that $B(x)$ means "$x$ is a bat", $F(x)$ means "$x$ is a fly", and $E(x, y)$ means "x eats $y$", what is the best English translation of $ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$ all flies eat bats every fly is eaten by some bat bats eat only flies every bat eats flies only bats eat flies
answered
Nov 1, 2018
in
Mathematical Logic

722
views
tifr2017
firstorderlogic
+1
vote
8
Permutations, TIFR2011B30
What does it mean when they say "An array A[1...n] consists of a permutation of numbers 1....n.".? Also I'd be grateful if you give some example.
answered
Nov 1, 2018
in
Numerical Ability

49
views
datastructure
permutationsandcombinations
arrays
usertifr2011
usermod
generalaptitude
+2
votes
9
CMI2013B02
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on 10 vertices. Let $u, \: v, \: w$ be three distinct vertices in $G$. How many simple paths are there from $u$ to $v$ going through $w$?
answered
Oct 27, 2018
in
Graph Theory

448
views
cmi2013
descriptive
graphtheory
counting
0
votes
10
TANCET 2016 DEADLOCK
answered
Oct 25, 2018
in
Operating System

28
views
tancet
0
votes
11
TANCET 2016 Interrupt
answered
Oct 23, 2018
in
CO & Architecture

14
views
tancet
+6
votes
12
GATE2005IT62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_h$ from process $P_j$ ... ensures that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
answered
Oct 18, 2018
in
Operating System

1.8k
views
gate2005it
operatingsystem
resourceallocation
normal
+1
vote
13
GATE198911a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release resources are as follows: Process P: 1. P requests A ... . What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
answered
Oct 18, 2018
in
Operating System

512
views
descriptive
gate1989
operatingsystem
resourceallocation
+1
vote
14
Fragmentation
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host). The first network has ... the IP layer at the destination for TCP message, in the best case is _________ bytes. (Assume all IP headers are 20 bytes)
answered
Oct 16, 2018
in
Computer Networks

97
views
fragmentation
computernetworks
+4
votes
15
Jam Signal
Consider two nodes A and B on the same ethernet segment, and suppose the propagation delay between two nodes is 225 bit times. Suppose at time both nodes A and B begin to transmit a frame. Assume both nodes transmit a 50 bit jam signal after detection a collision. For 107 bits per set ethernet , find the time at which both nodes A and B sense an idle channel(in microsec) ?
answered
Oct 15, 2018
in
Computer Networks

545
views
computernetworks
+1
vote
16
GATE2004IT67
In a particular Unix OS, each data block is of size $1024$ bytes, each node has $10$ direct data block addresses and three additional addresses: one for single indirect block, one for double indirect block and one for triple indirect block. Also, each block can contain ... following is approximately the maximum size of a file in the file system? $512$ MB $2$ GB $8$ GB $16$ GB
answered
Oct 7, 2018
in
Operating System

1.8k
views
gate2004it
operatingsystem
filesystem
normal
+1
vote
17
zeal test digital logic
how to approach this question? i didn't understand the question
answered
Oct 7, 2018
in
Digital Logic

37
views
test
series
+1
vote
18
Self dual functions
Number of selfdual binary functions with 4 variables are: $A) 16$ $B) 64$ $C) 256$ $D) 512$
answered
Oct 6, 2018
in
Digital Logic

40
views
digitallogic
dualfunction
+1
vote
19
GATE20011.22
Which of the following requires a device driver? Register Cache Main memory Disk
answered
Oct 4, 2018
in
Operating System

2.7k
views
gate2001
operatingsystem
disks
easy
+1
vote
20
Implication
Which of the following Implications are Tautologies? 1) If I drink milk, I'm healthy or If I'm healthy, I do maths. 2)If it is not the case that riches is sufficient for Mr. X to be happy then Mr. X is rich and not happy. A) Both (1) and (2) B) only (1) C) only (2) D) Neither
answered
Oct 3, 2018
in
Mathematical Logic

37
views
discretemathematics
propositionallogic
0
votes
21
ROM system
How many address and data lines in 1M×16 ROM system
answered
Oct 2, 2018
in
CO & Architecture

27
views
rom
0
votes
22
ROM system
Is it true In SRAM information in memory gets lost as soon as power is switched off
answered
Oct 2, 2018
in
Digital Logic

21
views
rom
+2
votes
23
#OS User Gate Disk Question
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. Find the disk storage capacity and the data transfer rate. =============== How we can find disk capacity without having sectors and also how to find data transfer rate?
answered
Oct 2, 2018
in
Operating System

76
views
usermod
os
operatingsystem
disks
+2
votes
24
Gateforum
answered
Oct 2, 2018
in
DS

37
views
0
votes
25
Progression and series
1*2+2*3x+3*4x^2+........up to infinity .find Its sum if x<1.
answered
Oct 2, 2018
in
Mathematical Logic

16
views
+1
vote
26
Made easy
It says "false as truth value". Means contradiction ???
answered
Sep 30, 2018
in
Mathematical Logic

26
views
0
votes
27
TIFR2016B1
A Boolean formula is said to be a $tautology$ if it evaluates to TRUE for all assignments to its variables. Which one of the following is NOT a tautology? $(( p \vee q) \wedge (r \vee s)) \Rightarrow (( p \wedge r) \vee q \vee s)$ ... $(( p \vee q ) \wedge ( r \vee s)) \Rightarrow ( p \vee q)$
answered
Sep 25, 2018
in
Digital Logic

180
views
tifr2016
booleanexpressions
0
votes
28
gate 2017
Given f(w, x, y, z) = Σm(0,1,2,3,7,8,10) + Σd(5,6,11,15), where d represents the don’tcare condition in Karnaugh maps. Which of the following is a minimum productofsums(POS) form of f(w,x,y,z)? a: f = (w' + z' )( x' + z ) B: f = (w' + z ) ( x + z ) C: f = ( w + z ) ( x ' + z ) D: f = ( w + z' ) ( x' + z )
answered
Sep 21, 2018
in
Digital Logic

26
views
0
votes
29
general query
Can anyone suggest me best resource for IO organization, DMA and hard disk structure in CO. I am getting difficulty in these topics.
answered
Sep 19, 2018
in
CO & Architecture

15
views
+1
vote
30
3 address code
answered
Sep 19, 2018
in
Compiler Design

73
views
compilerdesign
0
votes
31
Self Doubt
#include<stdio.h> int main() { int *p; p = (int *)malloc(20); printf("%d\n", sizeof(p)); free(p); return 0; } malloc(20) reserves 20 bytes, why output is 8?
answered
Sep 17, 2018
in
Programming

46
views
programminginc
–1
vote
32
GATE2017154
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16way setassociative cache, the length of the TAG field is ____________ bits.
answered
Sep 15, 2018
in
CO & Architecture

7.1k
views
gate20171
coandarchitecture
cachememory
normal
numericalanswers
0
votes
33
ISI2016MMA15
The number of positive integers $n$ for which $n^2 +96$ is a perfect square 0 1 2 4
answered
Sep 13, 2018
in
Others

13
views
isi2016mma
0
votes
34
ISI2016MMA14
The number of terms independent of $x$ in the binomial expansion of $(3x^2 + \frac{1}{x})^{10}$ is 0 1 2 5
answered
Sep 13, 2018
in
Others

9
views
isi2016mma
0
votes
35
ISI2016MMA13
Which one of the following statements is correct regarding the elements and subsets of the set $\{1, 2, \{1, 2, 3\}\}$? $\{1, 2\} \in \{1, 2, \{1, 2, 3\} \}$ $\{1, 2\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $\{1, 2, 3\} \subseteq \{1, 2, \{1, 2, 3\} \}$ $3 \in \{1, 2, \{1, 2, 3\} \}$
answered
Sep 13, 2018
in
Others

5
views
isi2016mma
0
votes
36
Instruction Format
Consider a computer has 64 registers and support 15 different instructions. Each instruction has 4 fields i.e. opcode, source register, destination register and immediate value of 6 bits. If each instruction in byte aligned and 50 instructions are ... answer My question is, in this question what is difference between computer has 15 instruction and memory has 50 instructions?
answered
Sep 12, 2018
in
CO & Architecture

242
views
machineinstructions
instructionformat
coandarchitecture
0
votes
37
Instruction Execution
Consider the 2 GHz clock frequency processor used execute the following program segment. Assume the 3 clock cycles required for Register to/from memory transfer, 1 clock cycle for ADD with both operands in register, 2 clock cycle MUL with both operands in ... for instruction fetch and decode. What is the total time required to complete the program execution (in ns)? Ans. 18
answered
Sep 12, 2018
in
CO & Architecture

114
views
coandarchitecture
machineinstructions
+2
votes
38
Computer Organization
A computer has 256 K word memory. The instruction format has 4 fields i.e., Opcode, register field to represent one of the 60 processor registers, mode field represent one of 7 addressing modes and memory address field. How many instructions the system supports when a 32 bit instruction is placed in the one memory cell.
answered
Sep 12, 2018
in
CO & Architecture

233
views
computerarchitecture
machineinstructions
instructionformat
+1
vote
39
Analysis of the algorithms
T(n) = 3T( n/3 ) + n/2 The answer to the above question says that case 2 of masters theorem is applied here. How is it so?
answered
Sep 11, 2018
in
Algorithms

36
views
Page:
1
2
next »
47,199
questions
51,434
answers
178,321
comments
66,728
users