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 Musa
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Musa
4
votes
1
GATE CSE 1987 | Question: 2n
State whether the following statements are TRUE or FALSE: A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2\rangle$ and $\langle 2, 2 \rangle$ can both be in $r$ simultaneously.
answered
in
Databases
Dec 9, 2020
3.5k
views
gate1987
databases
database-normalization
true-false
5
votes
2
GATE CSE 2004 | Question: 54
$A$ and $B$ are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both $A$ and $B$ attempt to transmit a frame, collide, and $A$ wins the first backoff race. At the end of this successful transmission by $A$, both $A$ ... attempt to transmit and collide. The probability that $A$ wins the second backoff race is: $0.5$ $0.625$ $0.75$ $1.0$
answered
in
Computer Networks
Nov 28, 2020
16.7k
views
gatecse-2004
computer-networks
ethernet
probability
normal
4
votes
3
GATE IT 2004 | Question: 81
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ensure correct operation of the $ARQ$ scheme is $\min (M, N)$ $\max (M, N)$ $M + N$ $MN$
answered
in
Computer Networks
Nov 24, 2020
10.4k
views
gateit-2004
computer-networks
sliding-window
normal
0
votes
4
GATE CSE 2003 | Question: 19, ISRO2009-24
Suppose the numbers $7, 5, 1, 8, 3, 6, 0, 9, 4, 2$ ... $9 \ 8 \ 6 \ 4 \ 2 \ 3 \ 0 \ 1 \ 5 \ 7$
answered
in
DS
Nov 19, 2020
23.4k
views
gatecse-2003
binary-search-tree
easy
isro2009
0
votes
5
GATE IT 2007 | Question: 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: $isEmpty (Q)$ - returns true if the queue is empty, false otherwise. $delete (Q)$ - deletes the element at the front of the queue ... the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$
answered
in
DS
Nov 17, 2020
16.2k
views
gateit-2007
data-structures
queue
normal
0
votes
6
GATE CSE 1998 | Question: 2.14
Let $A$ be a two dimensional array declared as follows: A: array [1 …. 10] [1 ….. 15] of integer; Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location $100$, what is the address of the element $A[i][j]$? $15i+j+84$ $15j+i+84$ $10i+j+89$ $10j+i+89$
answered
in
DS
Nov 16, 2020
29.6k
views
gate1998
data-structures
array
easy
8
votes
7
GATE CSE 2006 | Question: 57
Consider this C code to swap two integers and these five statements: the code void swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; } S1: will generate a compilation error S2: may generate a ... procedure correctly for some but not all valid input pointers S5: may add or subtract integers and pointers S1 S2 and S3 S2 and S4 S2 and S5
answered
in
Programming in C
Nov 14, 2020
20.8k
views
gatecse-2006
programming
programming-in-c
normal
pointers
1
vote
8
GATE IT 2004 | Question: 65
The semaphore variables full, empty and mutex are initialized to $0$, $n$ and $1$, respectively. Process P1 repeatedly adds one item at a time to a buffer of size $n$, and process P2 repeatedly removes one item at a time from the same buffer using the programs given below. In ... P(empty), V(full) P(empty), V(full), P(empty), V(full) P(empty), V(full), P(full), V(empty)
answered
in
Operating System
Nov 12, 2020
7.0k
views
gateit-2004
operating-system
process-synchronization
normal
0
votes
9
GATE CSE 1999 | Question: 20-b
Consider the following solution to the producer-consumer problem using a buffer of size 1. Assume that the initial value of count is 0. Also assume that the testing of count and assignment to count are atomic operations. Producer: Repeat Produce an ... item; Forever; Show that in this solution it is possible that both the processes are sleeping at the same time.
answered
in
Operating System
Nov 6, 2020
3.4k
views
gate1999
operating-system
process-synchronization
normal
descriptive
12
votes
10
GATE IT 2004 | Question: 14
Which one of the following is NOT shared by the threads of the same process ? Stack Address Space File Descriptor Table Message Queue
answered
in
Operating System
Nov 2, 2020
13.8k
views
gateit-2004
operating-system
easy
threads
1
vote
11
GATE CSE 1995 | Question: 2.6
The sequence __________ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for ________ unit(s) of time. ... $\{2, 1, 3\}, 0$ $\{3, 2, 1\}, 0$ $\{1, 2, 3\}, 5$
answered
in
Operating System
Nov 1, 2020
16.2k
views
gate1995
operating-system
process-scheduling
normal
1
vote
12
GATE CSE 2002 | Question: 2.21
Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? More than one program may be loaded into main memory at the same time for execution If a program waits for certain events such as I/O, another program is immediately scheduled ... is immediately scheduled for execution. (a) (a) and (b) (a) and (c) (a), (b) and (c)
answered
in
Operating System
Nov 1, 2020
12.6k
views
gatecse-2002
operating-system
normal
process
7
votes
13
GATE CSE 2005 | Question: 14
The grammar $A \rightarrow AA \mid (A) \mid \epsilon$ is not suitable for predictive-parsing because the grammar is: ambiguous left-recursive right-recursive an operator-grammar
answered
in
Compiler Design
Oct 29, 2020
23.3k
views
gatecse-2005
compiler-design
parsing
grammar
easy
0
votes
14
GATE CSE 2005 | Question: 55
Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language
answered
in
Theory of Computation
Oct 17, 2020
8.6k
views
gatecse-2005
theory-of-computation
identify-class-language
normal
1
vote
15
ISRO2014-33
The following Finite Automaton recognizes which of the given languages? $\{ 1, 0 \}^* \{ 0 1 \}$ $\{ 1,0\}^*\{ 1\}$ $\{ 1 \} \{1, 0\}^*\{ 1 \}$ $1^*0^*\{0,1\}$
answered
in
GATE
Oct 16, 2020
5.4k
views
finite-automata
isro2014
0
votes
16
GATE CSE 2015 Set 1 | Question: 33
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r - y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ ... $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r - y \wedge y > 0\}$
answered
in
Programming in C
Oct 13, 2020
15.5k
views
gatecse-2015-set1
programming
loop-invariants
normal
0
votes
17
GATE CSE 2016 Set 2 | Question: 42
Consider the following two statements: If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false
answered
in
Theory of Computation
Oct 13, 2020
25.0k
views
gatecse-2016-set2
theory-of-computation
finite-automata
normal
5
votes
18
GATE CSE 2007 | Question: 7
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a non-regular set is regular The union of two non-regular sets is not regular Infinite union of finite sets is regular
answered
in
Theory of Computation
Oct 12, 2020
15.3k
views
gatecse-2007
theory-of-computation
easy
regular-language
1
vote
19
GATE CSE 2001 | Question: 2.14
Consider an undirected, unweighted graph $G$. Let a breadth-first traversal of $G$ be done starting from a node $r$. Let $d(r,u)$ and $d(r,v)$ be the lengths of the shortest paths from $r$ to $u$ and $v$ respectively in $G$. If $u$ is visited before $v$ during the breadth- ... correct? $d(r,u) < d(r,v)$ $d(r,u) > d(r,v)$ $d(r,u) \leq d(r,v)$ None of the above
answered
in
Algorithms
Oct 4, 2020
14.0k
views
gatecse-2001
algorithms
graph-algorithms
normal
graph-search
0
votes
20
GATE CSE 2003 | Question: 62
In a permutation $a_1\ldots a_n$, of $n$ distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j.$ What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of $1. . . n$ with at most $n$ inversions? $\Theta(n^2)$ $\Theta(n\log n)$ $\Theta(n^{1.5})$ $\Theta(n)$
answered
in
Algorithms
Sep 24, 2020
19.6k
views
gatecse-2003
algorithms
sorting
normal
insertion-sort
0
votes
21
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
Sep 20, 2020
21.2k
views
gatecse-2008
algorithms
searching
normal
3
votes
22
GATE CSE 2020 | Question: 2
For parameters $a$ and $b$, both of which are $\omega(1)$, $T(n) = T(n^{1/a})+1$, and $T(b)=1$. Then $T(n)$ is $\Theta (\log_a \log _b n)$ $\Theta (\log_{ab} n$) $\Theta (\log_{b} \log_{a} \: n$) $\Theta (\log_{2} \log_{2} n$)
answered
in
Algorithms
Sep 19, 2020
19.4k
views
gatecse-2020
algorithms
recurrence-relation
1-mark
1
vote
23
GATE CSE 2012 | Question: 18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
answered
in
Algorithms
Sep 10, 2020
14.3k
views
gatecse-2012
algorithms
easy
asymptotic-notation
2
votes
24
GATE CSE 2020 | Question: 39
Which one of the following predicate formulae is NOT logically valid? Note that $W$ is a predicate formula without any free occurrence of $x$. $\forall x (p(x) \vee W) \equiv \forall x \: ( px) \vee W$ ... $\exists x(p(x) \rightarrow W) \equiv \forall x \: p(x) \rightarrow W$
answered
in
Mathematical Logic
Sep 7, 2020
17.0k
views
gatecse-2020
first-order-logic
mathematical-logic
2-marks
0
votes
25
UGC NET CSE | August 2016 | Part 2 | Question: 2
Let us assume that you construct ordered tree to represent the compound proposition $(\sim (p \wedge q)) \leftrightarrow (\sim p \vee \sim q)$. Then, the prefix expression and post-fix expression determined using this ordered tree are given as _____ ...
answered
in
Discrete Mathematics
Sep 6, 2020
2.0k
views
ugcnetcse-aug2016-paper2
discrete-mathematics
propositional-logic
0
votes
26
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) $
answered
in
Mathematical Logic
Sep 4, 2020
13.5k
views
gatecse-2014-set1
mathematical-logic
normal
propositional-logic
0
votes
27
GATE CSE 2009 | Question: 23
Which one of the following is the most appropriate logical formula to represent the statement? "Gold and silver ornaments are precious". The following notations are used: $G(x): x$ is a gold ornament $S(x): x$ is a silver ornament $P(x): x$ ... $\forall x((G(x) \vee S(x)) \implies P(x))$
answered
in
Mathematical Logic
Sep 4, 2020
8.4k
views
gatecse-2009
mathematical-logic
easy
first-order-logic
3
votes
28
GATE CSE 2010 | Question: 30
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
answered
in
Mathematical Logic
Sep 3, 2020
70.0k
views
gatecse-2010
mathematical-logic
easy
first-order-logic
0
votes
29
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
answered
in
Mathematical Logic
Sep 3, 2020
14.0k
views
gatecse-2013
mathematical-logic
easy
first-order-logic
1
vote
30
GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$
answered
in
Digital Logic
Sep 2, 2020
30.5k
views
gatecse-2010
digital-logic
circuit-output
normal
Page:
1
2
3
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:...