Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions
17
votes
12
answers
41
TIFR CSE 2018 | Part B | Question: 1
What is the remainder when $4444^{4444}$ is divided by $9?$ $1$ $2$ $5$ $7$ $8$
Arjun
asked
in
Quantitative Aptitude
Dec 10, 2017
by
Arjun
3.3k
views
tifr2018
quantitative-aptitude
modular-arithmetic
54
votes
12
answers
42
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
khushtak
asked
in
Algorithms
Feb 14, 2017
by
khushtak
17.7k
views
gatecse-2017-set1
algorithms
asymptotic-notation
normal
77
votes
12
answers
43
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
28.2k
views
gatecse-2017-set2
theory-of-computation
finite-automata
39
votes
12
answers
44
GATE CSE 2017 Set 1 | Question: 44
In a RSA cryptosystem, a participant $A$ uses two prime numbers $p = 13$ and $q = 17$ to generate her public and private keys. If the public key of $A$ is $35$, then the private key of $A$ is __________ .
Arjun
asked
in
Computer Networks
Feb 14, 2017
by
Arjun
23.8k
views
gatecse-2017-set1
network-security
computer-networks
rsa-security-networks
out-of-gate-syllabus
numerical-answers
normal
55
votes
12
answers
45
GATE CSE 2005 | Question: 80
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in ... $2$ $3$ $4$ $5$
go_editor
asked
in
CO and Architecture
Apr 24, 2016
by
go_editor
24.1k
views
co-and-architecture
normal
gatecse-2005
data-path
machine-instruction
143
votes
12
answers
46
GATE CSE 2016 Set 1 | Question: 41
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. $Head(Q)$ returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly $Top(S)$ returns the element at the top of $S$ without removing ... = Pop(S); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
Sandeep Singh
asked
in
DS
Feb 12, 2016
by
Sandeep Singh
34.7k
views
gatecse-2016-set1
data-structures
queue
difficult
numerical-answers
69
votes
12
answers
47
GATE CSE 2016 Set 1 | Question: 19
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 __________.
Sandeep Singh
asked
in
Compiler Design
Feb 12, 2016
by
Sandeep Singh
27.5k
views
gatecse-2016-set1
compiler-design
static-single-assignment
normal
numerical-answers
99
votes
12
answers
48
GATE CSE 2016 Set 2 | Question: 30
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
Akash Kanase
asked
in
CO and Architecture
Feb 12, 2016
by
Akash Kanase
22.7k
views
gatecse-2016-set2
co-and-architecture
data-path
normal
numerical-answers
42
votes
12
answers
49
GATE CSE 2015 Set 3 | Question: 25
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.
go_editor
asked
in
DS
Feb 14, 2015
by
go_editor
23.9k
views
gatecse-2015-set3
data-structures
binary-tree
normal
numerical-answers
92
votes
12
answers
50
GATE CSE 2015 Set 3 | Question: 24
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail
go_editor
asked
in
Mathematical Logic
Feb 14, 2015
by
go_editor
17.7k
views
gatecse-2015-set3
mathematical-logic
difficult
logical-reasoning
65
votes
12
answers
51
GATE CSE 2015 Set 1 | Question: 52
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
makhdoom ghaya
asked
in
Theory of Computation
Feb 13, 2015
by
makhdoom ghaya
17.1k
views
gatecse-2015-set1
theory-of-computation
finite-automata
easy
numerical-answers
minimal-state-automata
99
votes
12
answers
52
GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.
go_editor
asked
in
Digital Logic
Feb 13, 2015
by
go_editor
57.7k
views
gatecse-2015-set2
digital-logic
adder
normal
numerical-answers
56
votes
12
answers
53
GATE CSE 2015 Set 2 | Question: 37
The number of min-terms after minimizing the following Boolean expression is _______. $[D'+AB'+A'C+AC'D+A'C'D]'$
go_editor
asked
in
Digital Logic
Feb 12, 2015
by
go_editor
18.7k
views
gatecse-2015-set2
digital-logic
boolean-algebra
normal
numerical-answers
62
votes
12
answers
54
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
go_editor
asked
in
Algorithms
Feb 12, 2015
by
go_editor
21.0k
views
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
35
votes
12
answers
55
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
30.1k
views
gatecse-2015-set2
data-structures
binary-tree
normal
numerical-answers
76
votes
12
answers
56
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
Kathleen
asked
in
Graph Theory
Oct 4, 2014
by
Kathleen
34.7k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
57
votes
12
answers
57
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
go_editor
asked
in
DS
Sep 29, 2014
by
go_editor
16.2k
views
gatecse-2010
data-structures
binary-tree
normal
51
votes
12
answers
58
GATE CSE 2014 Set 1 | Question: 53
Which one of the following propositional logic formulas is TRUE when exactly two of $p,q$ and $r$ are TRUE? $(( p \leftrightarrow q) \wedge r) \vee (p \wedge q \wedge \sim r)$ $( \sim (p \leftrightarrow q) \wedge r)\vee (p \wedge q \wedge \sim r)$ ... $(\sim (p \leftrightarrow q) \wedge r) \wedge (p \wedge q \wedge \sim r) $
go_editor
asked
in
Mathematical Logic
Sep 28, 2014
by
go_editor
13.5k
views
gatecse-2014-set1
mathematical-logic
normal
propositional-logic
80
votes
12
answers
59
GATE CSE 2014 Set 1 | Question: 42
Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do for j = i to n do for k = j + 1 to n do D = D * 3 Half of the product of the $3$ consecutive integers. One-third of the product of the $3$ consecutive integers. One-sixth of the product of the $3$ consecutive integers. None of the above.
go_editor
asked
in
Algorithms
Sep 28, 2014
by
go_editor
34.2k
views
gatecse-2014-set1
algorithms
time-complexity
normal
90
votes
12
answers
60
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Rucha Shelke
asked
in
Algorithms
Sep 26, 2014
by
Rucha Shelke
21.0k
views
gatecse-2006
algorithms
graph-algorithms
normal
Page:
« prev
1
2
3
4
5
6
7
8
...
2806
...
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow