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 ramakrushna
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by ramakrushna
0
votes
2
answers
1
ACE Test Series
A ) B ) C ) D )
asked
in
DS
Jan 27, 2022
393
views
data-structures
binary-heap
ace-test-series
0
votes
1
answer
2
Applied Test Series: CN
Which of the following options is/are false? If the maximum value sequence number in the GBN is n, then the maximum sender window is n-1. The size of fragments in IPv4 packet fragmentation payload is always divisible by 8 except the last fragment. DF bit is ... IPV4 packet is different. They have provided the ans as 1, 3 and 4. Can someone explain me how option 3 is false?
asked
in
Computer Networks
Jan 25, 2022
235
views
test-series
computer-networks
0
votes
3
answers
3
Applied Test Series:
Need help Anyone?
asked
in
CO and Architecture
Jan 12, 2022
378
views
test-series
operating-system
multilevel-paging
1
vote
1
answer
4
Applied Test Series: Live Mock
A 30*30 upper triangular matrix of integers is stored optimally in a 1-D array with starting address of 3000 assume the matrix indexing starts at (1,1) and array indexing starts at 0 what would be the address of element with index (25,25)), ... integer takes up two bytes of memory.___ Need help in this one. Didn't get the solution properly provided by them. Anyone!
asked
in
DS
Jan 10, 2022
346
views
test-series
data-structures
array
0
votes
1
answer
5
Applied Test Series
Consider the following statements S1 and S2 : S1 : The minimal elements of a poset always form an antichain. S2 : The maximal elements of a poset always form an antichain Which of the following is correct? Can someone explain these two with examples? Thank you!
asked
in
Set Theory & Algebra
Jan 7, 2022
322
views
test-series
discrete-mathematics
set-theory
0
votes
1
answer
6
Applied Live Test
Given a byte addressable system which implements demand paging, a TLB has 64 entries and the frame size is 4KB. The LAS is 4MB. TLB has a hit ratio of 90% and has an access time of 2 ns. If the main memory access time is 100 ns and page fault is 5%. The page fault service time is given to be 100 ms. The TLB reach for this system given above is _____ B Anyone can help this.
asked
in
Operating System
Jan 3, 2022
266
views
test-series
operating-system
demand-paging
translation-lookaside-buffer
4
votes
1
answer
7
Applied Test series: DS
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BST How to tackle this kind of problem. Anyone!
asked
in
Programming
Dec 31, 2021
645
views
test-series
data-structures
binary-search-tree
1
vote
1
answer
8
Test Series: Applied
What is the output of the following c-code? 320 1 64 Compiler Error What should be ans for this one. This program will compiler error right?(invalid operands to binary ) Even i checked in Compiler by running this code. How the ans given by them is 64. Can anyone help me out. Am i missing something.
asked
in
Programming
Dec 30, 2021
323
views
test-series
programming-in-c
output
0
votes
1
answer
9
Test Series: ACE (Networking)
Never done any problem in concept called purging in networking. can anyone tell me how to approach this. is this in syllabus?
asked
in
Computer Networks
Dec 28, 2021
251
views
ace-test-series
computer-networks
csma-cd
0
votes
0
answers
10
Test Series: COA
I need help in this one.
asked
in
CO and Architecture
Dec 28, 2021
217
views
test-series
ace-test-series
co-and-architecture
1
vote
2
answers
11
Applied Test series: C-programming
I know the answer but need a good explanation for this question. Can anyone help. Thanks!
asked
in
Programming
Dec 26, 2021
295
views
test-series
programming-in-c
operators
0
votes
1
answer
12
Applied Test Series: Knapsack Problem
The following table givens the frequency of 4 letters in a database of text If Huffman encoding is used to encode the word “aaabca” the number of bits required for it is given by ______. Need help!
asked
in
Operating System
Dec 25, 2021
249
views
test-series
knapsack-problem
algorithms
0
votes
1
answer
13
ACE Test series
Need help!
asked
in
Computer Networks
Dec 23, 2021
162
views
ace-test-series
computer-networks
osi-protocol
1
vote
1
answer
14
Test Series: ACE
How to approach this one?
asked
in
CO and Architecture
Dec 23, 2021
253
views
ace-test-series
co-and-architecture
test-series
pipelining
0
votes
3
answers
15
ACE Test Series:C-program
What should be the ans. Isn’t the Function initialization should be outside main function? They are given inside main. If declaration would be outside main then ans should be C else i don’t think options are correct here. Anyone ?
asked
in
Programming
Dec 23, 2021
395
views
programming-in-c
ace-test-series
output
programming
1
vote
1
answer
16
Live Test Series Live: Applied
We are given a hard disk of 500 GB. The performance details are : 5000 RPM rotation rate 200 cylinders, numbered from 1 to 200 Takes 1 + (n/20) milliseconds to move heads across n cylinders (e.g., from i to i + n). A ... the head travels half the cylinders and half a revolution. The average time taken to read a 1MB block from the hard disk is__? Need help.
asked
in
CO and Architecture
Dec 22, 2021
428
views
test-series
operating-system
disk-scheduling
disk
0
votes
2
answers
17
Applied Test Series: Mock
Consider the following schedule S: S: R3(A), W2(A), R1(A), W3(A), W1(A); The possible number of view serializable schedules of the schedule S (other than S) are _____ Can someone help me in this.
asked
in
Databases
Dec 22, 2021
240
views
databases
view-serializable
virtual-gate-test-series
1
vote
1
answer
18
Test Series- Applied:
Given a system with 3 processes where each process requires at least 2 resources to complete their execution, then the largest number of resources which will guarantee a deadlock is ___ I answered it as 3. Because it asked for maximum which is not correct. Can someone help me in this.
asked
in
Operating System
Dec 20, 2021
238
views
operating-system
test-series
deadlock-prevention-avoidance-detection
1
vote
2
answers
19
Operation system Applied test series 2022
If the P() and V() semaphore operations are not executed atomically, then which of the following are always correct? Mutual exclusion satisfied Progress is not satisfied Bounded waiting is not satisfied None of the above Can anyone help me in this A should not be the ans as there is no restriction on atomicity. What about b and c.
asked
in
Operating System
Dec 18, 2021
447
views
test-series
operating-system
semaphore
mutual-exclusion
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
This guy was just exceptional. I remember hearing...
Inspirational! Found the right Blog at the right...
That was my second attempt. I already had notes,...
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...