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 priyesh9875
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by priyesh9875
4
answers
1
GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads
comment edited
in
Operating System
Feb 19, 2021
13.3k
views
gatecse-2021-set1
multiple-selects
operating-system
process-synchronization
semaphore
2-marks
2
answers
2
GATE CSE 2021 Set 1 | Question: 13
Suppose a database system crashes again while recovering from a previous crash. Assume checkpointing is not done by the database either during the transactions or during recovery. Which of the following statements is/are correct? The same ... All the transactions that are already undone and redone will not be recovered again The database will become inconsistent
commented
in
Databases
Feb 18, 2021
10.6k
views
gatecse-2021-set1
multiple-selects
databases
transaction-and-concurrency
1-mark
10
answers
3
GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________
comment reshown
in
Operating System
Feb 18, 2020
45.2k
views
gatecse-2020
numerical-answers
operating-system
virtual-memory
2-marks
9
answers
4
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$
commented
in
DS
Feb 12, 2020
26.4k
views
gatecse-2020
linked-list
1-mark
4
answers
5
GATE CSE 2020 | Question: 55
Consider a $\textsf{TCP}$ connection between a client and a server with the following specifications; the round trip time is $6$ ms, the size of the receiver advertised window is $50$ KB, slow-start threshold at the client is $32$ KB, and the ... the size of the congestion window (in $\text{KB}$) at time $t+60$ ms after all acknowledgements are processed is _______
commented
in
Computer Networks
Feb 12, 2020
14.2k
views
gatecse-2020
numerical-answers
computer-networks
tcp
2-marks
3
answers
6
MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
commented
in
Combinatory
Jan 30, 2020
1.5k
views
discrete-mathematics
combinatory
made-easy-test-series
1
answer
7
Made Easy Test Series 2019: Combinatory - Permutations And Combinations
in how many ways 6 letters can be placed in 6 envelopes such that at least 4 letters go into their corresponding envelopes ?
commented
in
Combinatory
Jan 30, 2020
1.1k
views
discrete-mathematics
combinatory
made-easy-test-series
3
answers
8
ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$
commented
in
Databases
Jan 27, 2020
10.1k
views
isro2018
databases
b-tree
0
answers
9
Maths and Aptitude preparation strategy
Please suggest me how to do I start preparing for maths and aptitude as I'm already completing other subjects.(Any links or something which can be helpful) Suggestions will be very helpful. Thanks
commented
in
Mathematical Logic
Jan 26, 2020
542
views
engineering-mathematics
gate-preparation
study-resources
1
answer
10
Bellman Ford
A pseudo code for Bellman Ford where each edge is relaxed k times where k>=1. Let the graph G be a simple connected and undirected graph . Let number of vertices be V, and number of edges be E . int i=1; for( i=1;i<=k;i++) { For each edge (u,v) ... . (ii) For proper running of the algorithm k can be equal to V-1. (iii) For proper running of the algorithm k must be equal to E.
commented
in
Algorithms
Jan 19, 2020
910
views
algorithms
bellman-ford
shortest-path
2
answers
11
Pipelining
commented
in
CO and Architecture
Jan 6, 2020
2.1k
views
pipelining
co-and-architecture
clock-cycles
2
answers
12
GATE Overflow | Programming | Test 1 | Question: 23
The value returned by the following function for foo(10) is ____ int foo(int x) { if(x < 1) return 1; int sum = 0; for(int i = 1; i <= x; i++) { sum += foo(x-i); } return sum; }
commented
in
Programming in C
Jan 5, 2020
1.2k
views
go-programming-1
programming
numerical-answers
2
answers
13
FAQ-5
How to attempt Gate exam ?
commented
in
GATE
Jan 2, 2020
1.8k
views
faq
4
answers
14
CMI2014-A-01
For the inter-hostel six-a-side football tournament, a team of $6$ players is to be chosen from $11$ players consisting of $5$ forwards, $4$ defenders and $2$ goalkeepers. The team must include at least $2$ forwards, at least $2$ defenders and at least $1$ goalkeeper. Find the number of different ways in which the team can be chosen. $260$ $340$ $720$ $440$
commented
in
Combinatory
Dec 27, 2019
2.4k
views
cmi2014
combinatory
discrete-mathematics
normal
2
answers
15
Recurrence Relation Self-Doubt
What will be solution of recurrence relation if roots are like this: r1=-2, r2=2, r3=-2, r4=2 is this the case of repetitive roots?
commented
in
Combinatory
Dec 27, 2019
852
views
relations
recurrence-relation
discrete-mathematics
combinational-circuit
6
answers
16
GATE CSE 2015 Set 3 | Question: 37
Suppose $X_i$ for $i=1, 2, 3$ are independent and identically distributed random variables whose probability mass functions are $Pr[X_i = 0] = Pr[X_i = 1] = \frac{1} {2} \text{ for } i = 1, 2, 3$. Define another random variable $Y = X_1X_2 \oplus X_3$, where $\oplus$ denotes XOR. Then $Pr[Y=0 \mid X_3 = 0] =$______.
commented
in
Probability
Dec 21, 2019
16.5k
views
gatecse-2015-set3
probability
random-variable
normal
numerical-answers
1
answer
17
Which of the following condition is sufficient to detect cycle in a directed graph?
Which of the following condition is sufficient to detect cycle in a directed graph? (A) There is an edge from currently being visited node to an already visited node. (B) There is an edge from currently being visited node to ... seen twice in DFS. (D) None of the bove here option B is right, but why not option A?
commented
in
Algorithms
Dec 4, 2019
13.4k
views
graph-theory
depth-first-search
geeksforgeeks-test-series
graph-algorithm
1
answer
18
Computer Organization
A computer has 256 K word memory. The instruction format has 4 fields i.e., Opcode, register field to represent one of the 60 processor registers, mode field represent one of 7 addressing modes and memory address field. How many instructions the system supports when a 32- bit instruction is placed in the one memory cell.
commented
in
CO and Architecture
Nov 28, 2019
13.1k
views
computer-architecture
machine-instruction
instruction-format
2
answers
19
Self Doubt In String C-Programming
#include <stdio.h> void my_toUpper(char* str, int index) { *(str + index) &= ~32; } int main() { char* arr = "gatesquiz"; my_toUpper(arr, 0); my_toUpper(arr, 5); printf("%s", arr); return 0; } (a) GatesQuiz (b) gatesquiz (c) Compiler dependent
commented
in
Programming in C
Nov 18, 2019
1.6k
views
programming-in-c
strings
pointers
6
answers
20
GATE CSE 2017 Set 2 | Question: 19
Consider the following tables $T1$ and $T2.$ ... delete record $\langle 3, 8 \rangle$ from the table $T1,$ the number of additional records that need to be deleted from table $T1$ is _______
commented
in
Databases
Nov 12, 2019
18.3k
views
gatecse-2017-set2
databases
numerical-answers
referential-integrity
normal
1
answer
21
Turing Machine
S1: Can a Turing machine ever write a blank symbol on its tape. S2: Any Turing machine must have at least two states which of above statements are true???
commented
in
Theory of Computation
Nov 8, 2019
1.8k
views
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:...