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 Syedarshadali
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Syedarshadali
4
answers
1
GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
commented
in
Theory of Computation
Apr 23, 2020
16.3k
views
gateit-2005
theory-of-computation
finite-automata
normal
3
answers
2
GATE CSE 2014 Set 2 | Question: 31
Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1; void producer() { while(true) { produce(); semWait(s); addToBuffer(); semSignal(s); semSignal(n); } } void consumer() { while( ... the buffer is empty. The starting value for the semaphore $n$ must be $1$ and not $0$ for deadlock-free operation.
commented
in
Operating System
Dec 1, 2019
13.7k
views
gatecse-2014-set2
operating-system
process-synchronization
normal
6
answers
3
GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion
commented
in
Operating System
Dec 1, 2019
20.7k
views
gatecse-2015-set3
operating-system
process-synchronization
normal
4
answers
4
GATE CSE 2012 | Question: 22
Which of the following transport layer protocols is used to support electronic mail? $\textsf{SMTP}$ $\textsf{IP}$ $\textsf{TCP}$ $\textsf{UDP}$
commented
in
Computer Networks
Nov 26, 2019
20.1k
views
gatecse-2012
computer-networks
tcp
easy
1
answer
5
IP Fragmentation
commented
in
Computer Networks
Nov 25, 2019
1.4k
views
computer-networks
fragmentation
21
answers
6
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
commented
in
Computer Networks
Nov 25, 2019
42.0k
views
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
2
answers
7
Find the size of Sender's window if:
During a TCP connection, the size of the window advertised by the receiver is 20 KB. The last byte sent by the sender is 20480 and the last byte acknowledged by the receiver is 8384. If the current congestion window is 18 KB, then the current size of the sender's window is _______ (in KB).
commented
in
Computer Networks
Nov 22, 2019
6.2k
views
computer-networks
tcp
6
answers
8
GATE CSE 2009 | Question: 56
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... $\text{2NF}$ but not in $\text{3NF}$ The schema is not in $\text{2NF}$
commented
in
Databases
Dec 24, 2018
27.9k
views
gatecse-2009
databases
sql
database-normalization
normal
6
answers
9
GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$
commented
in
CO and Architecture
Jul 16, 2018
28.4k
views
gatecse-2017-set2
cache-memory
co-and-architecture
normal
6
answers
10
GATE CSE 2018 | Question: 40
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is $N$. Three semaphores $empty$, $full$ and $mutex$ are defined with respective initial values of $0, N$ and $1$. Semaphore $empty$ denotes the number of available slots in the buffer, ... $P: empty, \ \ \ Q:full, \ \ \ R:full, \ \ \ S:empty$
commented
in
Operating System
Feb 14, 2018
14.4k
views
gatecse-2018
operating-system
process-synchronization
normal
2-marks
2
answers
11
GATE CSE 2004 | Question: 60
Consider a multiplexer with $X$ and $Y$ as data inputs and $Z$ the as the control input. $Z=0$ selects input $X$, and $Z=1$ selects input $Y$. What are the connections required to realize the 2-variable Boolean function $f=T+R$ ... $\text{T to X, R to Y, 0 to Z}$ $\text{R to X, 0 to Y, T to Z}$
commented
in
Digital Logic
Jan 27, 2018
6.8k
views
gatecse-2004
digital-logic
normal
multiplexer
3
answers
12
GATE IT 2008 | Question: 54
An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement from the following: Both starvation and deadlock can occur Starvation can occur but deadlock cannot occur Starvation cannot occur but deadlock can occur Neither starvation nor deadlock can occur
commented
in
Operating System
Jan 25, 2018
15.6k
views
gateit-2008
operating-system
resource-allocation
normal
4
answers
13
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
commented
in
Theory of Computation
Jan 19, 2018
18.8k
views
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
5
answers
14
GATE CSE 2003 | Question: 55
Consider the NFA $M$ shown below. Let the language accepted by $M$ be $L$. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of $M$ to a non-accepting state and by changing the non-accepting states of $M$ to accepting states. Which ... statements is true? $L_1 = \{0,1\}^*-L$ $L_1 = \{0,1\}^*$ $L_1 \subseteq L$ $L_1 = L$
commented
in
Theory of Computation
Jan 18, 2018
14.3k
views
gatecse-2003
theory-of-computation
finite-automata
normal
3
answers
15
GATE CSE 2012 | Question: 61
Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass, must be available for Day, Evening and Saturday work. ... inference from the above advertisement? Gender-discriminatory Xenophobic Not designed to make the post attractive Not gender-discriminatory
answered
in
Verbal Aptitude
Jan 14, 2018
3.4k
views
gatecse-2012
verbal-aptitude
verbal-reasoning
normal
5
answers
16
GATE CSE 2008 | Question: 69
Consider the following relational schemes for a library database: Book (Title, Author, Catalog_no, Publisher, Year, Price) Collection(Title, Author, Catalog_no) with the following functional dependencies: $\text{Title Author }\rightarrow\text{ Catalog_no}$ ... $\text{2NF}$ and Collection in $\text{3NF}$ Both Book and Collection are in $\text{2NF}$ only
commented
in
Databases
Jan 14, 2018
27.9k
views
gatecse-2008
databases
database-normalization
normal
4
answers
17
GATE CSE 2014 Set 1 | Question: 21
Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\}$ on $R$. What is the key for $R$? $\{E, F\}$ $\{E, F, H\}$ $\{E, F, H, K, L\}$ $\{E\}$
commented
in
Databases
Jan 14, 2018
8.1k
views
gatecse-2014-set1
databases
database-normalization
normal
12
answers
18
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
commented
in
Graph Theory
Jan 12, 2018
34.7k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
10
answers
19
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
commented
in
Graph Theory
Jan 11, 2018
26.7k
views
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
7
answers
20
GATE IT 2004 | Question: 55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
commented
in
Algorithms
Jan 7, 2018
13.2k
views
gateit-2004
algorithms
asymptotic-notation
normal
6
answers
21
GATE CSE 1994 | Question: 1.23
Consider the following two functions: $g_1(n) = \begin{cases} n^3 \text{ for } 0 \leq n \leq 10,000 \\ n^2 \text{ for } n > 10,000 \end{cases}$ $g_2(n) = \begin{cases} n \text{ for } 0 \leq n \leq 100 \\ n^3 \text{ for } n > 100 \end{cases}$ Which of the ... $g_1(n) \text{ is } O(n^3)$ $g_2(n) \text{ is } O(g_1(n))$ $g_2(n) \text{ is } O(n)$
commented
in
Algorithms
Jan 7, 2018
15.5k
views
gate1994
algorithms
asymptotic-notation
normal
multiple-selects
6
answers
22
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
commented
in
DS
Jan 5, 2018
13.7k
views
gate1996
data-structures
hashing
normal
7
answers
23
GATE IT 2005 | Question: 12
The numbers $1, 2, .\dots n$ are inserted in a binary search tree in some order. In the resulting tree, the right subtree of the root contains $p$ nodes. The first number to be inserted in the tree must be $p$ $p + 1$ $n - p$ $n - p + 1$
commented
in
DS
Jan 4, 2018
13.4k
views
gateit-2005
data-structures
normal
binary-search-tree
8
answers
24
GATE CSE 2006 | Question: 49
An implementation of a queue $Q$, using two stacks $S1$ and $S2$, is given below: void insert (Q, x) { push (S1, x); } void delete (Q) { if (stack-empty(S2)) then if (stack-empty(S1)) then { print( Q is empty ); return; } else while (!(stack-empty(S1))){ x=pop ... and $2m\leq y\leq 2n $ $ 2m\leq x<2n $ and $2m\leq y\leq n+m $ $ 2m\leq x<2n $ and $2m\leq y\leq 2n $
commented
in
DS
Jan 3, 2018
32.8k
views
gatecse-2006
data-structures
queue
stack
normal
1
answer
25
Self doubt
If inefficiency of scheduling algorithm is $\frac{Burst Time wasted}{Total Burst Time} X 100$ Why do we have to multiply with 100?
asked
in
Operating System
Oct 22, 2017
421
views
operating-system
scheduling
process-scheduling
process
2
answers
26
GATE CSE 2005 | Question: 63
The following diagram represents a finite state machine which takes as input a binary number from the least significant bit. Which of the following is TRUE? It computes $1$’s complement of the input number It computes $2$’s complement of the input number It increments the input number it decrements the input number
commented
in
Theory of Computation
Oct 13, 2017
8.6k
views
gatecse-2005
theory-of-computation
finite-automata
easy
7
answers
27
GATE CSE 2014 Set 3 | Question: 55
Let $\oplus$ denote the exclusive OR (XOR) operation. Let '$1$' and '$0$' denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$ ... $F$ is $P+Q$ $\overline{P+Q}$ $P \oplus Q$ $\overline {P \oplus Q}$
commented
in
Digital Logic
Sep 8, 2017
10.6k
views
gatecse-2014-set3
digital-logic
normal
boolean-algebra
1
answer
28
New Gradiance
How to approach this problem ? what does "right rotation at K" mean ? is it LR
commented
in
DS
Aug 22, 2017
848
views
data-structures
avl-tree
newgradiance
3
answers
29
GATE CSE 1994 | Question: 26
A queue $Q$ containing $n$ items and an empty stack $S$ are given. It is required to transfer all the items from the queue to the stack, so that the item at the front of queue is on the TOP of the stack, and the order of all other ... which can be performed on the queue and stack are Delete, Insert, Push and Pop. Do not assume any implementation of the queue or stack.
commented
in
DS
Jul 29, 2017
7.4k
views
gate1994
data-structures
queue
stack
normal
descriptive
0
answers
30
#Gate2003
Consider the following logic program P A(x) <- B(x, y), C(y) <- B(x,x) Which of the following first order sentences is equivalent to P? Can anyone explain how it can be solved ?
asked
in
Mathematical Logic
Jun 29, 2017
986
views
discrete-mathematics
first-order-logic
gatecse-2003
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:...