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 rawan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rawan
15
answers
1
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$
comment edited
in
Operating System
Dec 10, 2020
17.9k
views
gateit-2007
operating-system
disk-scheduling
normal
8
answers
2
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
commented
in
Algorithms
Jan 29, 2020
15.7k
views
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
5
answers
3
GATE CSE 2003 | Question: 50
Consider the following deterministic finite state automaton $M$. Let $S$ denote the set of seven bit binary strings in which the first, the fourth, and the last bits are $1$. The number of strings in $S$ that are accepted by $M$ is $1$ $5$ $7$ $8$
commented
in
Theory of Computation
Jul 25, 2019
11.6k
views
gatecse-2003
theory-of-computation
finite-automata
normal
10
answers
4
GATE CSE 1998 | Question: 27
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are pre- ... relational algebra: List all the courses for which a student with Student_no 2310 has completed all the pre-requisites.
answered
in
Databases
Jul 15, 2019
5.9k
views
gate1998
databases
relational-algebra
normal
descriptive
1
answer
5
GATE CSE 1988 | Question: 2xvii
Construct a DAG for the following set of quadruples: E:=A+B F:=E-C G:=F*D H:=A+B I:=I-C J:=I+G
commented
in
Compiler Design
Jun 30, 2019
1.8k
views
gate1988
descriptive
compiler-design
intermediate-code
0
answers
6
GATE CSE 1990 | Question: 15b
Complete the following production rules which generate the language:$L= \left\{a^{n} b^{n} c^{n}\mid a, b, c \in \Sigma \right\}$ where variables $R$ and $Q$ are used to move back and forth over the current string generated $S \rightarrow aYc$ ... $Qc \rightarrow cQ$ $Q \rightarrow R'c$ $cR' \rightarrow ...$ $bR' \rightarrow ...$ $aR' \rightarrow a...$
commented
in
Theory of Computation
Jun 29, 2019
478
views
gate1990
descriptive
theory-of-computation
grammar
context-sensitive
out-of-gate-syllabus
2
answers
7
GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
commented
in
Algorithms
Jun 28, 2019
1.8k
views
gate1990
descriptive
algorithms
algorithm-design-techniques
3
answers
8
GATE IT 2007 | Question: 49
Consider the following grammars. Names representing terminals have been specified in capital letters. ... $G_1$ and $G_2$ are regular Both $G_1$ and $G_2$ are context-free but neither of them is regular
commented
in
Theory of Computation
May 22, 2019
9.9k
views
gateit-2007
theory-of-computation
context-free-language
normal
8
answers
9
GATE CSE 2006 | Question: 34
Consider the regular language $L=(111+11111)^{*}.$ The minimum number of states in any DFA accepting this languages is: $3$ $5$ $8$ $9$
comment edited
in
Theory of Computation
Jan 26, 2019
26.8k
views
gatecse-2006
theory-of-computation
finite-automata
normal
minimal-state-automata
6
answers
10
GATE CSE 2006 | Question: 39
We consider the addition of two $2's$ complement numbers $ b_{n-1}b_{n-2}\dots b_{0}$ and $a_{n-1}a_{n-2}\dots a_{0}$. A binary adder for adding unsigned binary numbers is used to add the two numbers. The sum is denoted by $ c_{n-1}c_{n-2}\dots c_{0}$ and the carry- ... $ c_{out}\oplus c_{n-1}$ $ a_{n-1}\oplus b_{n-1}\oplus c_{n-1}$
commented
in
Digital Logic
Jan 23, 2019
15.3k
views
gatecse-2006
digital-logic
number-representation
normal
4
answers
11
GATE CSE 2006 | Question: 32, ISRO2016-35
Consider the following statements about the context free grammar $G = \left \{ S \rightarrow SS, S \rightarrow ab, S \rightarrow ba, S \rightarrow \epsilon \right \} $ $G$ is ambiguous $G$ produces all strings with equal number of $a$'s ... combination below expresses all the true statements about $G$? I only I and III only II and III only I, II and III
comment edited
in
Compiler Design
Jan 23, 2019
24.8k
views
gatecse-2006
compiler-design
context-free-language
normal
isro2016
2
answers
12
Inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ ... (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar
commented
in
Theory of Computation
Jan 23, 2019
13.0k
views
theory-of-computation
inherently-ambiguous
4
answers
13
GATE CSE 2006 | Question: 4
A relation $R$ is defined on ordered pairs of integers as follows: $(x,y)R(u,v) \text{ if } x<u \text{ and } y>v$ Then $R$ is: Neither a Partial Order nor an Equivalence Relation A Partial Order but not a Total Order A total Order An Equivalence Relation
commented
in
Set Theory & Algebra
Jan 22, 2019
5.9k
views
gatecse-2006
set-theory&algebra
normal
relations
11
answers
14
GATE IT 2007 | Question: 28
Consider a hash function that distributes keys uniformly. The hash table size is $20$. After hashing of how many keys will the probability that any new key hashed collides with an existing one exceed $0.5$. $5$ $6$ $7$ $10$
comment reshown
in
DS
Jan 19, 2019
22.7k
views
gateit-2007
data-structures
hashing
probability
normal
0
answers
15
Test by Bikram | Mock GATE | Test 4 | Question: 35
Let $DM$ be a single-tape, Deterministic Turing machine with tape alphabet $\left \{ blank,0,1 \right \}$, and let $C_i$ denote the (possibly infinite) computation of $DM$ starting with a blank tape. The input to each problem below is ... $k$ distinct tape squares during the computation $C_i.$ III only I and III only II and III only I, II, and III
commented
in
Theory of Computation
Jan 17, 2019
280
views
tbb-mockgate-4
theory-of-computation
easy
decidability
turing-machine
6
answers
16
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language
commented
in
Theory of Computation
Jan 17, 2019
7.5k
views
gateit-2006
theory-of-computation
closure-property
easy
5
answers
17
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
commented
in
Mathematical Logic
Jan 16, 2019
9.9k
views
gateit-2006
mathematical-logic
normal
first-order-logic
10
answers
18
GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$
commented
in
DS
Jan 16, 2019
21.3k
views
gateit-2006
data-structures
binary-tree
normal
4
answers
19
GATE IT 2005 | Question: 55
A binary search tree contains the numbers $1, 2, 3, 4, 5, 6, 7, 8.$ When the tree is traversed in pre-order and the values in each node printed out, the sequence of values obtained is $5, 3, 1, 2, 4, 6, 8, 7.$ ... $1, 2, 3, 4, 8, 7, 6, 5$ $2, 1, 4, 3, 6, 7, 8, 5$ $2, 1, 4, 3, 7, 8, 6, 5$
commented
in
DS
Jan 15, 2019
7.0k
views
gateit-2005
data-structures
binary-search-tree
normal
7
answers
20
GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$
comment edited
in
DS
Jan 15, 2019
16.4k
views
gateit-2005
data-structures
binary-tree
normal
7
answers
21
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
comment edited
in
Probability
Jan 13, 2019
18.0k
views
gateit-2005
probability
binomial-distribution
expectation
normal
4
answers
22
GATE IT 2005 | Question: 9
A dynamic RAM has a memory cycle time of $64$ $\text{nsec}$. It has to be refreshed $100$ times per msec and each refresh takes $100$ $\text{nsec}$ . What percentage of the memory cycle time is used for refreshing? $10$ $6.4$ $1$ $0.64$
comment edited
in
Digital Logic
Jan 11, 2019
7.3k
views
gateit-2005
digital-logic
memory-interfacing
normal
4
answers
23
GATE CSE 2003 | Question: 51
Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true? $G$ is not ambiguous There ... $L(G)$ We can find a deterministic finite state automaton that accepts $L(G)$
comment edited
in
Theory of Computation
Jan 11, 2019
15.0k
views
gatecse-2003
theory-of-computation
context-free-language
normal
4
answers
24
GATE CSE 2005 | Question: 84a
We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ and a deadline $d_i$. Profit $P_i$ is earned if the task is completed before ... profit? All tasks are completed $T_1$ and $T_6$ are left out $T_1$ and $T_8$ are left out $T_4$ and $T_6$ are left out
commented
in
Algorithms
Jan 10, 2019
11.1k
views
gatecse-2005
algorithms
greedy-algorithm
process-scheduling
normal
0
answers
25
What is a good resource to learn all the rules of modular arithmetic?
For example, is there a way to calculate the value of $(7 \times 11 \times 13 \times 17) \% 5$ in terms of the values of $7\%5, 11\%5, 13\%5,$ and $17\%5 $ ?
commented
in
Mathematical Logic
Jan 10, 2019
247
views
4
answers
26
GATE CSE 2005 | Question: 82b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges ... spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
commented
in
Algorithms
Jan 10, 2019
4.9k
views
gatecse-2005
algorithms
graph-algorithms
normal
8
answers
27
GATE CSE 2005 | Question: 50
Let $G(x) = \frac{1}{(1-x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $|x| < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
commented
in
Combinatory
Jan 10, 2019
6.2k
views
gatecse-2005
normal
generating-functions
2
answers
28
GATE CSE 2005 | Question: 47
Which one of the following graphs is NOT planar? G1 G2 G3 G4
commented
in
Graph Theory
Jan 10, 2019
6.7k
views
gatecse-2005
graph-theory
graph-planarity
normal
1
answer
29
Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure: void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$
commented
in
GATE
Jan 10, 2019
599
views
tbb-mockgate-1
data-structures
priority-queue
4
answers
30
GATE CSE 2005 | Question: 42
Let $R$ and $S$ be any two equivalence relations on a non-empty set $A$. Which one of the following statements is TRUE? $R$ $∪$ $S$, $R$ $∩$ $S$ are both equivalence relations $R$ $∪$ $S$ is an equivalence relation $R$ $∩$ $S$ is an equivalence relation Neither $R$ $∪$ $S$ nor $R$ $∩$ $S$ are equivalence relations
commented
in
Set Theory & Algebra
Jan 10, 2019
7.4k
views
gatecse-2005
set-theory&algebra
normal
relations
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This was very nice blog man!!😂😂
@abhi_3_0_12 bro revise now, Gate is on upcoming...
I want to buy the test series today but I want to...
@mahendrapatel The more you give those (some...
@ChatGPT bhai muze vo test bhi dena tha...