Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Bhupendra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Bhupendra
4
answers
1
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported ...
21.5k
views
commented
Feb 12, 2020
DS
gatecse-2020
data-structures
binary-search-tree
2-marks
+
–
4
answers
2
GATE CSE 2020 | Question: 48
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob(b ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.
Consider the following C functions.int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } ret...
11.3k
views
commented
Feb 12, 2020
Algorithms
gatecse-2020
numerical-answers
identify-function
2-marks
+
–
7
answers
3
GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which the signal handling routine executes? User mode Kernel mode Superuser mode Privileged mode
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When ...
11.0k
views
commented
Oct 3, 2019
Operating System
gateit-2005
operating-system
os-protection
normal
ugcnetcse-june2012-paper3
+
–
1
answer
4
Hashing
1.6k
views
commented
Sep 10, 2019
2
answers
5
GATE CSE 1990 | Question: 13a
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$ (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig$.5$ using node D of tree $T_{1}$. (ii) What is the ... where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$(i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}...
3.8k
views
commented
Sep 4, 2019
DS
gate1990
data-structures
tree
descriptive
+
–
0
answers
6
Admission query
Hii , can anyone tell me what specialization to choose between CSE and MATHEMATICS AND COMPUTING? which is best keeping in mind the government jobs like ISRO,AAI,BHSPCL ETC.
Hii , can anyone tell me what specialization to choose between CSE and MATHEMATICS AND COMPUTING? which is best keeping in mind the government jobs like ISRO,AAI,BHSPCL E...
276
views
commented
Mar 24, 2019
0
answers
7
Gate2020
Can anyone please suggest me what is the best youtube video lecture series on C programming for gate.
Can anyone please suggest me what is the best youtube video lecture series on C programming for gate.
470
views
commented
Mar 24, 2019
GATE Application
self-doubt
+
–
2
answers
8
NIELIT 2018-5
Suppose a fraud shopkeeper sells rice to the customer at the cost price, but he uses a false weight of $900$ gm for a kg then his percentage gain is ______ $5.75 \%$ $5.56 \%$ $5.20 \%$ $5.00 \%$
Suppose a fraud shopkeeper sells rice to the customer at the cost price, but he uses a false weight of $900$ gm for a kg then his percentage gain is ______$5.75 \%$$5.56 ...
6.5k
views
commented
Mar 12, 2019
Quantitative Aptitude
nielit-2018
general-aptitude
quantitative-aptitude
profit-loss
+
–
0
answers
9
Locality of Rference(OS+DS) (ACE)
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference? Linear search on linked list Binary search on array Linear search on array Binary search on linked list
An OS uses virtual memory with paging technique for memory allocation. Which of the following searching technique on given data structure use locality of reference?Linear...
1.2k
views
commented
Mar 2, 2019
Programming in C
array
linked-list
+
–
6
answers
10
GATE CSE 2019 | Question: 23
Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ ... values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $Y-X$ is ______
Consider three concurrent processes $P_1, P_2$ and $P_3$ as shown below, which access a shared variable $D$ that has been initialized to $100.$ $$\begin{array}{|c|c|c|} \...
16.9k
views
commented
Feb 7, 2019
Operating System
gatecse-2019
numerical-answers
operating-system
process-synchronization
1-mark
+
–
9
answers
11
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.1k
views
commented
Jan 30, 2019
Linear Algebra
gatecse-2017-set1
linear-algebra
system-of-equations
normal
+
–
6
answers
12
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ and the number of segments are given below.$$\small \begin{array}{|c|c|c|}\h...
28.7k
views
commented
Jan 29, 2019
Operating System
gateit-2006
operating-system
memory-management
difficult
+
–
0
answers
13
MadeEasy Test Series: Digital Logic - Digital Counter
740
views
commented
Jan 26, 2019
Digital Logic
made-easy-test-series
digital-logic
flip-flop
digital-counter
+
–
1
answer
14
self doubt
Consider a byte addressable computer that has a physical address space of 512 bytes. The computeruses a simple, one level virtual memory system. The page table is always in physical memory. Thepage size is specified as 8 bytes and the virtual address space is 2 KB ... 2bytes. The replacement policy is LRU. How many bits of the virtual page number are used to index intothe cache? Ans. 4
Consider a byte addressable computer that has a physical address space of 512 bytes. The computeruses a simple, one level virtual memory system. The page table is always ...
549
views
commented
Jan 20, 2019
Operating System
operating-system
+
–
0
answers
15
ME test series
501
views
comment reshown
Jan 11, 2019
1
answer
16
Gateforum Test Series: Set Theory & Algebra - Sets
404
views
commented
Jan 9, 2019
Set Theory & Algebra
gateforum-test-series
set-theory&algebra
set-theory
+
–
0
answers
17
prime Imp
Consider the function f(P,Q,R,S)=Σ(0,5,7,8,10,13,15) + Σd(1,2,3,9). The number of prime implicants for the function is
Consider the function f(P,Q,R,S)=Σ(0,5,7,8,10,13,15) + Σd(1,2,3,9). The number of prime implicants for the function is
555
views
commented
Jan 5, 2019
Digital Logic
digital-logic
prime-implicants
+
–
3
answers
18
no of essential prime implicants
for given boolean function what will b the no of prime implicants and no of essential prime implicants F(A,B,C,D)=Σm (1,3,4,5,9,11,14,15) +d(2,6,7,8) where d represents dont cares.
for given boolean function what will b the no of prime implicants and no of essential prime implicantsF(A,B,C,D)=Σm (1,3,4,5,9,11,14,15) +d(2,6,7,8) where d represents ...
3.8k
views
commented
Jan 4, 2019
Digital Logic
digital-logic
k-map
prime-implicants
+
–
0
answers
19
dbms nptel
Q6:Which of the following statements are not true? A. Superset of a superkey is also a superkey. B. Superset of a candidate key is a superkey. C. Subset of a candidate key can be a superkey. D. Proper subset of a candidate key is also a candidate key
Q6:Which of the following statements are not true?A. Superset of a superkey is also a superkey.B. Superset of a candidate key is a superkey.C. Subset of a candidate key c...
360
views
asked
Jan 4, 2019
Databases
databases
+
–
0
answers
20
dbms-key
Q6:Which of the following statements arenottrue? A. Superset of a superkey is also a superkey. B. Superset of a candidate key is a superkey. C. Subset of a candidate key can be a superkey. D. Proper subset of a candidate key is also a candidate key
Q6:Which of the following statements arenottrue?A. Superset of a superkey is also a superkey.B. Superset of a candidate key is a superkey.C. Subset of a candidate key can...
665
views
asked
Jan 4, 2019
3
answers
21
GATE CSE 1994 | Question: 21
Consider the following recursive function: function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end; The above function is run on a computer with a stack of $64$ bytes. Assuming ... an address takes $2$ bytes each, estimate the maximum value of $n$ for which the stack will not overflow. Give reasons for your answer.
Consider the following recursive function:function fib (n:integer);integer; begin if (n=0) or (n=1) then fib := 1 else fib := fib(n-1) + fib(n-2) end;The above function i...
25.4k
views
commented
Jan 1, 2019
Programming in C
gate1994
programming
recursion
normal
descriptive
+
–
5
answers
22
GATE CSE 2003 | Question: 73
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by need parameter passing mechanism, the values printed by the above program are: $115, 220$ $25, 220$ $25, 15$ $115, 105$
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions.global int i=100, j=5...
9.1k
views
commented
Jan 1, 2019
Programming in C
gatecse-2003
compiler-design
normal
runtime-environment
parameter-passing
+
–
0
answers
23
self doubt
if anyone have previous year math question of gate of all branches please share by google drive and share link. please friends. Thankyou.
if anyone have previous year math question of gate of all branches please share by google drive and share link.please friends.Thankyou.
224
views
commented
Dec 30, 2018
Mathematical Logic
discrete-mathematics
+
–
7
answers
24
GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...
29.9k
views
commented
Dec 30, 2018
Computer Networks
gatecse-2009
computer-networks
sliding-window
normal
+
–
6
answers
25
GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error?$G(x)$ contai...
28.9k
views
commented
Dec 29, 2018
Computer Networks
gatecse-2009
computer-networks
error-detection
normal
+
–
6
answers
26
GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertice...
6.2k
views
answered
Dec 22, 2018
Set Theory & Algebra
gatecse-2000
set-theory&algebra
normal
descriptive
set-theory
+
–
6
answers
27
GATE CSE 2003 | Question: 39
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows: $g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$. Let $p_i$ denote the i-th prime number $\left(p_1 = 2\right)$ ... numbers is the encoding, $h$, of a non-empty sequence of strings? $2^73^75^7$ $2^83^85^8$ $2^93^95^9$ $2^{10}3^{10}5^{10}$
Let $\Sigma = \left\{a, b, c, d, e\right\}$ be an alphabet. We define an encoding scheme as follows:$g(a) = 3, g(b) = 5, g(c) = 7, g(d) = 9, g(e) = 11$.Let $p_i$ denote t...
7.4k
views
commented
Dec 22, 2018
Set Theory & Algebra
gatecse-2003
set-theory&algebra
functions
normal
+
–
0
answers
28
DLD maximum clock frequency doubt
How to approach this kind of problem ?please provide the detailed approach .
How to approach this kind of problem ?please provide the detailed approach .
642
views
commented
Dec 22, 2018
Digital Logic
digital-logic-clock-frequency
+
–
12
answers
29
GATE CSE 2015 Set 3 | Question: 24
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always l...
17.6k
views
commented
Dec 22, 2018
Mathematical Logic
gatecse-2015-set3
mathematical-logic
difficult
logical-reasoning
+
–
9
answers
30
GATE CSE 2017 Set 1 | Question: 51
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur due to the contention of multiple blocks for the same cache set. Compulsory ... $10$ times. The number of conflict misses experienced by the cache is _________ .
Consider a $2$-way set associative cache with $256$ blocks and uses $\text{LRU}$ replacement. Initially the cache is empty. Conflict misses are those misses which occur d...
38.4k
views
commented
Nov 7, 2018
CO and Architecture
gatecse-2017-set1
co-and-architecture
cache-memory
conflict-misses
normal
numerical-answers
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register