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 sachin486
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sachin486
3
answers
1
GO Classes Scholarship 2023 | Test | Question: 27
What will be the number of recursive calls for $\textsf{mystery(5)}$ including the first call? void mystery(int n) { if (n == 0 || n == 1) return 0; mystery(n-2); printf("%d", n); mystery(n-1); }
commented
in
Programming in C
Oct 16, 2022
535
views
goclasses-scholarship-test1
numerical-answers
goclasses
programming
programming-in-c
recursion
1-mark
1
answer
2
Kenneth.H.Rosen
I’m using standard book(kenneth.H.Rosen) for my GATE preparation. And I have a doubt regarding syllabus or propositional logic. Do I have to study the topic “Proofs” for GATE?
commented
in
Mathematical Logic
Feb 20, 2022
1.6k
views
1
answer
3
Repeatable Read Problem
Does the schedule below have the repeatable read problem or not? repeatable read problem is when a transaction read a data, then another transaction comes and changes that data, another time that the first transaction wants to read that data the ... schedule doesn't have this problem. What is the correct answer? I have this question for inconsistent analysis too, please?
answered
in
Databases
Feb 20, 2022
421
views
3
answers
4
Doubt about joins on keys
Consider the following relation: R (A B C) A primary key with 100 tuples. S (E F G) E primary key with 50 tuples. T (AE D) AE primary key with 80 tuples. U (D G H) H primary key with 10 tuples. The maximum number of possible records in the result of _______.
answered
in
Databases
Jan 15, 2022
2.2k
views
databases
relational-algebra
1
answer
5
Relational Algebra
commented
in
Databases
Jan 15, 2022
1.5k
views
relational-algebra
databases
3
answers
6
MadeEasy Test Series: Databases - Relational Algebra
Consider relation R' and S' have n' and m' tuples, respectively. Choose the best matching between List-I (Expression) and List-II (Maximum number of tuple): Soln. According to me Answer should be Option C. 1.R union S = m+n (easy nothing to say) 2. ... 2 3 3 3 5 4 3 3 3 6 Now in R natual join S = m * n So option C should suffice isn't it ?
answer edited
in
Databases
Jan 15, 2022
2.7k
views
made-easy-test-series
databases
relational-algebra
natural-join
6
answers
7
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 31, 2021
24.5k
views
gate1996
co-and-architecture
microprogramming
normal
3
answers
8
Self Doubt
Consider a hypothetical CPU which supports 2 address, 1 address and 0 address instructions. A 16 bit instruction is placed in 128 word memory. If there exists 2 two address instructions and 100 one address instructions, then how many 0 address instructions can be designed?
commented
in
CO and Architecture
Dec 30, 2021
1.1k
views
machine-instruction
instruction-format
computer-architecture
1
answer
9
CN-TCP
Assume a new TCP connection starts by sending 1 segment and then increases it congestion windows by 1 segment each time it receives an acknowledgement i,e after 1RTT congestion window is 2 segments in slowstart.Assume connection never leaves slow start.Find the number of RTT's it takes to send N segments Given ans is Log2(N+1)
commented
in
Computer Networks
Dec 29, 2021
1.2k
views
computer-networks
tcp
congestion-control
0
answers
10
#Networks #AIMD #TCP #CongessionControl
What is the initial thresold should be taken in AIMD ? Is it is reciever's advertise window size or half of it. Please clearify.
commented
in
Computer Networks
Dec 29, 2021
417
views
aimd
tcp
congestion-control
1
answer
11
pre ladder quiz
Consider the TCP is using slow-start congestion control.After having 10th consecutive transmission failed due to Timeout,the current threshold value is set to 7KB .what was the congestion window size at the time of starting of these transmissions ? assume MSS= 1kb
commented
in
Computer Networks
Dec 29, 2021
545
views
tcp
congestion-control
2
answers
12
CN: TCP Window Size
Consider TCP congestion control. Assuming RTT as 4 seconds and segment size as 3KB, if bandwidth is 500kbps, what is the smallest window size for which there is no stalling in this case?
commented
in
Computer Networks
Dec 29, 2021
1.6k
views
computer-networks
tcp
2
answers
13
TCP 3 Way Handshaking
In TCP 3 way handshaking mechanism why the data is not started being transmitting from the 3rd step itself I.e. 1. A-> B / SYN FROM A 2. A<-B / SYN AND ACK FROM B 3. A-> B / ACK FROM A.
commented
in
Computer Networks
Dec 27, 2021
1.1k
views
computer-networks
tcp
3
answers
14
TCP Congestion control AIMD
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 32 KB. Assume that 3 ... transmission and 1 duplicate ACK received during 6th transmission. what is the congestion window size at the end of 10th transmission?
commented
in
Computer Networks
Dec 27, 2021
2.0k
views
congestion-control
tcp
1
answer
15
S->AA/ab A->Bd/null B->SB/d remove left recursion
S->AA/ab A->Bd/null B->SB/d remove left recursion
answered
in
Compiler Design
Dec 26, 2021
1.1k
views
compiler-design
left-recursion
grammar
1
answer
16
general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?
commented
in
Computer Networks
Dec 24, 2021
809
views
distance-vector-routing
routing
split-horizon
count-to-infinity
2
answers
17
Pipeline hazards
R1 <- R1+R2 R2 <- R3*R4 R3 <- R4-R1 R2 <- R3+R4 Can someone point out hazards. Thanks :)
answer edited
in
CO and Architecture
Dec 24, 2021
1.1k
views
pipelining
hazards
co-and-architecture
data-hazards
1
answer
18
GATE Overflow | Mock GATE | Test 1 | Question: 38
Consider a system with paging-based memory management, whose architecture allows for a $4\text{GB}$ virtual address space for processes. The size of logical pages and physical frames is $4\text{KB}$. The system has $8\text{GB}$ physical RAM. The system allows a maximum of ... $4 \text{GB} + 4 \text{KB}$ $4 \text{MB} + 4 \text{GB}$
commented
in
Operating System
Dec 24, 2021
2.4k
views
go-mockgate-1
virtual-memory
memory-management
operating-system
2
answers
19
ACE test_series
Is this question and solution both are wrong?
commented
in
Computer Networks
Dec 23, 2021
984
views
computer-networks
distance-vector-routing
2
answers
20
MadeEasy Test Series: Computer Networks - Distance Vector Routing
answered
in
Computer Networks
Dec 23, 2021
1.3k
views
computer-networks
distance-vector-routing
made-easy-test-series
2
answers
21
synchronization reader's writer's problem.
int readers_count = 0; semaphore mutex = 1; // binary semaphore semaphore db = 1; // binary semaphore void reader() { while(TRUE) { x. down(mutex); //or wait(mutex) or P(mutex) readers_count = readers_count + 1; y. if(readers_count ... and writers are allowed in the database at the same time. c. There is possibility of deadlock. d. None of the above.
commented
in
Operating System
Dec 23, 2021
2.2k
views
process-synchronization
deadlock-prevention-avoidance-detection
operating-system
2
answers
22
Applied Test Series
The solution for process synchronization is given below : Which of the following is correct about the above given solution? (A) Satisfies Mutual Exclusion (B) Satisfies Progress (C) Satisfies Bounded wait (D) Suffers from deadlock
answered
in
Operating System
Dec 23, 2021
541
views
test-series
operating-system
process-synchronization
multiple-selects
2
answers
23
synchronisation
The above synchronisation procedure satisfies 1. Mutual exclusion is guranteed 2.Progress is not guranteed 3.Bounded wait is not guranteed 4Deadlock may occur I am getting all of the above. Is it correct?
answer edited
in
Operating System
Dec 22, 2021
683
views
operating-system
process-synchronization
3
answers
24
Consider two processes, P and Q, each need three records,
Consider two processes, P and Q, each need three records, R1, R2. and R3, in a database. If P asks for them in any order R1, R2, R3, and Q asks for them in any order, What fraction of all the combinations are guaranteed to be deadlock free? $\frac{1}{3}$ $\frac{2}{3}$ $\frac{1}{6}$
comment edited
in
Operating System
Dec 21, 2021
4.3k
views
deadlock-prevention-avoidance-detection
operating-system
1
answer
25
Pipelining
A 5 stage pipeline system is in operation with clock cycle of n ns. If the clock per instruction CPI for non-pipelined system is 5,and Instruction per clock for pipeline is 5,and pipeline efficiency is 70% what is the speed up factor? Please explain the Soultion and concept briefly i am little bit confused.
answer edited
in
CO and Architecture
Dec 18, 2021
2.5k
views
co-and-architecture
pipelining
speedup
2
answers
26
Fragmentation
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host). The first network has ... the IP layer at the destination for TCP message, in the best case is _________ bytes. (Assume all IP headers are 20 bytes)
commented
in
Computer Networks
Dec 16, 2021
2.6k
views
fragmentation
computer-networks
2
answers
27
Test-Series
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? Assume the cost toupdate the TLB, the page table, and the frame table (if needed) is negligible. 1. 3777.5ns 2. 30220ns 3. 15110ns 4. 7555ns
commented
in
Operating System
Dec 16, 2021
3.3k
views
2
answers
28
Pipeline Stages
The CPU supports the following instructions LOAD R1 , R2 (100) ; R2 ← [R2 + 100] ADD R1 , R2; R1 ← R1 + R2 SUB R2,R1 ; R2 ← R2 - R1 STORE R1 (100), R2 ; [R1+100] ←R2 4 stage pipeline is used to execute the above ... require 3 clocks for memory related operation and 1 clock is for other instructions. The minimum number of clocks needed with operand forwarding is ________. Ans. 11.
commented
in
CO and Architecture
Jun 13, 2021
655
views
pipelining
co-and-architecture
2
answers
29
Gateforum Test Series: Computer Networks - Error Detection
Which of the following statements is FALSE for the generator $x^{6}$+1? S1: This generator can detect all burst errors with a length of 5 bits. S2: This generator can detect some but not all burst errors with a length of 6 bits.
answered
in
Computer Networks
Feb 8, 2021
567
views
gateforum-test-series
computer-networks
error-detection
0
answers
30
regular and context free
Let Σ = {a, b}. For a word w ∈ Σ* , let na(x) denote the number of a’s in w and let nb(x) denote the number of b’s in w. Consider the following language: L := {xy | x, y ∈ Σ* , na(x) = nb(y)} What can we say about L? (A) L is regular, but not context-free. (B) L is context-free, but not regular. (C) L is Σ*. (D) None of these.
commented
in
Theory of Computation
Feb 1, 2021
263
views
context-free-grammar
identify-class-language
theory-of-computation
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation