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
Recent activity by Warrior
0
answers
1
toc - self doubt
Is subset of regular language is always recursively enumerable language?
Is subset of regular language is always recursively enumerable language?
325
views
asked
Jan 9, 2019
2
answers
2
Self doubt -OS-FORK()
1.4k
views
commented
Nov 11, 2018
Operating System
operating-system
fork-system-call
+
–
4
answers
3
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk acce...
4.2k
views
commented
Nov 4, 2018
Operating System
operating-system
disk-scheduling
+
–
2
answers
4
Fork System Call
A process execute the code: main() { fork(); fork() && fork() || fork(); fork(); printf("Hi"); } The number of times "Hi" will be printed is
A process execute the code: main() { fork(); fork() && fork() || fork(); fork(); printf("Hi"); } The number of times "Hi" will be printed is
4.7k
views
commented
Nov 3, 2018
Operating System
operating-system
fork-system-call
+
–
0
answers
5
Deadlock --foreign university Assignment Question
Consider two processes p1 and p2 each needed 3 resources 1, 2,3 in databases. If each, processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock free?
Consider two processes p1 and p2 each needed 3 resources 1, 2,3 in databases. If each, processes ask them in any order, then the number of ways possible in which system i...
496
views
commented
Nov 2, 2018
Operating System
deadlock-operating-system
+
–
0
answers
6
IISc Research Field
Can anybody please tell what INTERDISCIPLINARY PROGRAM - CYBER PHYSICAL SYSTEM is in IISc? It seems to be an interesting research area by whatever I have read but after seeing the cut off scores for this field it seems nobody is much interested in this field. What may be the reason for such less interest in this field?
Can anybody please tell what INTERDISCIPLINARY PROGRAM - CYBER PHYSICAL SYSTEM is in IISc? It seems to be an interesting research area by whatever I have read but after s...
618
views
commented
Mar 21, 2018
IISc/IITs
iisccsaresearch2016
+
–
2
answers
7
test series (gradeup)
What is the output of this program ?Please give reason.. #include<stdio.h> int g() ; int f(); void main() { printf(“%d”,f()); } int g(){ int a=7,b=8,c; { int a=3; b=6; c=b+a; } return (c+b+a); } int f() { return (g()); }
What is the output of this program ?Please give reason..#include<stdio.h int g() ; int f(); void main() { printf(“%d”,f()); } int g(){ int a=7,b=8,c; { int a=3; b=6; ...
569
views
commented
Mar 18, 2018
Programming in C
programming-in-c
+
–
1
answer
8
Admissions gate2018
My gate mark is 44 and score is 575 (according to pragy's app). I belongs to OBC_NCL. Which college i can get from this score. Will i get IIIT-B or IIIT-D or top NIT's?
My gate mark is 44 and score is 575 (according to pragy's app). I belongs to OBC_NCL. Which college i can get from this score.Will i get IIIT-B or IIIT-D or top NIT's?
410
views
commented
Mar 7, 2018
Others
gate2018-admissions
+
–
2
answers
9
Test series
Consider the variation of the binary search algorithm so that it splits the list into not only into two sets of almost equal sizes but into two sets of size approximately one-thirds and Two-third. What is the recurrence equation for this search in worst-case? $T(n) = T(n/2) + 1$ $T(n) = 2T(n/2) + 1$ $T(n) = T(n/3) + 1$ $T(n) = 2T(n/3) + 1$
Consider the variation of the binary search algorithm so that it splits the list into not only into two sets of almost equal sizes but into two sets of size approximately...
1.8k
views
asked
Mar 6, 2018
Algorithms
algorithms
recurrence-relation
test-series
+
–
2
answers
10
GATE CSE 2014 Set 3 | Question: 5
If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.
If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.
10.8k
views
commented
Jan 15, 2018
Linear Algebra
gatecse-2014-set3
linear-algebra
vector-space
normal
numerical-answers
+
–
5
answers
11
GATE IT 2004 | Question: 25
A sender is employing public key cryptography to send a secret message to a receiver. Which one of the following statements is TRUE? Sender encrypts using receiver's public key Sender encrypts using his own public key Receiver decrypts using sender's public key Receiver decrypts using his own public key
A sender is employing public key cryptography to send a secret message to a receiver. Which one of the following statements is TRUE?Sender encrypts using receiver's publi...
13.4k
views
commented
Jan 3, 2018
Computer Networks
gateit-2004
computer-networks
network-security
normal
out-of-gate-syllabus
+
–
4
answers
12
TIFR CSE 2013 | Part B | Question: 1
Let $G= (V, E)$ be a simple undirected graph on $n$ vertices. A colouring of $G$ is an assignment of colours to each vertex such that endpoints of every edge are given different colours. Let $\chi (G)$ denote the chromatic number of $G$, i.e. the minimum ... $a\left(G\right)\leq \frac{n}{\chi \left(G\right)}$ None of the above
Let $G= (V, E)$ be a simple undirected graph on $n$ vertices. A colouring of $G$ is an assignment of colours to each vertex such that endpoints of every edge are given di...
4.3k
views
commented
Dec 30, 2017
Graph Theory
tifr2013
graph-theory
graph-coloring
+
–
8
answers
13
GATE IT 2007 | Question: 2
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvectors of $A?$ $5$ $\frac{(5 + √5)}{2}$ $3$ $\frac{(5 - √5)}{2}$
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvect...
16.3k
views
commented
Dec 30, 2017
Linear Algebra
gateit-2007
linear-algebra
eigen-value
normal
+
–
6
answers
14
TIFR CSE 2010 | Part B | Question: 36
In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices? Exactly seven edges leave every vertex. Exactly seven edges leave some vertex. Some vertex has at least seven edges leaving it. The number of edges coming out of vertex is odd. None of the above.
In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices?Exactly seven edges leave...
5.9k
views
commented
Dec 29, 2017
Graph Theory
tifr2010
graph-theory
degree-of-graph
+
–
8
answers
15
GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and th...
25.6k
views
commented
Dec 29, 2017
Computer Networks
gatecse-2012
computer-networks
communication
normal
+
–
8
answers
16
GATE CSE 2008 | Question: 14, ISRO2016-74
What is the maximum size of data that the application layer can pass on to the TCP layer below? Any size $2^{16}$ bytes - size of TCP header $2^{16}$ bytes $1500$ bytes
What is the maximum size of data that the application layer can pass on to the TCP layer below?Any size$2^{16}$ bytes - size of TCP header$2^{16}$ bytes$1500$ bytes
17.8k
views
commented
Dec 28, 2017
Computer Networks
gatecse-2008
easy
computer-networks
application-layer-protocols
isro2016
+
–
7
answers
17
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...
28.0k
views
commented
Dec 27, 2017
Computer Networks
gatecse-2003
computer-networks
sliding-window
normal
+
–
11
answers
18
GATE CSE 2016 Set 1 | Question: 55
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ ... $100$ milliseconds. Assuming no frame is lost, the sender throughput is ________ bytes/ second.
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission rate at the sender is $80\...
26.4k
views
commented
Dec 26, 2017
Computer Networks
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
+
–
9
answers
19
GATE CSE 2012 | Question: 34, ISRO-DEC2017-32
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of addresses to Organization $A$, and a quarter to Organization $B$, while retaining the remaining ... $245.248.136.0/24 \text{ and } 245.248.132.0/21$
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: $245.248.128.0/20$. The ISP wants to give half of this chunk of a...
30.2k
views
commented
Dec 21, 2017
Computer Networks
gatecse-2012
computer-networks
subnetting
normal
isrodec2017
+
–
5
answers
20
TIFR CSE 2011 | Part B | Question: 27
Let $n$ be a large integer. Which of the following statements is TRUE? $n^\frac{1}{ \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^\frac{1}{100}$ $n^\frac{1}{100} < n^\frac{1} {\sqrt{\log_2 n}} < \sqrt{\log_2 n}$ ... $\sqrt{\log_2 n} < n^\frac{1}{100} < n^\frac{1}{\sqrt{\log_2 n}}$
Let $n$ be a large integer. Which of the following statements is TRUE?$n^\frac{1}{ \sqrt{\log_2 n}} < \sqrt{\log_2 n} < n^\frac{1}{100}$$n^\frac{1}{100} < n^\frac{1} {\sq...
4.2k
views
commented
Dec 15, 2017
Algorithms
tifr2011
asymptotic-notation
+
–
8
answers
21
GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions: $P:$ $R$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions:$P:$ $R$ ...
14.7k
views
commented
Dec 7, 2017
Set Theory & Algebra
gatecse-2016-set2
set-theory&algebra
relations
normal
+
–
2
answers
22
GATE CSE 1995 | Question: 2.13
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is: $\frac{1}{\sqrt{3}} (i+j+k)$ $\frac{1}{3} (i+j-k)$ $\frac{1}{3} (i-j-k)$ $\frac{1}{\sqrt{3}} (i+j-k)$
A unit vector perpendicular to both the vectors $a=2i-3j+k$ and $b=i+j-2k$ is:$\frac{1}{\sqrt{3}} (i+j+k)$$\frac{1}{3} (i+j-k)$$\frac{1}{3} (i-j-k)$$\frac{1}{\sqrt{3}} (i...
4.1k
views
commented
Dec 3, 2017
Linear Algebra
gate1995
linear-algebra
normal
vector-space
+
–
4
answers
23
GATE CSE 2003 | Question: 41
Consider the following system of linear equations ... linearly dependent. For how many values of $\alpha$, does this system of equations have infinitely many solutions? \(0\) \(1\) \(2\) \(3\)
Consider the following system of linear equations $$\left( \begin{array}{ccc} 2 & 1 & -4 \\ 4 & 3 & -12 \\ 1 & 2 & -8 \end{array} \right) \left( \begin{array}{ccc} x \\ y...
12.2k
views
commented
Dec 3, 2017
Linear Algebra
gatecse-2003
linear-algebra
system-of-equations
normal
+
–
3
answers
24
GATE CSE 2014 Set 3 | Question: 4
Which one of the following statements is TRUE about every $n \times n$ matrix with only real eigenvalues? If the trace of the matrix is positive and the determinant of the matrix is negative, at least one of its eigenvalues is ... eigenvalues are positive. If the product of the trace and determinant of the matrix is positive, all its eigenvalues are positive.
Which one of the following statements is TRUE about every $n \times n$ matrix with only real eigenvalues?If the trace of the matrix is positive and the determinant of the...
11.3k
views
commented
Dec 1, 2017
Linear Algebra
gatecse-2014-set3
linear-algebra
eigen-value
normal
+
–
5
answers
25
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $...
16.8k
views
commented
Dec 1, 2017
Linear Algebra
gatecse-2007
eigen-value
linear-algebra
difficult
+
–
1
answer
26
TIFR CSE 2010 | Part A | Question: 16
Let the characteristic equation of matrix $M$ be $\lambda ^{2} - \lambda - 1 = 0$. Then. $M^{-1}$ does not exist. $M^{-1}$ exists but cannot be determined from the data. $M^{-1} = M + I$ $M^{-1} = M - I$ $M^{-1}$ exists and can be determined from the data but the choices (c) and (d) are incorrect.
Let the characteristic equation of matrix $M$ be $\lambda ^{2} - \lambda - 1 = 0$. Then.$M^{-1}$ does not exist.$M^{-1}$ exists but cannot be determined from the data.$M^...
12.2k
views
commented
Nov 30, 2017
Linear Algebra
tifr2010
linear-algebra
matrix
+
–
9
answers
27
GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...
11.1k
views
commented
Nov 19, 2017
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
5
answers
28
GATE CSE 2008 | Question: 13, ISRO2016-36
If $L$ and $\overline{L}$ are recursively enumerable then $L$ is regular context-free context-sensitive recursive
If $L$ and $\overline{L}$ are recursively enumerable then $L$ isregularcontext-freecontext-sensitiverecursive
11.6k
views
commented
Nov 19, 2017
Theory of Computation
gatecse-2008
theory-of-computation
easy
isro2016
recursive-and-recursively-enumerable-languages
+
–
3
answers
29
GATE CSE 2007 | Question: 2
Let $S$ be a set of $n$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $S$ are: $n$ and $n$ $n^2$ and $n$ $n^2$ and $0$ $n$ and $1$
Let $S$ be a set of $n$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $S$ are:$n$ and $n$$n^2$ and $n$$n^2$ and $0$$n$ an...
8.6k
views
commented
Oct 26, 2017
Set Theory & Algebra
gatecse-2007
set-theory&algebra
normal
relations
+
–
3
answers
30
ISI Entrance Exam MTech (CS)
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
2.4k
views
commented
Oct 23, 2017
Graph Theory
isi2016
graph-theory
tree
descriptive
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register