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 srestha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by srestha
1
vote
31
GATE CSE 2020 | Question: 37
Consider a schedule of transactions $T_1$ and $T_2$ ...
answered
in
Databases
Feb 12, 2020
11.7k
views
gatecse-2020
databases
transaction-and-concurrency
2-marks
1
vote
32
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
Question: Options:
answered
in
Compiler Design
Nov 16, 2019
594
views
made-easy-test-series
compiler-design
syntax-directed-translation
0
votes
33
#compiler
given Grammar E → E + E E → E * E E → ( E ) E → id Find set of handles and viable prefixes for the input string id1 + id2 * id3
answered
in
Compiler Design
Nov 8, 2019
4.3k
views
compiler-design
viable-prefix
0
votes
34
Made Easy Test Series:OS
Consider the following solution for critical section problem with 'n' processes P0,P1,P2,......P(n-1).For all i,number[i] is an integer array initialized to zero, and for all j,choosing[j] is a binary array initialized to false. CODE FOR Pi : Repeat ... . b)S1 and S2 only. c)S2 and S3 only. d)S1 , S2 and S3 (please anyone elaborate this solution.thanks in advance)
answered
in
Operating System
Oct 23, 2019
646
views
critical-section
operating-system
0
votes
35
sudo gate test series
Which of the following is not the Application layer protocol in TCP/IP Model? SMTP, FTP, TELNET, POP, MIME, HTTP A FTP, POP, MIME, SMTP B TELNET, HTTP C MIME D None of these
answered
in
Computer Networks
Oct 12, 2019
2.7k
views
computer-networks
application-layer-protocols
0
votes
36
Virtual Gate Test Series: Computer Networks - Transmission Control Protocol
On TCP connection, consider FIN, SYN packets will take $1$ byte and ACK packets will take $0$ bytes. Assume client and server are working on this connection. Client and server selected random numbers for sequence numbers $100$ and $500$ ... $(D)$ SEQ NUM = 501 and ACK NUM = 301
answered
in
Computer Networks
Oct 12, 2019
1.7k
views
computer-networks
tcp
sequencenumber
virtual-gate-test-series
2
votes
37
ISI2014-DCG-3
$\underset{x \to \infty}{\lim} \left( \frac{3x-1}{3x+1} \right) ^{4x}$ equals $1$ $0$ $e^{-8/3}$ $e^{4/9}$
answered
in
Calculus
Sep 25, 2019
1.6k
views
isi2014-dcg
calculus
limits
1
vote
38
ISI2016-DCG-3
The value of $\begin{vmatrix} 1+a& 1& 1& 1\\ 1&1+b &1 &1 \\ 1&1 &1+c &1 \\ 1&1 &1 &1+d \end{vmatrix}$ is $abcd(1+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d})$ $abcd(\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d})$ $1+\frac{1}{a}+\frac{1}{b}+\frac{1}{c}+\frac{1}{d}$ None of these
answered
in
Linear Algebra
Sep 19, 2019
409
views
isi2016-dcg
linear-algebra
determinant
0
votes
39
Combinational Circuits: Adders
A full adder circuit is implemented using 2-input AND, OR gates; each of which takes 1 unit of delay. If inputs are also available in complements forms, what will be the delay of full adder (in units)?
answered
in
Digital Logic
Aug 4, 2019
1.3k
views
0
votes
40
MadeEasy Full Length Test 2019: Digital Logic - Number Representation
The $(r-1)$'s complement of a number can be found using formula $(r^{n}-r^{-m}-N)$ where $r$ is base of the number $N$ having $n$ digits and $m$ digits in integral an fraction part respectively. We have been ... $(iv) -517.67$ How many $(r - 1)'s$ complement of above decimal numbers can be calculated using mentioned formula?
answered
in
Digital Logic
Aug 3, 2019
585
views
digital-logic
number-representation
made-easy-test-series
2
votes
41
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
answered
in
Linear Algebra
Jul 24, 2019
37.1k
views
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
0
votes
42
Michael Sipser Edition 3 Exercise 1 Question 55 (Page No. 91)
The pumping lemma says that every regular language has a pumping length $p,$ such that every string in the language can be pumped if it has length $p$ or more. If $p$ is a pumping length for language $A,$ so is any length $p^{'}\geq p.$ The minimum pumping ... $\epsilon$ $1^{*}01^{*}01^{*}$ $10(11^{*}0)^{*}0$ $1011$ $\sum^{*}$
answered
in
Theory of Computation
Jul 14, 2019
2.2k
views
michael-sipser
theory-of-computation
regular-language
pumping-lemma
proof
descriptive
0
votes
43
Kenneth Rosen Edition 6 Question 45 (Page No. 346)
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
answered
in
Combinatory
Jul 14, 2019
8.9k
views
combinatory
counting
0
votes
44
Michael Sipser Edition 3 Exercise 2 Question 30 (Page No. 157)
Use the pumping lemma to show that the following languages are not context free$.$ $\{0^{n}1^{n}0^{n}1^{n}\mid n\geq 0\}$ $\{0^{n}\#0^{2n}\#0^{3n}\mid n\geq 0\}$ $\{w\#t\mid w$ $\text{ is a substring of}$ $ t,$ $\text{where}$ ... $\text{each}$ $ t_{i}\in\{a,b\}^{*},$ $\text{and}$ $ t_{i}=t_{j}$ $\text{ for some}$ $ i\neq j\}$
answered
in
Theory of Computation
Jul 12, 2019
1.1k
views
michael-sipser
theory-of-computation
context-free-language
pumping-lemma
0
votes
45
MADEEASY
Consider a set S={1000,1001,1002........,9999}. The numbers in set S having atleast one digit as 2 and atleast one digit as 5 are?
answered
in
Combinatory
Jul 11, 2019
1.4k
views
counting
0
votes
46
Kenneth Rosen Edition 6th Exercise 7.5 Question 3 e (Page No. 507)
Which of these relations on the set of all functions from Z to Z are equivalence relations? Determine the properties of an equivalence relation that the others lack. {(f, g) | f(0) = g(1) and f(1) = g(0)} In ... made to check the reflexive property. Why can't we check f(0)=f(0) to confirm the reflexive property. Please help.
answered
in
Set Theory & Algebra
Jul 5, 2019
537
views
discrete-mathematics
kenneth-rosen
3
votes
47
UGC NET CSE | June 2019 | Part 2 | Question: 22
Consider the following C-code fragment running on a $32$-bit $X86$ machine: typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; }S; S B[10]; S*p=&B[4]; S*q=&B[5]; p → U.b=0x1234; /* structure S takes 32-bits */ If M is the ... $(M,N)$ is $(1,1)$ $(3,2)$ $(1,2)$ $(4,4)$
answered
in
Programming in C
Jul 2, 2019
2.9k
views
ugcnetcse-june2019-paper2
programming-in-c
1
vote
48
UGC NET CSE | June 2019 | Part 2 | Question: 24
Consider the following C++ function f(): unsigned int f(unsigned int n) { unsigned int b=0; while (n) { b+=n & 1; n>>1; } return b; } The function f() returns the int that represents the ____P____ in the binary representation of positive integer n, where P is number of $0$’s number of bits number of consecutive $1$’s number of $1$’s
answered
in
Object Oriented Programming
Jul 2, 2019
2.3k
views
ugcnetcse-june2019-paper2
programming-in-c
4
votes
49
UGC NET CSE | June 2019 | Part 2 | Question: 20
Suppose that a computer program takes $100$ seconds of execution time on a computer with multiplication operation responsible for $80$ seconds of this time. How much do you have to improve the speed of the multiplication operation if you are ... this program four times faster? $14$ times faster $15$ times faster $16$ times faster $17$ times faster
answered
in
CO and Architecture
Jul 2, 2019
5.9k
views
ugcnetcse-june2019-paper2
co-and-architecture
speedup
1
vote
50
Kenneth Rosen Edition 7 Exercise 2.1 Question 23 (Page No. 126)
How many elements does each of these sets have where $a$ and $b$ are distinct elements? $P (\left \{a,b, \left \{a,b \right \} \right \})$ $P\left \{ \phi, a, \left \{ a \right \},\left \{ \left \{ a \right \} \right \}\right \}$ $P(P(\phi ))$
answered
in
Set Theory & Algebra
Jul 1, 2019
2.2k
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
2
votes
51
Kenneth Rosen Edition 7 Exercise 2.1 Question 24 (Page No. 126)
Determine whether each of these sets is the power set of a set, where $a$ and $b$ are distinct elements. $\phi$ $\left \{ \phi ,\left \{ a \right \} \right \}$ $\left \{ \phi ,\left \{ a \right \},\left \{ \phi ,a \right \} \right \}$ $\left \{ \phi ,\left \{ a \right \},\left \{ b \right \},\left \{ a,b \right \} \right \}$
answered
in
Set Theory & Algebra
Jul 1, 2019
510
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
4
votes
52
Cormen Edition 3 Exercise 8.3 Question 4 (Page No. 200)
Show how to sort $n$ integers in the range $0$ to $n^3-1$ in $O(n)$ time.
answered
in
Algorithms
Jun 30, 2019
1.1k
views
cormen
algorithms
sorting
radix-sort
descriptive
0
votes
53
Kenneth Rosen: Counting-13
How many bit strings with length not exceeding $n$ ,where n is a positive integer ,consist entirely of $1's?$
answered
in
Combinatory
Jun 25, 2019
2.3k
views
counting
discrete-mathematics
0
votes
54
ISI2018-MMA-17
There are eight coins, seven of which have the same weight and the other one weighs more. In order to find the coin having more weight, a person randomly chooses two coins and puts one coin on each side of a common balance. If these two coins are found to have the same ... as before. The probability that the coin will be identified at the second draw is $1/2$ $1/3$ $1/4$ $1/6$
answered
in
Probability
Jun 20, 2019
1.2k
views
isi2018-mma
engineering-mathematics
probability
0
votes
55
ISI2018-MMA-18
Let $A_1 = (0, 0), A_2 = (1, 0), A_3 = (1, 1)\ $and$\ A_4 = (0, 1)$ be the four vertices of a square. A particle starts from the point $A_1$ at time $0$ and moves either to $A_2$ or to $A_4$ with equal probability. Similarly, in each of the subsequent ... $T$ be the minimum number of steps required to cover all four vertices. The probability $P(T = 4)$ is $0$ $1/16$ $1/8$ $1/4$
answered
in
Probability
Jun 20, 2019
1.0k
views
isi2018-mma
engineering-mathematics
probability
0
votes
56
ISI2019-MMA-22
A coin with probability $p (0 < p < 1)$ of getting head, is tossed until a head appears for the first time. If the probability that the number of tosses required is even is $2/5$, then the value of $p$ is $2/7$ $1/3$ $5/7$ $2/3$
answered
in
Probability
Jun 20, 2019
885
views
isi2019-mma
probability
4
votes
57
TIFR CSE 2015 | Part A | Question: 12
Consider two independent and identically distributed random variables $X$ and $Y$ uniformly distributed in $[0, 1]$. For $\alpha \in \left[0, 1\right]$, the probability that $\alpha$ max $(X, Y) < XY$ is $1/ (2\alpha)$ exp $(1 - \alpha)$ $1 - \alpha$ $(1 - \alpha)^{2}$ $1 - \alpha^{2}$
answered
in
Probability
Jun 19, 2019
1.9k
views
tifr2015
probability
random-variable
uniform-distribution
0
votes
58
TIFR CSE 2013 | Part A | Question: 5
The late painter Maqbool Fida Husain once coloured the surface of a huge hollow steel sphere, of radius $1$ metre, using just two colours, Red and Blue. As was his style however, both the red and blue areas were a bunch of highly irregular disconnected ... $11 sq. metres$; None of the above.
answered
in
Quantitative Aptitude
Jun 17, 2019
2.8k
views
tifr2013
geometry
quantitative-aptitude
3
votes
59
TIFR CSE 2015 | Part A | Question: 15
Let $A$ and $B$ be non-empty disjoint sets of real numbers. Suppose that the average of the numbers in the first set is $\mu_{A}$ and the average of the numbers in the second set is $\mu_{B}$; let the corresponding variances be $v_{A}$ and $v_{B}$ respectively. If the average of the ... $p.v_{A}+ (1 - p). v_{B} + (\mu_{A}- \mu_{B})^{2}$
answered
in
Quantitative Aptitude
Jun 16, 2019
1.0k
views
tifr2015
statistics
0
votes
60
Michael Sipser Edition 3 Exercise 1 Question 38 (Page No. 89)
An $\text{all-NFA}$ $M$ is a $\text{5-tuple}$ $(Q, Σ, δ, q_{0}, F)$ that accepts $x\in\sum^{*}$ if every possible state that $M$ could be in after reading input $x$ is a state from $F.$ Note ... string if some state among these possible states is an accept state$.$ Prove that $\text{all-NFAs}$ recognize the class of regular languages$.$
answered
in
Theory of Computation
Jun 14, 2019
1.9k
views
michael-sipser
theory-of-computation
finite-automata
regular-language
Page:
« prev
1
2
3
4
5
6
7
...
36
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:...