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 mehul vaidya
1
votes
1
GATE CSE 2017 Set 1 | Question: 3
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$.Consider the set of linear equations$...
20.5k
views
answered
Dec 25, 2019
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
2
votes
2
Applied Course | Mock GATE | Test 1 | Question: 48
Assume the following program is compiled and run on a modern Linux machine: main() { int x = 0; int a = fork(); x++; if (a == 0) { a = fork(); x++; } else { x++; } printf("GATE!\n"); printf("x is %d ... $"x"$ may have different values on different runs of the program. $2$ $3$ $5$
Assume the following program is compiled and run on a modern Linux machine:main() { int x = 0; int a = fork(); x++; if (a == 0) { a = fork(); x++; } else { x++; } printf(...
903
views
answered
Jun 3, 2019
Operating System
applied-course-2019-mock1
numerical-answers
operating-system
fork-system-call
+
–
0
votes
3
Applied Course | Mock GATE | Test 1 | Question: 30
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
Consider the following program code, where pow() is the exponentiation function.f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if ...
723
views
answered
Jun 2, 2019
Algorithms
applied-course-2019-mock1
algorithms
time-complexity
+
–
1
votes
4
GATE CSE 2019 | Question: GA-6
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
The police arrested four criminals – $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements:$P$ says “Q committed the crime.”$Q$ says ...
12.5k
views
answered
Feb 25, 2019
Verbal Aptitude
gatecse-2019
verbal-aptitude
verbal-reasoning
2-marks
+
–
1
votes
5
made easy
Consider Dijkstra's algorithm in the link state routing protocol at node u,professor Ram first sets the route for each directly connected node v to be the link connecting u to v.Ram then implements the rest of the algorithm correctly,aiming to produce a minimum-cost routes, ... link costs where all routing table entry (other than from u to itself) will be correct. D)Both (A) and (B)
Consider Dijkstra's algorithm in the link state routing protocol at node u,professor Ram first sets the route for each directly connected node v to be the link connecting...
794
views
answered
Feb 14, 2019
0
votes
6
Madeeasy
S : r1(A), r2(A), r3(A), r4(A), w1(B), w2(B), w3(B), w4(B) The number of serial schedules equal to schedule(S) but not conflict equal to schedule(S) answer given is 5. What i understood is for schedule to be serial. r1(A) & w1(B) must be together. Similarly r2( ... ) must be last one to write B. But we can order T1, T2 &T3 in any order. 3! =6 So I am getting 6 as answer , but not 5
S : r1(A), r2(A), r3(A), r4(A), w1(B), w2(B), w3(B), w4(B) The number of serial schedules equal to schedule(S) but not conflict equal to schedule(S)answer given is 5.What...
790
views
answered
Jan 22, 2019
1
votes
7
GATE IT 2004 | Question: 50
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by $\text{20%}$ and the speed of a fixed point unit has been increased by $\text{10%}$. What is the overall speedup achieved if the ratio of the number of ... to take twice the time taken by the fixed point operation in the original design? $1.155$ $1.185$ $1.255$ $1.285$
In an enhancement of a design of a CPU, the speed of a floating point unit has been increased by $\text{20%}$ and the speed of a fixed point unit has been increased by $\...
19.2k
views
answered
Oct 30, 2018
CO and Architecture
gateit-2004
normal
co-and-architecture
speedup
+
–
6
votes
8
GATE CSE 1999 | Question: 13
An instruction pipeline consists of $4$ stages - Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction sequence need these stages for the different number of clock cycles as shown by the ... $5$ instructions.
An instruction pipeline consists of $4$ stages – Fetch $(F)$, Decode field $(D)$, Execute $(E)$ and Result Write $(W)$. The $5$ instructions in a certain instruction se...
10.7k
views
answered
Oct 28, 2018
CO and Architecture
gate1999
co-and-architecture
pipelining
normal
numerical-answers
+
–
17
votes
9
GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.
Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.
4.6k
views
answered
Oct 11, 2018
Digital Logic
gate1990
descriptive
digital-logic
combinational-circuit
multiplexer
+
–
1
votes
10
GATE IT 2008 | Question: 34
Consider a CFG with the following productions. $S \to AA \mid B$ $A \to 0A \mid A0 \mid 1$ $B \to 0B00 \mid 1$ $S$ is the start symbol, $A$ and $B$ ... $\{0, 1\}$ containing at least two $0$'s
Consider a CFG with the following productions.$S \to AA \mid B$$A \to 0A \mid A0 \mid 1$$B \to 0B00 \mid 1$$S$ is the start symbol, $A$ and $B$ are non-terminals and 0 an...
15.1k
views
answered
Aug 26, 2018
Theory of Computation
gateit-2008
theory-of-computation
context-free-language
normal
+
–
1
votes
11
GATE CSE 1989 | Question: 2-iii
Match the pairs in the following: ... 2)$} &\text{(s)} & \text{Selection of the $k^{th}$ smallest element in a set of $n$ elements} \\\hline \end{array}$
Match the pairs in the following:$$\begin{array}{ll|ll}\hline \text{(A)} & \text{$O (\log n)$} & \text{(p)} & \text{Heapsort} \\\hline \text{(B)} & \text{$O (n)$} & \tex...
5.7k
views
answered
Aug 15, 2018
Algorithms
gate1989
match-the-following
algorithms
time-complexity
+
–
2
votes
12
GATE CSE 2010 | Question: 52
A hash table of length $10$ uses open addressing with hash function $h(k) = k \mod 10$, and linear probing. After inserting $6$ ... $34, 42, 23, 52, 33, 46$ $46, 34, 42, 23, 52, 33$ $42, 46, 33, 23, 34, 52$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \mod 10$, and linear probing. After inserting $6$ values into an empty hash table, the table...
6.7k
views
answered
Jul 28, 2018
DS
gatecse-2010
data-structures
hashing
normal
+
–
3
votes
13
GATE CSE 1997 | Question: 17
An array $A$ contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ ... ◻ end else begin if(j-i) < min then min:=j-i; sum:=sum -A[i]; i:=i+1; end writeln (min +1); end.
An array $A$ contains $n \geq 1$ positive integers in the locations $A , A , \dots A[n]$. The following program fragment prints the length of a shortest sequence of conse...
5.1k
views
answered
Jul 22, 2018
DS
gate1997
data-structures
array
normal
descriptive
+
–
3
votes
14
GATE CSE 1991 | Question: 01,x
Consider the following recursive definition of $fib$: fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2) The number of times $fib$ is called (including the first call) for evaluation of $fib(7)$ is___________.
Consider the following recursive definition of $fib$:fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2)The number of times $fib$ is called (includin...
10.3k
views
answered
Jul 21, 2018
Programming in C
gate1991
programming
recursion
normal
numerical-answers
+
–
1
votes
15
GATE CSE 1999 | Question: 2.5
Given the programming constructs assignment for loops where the loop parameter cannot be changed within the loop if-then-else forward go to arbitrary go to non-recursive procedure call recursive procedure/function call repeat loop, which constructs will you not include in a programming language ... $\text{(vi), (vii), (viii)}$ $\text{(iii), (vii), (viii)}$
Given the programming constructsassignmentfor loops where the loop parameter cannot be changed within the loopif-then-elseforward go toarbitrary go tonon-recursive proced...
12.7k
views
answered
Jul 14, 2018
Programming in C
gate1999
programming
normal
programming-constructs
+
–
3
votes
16
GATE CSE 2014 Set 3 | Question: 54
Consider the following relational schema: employee (empId,empName,empDept) customer (custId,custName,salesRepId,rating) salesRepId is a foreign key referring to empId of the employee relation. Assume that each employee makes a sale to at least one ... a 'GOOD' rating. Names of all the employees with all their customers having a 'GOOD' rating.
Consider the following relational schema:employee (empId,empName,empDept) customer (custId,custName,salesRepId,rating) salesRepId is a foreign key referring to empId of t...
16.7k
views
answered
Jul 8, 2018
Databases
gatecse-2014-set3
databases
sql
easy
+
–
2
votes
17
TIFR CSE 2010 | Part B | Question: 33
In a relational database there are three relations: $Customers = C \textsf{(CName)}$ $Shops = S \textsf{(SName)}$ $Buys = B \textsf{(CName, SName)}$ Then the Relational Algebra expression ( $\Pi $ ... from at least two shops. Customers who buy from all shops. Customers who do not buy buy anything at all. None of the above.
In a relational database there are three relations:$Customers = C \textsf{(CName)}$$Shops = S \textsf{(SName)}$$Buys = B \textsf{(CName, SName)}$Then the Relational Algeb...
3.8k
views
answered
Jul 5, 2018
Databases
tifr2010
databases
relational-algebra
+
–
5
votes
18
GATE CSE 2002 | Question: 2.22
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on the size of the blocks, and the size of the address of the blocks. the number of blocks used for the index, and the size of the blocks. the size of the blocks, the number of blocks used for the index, and the size of the address of the blocks. None of the above
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends onthe size of the blocks, and the size of the address of the blocks.the ...
14.7k
views
answered
Jul 3, 2018
Operating System
gatecse-2002
operating-system
normal
file-system
+
–
1
votes
19
GATE IT 2007 | Question: 84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....
16.3k
views
answered
Jun 30, 2018
Databases
gateit-2007
databases
b-tree
normal
+
–
0
votes
20
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
43.4k
views
answered
Jun 24, 2018
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
3
votes
21
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a mess...
19.2k
views
answered
Jun 19, 2018
Computer Networks
gateit-2007
computer-networks
routing
binary-tree
normal
+
–
170
votes
22
GATE IT 2006 | Question: 66
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and the Inter-Packet-Gap). The maximum packet processing time at the router for wirespeed forwarding to be possible is (in microseconds) $0.01$ $3.36$ $6.72$ $8$
A router has two full-duplex Ethernet interfaces each operating at $100$ $\text{Mb/s}$. Ethernet frames are at least $84$ $\text{bytes}$ long (including the Preamble and ...
22.4k
views
answered
Jun 17, 2018
Computer Networks
gateit-2006
computer-networks
lan-technologies
ethernet
normal
+
–
32
votes
23
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$
Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r...
15.8k
views
answered
Jun 16, 2018
Computer Networks
gateit-2008
computer-networks
normal
error-detection
+
–
4
votes
24
GATE IT 2005 | Question: 74
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have bit error probability of $b_1$ and $b_2$ respectively. The probability that the packet will be received without ... $[1 - (b_1 + b_2)^L]p_1p_2$ $(1 - b_1)^L (1 - b_2)^Lp_1p_2$ $1 - (b_1^Lp_1 + b_2^Lp_2)$
In a communication network, a packet of length $L$ bits takes link $L_1$ with a probability of $p_1$ or link $L_2$ with a probability of $p_2$. Link $L_1$ and $L_2$ have ...
9.0k
views
answered
Jun 16, 2018
Computer Networks
gateit-2005
computer-networks
error-detection
probability
normal
+
–
2
votes
25
GATE CSE 2006 | Question: 06, ISRO2009-14
Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $1$ $2$ $3$ $4$
Consider three CPU-intensive processes, which require $10$, $20$ and $30$ time units and arrive at times $0$, $2$ and $6$, respectively. How many context switches are nee...
16.1k
views
answered
Jun 9, 2018
Operating System
gatecse-2006
operating-system
process-scheduling
normal
isro2009
+
–
2
votes
26
GATE CSE 2000 | Question: 20
a. Fill in the boxes below to get a solution for the reader-writer problem, using a single binary semaphore, mutex (initialized to $1$) and busy waiting. Write the box numbers ($1$, $2$ and $3$), and their contents in your answer book. int R = 0, W = ... ...../*do the write*/ wait( mutex); W=0; signal (mutex); } b. Can the above solution lead to starvation of writers?
a. Fill in the boxes below to get a solution for the reader-writer problem, using a single binary semaphore, mutex (initialized to $1$) and busy waiting. Write the box nu...
9.9k
views
answered
Jun 4, 2018
Operating System
gatecse-2000
operating-system
process-synchronization
normal
descriptive
+
–
1
votes
27
CMI2014-A-02
The $12$ houses on one side of a street are numbered with even numbers starting at $2$ and going up to $24$. A free newspaper is delivered on Monday to $3$ different houses chosen at random from these $12$. Find the probability that at least $2$ of these newspapers are delivered to ... with numbers strictly greater than $14$. $\frac{7}{11}$ $\frac{5}{12}$ $\frac{4}{11}$ $\frac{5}{22}$
The $12$ houses on one side of a street are numbered with even numbers starting at $2$ and going up to $24$. A free newspaper is delivered on Monday to $3$ different hous...
2.2k
views
answered
May 26, 2018
Probability
cmi2014
probability
+
–
0
votes
28
TIFR CSE 2011 | Part A | Question: 1
If either wages or prices are raised, there will be inflation. If there is inflation, then either the government must regulate it or the people will suffer. If the people suffer, the government will be unpopular. Government will not be ... raised Prices are not raised If the inflation is not regulated, then the prices are not raised Wages are not raised
If either wages or prices are raised, there will be inflation.If there is inflation, then either the government must regulate it or the people will suffer.If the people s...
3.0k
views
answered
May 6, 2018
Mathematical Logic
tifr2011
mathematical-logic
propositional-logic
normal
+
–
2
votes
29
GATE IT 2007 | Question: 21
Which one of these first-order logic formulae is valid? $\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall xQ\left(x\right)\right)$ ... $\forall x \exists y P\left(x, y\right)\implies \exists y \forall x P\left(x, y\right)$
Which one of these first-order logic formulae is valid?$\forall x\left(P\left(x\right) \implies Q\left(x\right)\right) \implies \left(∀xP\left(x\right)\implies \forall ...
10.6k
views
answered
May 5, 2018
Mathematical Logic
gateit-2007
mathematical-logic
normal
first-order-logic
+
–
3
votes
30
GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct?S1: Each row of $M$ can be represented as a linear combination of...
9.8k
views
answered
Apr 29, 2018
Linear Algebra
gateit-2008
linear-algebra
normal
matrix
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register