Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User shikhar500
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by shikhar500
6
answers
1
GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
commented
in
Databases
Jan 29, 2023
11.3k
views
gatecse-2003
databases
transaction-and-concurrency
normal
9
answers
2
GATE CSE 2006 | Question: 80
A CPU has a $32 KB$ direct mapped cache with $128$ byte-block size. Suppose A is two dimensional array of size $512 \times512$ with elements that occupy $8$-bytes each. Consider the following two C code segments, $P1$ and $P2$. P1: for (i=0; i<512; i++) { for (j=0; ... $P1$ be $M_{1}$and that for $P2$ be $M_{2}$. The value of $M_{1}$ is: $0$ $2048$ $16384$ $262144$
commented
in
CO and Architecture
Jan 25, 2023
16.7k
views
gatecse-2006
co-and-architecture
cache-memory
normal
5
answers
3
GATE IT 2005 | Question: 22
A table has fields $F_1, F_2, F_3, F_4, F_5$ with the following functional dependencies $F_1 \to F_3, F_2\to F_4, (F_1 . F_2) \to F_5$ In terms of Normalization, this table is in $1\;\text{NF}$ $2\;\text{NF}$ $3\;\text{NF}$ None of these
commented
in
Databases
Jan 23, 2023
7.2k
views
gateit-2005
databases
database-normalization
easy
2
answers
4
Applied test series
We know that the paging scheme suffers from internal fragmentation. S1 : If the CPU attempts to access the unused portion of the last page, the valid/invalid bits will block such accesses. S2 : A possible solution to handle the internal fragmentation issue is to use multiple page sizes. can anyone plz explain me this ? we have to select from s1 and s2 which is correct
asked
in
Operating System
Jan 8, 2023
463
views
operating-system
test-series
memory-management
11
answers
5
GATE CSE 2015 Set 3 | Question: 26
Consider the following C program #include<stdio.h> int main() { static int a[] = {10, 20, 30, 40, 50}; static int *p[] = {a, a+3, a+4, a+1, a+2}; int **ptr = p; ptr++; printf("%d%d", ptr-p, **ptr); } The output of the program is _______.
commented
in
Programming in C
Jan 6, 2023
22.4k
views
gatecse-2015-set3
programming
programming-in-c
normal
numerical-answers
pointers
6
answers
6
GATE CSE 2017 Set 2 | Question: 37
Consider the C program fragment below which is meant to divide $x$ by $y$ using repeated subtractions. The variables $x$, $y$, $q$ and $r$ are all unsigned int. while (r >= y) { r=r-y; q=q+1; } Which of the following conditions on the variables $x, y, q$ and $r$ ... $(q==0) \ \&\& \ (y>0)$
commented
in
Programming in C
Jan 6, 2023
14.1k
views
gatecse-2017-set2
programming
loop-invariants
9
answers
7
GATE CSE 2014 Set 1 | Question: 43
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this $6$-stage pipeline, the speedup achieved with respect to non-pipelined execution if $25$% of the instructions incur $2$ pipeline stall cycles is ____________
commented
in
CO and Architecture
Jan 5, 2023
19.9k
views
gatecse-2014-set1
co-and-architecture
pipelining
numerical-answers
normal
6
answers
8
GATE CSE 1996 | Question: 2.25
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be: $2$ $2.5$ $10$ $12$
commented
in
CO and Architecture
Dec 29, 2022
24.7k
views
gate1996
co-and-architecture
microprogramming
normal
3
answers
9
GATE CSE 2001 | Question: 1.20
Where does the swap space reside? RAM Disk ROM On-chip cache
commented
in
Operating System
Dec 28, 2022
12.5k
views
gatecse-2001
operating-system
easy
virtual-memory
8
answers
10
GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
commented
in
Digital Logic
Dec 25, 2022
36.8k
views
gatecse-2015-set2
digital-logic
digital-counter
normal
numerical-answers
5
answers
11
GATE CSE 2013 | Question: 48
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = ... while preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3
commented
in
Compiler Design
Dec 21, 2022
28.5k
views
gatecse-2013
normal
compiler-design
target-code-generation
code-optimization
4
answers
12
GATE CSE 2021 Set 2 | Question: 33
A bag has $r$ red balls and $b$ black balls. All balls are identical except for their colours. In a trial, a ball is randomly drawn from the bag, its colour is noted and the ball is placed back into the bag along with another ball of the same colour. Note that the number of ...
commented
in
Probability
Dec 18, 2022
10.7k
views
gatecse-2021-set2
probability
normal
2-marks
4
answers
13
GATE CSE 2014 Set 2 | Question: 48
The probability that a given positive integer lying between $1$ and $100$ (both inclusive) is NOT divisible by $2$, $3$ or $5$ is ______ .
commented
in
Probability
Dec 18, 2022
13.0k
views
gatecse-2014-set2
probability
numerical-answers
normal
4
answers
14
GATE CSE 2015 Set 2 | Question: 1
Consider the following transaction involving two bank accounts $x$ and $y$. read(x); x:=x-50; write (x); read(y); y:=y+50; write(y) The constraint that the sum of the accounts $x$ and $y$ should remain constant is that of Atomicity Consistency Isolation Durability
commented
in
Databases
Dec 15, 2022
14.1k
views
gatecse-2015-set2
databases
transaction-and-concurrency
easy
7
answers
15
GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
commented
in
Databases
Dec 15, 2022
22.6k
views
gatecse-2012
databases
transaction-and-concurrency
normal
1
answer
16
Dijkstra’s algorithm
Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix. What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)? How to solve this kinds of problems ? Changing DS used in one algorithm . Do I need to study the entire algorithm ?
commented
in
Algorithms
Dec 15, 2022
2.7k
views
algorithms
dijkstras-algorithm
2
answers
17
GATE IT 2008 | Question: 12
Which of the following is TRUE? The cost of searching an AVL tree is $\Theta (\log n)$ but that of a binary search tree is $O(n)$ The cost of searching an AVL tree is $\Theta (\log n)$ but that of a complete binary tree is $\Theta (n \log n)$ The cost ... is $\Theta(n)$ The cost of searching an AVL tree is $\Theta (n \log n)$ but that of a binary search tree is $O(n)$
commented
in
DS
Dec 14, 2022
11.8k
views
gateit-2008
data-structures
binary-search-tree
easy
avl-tree
1
answer
18
Made easy test series
The minimum number of registers required by an optimal code generation algorithm (intermediate results can be stored in memory). And if possible solve it using Sethi-Ullman Algorithm.
commented
in
Compiler Design
Dec 9, 2022
1.6k
views
compiler-design
code-generation
made-easy-test-series
numerical-answers
5
answers
19
GATE CSE 2001 | Question: 2.22
Consider Peterson's algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below. repeat flag[i] = true; turn = j; while (P) do no-op; Enter critical section, perform actions, then exit critical section Flag[i] = ... i flag[j] = true and turn = j flag[i] = true and turn = j flag[i] = true and turn = i
commented
in
Operating System
Dec 8, 2022
26.6k
views
gatecse-2001
operating-system
process-synchronization
normal
4
answers
20
GATE CSE 2021 Set 1 | Question: 2
Let $P$ be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct ... $t>\lceil \log_2(n)\rceil \text{ and } t\leq n$
commented
in
DS
Dec 6, 2022
16.5k
views
gatecse-2021-set1
data-structures
array
1-mark
4
answers
21
GATE CSE 2008 | Question: 65
Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? In deadlock prevention, the request for resources is always granted if the resulting state is safe In deadlock avoidance, the request ... safe Deadlock avoidance is less restrictive than deadlock prevention Deadlock avoidance requires knowledge of resource requirements apriori..
commented
in
Operating System
Dec 6, 2022
23.8k
views
gatecse-2008
operating-system
easy
resource-allocation
3
answers
22
GATE CSE 2001 | Question: 1.25
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)$ is always equal to $\sigma_{A=a}(r)$ $r$ $\sigma_{A=a}(r) \bowtie s$ None of the above
commented
in
Databases
Dec 6, 2022
7.3k
views
gatecse-2001
databases
relational-algebra
7
answers
23
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})$
commented
in
Algorithms
Dec 5, 2022
23.6k
views
gatecse-2021-set1
algorithms
recurrence-relation
time-complexity
2-marks
3
answers
24
GATE IT 2007 | Question: 67
Consider the following implications relating to functional and multivalued dependencies given below, which may or may not be correct. if $A \rightarrow \rightarrow B$ and $A \rightarrow \rightarrow C$ then $A \rightarrow BC$ if $A \rightarrow B$ ... then $A \rightarrow \rightarrow C$ Exactly how many of the above implications are valid? $0$ $1$ $2$ $3$
commented
in
Databases
Dec 5, 2022
12.8k
views
gateit-2007
databases
database-normalization
multivalued-dependency-4nf
normal
18
answers
25
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
commented
in
Algorithms
Dec 4, 2022
35.3k
views
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
8
answers
26
GATE CSE 2015 Set 1 | Question: 41
Consider an Entity-Relationship $(\text{ER})$ model in which entity sets $E_{1}$ and $E_{2}$ are connected by an $m:n$ relationship $R_{12}$. $E_{1}$ and $E_{3}$ are connected by a $1 : n$ ($1$ ... from the above $\text{ER}$ model, then the minimum number of relations that would be generated if all relation are in $\text{3NF}$ is________________.
commented
in
Databases
Nov 30, 2022
18.8k
views
gatecse-2015-set1
databases
er-diagram
normal
numerical-answers
6
answers
27
GATE CSE 2012 | Question: 15
Which of the following statements are TRUE about an SQL query? P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used ... Not all attributes used in the GROUP BY clause need to appear in the SELECT clause P and R P and S Q and R Q and S
commented
in
Databases
Nov 30, 2022
39.8k
views
gatecse-2012
databases
easy
sql
ambiguous
0
answers
28
#CompilerDesign #made-easy-test-series
what should be the ans?? according to me answer should be 7 nodes, 8 edges but 5 nodes, 6 edges is given in the answer key! please tell me what am i doing wrong.
commented
in
Compiler Design
Nov 28, 2022
517
views
made-easy-test-series
compiler-design
4
answers
29
GATE CSE 2021 Set 2 | Question: 38
For a statement $S$ in a program, in the context of liveness analysis, the following sets are defined: $\text{USE}(S)$ : the set of variables used in $S$ $\text{IN}(S)$ : the set of variables that are live at the entry of $S$ $\text{OUT}(S)$ : the set of variables ... S_2$) }\cup \text{ OUT ($S_2$)}$ $\text{OUT ($S_1$)} = \text{USE ($S_1$)} \cup \text{IN ($S_2$)}$
commented
in
Compiler Design
Nov 28, 2022
6.7k
views
gatecse-2021-set2
code-optimization
live-variable-analysis
compiler-design
2-marks
7
answers
30
GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
commented
in
Calculus
Nov 27, 2022
17.2k
views
gatecse-2015-set2
continuity
functions
normal
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...