GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Answers by akash.dinkar12
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akash.dinkar12
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
algorithm
worst case time complexity of job sequencing with deadline using greedy algorithm
answered
1 day
ago
in
Algorithms

15
views
0
votes
2
GATE1996_1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(AB) \cup (BA) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$
answered
2 days
ago
in
Set Theory & Algebra

259
views
gate1996
settheory&algebra
easy
sets
0
votes
3
GATE20082
If $P, Q, R$ are subsets of the universal set U, then $$(P\cap Q\cap R) \cup (P^c \cap Q \cap R) \cup Q^c \cup R^c$$ is $Q^c \cup R^c$ $P \cup Q^c \cup R^c$ $P^c \cup Q^c \cup R^c$ U
answered
2 days
ago
in
Set Theory & Algebra

440
views
gate2008
normal
settheory&algebra
sets
0
votes
4
GATE2006IT23
Let P, Q and R be sets let Δ denote the symmetric difference operator defined as PΔQ = (P U Q)  (P ∩ Q). Using Venn diagrams, determine which of the following is/are TRUE? PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R) P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R) I only II only Neither I nor II Both I and II
answered
2 days
ago
in
Set Theory & Algebra

445
views
gate2006it
settheory&algebra
normal
sets
0
votes
5
GATE200622
Let $E, F$ and $G$ be finite sets. Let $X = (E ∩ F)  (F ∩ G)$ and $Y = (E  (E ∩ G))  (E  F)$. Which one of the following is true? $X ⊂ Y$ $X ⊃ Y$ $X = Y$ $X  Y ≠ \phi$ and $Y  X ≠ \phi$
answered
2 days
ago
in
Set Theory & Algebra

228
views
gate2006
settheory&algebra
normal
sets
+4
votes
6
Macros
# include <stdio.h> # define scanf "%s GeeksQuiz" int main() { printf(scanf, scanf); return 0; } (A) Compiler Error (B) %s Geeks Quiz (C) Geeks Quiz (D) %s Geeks Quiz Geeks Quiz
answered
6 days
ago
in
Programming

60
views
0
votes
7
computer org
A 32 bit machine processor has 32 registers, each of it is 16 bit long.Each instruction is specified with 4 fields, namely operation part, immediate operand in addition to 2 register operands. Assume that immediate operand ... in immediate operand field is +4095 Max number of instructions that can be permitted by this processor is _______________________
answered
Jul 5
in
CO & Architecture

29
views
0
votes
8
Shortest Path Algorithms
For a given undirected weighted graph G with V number of vertices, if you want to find all pair shortest paths then which one of the following is true ? a) run dijkstra's shortest path algorithm only once. b) run dijkstra's shortest path algorithm V times. What if the given graph is directed ?
answered
Jul 4
in
Algorithms

61
views
algorithms
graphalgorithms
shortestpath
0
votes
9
Minimal DFA
answered
Jul 1
in
Theory of Computation

18
views
0
votes
10
GATE 2016132
The stage delays in a $4$stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
answered
Jun 29
in
CO & Architecture

2.9k
views
gate20161
co&architecture
pipelining
normal
numericalanswers
+1
vote
11
Bitwise operation
#include <stdio.h> int main() { unsigned int m = 0; m = 0xA38; printf("%x\n",m(m1)); printf("%x\n",( (m(m1)) + 1 ) & m ); } Find the output ?
answered
Jun 28
in
Programming

40
views
programminginc
bitwise
+1
vote
12
CONFLICT SERIALIZABLE
What is the answer?
answered
Jun 21
in
Databases

37
views
0
votes
13
Programmin
main() { char check ='a'; switch(check) { case 'a'1:printf("gats"); case 'b'  2: printf("quiz"); break; default :printf("Gatesquiz"); } } a)gates b)gatesquiz c)gatesquizgatesquiz d)compiler error
answered
Jun 14
in
Programming

42
views
0
votes
14
SQL Query
Select operation in SQL is a a) Data query language b) Data definition language c) Data manipulation language d) Data control language Confused between option a) and option c) .
answered
Jun 11
in
Databases

28
views
+3
votes
15
ternary operator
How to solve ij&&ji ?????????
answered
Jun 6
in
Programming

25
views
+1
vote
16
c input output problem
int A(int m,int n) { if(!m) return n+1; if(!n) return A(m1,1); return A(m1,A(m,n1)); } int main() { printf("A(1,2)=%d",A(1,2)); } what will be the output and how?
answered
Jun 5
in
Programming

34
views
+2
votes
17
GATE 2017 EC Set1
Trucks(10 m long) and cars (5m long) go on a single lane bridge. There must be a gap of at least 20m after each truck and a gap of at least 15m after each car. Trucks and cars travel at a speed of 36 km/h. If cars and trucks go alternately. What is the maximum number of vehicles that can use the bridge in one hour? (a)1440 (b) 1200 (c)720 (d)600
answered
Jun 5
in
Numerical Ability

