Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
kirtipurohit
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by kirtipurohit
4
answers
1
GATE CSE 2016 Set 1 | Question: 45
The attribute of three arithmetic operators in some programming language are given below. ... $2-5+1-7*3$ in this language is ________.
The attribute of three arithmetic operators in some programming language are given below.$$\begin{array}{|c|l|}\hline \textbf{OPERATOR} & \textbf{PRECEDENCE} & \textbf{...
10.0k
views
commented
Feb 3, 2022
Compiler Design
gatecse-2016-set1
compiler-design
parsing
normal
numerical-answers
+
–
1
answer
2
time complexity of recursive program
What is the time complexity of the following code snippet? Assume "statement" takes $O(1)$ time. int x=0; int A(n) { statement; if(n==1)return 1; else { x + = 4A(n/2)+n^{2} return (x); } } $A)\theta(n^{2}logn)$ $B)\theta(logn)$ $C)\theta(n^{2})$ $D)\theta(nlogn)$
What is the time complexity of the following code snippet? Assume "statement" takes $O(1)$ time.int x=0; int A(n) { statement; if(n==1)return 1; else { ...
1.5k
views
commented
Jan 9, 2022
Algorithms
algorithms
time-complexity
+
–
1
answer
3
MadeEasy Test Series: Algorithms - Time Complexity
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
For merging two unsorted list of size m and n into sorted list of size (m+n). The time complexity in terms of no. of comparison for this is?
1.1k
views
commented
Jan 9, 2022
Algorithms
made-easy-test-series
algorithms
time-complexity
+
–
0
answers
4
GATEBOOK
Please mention proper approach to solve similar questions
Please mention proper approach to solve similar questions
581
views
commented
Jan 9, 2022
Algorithms
time-complexity
algorithms
+
–
15
answers
5
GATE CSE 2007 | Question: 15, ISRO2016-26
Consider the following segment of C-code: int j, n; j = 1; while (j <= n) j = j * 2; The number of comparisons made in the execution of the loop for any $n > 0$ is: $\lceil \log_2n \rceil +1$ $n$ $\lceil \log_2n \rceil$ $\lfloor \log_2n \rfloor +1$
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
36.7k
views
commented
Dec 22, 2021
Algorithms
gatecse-2007
algorithms
time-complexity
normal
isro2016
+
–
1
answer
6
Dependency preserving decompostion
A relation $R(ABCD)$ is given FD set = $\{ AB\rightarrow CD , D\rightarrow A \}$ R1(ABC) R2(AD) R3(BCD) Test Dependencies in R1, R2 ,R3 ? Pls explain the solution in detail.....
A relation $R(ABCD)$ is givenFD set = $\{ AB\rightarrow CD , D\rightarrow A \}$R1(ABC)R2(AD)R3(BCD)Test Dependencies in R1, R2 ,R3 ? Pls explain the solution in detail.....
414
views
commented
Dec 22, 2021
Databases
databases
dependency-preserving
+
–
3
answers
7
ACE Test Series : dependency preserving
R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition? A->B, B->C A->B,B->C,C->A AB->C,C->A None of these
R(A,B,C) is a relation.Which of the following don't have dependency preserving BCNF decomposition?A->B, B->CA->B,B->C,C->AAB->C,C->ANone of these
899
views
commented
Dec 22, 2021
Databases
ace-test-series
databases
dependency-preserving
bcnf-decomposition
+
–
1
answer
8
#DBMS #dependency
What is the number of redundent FD’s possible for given set of FD , A->B, B->C,C->D for relation R(ABCD)?? please explain in detail.
What is the number of redundent FD’s possible for given set of FD , A->B, B->C,C->D for relation R(ABCD)?? please explain in detail.
890
views
commented
Dec 22, 2021
Databases
databases
data-dependency
dependency-preserving
rdbms
+
–
4
answers
9
Conditional probability
2.5k
views
commented
Nov 14, 2021
Quantitative Aptitude
probability
+
–
3
answers
10
Heapsort Comparisons
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they were initially in sorted order, initially in reverse sorted order?
How many element comparisons would heap sort use to sort the integers $1$ to $8$ if they wereinitially in sorted order, initially in reverse sorted order?
3.4k
views
commented
Sep 27, 2021
DS
data-structures
heap-sort
+
–
7
answers
11
GATE CSE 2004 | Question: 14
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
Consider the following relation schema pertaining to a students database:Students (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are s...
28.4k
views
commented
Sep 20, 2021
Databases
gatecse-2004
databases
easy
joins
natural-join
+
–
4
answers
12
GATE CSE 2012 | Question: 18
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
Let $W(n) $ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWA...
14.2k
views
commented
Aug 7, 2021
Algorithms
gatecse-2012
algorithms
easy
asymptotic-notation
+
–
5
answers
13
GATE CSE 2015 Set 3 | Question: 4
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$: $\Theta(n^4)$ $\Theta(n^5)$ $O(n^5)$ $\Omega(n^3)$ The equality above remains correct if $X$ is replaced by Only I Only II I or III or IV but not II II or III or IV but not I
Consider the equality $\displaystyle{\sum_{i=0}^n} i^3 = X$ and the following choices for $X$:$\Theta(n^4)$$\Theta(n^5)$$O(n^5)$$\Omega(n^3)$The equality above remains co...
16.5k
views
commented
Aug 7, 2021
Algorithms
gatecse-2015-set3
algorithms
asymptotic-notation
normal
+
–
7
answers
14
GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes?$5$$4$$3$$2$
51.9k
views
commented
Aug 5, 2021
Graph Theory
gateit-2008
normal
graph-connectivity
+
–
16
answers
15
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...
15.4k
views
commented
Aug 4, 2021
Combinatory
gatecse-2015-set3
combinatory
normal
numerical-answers
+
–
4
answers
16
GATE CSE 2015 Set 1 | Question: 5
If $g(x) = 1 - x$ and $h(x) = \frac{x}{x-1}$, then $\frac{g(h(x))}{h(g(x))}$ is: $\frac{h(x)}{g(x)}$ $\frac{-1}{x}$ $\frac{g(x)}{h(x)}$ $\frac{x}{(1-x)^{2}}$
If $g(x) = 1 - x$ and $h(x) = \frac{x}{x-1}$, then $\frac{g(h(x))}{h(g(x))}$ is:$\frac{h(x)}{g(x)}$$\frac{-1}{x}$$\frac{g(x)}{h(x)}$$\frac{x}{(1-x)^{2}}$
6.4k
views
commented
Aug 2, 2021
Set Theory & Algebra
gatecse-2015-set1
set-theory&algebra
functions
normal
+
–
3
answers
17
mtu
Suppose that host A is connected to a router R 1, R 1 is connected to another router, R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900 bytes of data and 20 bytes of TCP header is passed to the IP code at host A for ... 512 bytes, including an 8-byte frame header, and link R2-B can support a maximum frame size of 512 bytes including a 12-byte frame header.
Suppose that host A is connected to a router R 1, R 1 is connected to another router,R 2, and R 2 is connected to host B. Suppose that a TCP message that contains 900byte...
11.1k
views
answered
Jul 29, 2021
2
answers
18
Tanenbaum- Q30(Network layer)
The CPU in a router can process 2 million packets/sec. The load offered to it is 1.5 million packets/sec. If a route from source to destination contains 10 routers, how much time is spent being queued and serviced by the CPUs?
The CPU in a router can process 2 million packets/sec. The load offered to it is 1.5million packets/sec. If a route from source to destination contains 10 routers, howmuc...
3.0k
views
answered
Jul 29, 2021
7
answers
19
GATE CSE 2010 | Question: 54
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram. All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its ... stabilize, how many links in the network will never be used for carrying any data? $4$ $3$ $2$ $1$
Consider a network with $6$ routers $\textbf{R1}$ to $\textbf{R6}$ connected with links having weights as shown in the following diagram.All the routers use the distance ...
23.4k
views
commented
Jul 29, 2021
Computer Networks
gatecse-2010
computer-networks
routing
distance-vector-routing
normal
+
–
2
answers
20
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 20 (Page No. 352)
How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
How many frames per second can gigabit Ethernet handle? Think carefully and takeinto account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.
1.3k
views
answered
Jul 28, 2021
Computer Networks
computer-networks
ethernet
tanenbaum
lan-technologies
+
–
1
answer
21
Andrew S. Tanenbaum Edition 5th Exercise 4 Question 19 (Page No. 352)
Some books quote the maximum size of an Ethernet frame as 1522 bytes instead of 1500 bytes. Are they wrong? Explain your answer.
Some books quote the maximum size of an Ethernet frame as 1522 bytes instead of1500 bytes. Are they wrong? Explain your answer.
960
views
answered
Jul 28, 2021
Computer Networks
computer-networks
tanenbaum
ethernet
data-link-layer
lan-technologies
+
–
5
answers
22
Sliding Window Protocol Question 1
Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknowledgement timer were eliminated unnecessary timout would occur . How any times average msg would have been transimitted ? a) Only once b) Twice C) thrice d) None
Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknow...
4.4k
views
answered
Jul 27, 2021
Computer Networks
sliding-window
computer-networks
+
–
4
answers
23
ISRO2018-71
A particular parallel program computation requires $100$ sec when executed on a single processor, if $40\%$ of this computation is inherently sequential (i.e. will not benefit from additional processors), then theoretically best possible elapsed times of this program running with $2$ and $4$ ... sec and $10$ sec $30$ sec and $15$ sec $50$ sec and $25$ sec $70$ sec and $55$ sec
A particular parallel program computation requires $100$ sec when executed on a single processor, if $40\%$ of this computation is inherently sequential (i.e. will not be...
4.8k
views
commented
Jul 24, 2021
CO and Architecture
isro2018
co-and-architecture
parallel-programming
+
–
3
answers
24
UGC NET CSE | December 2014 | Part 3 | Question: 50
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the disk block number is stored in $32$ bits. $1024$ blocks $16794$ blocks $20000$ blocks $1048576$ blocks
How many disk blocks are required to keep list of free disk blocks in a $16$ GB hard disk with $1$ kB block size using linked list of free disk blocks ? Assume that the d...
5.8k
views
commented
Jul 24, 2021
Operating System
ugcnetcse-dec2014-paper3
operating-system
file-system
+
–
2
answers
25
GATE CSE 2004 | Question: 67
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field of $13$ bits, a next address field $(X),$ and a MUX select field $(Y).$ There are $8$ status bits in the ... of the control memory in number of words? $10, 3, 1024$ $8, 5, 256$ $5, 8, 2048$ $10, 3, 512$
The microinstructions stored in the control memory of a processor have a width of $26$ bits. Each microinstruction is divided into three fields: a micro-operation field o...
13.4k
views
commented
Jul 21, 2021
CO and Architecture
gatecse-2004
co-and-architecture
microprogramming
normal
+
–
1
answer
26
Which book is best for calculus?
Between Higher engineering mathematics and Gilbert Strang which one is more appropriate for GATE?
Between Higher engineering mathematics and Gilbert Strang which one is more appropriate for GATE?
1.5k
views
commented
Jul 18, 2021
Calculus
study-resources
+
–
4
answers
27
GATE CSE 1996 | Question: 2.6
The matrices $\begin{bmatrix} \cos\theta && -\sin\theta \\ \sin\theta && \cos\theta \end{bmatrix}$ and $\begin{bmatrix} a && 0\\ 0&& b \end{bmatrix}$ commute under multiplication if $a=b \text{ or } \theta = n\pi, n$ an integer always never if $a \cos\theta = b \sin\theta$
The matrices $\begin{bmatrix} \cos\theta && -\sin\theta \\ \sin\theta && \cos\theta \end{bmatrix}$ and $\begin{bmatrix} a && 0\\ 0&& b \end{bmatrix}$ commute under multip...
5.3k
views
commented
Jul 6, 2021
Linear Algebra
gate1996
linear-algebra
normal
matrix
+
–
6
answers
28
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...
12.8k
views
commented
Jul 5, 2021
Set Theory & Algebra
gatecse-2002
set-theory&algebra
normal
relations
+
–
2
answers
29
GATE CSE 1987 | Question: 9e
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
How many true inclusion relations are there of the form $A \subseteq B$, where $A$ and $B$ are subsets of a set $S$ with $n$ elements?
3.1k
views
commented
Jul 3, 2021
Set Theory & Algebra
gate1987
set-theory&algebra
relations
descriptive
+
–
1
answer
30
Ullman Exercise
What language is generated by the following grammer? S→ a | S+S | SS | S* | (S)
What language is generated by the following grammer?S→ a | S+S | SS | S* | (S)
434
views
commented
Feb 27, 2021
Compiler Design
compiler-design
context-free-grammar
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register