Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by pritishc
0
votes
1
GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$
Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...
23.9k
views
answered
Feb 20, 2021
Algorithms
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
+
–
18
votes
2
GATE CSE 2021 Set 1 | Question: 45
Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between $R$ and $Q$ is $820$ bytes. A $\text{TCP}$ segment ... to resend the whole $\text{TCP}$ segment. $\text{TCP}$ destination port can be determined by analysing $\textit{only}$ the second fragment.
Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between...
10.5k
views
answered
Feb 19, 2021
Computer Networks
gatecse-2021-set1
computer-networks
tcp
2-marks
multiple-selects
+
–
0
votes
3
MadeEasy Test Series: Programming & DS - Programming In C
Consider the C node fragment given below: Which of the following true about above code if input is given as linked list of n-element in which for each node memory is created in heap area? A. Compiles successfully but execution may ... in else part. I think answer should be C. Because the return type is int node* Can someone please confirm.
Consider the C node fragment given below:Which of the following true about above code if input is given as linked list of n-element in which for each node memory is creat...
1.1k
views
answered
Jan 27, 2020
Programming in C
made-easy-test-series
programming-in-c
pointers
structure
linked-list
binary-heap
+
–
4
votes
4
GATE CSE 2015 Set 3 | Question: 38
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.
16.4k
views
answered
Jan 24, 2020
Computer Networks
gatecse-2015-set3
computer-networks
subnetting
normal
numerical-answers
+
–
2
votes
5
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresses $192.168.1.135$ and $192.168.1.110$. $R2$ ... $1$ $2$ $3$ $6$
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP address...
12.1k
views
answered
Jan 24, 2020
Computer Networks
gateit-2008
computer-networks
subnetting
normal
+
–
1
votes
6
GATE CSE 1987 | Question: 1-xxii
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ has All complex roots At least one real root Four pairs of imaginary roots None of the above
The equation $7x^{7}+14x^{6}+12x^{5}+3x^{4}+12x^{3}+10x^{2}+5x+7=0$ hasAll complex rootsAt least one real rootFour pairs of imaginary rootsNone of the above
2.9k
views
answered
Dec 22, 2019
Calculus
gate1987
calculus
polynomials
+
–
3
votes
7
GATE CSE 1991 | Question: 15,b
Consider the following first order formula: ... Does it have finite models? Is it satisfiable? If so, give a countable model for it.
Consider the following first order formula:$\left ( \matrix{ \forall x \exists y : R(x,y) \\[1em] \Large \land \\[1em] \forall x \forall y : \left ( R(x,y) \impl...
6.4k
views
answered
Dec 11, 2019
Mathematical Logic
gate1991
mathematical-logic
first-order-logic
descriptive
+
–
1
votes
8
GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...
28.5k
views
answered
Dec 9, 2019
Theory of Computation
gatecse-2017-set2
theory-of-computation
finite-automata
+
–
2
votes
9
TIFR CSE 2012 | Part A | Question: 17
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away from the top with probability $2/3$, unless it is at the bottom in which ... $n$? It will never reach the top. Linear in $n$. Polynomial in $n$. Exponential in $n$. Double exponential in $n$.
A spider is at the bottom of a cliff, and is $n$ inches from the top. Every step it takes brings it one inch closer to the top with probability $1/3$, and one inch away f...
2.4k
views
answered
Dec 3, 2019
Probability
tifr2012
probability
binomial-distribution
+
–
3
votes
10
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
26.0k
views
answered
Dec 2, 2019
Combinatory
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
+
–
0
votes
11
Ullman (Compiler Design) Edition 2 Exercise 5.4 Question 3 (Page No. 337)
The following SDT computes the value of a string of $0's$ and $1's$ ... so the underlying grammar is not left recursive, and yet the same value of $B.val$ is computed for the entire input string.
The following SDT computes the value of a string of $0's$ and $1's$ interpreted as a positive, binary integer.$B\rightarrow B_{1}0\:\{B.val=2\times B_{1}.val\}\mid B_{1}1...
2.2k
views
answered
Nov 25, 2019
Compiler Design
ullman
compiler-design
syntax-directed-translation
grammar
left-recursion
descriptive
+
–
0
votes
12
Testbook Test Series: Theory of Computation - Identify Class Language
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers} Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by 1. Starting at the origin (0,0), a ... the following statements is TRUE? i) L is Regular. ii) L is context free. iii) L complement is context free. Thanks!
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers}Every point in G has 4 neighbors, North, South, East, and West, obtained by varying m or n by �...
450
views
answered
Nov 17, 2019
Theory of Computation
testbook-test-series
theory-of-computation
identify-class-language
+
–
1
votes
13
Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 3 (Page No. 125)
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
In a string of length $n$, how many of the following are there? Prefixes. Suffixes. Proper prefixes. Substrings. Subsequences.
1.9k
views
answered
Nov 8, 2019
Compiler Design
ullman
compiler-design
strings
descriptive
+
–
1
votes
14
Galvin Edition 9 Exercise 5 Question 9 (Page No. 243-245)
The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n − 1 turns was presented by Eisenberg and McGuire. The processes share the following variables: enum pstate ${idle, want in, in cs}$; ...
The first known correct software solution to the critical-section problem for n processes with a lower bound on waiting of n − 1 turns was presented by Eisenberg and Mc...
2.0k
views
answered
Oct 14, 2019
Operating System
galvin
operating-system
process-synchronization
descriptive
+
–
0
votes
15
GATE CSE 2004 | Question: 79
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ? $^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^2-3n}{2} \right )}}.\left(n^2-n\right)}C_k$ $^{\left(\frac{n^2-n}{2}\right)}C_n$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2-n}{2}\right)}C_k$
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2 - 3n)}{ 2}$ edges ?$^{\left(\frac{n^2-n}{2}\right)}C_{\left(\frac{n^2-3n} {2}\right)}$$^{{\l...
14.5k
views
answered
Jul 5, 2019
Graph Theory
gatecse-2004
graph-theory
combinatory
normal
counting
+
–
1
votes
16
GATE CSE 2002 | Question: 2.17
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetric Symmetric and reflexive Transitive and reflexive Transitive and symmetric
The binary relation $S= \phi \text{(empty set)}$ on a set $A = \left \{ 1,2,3 \right \}$ is Neither reflexive nor symmetricSymmetric and reflexiveTransitive and reflexive...
13.0k
views
answered
Jun 23, 2019
Set Theory & Algebra
gatecse-2002
set-theory&algebra
normal
relations
+
–
2
votes
17
Self doubt DIGITAL LOGIC
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!
Is Y' + Z' same as (YZ)' ? Please explain this concept of compliments..!!
658
views
answered
Jun 11, 2019
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register