120
views
gate2017
speedtimedistance
numericalability
+1
vote
18
normal form
answered
Jun 5
in
Databases

42
views
+1
vote
19
Algorithm
answered
Jun 3
in
Algorithms

41
views
algorithms
stack
0
votes
20
K map minimization and Dont cares
answered
May 31
in
Digital Logic

69
views
digitallogic
kmap
0
votes
21
GATE200734
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed? $2^n$ line to 1 line $2^{n+1}$ line to 1 line $2^{n1}$ line to 1 line $2^{n2}$ line to 1 line
answered
May 31
in
Digital Logic

1.7k
views
gate2007
digitallogic
normal
0
votes
22
minimum number of NAND and NOR gates
answered
May 31
in
Digital Logic

577
views
digitallogic
+1
vote
23
THE NUMBER OF COLUMNS IN A STATE TABLE FOR A SEQUENTIAL CIRCUIT WITH M FLIP FLOPS AND N INPUT IS
answered
May 28
in
Digital Logic

114
views
+3
votes
24
OUTPUT OF PROGRAM
answered
May 28
in
Programming

66
views
+1
vote
25
Gate Sample Practise Questions
#include<stdio.h> int f(int *a, int n) { if(n ≤ 0) return 0; else if(*a % 2 = = 0) return *a + f(a+1, n1); else return *a  f(a+1, n1); } int main() { int a[] = {12, 7, 13, 4, 11, 6}; printf("%d", f(a, 6)); return 0; } (a) 9 (b) 5 (c) 15 (d) 19 Need explanation stepwise for solution
answered
May 26
in
Algorithms

60
views
geekstogeeks
algorithms
+1
vote
26
Sample question for practise doubt
answered
May 25
in
Algorithms

30
views
asymptoticnotations
0
votes
27
GATE1992_02,ii
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (ii) All digital circuits can be realized using only ExOR gates Multiplexers Half adders OR gates
answered
May 22
in
Digital Logic

427
views
gate1992
normal
digitallogic
+2
votes
28
$a_n = 4^n + 6^n$
If $a_n = 4^n + 6^n$ Find the value of $a_{40} \text { mod } 25$
answered
May 20
in
Set Theory & Algebra

56
views
binomialdistribution
0
votes
29
GATE19905c
For the synchronous counter shown in Fig.3, write the truth table of $Q_{0}, Q_{1}$,and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the counting sequence and also the modulus of the counter.
answered
May 19
in
Digital Logic

93
views
gate1990
descriptive
digitallogic
flipflop
+1
vote
30
GATE19894ix
Provide short answers to the following questions: Explain the behaviour of the following logic circuit (Fig.4) with level input A and output B
answered
May 19
in
Digital Logic

248
views
gate1989
descriptive
digitallogic
circuitoutput
0
votes
31
GATE19883ab
The Karnaugh map of a function of (A, B, C) is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable C is entered in the map itself. Discuss, ... map has been derived and the rules (or steps) by which the woolean function can be derived from the entries in the reduced map.
answered
May 19
in
Digital Logic

49
views
gate1988
descriptive
digitallogic
kmap
0
votes
32
GATE19871III
The above circuit produces the output sequence: 1111 1111 0000 0000 1111 0000 1111 000 1111 0001 0011 010 1010 1010 1010 1010
answered
May 18
in
Digital Logic

136
views
gate1987
digitallogic
flipflop
+2
votes
33
database
If table is has only two coloumns,in which normal form would it be?
answered
May 16
in
Databases

95
views
+1
vote
34
Do while
What is the out put of the following code, i think it should be infinite loop, Correct me if iam wrong. When i execute it, only it is printing "Hello" only one Time. #include<stdio.h> int main() { int i = 1; do { printf("Hello\n"); continue; i; }while(i>=1); return 0; }
answered
May 15
in
Programming

69
views
general
programminginc
+3
votes
35
computer architecture
A cache has a capacity of 16 kbits and a line length of 128 bytes.how many set does cache have if it is 8 way set associative? A)16 B)32 C)64 D)none of the above
answered
May 15
in
CO & Architecture

29
views
+3
votes
36
dr. arun sharma
Three times the first of three consecutive odd numbers is 3 more than twice the third.what is the third integer ? A.15 B. 9 C. 11 D.5
answered
May 13
in
Numerical Ability

104
views
numericalability
+1
vote
37
cache memory
Suppose after analyzing a new cache design, you discover that the cache has far too many conflict misses and this needs to be resolved. You know that you must increase associativity in order to decrease the number of cache misses. What are the ... associativity? (a) Slower cache access time (b) Increase index bits (c) Increase block size (d) All of these
answered
May 12
in
CO & Architecture

37
views
co&architecture
+1
vote
38
The gatebook
Total order relation is Lattice or not please explain?
answered
May 12
in
Set Theory & Algebra

61
views
settheory&algebra
Page:
1
2
3
4
5
6
7
next »
24,089
questions
31,062
answers
70,677
comments
29,400
users