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
User amarVashishth
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by amarVashishth
61
votes
121
GATE CSE 2008 | Question: 1
$\displaystyle \lim_{x \to \infty}\frac{x-\sin x}{x+\cos x}$ equals $1$ $-1$ $\infty$ $-\infty$
answered
in
Calculus
Nov 9, 2015
10.0k
views
gatecse-2008
calculus
limits
easy
57
votes
122
GATE CSE 2008 | Question: 4
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds to The normalized value $2^{-127}$ The normalized value $2^{-126}$ The normalized value $+0$ The special value $+0$
answered
in
Digital Logic
Nov 8, 2015
12.7k
views
gatecse-2008
digital-logic
floating-point-representation
ieee-representation
easy
43
votes
123
GATE CSE 2008 | Question: 8
Given $f_1$, $f_3$ and $f$ in canonical sum of products form (in decimal) for the circuit $f_1 = \Sigma m(4, 5, 6, 7, 8)$ $f_3 = \Sigma m(1, 6, 15)$ $f = \Sigma m(1, 6, 8, 15)$ then $f_2$ is $\Sigma m(4, 6)$ $\Sigma m(4, 8)$ $\Sigma m(6, 8)$ $\Sigma m(4, 6, 8)$
answered
in
Digital Logic
Nov 8, 2015
9.4k
views
gatecse-2008
digital-logic
canonical-normal-form
easy
35
votes
124
GATE CSE 2008 | Question: 9
Which of the following is true for the language $\left\{ a^p \mid p \text{ is a prime } \right \}?$ It is not accepted by a Turing Machine It is regular but not context-free It is context-free but not regular It is neither regular nor context-free, but accepted by a Turing machine
answered
in
Theory of Computation
Nov 8, 2015
8.1k
views
gatecse-2008
theory-of-computation
easy
identify-class-language
7
votes
125
CYK Algorithm Table Length
answered
in
Theory of Computation
Nov 8, 2015
1.6k
views
cyk-algorithm
theory-of-computation
4
votes
126
CFG
Why is S2 not a correct option?
answered
in
Theory of Computation
Nov 8, 2015
545
views
81
votes
127
GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found
answered
in
Compiler Design
Nov 8, 2015
13.4k
views
gatecse-2008
compiler-design
parsing
normal
83
votes
128
GATE IT 2005 | Question: 41
Given below is a program which when executed spawns two concurrent processes : semaphore $X : = 0 ;$ /* Process now forks into concurrent processes $P1$ & $P2$ ... (II) are true. (I) is true but (II) is false. (II) is true but (I) is false Both (I) and (II) are false
answered
in
Operating System
Nov 7, 2015
23.9k
views
gateit-2005
operating-system
process-synchronization
normal
82
votes
129
GATE CSE 2008 | Question: 27
Aishwarya studies either computer science or mathematics everyday. If she studies computer science on a day, then the probability that she studies mathematics the next day is $0.6$. If she studies mathematics on a day, then the probability that she studies computer ... what is the probability that she studies computer science on Wednesday? $0.24$ $0.36$ $0.4$ $0.6$
answered
in
Probability
Nov 7, 2015
7.6k
views
gatecse-2008
probability
normal
conditional-probability
3
votes
130
BUGS in the Virtual Calculator for GATE 2016
There are may be BUGS in the GATE Calculator if you spot any please help other to get aware of them too. Check out the Virtual Calculator here : Your browser does not support iframes.
answered
in
Others
Nov 7, 2015
1.8k
views
calculator
61
votes
131
GATE CSE 2008 | Question: 29
Let $X$ be a random variable following normal distribution with mean $+1$ and variance $4$. Let $Y$ be another normal variable with mean $-1$ and variance unknown. If $P (X \leq -1) = P (Y \geq 2)$ , the standard deviation of $Y$ is $3$ $2$ $\sqrt{2}$ $1$
answered
in
Probability
Nov 7, 2015
23.5k
views
gatecse-2008
random-variable
normal-distribution
probability
normal
10
votes
132
GATE CSE 1993 | Question: 13
Consider a singly linked list having $n$ nodes. The data items $d_1, d_2, \dots d_n$ are stored in these $n$ nodes. Let $X$ be a pointer to the $j^{\text{th}}$ node $(1 \leq j \leq n)$ in which $d_j$ is stored. A new data item $d$ stored ... insert $d$ into the list to obtain a list having items $d_1, d_2, \dots, d_{j}, d,\dots, d_n$ in order without using the header.
answered
in
DS
Nov 7, 2015
3.6k
views
gate1993
data-structures
linked-list
normal
descriptive
37
votes
133
GATE CSE 2008 | Question: 35
For inclusion to hold between two cache levels $L_1$ and $L_2$ in a multi-level cache hierarchy, which of the following are necessary? $L_1$ must be write-through cache $L_2$ must be a write-through cache The associativity of $L_2$ must be greater than that of $L_1$ The ... be at least as large as the $L_1$ cache IV only I and IV only I, II and IV only I, II, III and IV
answered
in
CO and Architecture
Nov 7, 2015
24.5k
views
gatecse-2008
co-and-architecture
cache-memory
normal
41
votes
134
GATE CSE 2008 | Question: 37, ISRO2009-38
The use of multiple register windows with overlap causes a reduction in the number of memory accesses for: Function locals and parameters Register saves and restores Instruction fetches $\text{I}$ only $\text{II}$ only $\text{III}$ only $\text{I}, \text{II}$ and $\text{III}$
answered
in
CO and Architecture
Nov 7, 2015
19.3k
views
gatecse-2008
co-and-architecture
normal
isro2009
runtime-environment
48
votes
135
GATE CSE 2008 | Question: 39
Consider the following functions: $f(n) = 2^n$ $g(n) = n!$ $h(n) = n^{\log n}$ Which of the following statements about the asymptotic behavior of $f(n)$, $g(n)$ and $h(n)$ ... $h\left(n\right)=O\left(f\left(n\right)\right); g\left(n\right) = \Omega\left(f\left(n\right)\right)$
answered
in
Algorithms
Nov 6, 2015
16.2k
views
gatecse-2008
algorithms
asymptotic-notation
normal
73
votes
136
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
answered
in
Algorithms
Nov 6, 2015
36.4k
views
gatecse-2008
normal
algorithms
time-complexity
46
votes
137
GATE CSE 2008 | Question: 43
Consider the Quicksort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements. Let $T(n)$ be the number of comparisons required to sort $n$ elements. Then $T(n) \leq 2T(n/5) + n$ $T(n) \leq T(n/5) + T(4n/5) + n$ $T(n) \leq 2T(4n/5) + n$ $T(n) \leq 2T(n/2) + n$
answered
in
Algorithms
Nov 6, 2015
16.2k
views
gatecse-2008
algorithms
sorting
easy
72
votes
138
GATE CSE 2008 | Question: 47
We have a binary heap on $n$ elements and wish to insert $n$ more elements (not necessarily one after another) into this heap. The total time required for this is $\Theta(\log n)$ $\Theta(n)$ $\Theta(n\log n)$ $\Theta(n^2)$
answered
in
Algorithms
Nov 6, 2015
21.6k
views
gatecse-2008
algorithms
time-complexity
normal
34
votes
139
GATE CSE 2008 | Question: 48
Which of the following statements is false? Every NFA can be converted to an equivalent DFA Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine Every regular language is also a context-free language Every subset of a recursively enumerable set is recursive
answered
in
Theory of Computation
Nov 6, 2015
8.6k
views
gatecse-2008
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
39
votes
140
GATE CSE 2008 | Question: 52
Match the following NFAs with the regular expressions they correspond to: P Q R S $\epsilon + 0\left(01^*1+00\right)^*01^*$ $\epsilon + 0\left(10^*1+00\right)^*0$ $\epsilon + 0\left(10^*1+10\right)^*1$ $\epsilon + 0\left(10^*1+10\right)^*10^*$ $P-2, Q-1, R-3, S-4$ $P-1, Q-3, R-2, S-4$ $P-1, Q-2, R-3, S-4$ $P-3, Q-2, R-1, S-4$
answered
in
Theory of Computation
Nov 6, 2015
12.6k
views
gatecse-2008
theory-of-computation
finite-automata
normal
59
votes
141
GATE CSE 2008 | Question: 51
Match the following: $\small{\begin{array}{|ll|ll|}\hline \text{E.} & \text{Checking that identifiers are declared before their use} & \text{P.} & \text{$L \: = \: \left\{a^nb^mc^nd^m \mid n\: \geq1, m \geq 1\right\}$} \\\hline \text{F.} & \text{Number of formal ... $\text{E-R, F-P, G-Q, H-S}$ $\text{E-P, F-R, G-S, H-Q}$
answered
in
Theory of Computation
Nov 6, 2015
14.0k
views
gatecse-2008
normal
theory-of-computation
grammar
match-the-following
32
votes
142
GATE CSE 2008 | Question: 56
In the slow start phase of the TCP congestion algorithm, the size of the congestion window: does not increase increase linearly increases quadratically increases exponentially
answered
in
Computer Networks
Nov 6, 2015
10.0k
views
gatecse-2008
computer-networks
congestion-control
normal
44
votes
143
GATE CSE 2008 | Question: 57
If a class $B$ network on the Internet has a subnet mask of $255.255.248.0$, what is the maximum number of hosts per subnet? $1022$ $1023$ $2046$ $2047$
answered
in
Computer Networks
Nov 6, 2015
13.7k
views
gatecse-2008
computer-networks
subnetting
easy
54
votes
144
GATE CSE 2008 | Question: 60
What is printed by the following C program? int f(int x, int *py, int **ppz) { int y, z; **ppz += 1; z = **ppz; // corrected z = *ppz; to z = **ppz; *py += 2; y = *py; x += 3; return x+y+z; } void main() { int c, *b, **a; c = 4; b = &c; a = &b; printf("%d", f(c, b, a)); } $18$ $19$ $21$ $22$
answered
in
Programming in C
Nov 5, 2015
17.8k
views
gatecse-2008
programming
programming-in-c
normal
parameter-passing
18
votes
145
GATE CSE 2008 | Question: 78
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n-1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n-1} + x_{n-2}$
answered
in
Algorithms
Nov 5, 2015
8.4k
views
gatecse-2008
algorithms
recurrence-relation
normal
14
votes
146
GATE CSE 2008 | Question: 82
Consider the following $\text{ER}$ diagram The minimum number of tables needed to represent $M$, $N$, $P$, $R1$, $R2$ is $2$ $3$ $4$ $5$
answered
in
Databases
Nov 5, 2015
26.4k
views
gatecse-2008
databases
er-diagram
normal
46
votes
147
GATE CSE 2008 | Question: 84
Consider the following C program that attempts to locate an element $x$ in an array $Y[ \ ]$ using binary search. The program is erroneous. f (int Y[10] , int x) { int i, j, k; i= 0; j = 9; do { k = (i+ j) / 2; if( Y[k] < x) i = k;else j = k; } while (Y[k] != x ... $Y$ is $[2 \ 4 \ 6 \ 8 \ 10 \ 12 \ 14 \ 16 \ 18 \ 20]$ and $ 2 < x < 20$ and $x$ is even
answered
in
Algorithms
Nov 5, 2015
21.2k
views
gatecse-2008
algorithms
searching
normal
3
votes
148
probability
1)Among 10000 random digits find probability P that digit 3 appears at most 950 times.(area under normal between Z=0 and Z=1.67 is 0..4525) 2)A die is tossed 180 times .using normal distribution find probability that face 4 willnturn up atleat 35 times..(area under normal curve between Z=0 and z=1 is 0.3413)
answered
in
Probability
Nov 5, 2015
4.0k
views
0
votes
149
Meta: Suggestions to improve GATE Overflow
Mention your dislikes about the site and suggest improvements if any
answered
in
Others
Nov 2, 2015
1.3k
views
meta
site-improvement
gateoverflow
59
votes
150
GATE CSE 2010 | Question: 26
Consider a company that assembles computers. The probability of a faulty assembly of any computer is $p$. The company therefore subjects each computer to a testing process. This testing process gives the correct result for any computer with a probability of $q$. What is the probability of a computer being declared faulty? $pq + (1 - p)(1 - q)$ $(1 - q)p$ $(1 - p)q$ $pq$
answered
in
Probability
Oct 25, 2015
7.5k
views
gatecse-2010
probability
easy
Page:
« prev
1
2
3
4
5
6
7
8
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:...