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 supreetshukla
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by supreetshukla
1
vote
1
GATE CSE 2024 | Set 2 | Question: 17
Which of the following statements about the Two Phase Locking ($2 \mathrm{PL}$) protocol is/are TRUE? $2 \mathrm{PL}$ permits only serializable schedules With $2 \mathrm{PL}$, a transaction always locks the data item being read or ... , no more locks on any data item can be obtained inside that transaction A deadlock is possible with $2 \mathrm{PL}$
answered
in
Databases
Feb 16
1.8k
views
gatecse2024-set2
databases
two-phase-locking-protocol
multiple-selects
1
vote
2
GATE CSE 2024 | Set 1 | Question: 11
In a $\mathrm{B}+$ tree, the requirement of at least half-full $(50 \%)$ node occupancy is relaxed for which one of the following cases? Only the root node All leaf nodes All internal nodes Only the leftmost leaf node
answered
in
Databases
Feb 16
2.0k
views
gatecse2024-set1
databases
2
votes
3
GATE CSE 2024 | Set 2 | Question: 46
A functional dependency $F: X \rightarrow Y$ is termed as a useful functional dependency if and only if it satisfies all the following three conditions: $\text{X}$ is not the empty set. $\text{Y}$ is not the empty set. Intersection ... set. For a relation $\text{R}$ with $4$ attributes, the total number of possible useful functional dependencies is __________.
answered
in
Databases
Feb 16
1.5k
views
gatecse2024-set2
numerical-answers
databases
1
vote
4
GATE CSE 2024 | Set 2 | Question: 29
You are given a set $V$ of distinct integers. A binary search tree $T$ is created by inserting all elements of $V$ one by one, starting with an empty tree. The tree $T$ follows the convention that, at each node, all values ... determined from $V$ Preorder traversal of $T$ can be determined from $V$ Postorder traversal of $T$ can be determined from $V$
answered
in
Algorithms
Feb 16
1.8k
views
gatecse2024-set2
algorithms
1
vote
5
GATE CSE 2024 | Set 2 | Question: 25
Let $\text{A}$ be an array containing integer values. The distance of $\text{A}$ is defined as the minimum number of elements in $\text{A}$ that must be replaced with another integer so that the resulting array is sorted in non-decreasing order. The distance of the array $[2,5,3,1,4,2,6]$ is ___________.
answered
in
Algorithms
Feb 16
1.9k
views
gatecse2024-set2
numerical-answers
algorithms
sorting
1
vote
6
GATE CSE 2024 | Set 2 | GA Question: 4
For positive non-zero real variables $x$ and $y$, if \[ \ln \left(\frac{x+y}{2}\right)=\frac{1}{2}[\ln (x)+\ln (y)] \] then, the value of $\frac{x}{y}+\frac{y}{x}$ is $1$ $1 / 2$ $2$ $4$
answered
in
Quantitative Aptitude
Feb 16
2.5k
views
gatecse2024-set2
quantitative-aptitude
logarithms
0
votes
7
GATE CSE 2024 | Set 2 | GA Question: 10
In the $4 \times 4$ array shown below, each cell of the first three rows has either a cross $(X)$ or a number. The number in a cell represents the count of the immediate neighboring cells (left, right, top, bottom, diagonals) NOT having a cross ( $X$ ). ... has no crosses $(X)$, the sum of the four numbers to be filled in the last row is $11$ $10$ $12$ $9$
answered
in
Analytical Aptitude
Feb 16
2.3k
views
gatecse2024-set2
analytical-aptitude
1
vote
8
GATE CSE 2024 | Set 2 | Question: 4
The format of a single-precision floating-point number as per the $\text{IEEE 754}$ standard is: Sign Exponent Mantissa $(1 \mathrm{bit})$ $(8 \mathrm{bits})$ $(23 \mathrm{bits})$ Choose the largest floating- ... $0$ $11111111$ $11111111111111111111111$ Sign Exponent Mantissa $0$ $01111111$ $00000000000000000000000$
answered
in
Digital Logic
Feb 16
2.3k
views
gatecse2024-set2
digital-logic
number-representation
ieee-representation
1
vote
9
GATE CSE 2024 | Set 2 | Question: 9
Once the $\text{DBMS}$ informs the user that a transaction has been successfully completed, its effect should persist even if the system crashes before all its changes are reflected on disk. This property is called durability atomicity consistency isolation
answered
in
Databases
Feb 16
1.9k
views
gatecse2024-set2
databases
transaction-and-concurrency
1
vote
10
GATE CSE 2024 | Set 2 | Question: 10
In the context of owner and weak entity sets in the $\text{ER}$ (Entity-Relationship) data model, which one of the following statements is TRUE? The weak entity set MUST have total participation in the identifying ... in the identifying relationship Neither weak entity set nor owner entity set MUST have total participation in the identifying relationship
answered
in
Databases
Feb 16
1.7k
views
gatecse2024-set2
databases
0
votes
11
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
answered
in
Algorithms
Jan 30, 2023
13.6k
views
gateit-2007
algorithms
graph-algorithm
normal
graph-search
depth-first-search
0
votes
12
back edge and no forward edge
Which does this sentence mean? In BFS of an undirected graph, there are no back edge and no forward edge.
answered
in
DS
Jan 29, 2023
2.5k
views
programming-in-c
data-structures
breadth-first-search
0
votes
13
Applied Gate Test Series
answered
in
CO and Architecture
Jan 25, 2023
373
views
pipelining
computer-architecture
0
votes
14
GATE CSE 2022 | Question: 51
A processor $\text{X}_{1}$ operating at $2 \; \text{GHz}$ has a standard $5-$stage $\text{RISC}$ instruction pipeline having a base $\text{CPI (cycles per instruction)}$ of one without any pipeline hazards. For a given program $\text{P}$ ... $\text{X}_{2}$ over $\text{X}_{1}$ in executing $\text{P}$ is _______________.
answered
in
CO and Architecture
Jan 25, 2023
10.0k
views
gatecse-2022
numerical-answers
co-and-architecture
pipelining
stall
2-marks
0
votes
15
Made easy Gate mock test -1
A Boolean Function must satisfy the condition f(a,b,c) = f(c,b,a). how many such functions are possible?
answered
in
Digital Logic
Jan 24, 2023
827
views
numerical-answers
digital-logic
made-easy-test-series
0
votes
16
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
answered
in
Operating System
Jan 17, 2023
76.2k
views
gatecse-2008
operating-system
virtual-memory
normal
0
votes
17
gate applied mock test -3
Suppose that you wish to design a virtual memory system with the following characteristics: i. The size of a page table entry is 4 bytes. ii. Each page table must fit into a single physical frame. iii. The system must be able to support virtual address ... no more than two levels of page tables. What is the minimum page size that your system must have? 8KB 16KB 32KB none
answered
in
Operating System
Jan 17, 2023
879
views
multilevel-paging
virtual-memory
0
votes
18
Virtual Gate Test Series: Digital Logic - Carry Look Ahead Adder
In a $4-$bit carry look ahead adder, the propagation delay of EX-OR gate is $20ns,$ AND and OR gates is $10ns.$ The sum and carry output of full adder takes $20ns$ and $10ns$ respectively. The total propagation delay of the above adder in $ns$ is
answered
in
Digital Logic
Jan 4, 2023
829
views
digital-logic
combinational-circuit
carry-look-ahead-adder
virtual-gate-test-series
0
votes
19
Applied test series question
A 4-bit carry lookahead adder adds two 4-bit numbers. The adder is designed without making use of the EX-OR gates. The propagation delay for all gates is given as 2.4 time units. What will be the overall delay of adder if we assume that inputs ... AND, Or gates. can someone explain me this in a deatiled manner as i am not able to find the appropriate solution for it ?
answered
in
Digital Logic
Jan 4, 2023
618
views
test-series
digital-logic
adder
0
votes
20
UGC NET CSE | October 2022 | Part 1 | Question: 45
Match List I with List II : List I List II (A) Type $0$ (I) Finite automata (B) Type $1$ (II) Tuning machine (C) Type $2$ (III) Linear bound automata (D) Type $3$ ...
answered
in
Others
Nov 15, 2022
607
views
ugcnetcse-oct2022-paper1
1
vote
21
UGC NET CSE | October 2022 | Part 1 | Question: 59
Match List I with List II : ... $\text{(A)-(II), (B)-(I), (C)-(Iii), (D)-(IV)}$
answered
in
Operating System
Nov 15, 2022
507
views
ugcnetcse-oct2022-paper1
operating-system
–1
vote
22
Zeal Test
Question : Consider a system with 20 bit physical address and direct mapped cache with 64 blocks and block size of 16 bytes To what block number does byte address 1200 mapped??
answered
in
CO and Architecture
Oct 1, 2022
703
views
co-and-architecture
zeal
cache-memory
direct-mapping
0
votes
23
igate test series
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Execution state for addition take 1 clock, multiplication take 3 clock cycles and division take 5 clock cycles. Assume pipeline ... wrong. approch totel 200 in which (100 add having 1 cc) +(25*5-1) +(75*(3-1))=354
answered
in
CO and Architecture
Oct 1, 2022
474
views
co-and-architecture
pipelining
numerical-answers
i-gate-test-series
0
votes
24
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.
answered
in
Computer Networks
Aug 19, 2022
26.3k
views
gatecse-2016-set1
computer-networks
stop-and-wait
normal
numerical-answers
2
votes
25
Applied Test Series
A fair coin is tossed 20 times. The probability of getting the three or more heads in a row is 0.7870 and the probability of getting three or more heads in a row or three or more tails in a row is 0.9791. What is the probability of getting three or more heads in a row and three or more tails in a row________
answered
in
Mathematical Logic
Feb 1, 2022
3.2k
views
0
votes
26
max weighted MST possible
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____ the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure
answered
in
Graph Theory
Jan 15, 2022
729
views
minimum-spanning-tree
0
votes
27
Job Sequencing Problem (Greedy Algorithm)
If job $J=(J_{1},J_{2},J_{3},J_{4})$ are given their processing time $T_{i}=(1,1,2,3)$ and deadline are $D_{i}=(3,4,2,3)$ maximum how many job can be done$?$ $A)1$ $B)2$ $C)3$ $D)All$
answered
in
Algorithms
Jan 15, 2022
12.4k
views
algorithms
greedy-algorithm
algorithm-design
job-scheduling
0
votes
28
MadeEasy Test Series: Digital Logic - K Map
answered
in
Digital Logic
Nov 14, 2021
827
views
made-easy-test-series
digital-logic
minimization
2
votes
29
TIFR CSE 2018 | Part A | Question: 7
Consider the following function definition. void greet(int n) { if(n>0) { printf("hello"); greet(n-1); } printf("world"); } If you run $\textsf{greet(n)}$ ... "helloworld" $\textsf{n+1}$ times "helloworld" $\textsf{n}$ times "helloworld", followed by "world"
answered
in
Programming in C
Apr 11, 2021
2.8k
views
tifr2018
programming
programming-in-c
recursion
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:...