Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Veenit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Veenit
2
answers
1
TIFR CSE 2020 | Part B | Question: 4
A $\textit{clamp}$ gate is an analog gate parametrized by two real numbers $a$ and $b$, and denoted as $\text{clamp}_{a,b}$. It takes as input two non-negative real numbers $x$ and $y$ ... outputs the maximum of $x$ and $y?$ $1$ $2$ $3$ $4$ No circuit composed only of clamp gates can compute the max function
A $\textit{clamp}$ gate is an analog gate parametrized by two real numbers $a$ and $b$, and denoted as $\text{clamp}_{a,b}$. It takes as input two non-negative real numbe...
764
views
commented
Feb 14, 2020
Calculus
tifr2020
calculus
maxima-minima
+
–
3
answers
2
GATE CSE 1998 | Question: 1.2
Consider the following set of equations $x+2y=5$ $4x+8y=12$ $3x+6y+3z=15$ This set has unique solution has no solution has finite number of solutions has infinite number of solutions
Consider the following set of equations$x+2y=5$$4x+8y=12$$3x+6y+3z=15$This sethas unique solutionhas no solutionhas finite number of solutionshas infinite number of solut...
7.1k
views
commented
Jan 22, 2020
Linear Algebra
gate1998
linear-algebra
system-of-equations
easy
+
–
5
answers
3
GATE IT 2004 | Question: 76
A table T1 in a relational database has the following rows and columns: ... set marks = marks + 5 Select avg(marks) from T1 What is the output of the select statement? $18.75$ $20$ $25$ $\text{Null}$
A table T1 in a relational database has the following rows and columns: $$\begin{array}{|c|c|c|} \hline \text {Roll no. } & \text {Marks} \\\hline 1& 10 \\\hline 2 & 20 ...
10.6k
views
commented
Jan 4, 2020
Databases
gateit-2004
databases
sql
normal
+
–
1
answer
4
ME FLT
Consider the following statements with respect to POSETs. I. Every non empty, finite POSET has at least one maximal and at least one minimal element. II. Every POSET has at most one greatest element and at most one least element. Which of the above statement(s) is/are true?
Consider the following statements with respect to POSETs.I. Every non empty, finite POSET has at least one maximal and at least one minimal element.II. Every POSET has at...
1.1k
views
answered
Dec 31, 2019
Mathematical Logic
discrete-mathematics
+
–
7
answers
5
GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...
12.1k
views
commented
Dec 22, 2019
Combinatory
gate1999
combinatory
normal
+
–
8
answers
6
GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forward...
18.9k
views
commented
Dec 21, 2019
Computer Networks
gatecse-2018
computer-networks
ip-addressing
numerical-answers
2-marks
+
–
3
answers
7
GATE CSE 2003 | Question: 86
Consider the set of relations shown below and the SQL query that follows. Students: (Roll_number, Name, Date_of_birth) Courses: (Course_number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) Select distinct Name from Students, Courses, Grades where ... students who have got an A grade in at least one of the courses taught by Korth None of the above
Consider the set of relations shown below and the SQL query that follows.Students: (Roll_number, Name, Date_of_birth)Courses: (Course_number, Course_name, Instructor)Grad...
15.2k
views
commented
Dec 4, 2019
Databases
gatecse-2003
databases
sql
easy
+
–
1
answer
8
GATE CSE 2001 | Question: 21-c
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number. Suppose the relation $\text{appears (regno, centr_code)}$ specifies the center where an examinee appears. Write an SQL query to list the centr_code having an examinee of score greater than $80.$
Consider a relation $\text{examinee (regno, name, score)},$ where regno is the primary key to score is a real number.Suppose the relation $\text{appears (regno, centr_cod...
1.9k
views
commented
Dec 4, 2019
Databases
gatecse-2001
databases
sql
normal
descriptive
+
–
4
answers
9
GATE CSE 2001 | Question: 4
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers. Prove that the function $h$ is an injection (one-one). Prove that it is also a Surjection (onto)
Consider the function $h: N \times N \rightarrow N$ so that $h(a,b) = (2a +1)2^b - 1$, where $N=\{0,1,2,3,\dots\}$ is the set of natural numbers.Prove that the function $...
3.1k
views
commented
Dec 3, 2019
Set Theory & Algebra
gatecse-2001
functions
set-theory&algebra
normal
descriptive
+
–
1
answer
10
GATE CSE 1997 | Question: 76-b
Consider the following relational database schema: EMP (eno name, age) PROJ (pno name) INVOLVED (eno, pno) EMP contains information about employees. PROJ about projects and involved about which employees involved in which projects. The underlined attributes are the primary ... makes a copy of $\text{EMP}$ and names it $E$ ($\rho$ is called the rename operator))
Consider the following relational database schema:EMP (eno name, age)PROJ (pno name)INVOLVED (eno, pno)EMP contains information about employees. PROJ about projects and i...
3.2k
views
commented
Dec 3, 2019
Databases
gate1997
databases
sql
descriptive
normal
+
–
3
answers
11
GATE CSE 1992 | Question: 13b
Suppose we have a database consisting of the following three relations: ... are liked by each customer. Express the following query in relational algebra: Print the hotels the serve the snack that customer Rama likes.
Suppose we have a database consisting of the following three relations:$$\begin{array}{|c|c|} \hline \text {FREQUENTS} & \text {(CUSTOMER, HOTEL)} \\\hline \text {SERVES}...
3.6k
views
commented
Dec 2, 2019
Databases
gate1992
databases
relational-algebra
normal
descriptive
+
–
0
answers
12
SELF DOUBT GATE2009-56
I AM NOT GETTING THIS QUESTION CONCEPT . PLEASE HELP Consider the following relational schema: Suppliers(sid:integer−−−−−−−−, sname:string, city:string, street:string) Parts(pid:integer−−−−−−−−−, pname:string, color:string) Catalog(sid:integer, pid:integer−−−−−−−−−−−−−−−−−−,cost:real) ... is in 3NF but not in BCNF The schema is in 2NF but not in 3NF The schema is not in 2NF
I AM NOT GETTING THIS QUESTION CONCEPT . PLEASE HELPConsider the following relational schema:Suppliers(sid:integer−−−−−−−−, sname:string, city:string, str...
1.5k
views
commented
Nov 30, 2019
4
answers
13
GATE CSE 1999 | Question: 6
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer. Given two finite automata $M1, M2$, outline an algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer.Given two finite automata $M1, M2$, outline an ...
4.0k
views
commented
Nov 22, 2019
Theory of Computation
gate1999
theory-of-computation
normal
regular-language
descriptive
+
–
1
answer
14
GATE CSE 2005 | Question: 58
Consider the following two problems on undirected graphs: $\alpha$: Given $G(V, E)$, does $G$ have an independent set of size |V| - $4$? $\beta$: Given $G(V, E)$, does $G$ have an independent set of size $5$ ... $\beta$ is in P Both $\alpha$ and $\beta$ are NP-complete Both $\alpha$ and $\beta$ are in P
Consider the following two problems on undirected graphs:$\alpha$: Given $G(V, E)$, does $G$ have an independent set of size |V| - $4$?$\beta$: Given $G(V, E)$, does $G$ ...
6.5k
views
commented
Nov 20, 2019
Theory of Computation
gatecse-2005
theory-of-computation
p-np-npc-nph
normal
+
–
2
answers
15
TIFR CSE 2011 | Part B | Question: 25
Let $A_{TM}$ be defined as follows: $A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$ And let $L$ be some $\mathbf{NP}-$ complete language. Which of the following statements is ... Since $L$ is $\mathbf{NP}-$ complete, $A_{TM}$ is polynomial time reducible to $L$. $A_{TM} \notin \mathbf{NP}$.
Let $A_{TM}$ be defined as follows:$A_{TM}=\left \{ \left \langle M, w \right \rangle \mid \text{ The Turing machine $M$ accepts the word } w \right \}$And let $L$ be som...
2.1k
views
commented
Nov 18, 2019
Theory of Computation
tifr2011
theory-of-computation
decidability
+
–
2
answers
16
GATE CSE 2007 | Question: 6
Which of the following problems is undecidable? Membership problem for CFGs Ambiguity problem for CFGs Finiteness problem for FSAs Equivalence problem for FSAs
Which of the following problems is undecidable?Membership problem for CFGsAmbiguity problem for CFGsFiniteness problem for FSAsEquivalence problem for FSAs
5.6k
views
commented
Nov 18, 2019
Theory of Computation
gatecse-2007
theory-of-computation
decidability
normal
+
–
2
answers
17
GATE CSE 1989 | Question: 3-iii
Which of the following problems are undecidable? Membership problem in context-free languages. Whether a given context-free language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
Which of the following problems are undecidable?Membership problem in context-free languages.Whether a given context-free language is regular.Whether a finite state autom...
10.0k
views
commented
Nov 17, 2019
Theory of Computation
gate1989
normal
theory-of-computation
decidability
multiple-selects
+
–
1
answer
18
Peter Linz Edition 4 Exercise 7.3 Question 6 (Page No. 200)
For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ is a deterministic context-free language.
For the language $L =$ {$a^nb^{2n} : n ≥ 0$}, show that $L^*$ is a deterministic context-free language.
280
views
commented
Nov 14, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
context-free-language
+
–
1
answer
19
Peter Linz Edition 4 Exercise 7.1 Question 4.h(Page No. 183)
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
Construct npda for the following languages on $∑ =$ {$a,b,c$} $L =$ { $w : n_a(w) = 2*n_b(w)$ }
1.8k
views
commented
Nov 13, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
pushdown-automata
npda
+
–
2
answers
20
TIFR CSE 2014 | Part A | Question: 19
Consider the following random function of $x$ $F(x) = 1 + Ux + Vx^{2} \bmod 5$, where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, 2, 3, 4\right\}$. Which of the following is FALSE? $F(1)$ ... $F(1), F(2), F(3)$ are independent and identically distributed random variables. All of the above. None of the above.
Consider the following random function of $x$$F(x) = 1 + Ux + Vx^{2} \bmod 5$,where $U$ and $V$ are independent random variables uniformly distributed over $\left\{0, 1, ...
1.5k
views
commented
Nov 5, 2019
Probability
tifr2014
probability
random-variable
+
–
1
answer
21
GATE CSE 1989 | Question: 4-viii
$P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has stationary independent increments? (Note: $P_{t} (t)$is the probability density function).
$P_{n} (t)$ is the probability of $n$ events occurring during a time interval $t$. How will you express $P_{0} (t + h)$ in terms of $P_{0} (h)$, if $P_{0} (t)$ has statio...
1.6k
views
commented
Nov 4, 2019
Probability
gate1989
descriptive
probability
poisson-distribution
+
–
8
answers
22
GATE CSE 2004 | Question: 36
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\text{enQueue}$ and $\text{deQueue}$ can be performed in constant time? rear node front node not possible with a single pointer node next to front
A circularly linked list is used to represent a Queue. A single variable $p$ is used to access the Queue. To which node should $p$ point such that both the operations $\t...
30.7k
views
commented
Oct 4, 2019
DS
gatecse-2004
data-structures
linked-list
normal
+
–
1
answer
23
GATE CSE 1987 | Question: 7a
List the invariant assertions at points $A, B, C, D$ and $E$ in program given below: Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quotient:interger begin (*(dividend >= 0) AND (divisor > 0)*) remainder := dividend; ... = remainder - divisor; (*C*) end; (*D*) quotient := quotient - 1; remainder := remainder + divisor; (*E*) end
List the invariant assertions at points $A, B, C, D$ and $E$ in program given below:Program division (input, output) Const dividend = 81; divisor = 9; Var remainder, quot...
2.4k
views
commented
Sep 24, 2019
Programming in C
gate1987
programming
loop-invariants
descriptive
+
–
5
answers
24
GATE CSE 1989 | Question: 3-i
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s): It makes it more difficult to verify programs. It makes programs more inefficient. It makes it more difficult to modify existing programs. It results in the compiler generating longer machine code.
An unrestricted use of the "go to" statement is harmful because of which of the following reason (s):It makes it more difficult to verify programs.It makes programs more ...
4.2k
views
commented
Sep 23, 2019
Programming in C
gate1989
normal
programming
goto
+
–
4
answers
25
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
5.2k
views
commented
Sep 18, 2019
Digital Logic
gate1992
digital-logic
k-map
normal
fill-in-the-blanks
+
–
9
answers
26
GATE CSE 2003 | Question: 43
The following is a scheme for floating point number representation using $16$ bits. Let $s, e,$ and $m$ ... between two successive real numbers representable in this system? $2^{-40}$ $2^{-9}$ $2^{22}$ $2^{31}$
The following is a scheme for floating point number representation using $16$ bits.Let $s, e,$ and $m$ be the numbers represented in binary in the sign, exponent, and man...
17.9k
views
commented
Sep 18, 2019
Digital Logic
gatecse-2003
digital-logic
number-representation
floating-point-representation
normal
+
–
2
answers
27
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$
In the IEEE floating point representation the hexadecimal value $0\text{x}00000000$ corresponds toThe normalized value $2^{-127}$The normalized value $2^{-126}$The normal...
12.7k
views
commented
Sep 17, 2019
Digital Logic
gatecse-2008
digital-logic
floating-point-representation
ieee-representation
easy
+
–
4
answers
28
TIFR CSE 2017 | Part B | Question: 8
For any natural number $n$, an ordering of all binary strings of length $n$ is a Gray code if it starts with $0^n$, and any successive strings in the ordering differ in exactly one bit (the first and last string must also differ by one ... two strings are separated by $k$ other strings in the ordering, then they must differ in exactly $k$ bits none of the above
For any natural number $n$, an ordering of all binary strings of length $n$ is a Gray code if it starts with $0^n$, and any successive strings in the ordering differ in e...
3.1k
views
commented
Sep 17, 2019
Digital Logic
tifr2017
digital-logic
boolean-algebra
+
–
3
answers
29
GATE CSE 2005 | Question: 85-a
Consider the following floating-point format. Mantissa is a pure fraction in sign-magnitude form. The decimal number $0.239 \times 2^{13}$ has the following hexadecimal representation (without normalization and rounding off): $\text{0D 24}$ $\text{0D 4D}$ $\text{4D 0D}$ $\text{4D 3D}$
Consider the following floating-point format.Mantissa is a pure fraction in sign-magnitude form.The decimal number $0.239 \times 2^{13}$ has the following hexadecimal rep...
18.4k
views
commented
Sep 17, 2019
Digital Logic
gatecse-2005
digital-logic
number-representation
floating-point-representation
normal
+
–
1
answer
30
GATE CSE 1997 | Question: 72
Following floating point number format is given $f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ ... addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?
Following floating point number format is given$f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (...
3.0k
views
commented
Sep 17, 2019
Digital Logic
gate1997
digital-logic
floating-point-representation
normal
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register