GATE CSE Doubts

0 votes

0 answers

Does anyone has a list of questions to be practiced from different standard books for Gate Cse

asked 1 hour ago in Others by prajjwalsingh_11 (6 points) | 1 view

0 votes

0 answers

MADE EASY: CHAPTER: DIVIDE AND CONQUER
Find the average number of comparisons in a binary search on a sorted array of 10 consecutive integers starting from 1. (a) 2.6 (c) 2.8 (b) 2.7 (d) 2.9

asked 6 hours ago in Algorithms by Debanil (11 points) | 2 views

0 votes

0 answers

Why value of I is 515 in this code
#include<stdio.h> int main() { union a { int i; char ch[2]; }; union a u; u.ch[0]=3; u.ch[1]=2; printf("%d, %d, %d\n",u.ch[0],u.ch[1], u.i); return 0; } Why I value is 515

asked 9 hours ago in Programming by Muktiyar (6 points) | 4 views

0 votes

0 answers

longest prefix match
Can anyone help to understand why does router uses longest prefix technique when there is a multiple match for a received packet ? why does it choose the one having largest no of 1s?

asked 17 hours ago in Computer Networks by s_dr_13 (17 points) | 2 views

0 votes

0 answers

Binary Semaphores
Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S, T and U: Process P: Process Q: P(S) W: P(T) X: P(U) Y: Print ‘a’ Print ‘a’; Print ‘b’ Print ‘b’; V(S) A: V(T) B: V(U) C: What should be written at W to avoid deadlock? (a) P(T) (b) P(U) (c) P(S) (d) Not possible to avoid deadlock

asked 1 day ago in Operating System by amare123 (6 points) | 6 views

0 votes

0 answers

made easy wb
how to solve questions like this, I got this TAG SETS WORDS 18 7 7

asked 1 day ago in CO & Architecture by ummokkate (58 points) | 11 views

0 votes

0 answers

Made Easy WB
How to use the hit ratio of write access?

asked 1 day ago in CO & Architecture by ummokkate (58 points) | 4 views

0 votes

0 answers

memory management application
Consider a movie player application that supports functions like play movie, skip forward x frames and skip backward x frames. Suggest a memory management policy that will be best suited for this application. (source: question 4.4 ) Ans is given as: A ... if we use Look-ahead as in paging, then this will perform equally well, if not better. Please comment on it.

asked 1 day ago in Operating System by reboot (7 points) | 3 views

0 votes

0 answers

Self-Doubt In OS, Process Synchronization
Consider the following implementation of a general (counting) semaphore. This implementation assumes the existence of binary semaphore operations upb and downb implemented with a test-and-set instruction. Procedure UP( S : semaphore): downb( ... preemptive version) c) Priority (you may assign whatever priorities to the processes you wish) d) Round-Robin

asked 1 day ago in Operating System by Chinmay Agnihotri (13 points) | 2 views

0 votes

0 answers

Self-Doubt In OS, Process Synchronization
Consider the following implementation of a general (counting) semaphore. This implementation assumes the existence of binary semaphore operations upb and downb implemented with a test-and-set instruction. Procedure UP( S : semaphore): downb( ... preemptive version) c) Priority (you may assign whatever priorities to the processes you wish) d) Round-Robin

asked 1 day ago in Operating System by Chinmay Agnihotri (13 points) | 1 view

0 votes

0 answers

made easy wb
How to solve this question?

asked 1 day ago in CO & Architecture by ummokkate (58 points) | 1 view

0 votes

0 answers

CN_ Ace Quesn
Which attribute in DNS Resource record is used to deal with DNS cache issues at clients ? MX TTL CNAME A Anyone please clarify.

asked 1 day ago in Computer Networks by Shivateja MST (125 points) | 2 views

0 votes

0 answers

Made Easy WB
How to solve this question?

asked 1 day ago in CO & Architecture by ummokkate (58 points) | 4 views

0 votes

0 answers

MADE EASY WB
I have a doubt in c) part. the bits required for tag are 48bits, the bits required for set are 11bits and bit required for block offset are 5bits

asked 1 day ago in CO & Architecture by ummokkate (58 points) | 3 views

0 votes

0 answers

Threads Self Doubt IIT notes
User-level threads require non-blocking systems call i.e., a multithreaded kernel. Otherwise, the entire process will be blocked in the kernel, even if there are runnable threads left in the processes. For example, if one thread causes a page fault, ... kernel ? I cannot understand the relation between them, please help. link: IIT notes threads (last para of the page)

asked 2 days ago in Operating System by reboot (7 points) | 3 views

0 votes

0 answers

RBR practice question
A cache is having 60% hit ratio for read operation. Cache access time is 30 ns and main memory access time is 100 ns, 50% operations are read operation. What will be the average access time for read operation? (a) 50 ns (b) 58 ns (c) 100 ns ... have given 70ns as answer, but if we consider parallel access we get 58ns as answer. In such cases what is the default access method?

asked 2 days ago in CO & Architecture by ummokkate (58 points) | 7 views

0 votes

0 answers

RBR practice question
Q. Consider a system with cache access time 20 ns and main memory access time 140 ns. If 60% operations are read operations and hit ratio is 90%, what is the effective access time if write through updation technique is used? (a) 75.2 ns ... will that affect the solution?Also if nothing is given aout parallel access or hierarchical access, which one do we consider by default?

asked 2 days ago in CO & Architecture by ummokkate (58 points) | 6 views

0 votes

0 answers

computer networks
For a class C network if Ip address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of lost octet of lost host of sixth subnet is ________?

asked 2 days ago in Computer Networks by Taraka (6 points) | 2 views

0 votes

0 answers

kanodia workbook edition 2011
#include<stdio.h> void fun(int arr[]) { int i; int arr_size = sizeof(arr)/sizeof(arr[0]); for (i = 0; i < arr_size; i++) printf("%d ", arr[i]); } int main() { int i; int arr[4] = {10, 20 ,30, 40}; fun(arr); fun(arr); } what will be printed in the output??

asked 2 days ago in Programming by pratyush12 (6 points) | 3 views

0 votes

0 answers

#Self Doubt - How many ip addresses are wasted on subnetting on a network?

asked 2 days ago in Computer Networks by iarnav (84 points) | 5 views

0 votes

0 answers

dbms minimal cover
F = {A → BC, B → C, A → B, AB → C}; When I find the minimal cover of this my fd is B->C, A->B, A->C correct me . given ans is- A->B,B->C

asked 2 days ago in Databases by Shubham Aggarwal (7 points) | 11 views

0 votes

0 answers

self doubt in database normalization
Consider relation R(A,B,C,D) with functional dependencies: A -> B, C -> D, AD -> C, BC -> A Suppose we decompose R into Boyce-Codd Normal Form (BCNF). Which schemas will be in final decompositon.? CK-AC,AD,BC

asked 2 days ago in Databases by Shubham Aggarwal (7 points) | 4 views

0 votes

0 answers

Tannenbaum Chapter 2 Processes and Threads
Multiple jobs can run in parallel and finish faster than if they had run sequentially. Suppose that two jobs, each of which needs 5 minutes of CPU time, start simultaneously. How long will they last one take to complete if they run sequentially? How long if they ... in I/O = 5 + 20%*(5) = 6min instead of 6.25 minutes. What is the logic of 6.25 minutes?

asked 3 days ago in Operating System by AliH (11 points) | 6 views

0 votes

0 answers

M tech query
Pls anybody tell me about IIITDM JABALPUR for M. Tech (CSE).IS IT better choice for placement or not?

asked 3 days ago in IIITs by kpc (6 points) | 2 views

0 votes

0 answers

SELF DOUBT->MISSES IN CACHE
Associative cache: Only compulsory and capacity misses can occur. Direct mapped cache: Only compulasory and conflict misses can occur. Set Associative cache: Compulsory misses occurs. Capacity misses occurs if all the blocks in all the sets are filled. Capacity misses occurs if all the blocks in all the sets are not filled. Please state wheather these are correct or not?

asked 3 days ago in CO & Architecture by Doraemon (115 points) | 4 views

0 votes

0 answers

Fluid mechanics.
What are the proportions of radius to height of a right circular cylinder of specific gravity s.g. so that it will float in water with end faces horizontal in stable equilibrium.

asked 4 days ago in Others by Radheram (6 points) | 5 views

0 votes

0 answers

CCMT NIT Admission doubt
Hello all. I have a query regarding the admission procedure of CCMT. Suppose I have two colleges in my preference: A and B. Where A has a better scope(in terms of placement/research) than B. Suppose I get college B in the 3rd round. I want to lock B ... to B. So is this scenario allowed? Or do I have to forfeit college B in 3rd round completely in order to register in NSR?

asked 4 days ago in NITs by DukeThunders (416 points) | 10 views

0 votes

0 answers

The recursive programming bottom-up approach tends to have a stack overflow error. True / False

asked 5 days ago in Programming by Musa (11 points) | 6 views

0 votes

0 answers

John C Martin
Let Ln = { x ε (0,1)* ; | x | ≥ n and the nth symbol from the right in x is 1}. Draw an FA with four states that recognizes L2. For any n ≥ 1, describe how to construct an FA with 2n states that recognizes Ln.

asked 5 days ago in Theory of Computation by nehaPal13 (7 points) | 6 views

0 votes

0 answers

John C Martin
Show that L is accepted by PDA in which no symbols are ever removed from the stack, then L is regular.

asked 5 days ago in Theory of Computation by nehaPal13 (7 points) | 6 views

0 votes

0 answers

Self doubt on GB: Digital Logic
When two 8-bit numbers and in 2's complement representation (with and as the least significant bits) are subtracted(i.e. A-B) by first negating the subtrahend and then adding it to the minuend using a ripple-carry adder, the sum bits obtained are and the carry ... 1 (B). is 1 (C). is 1 (D). is 1 How this question will differ from previous GATE question? Plz verify

asked 5 days ago in Digital Logic by srestha (739 points) | 13 views

0 votes

0 answers

Software Design, Performance tuning of Job_Dispatcher

asked 5 days ago in Operating System by faseela45 (6 points) | 3 views

0 votes

1 answer

self doubt permutation and combination

answered 5 days ago in Combinatory by vps123 (9 points) | 14 views

0 votes

0 answers

THE GATEBOOK TEST SERIES
Find the number of data dependencies in the following My doubt here is that while considering the data dependencies do we consider dependencies only in the consecutive instructions or all the instruction. I solved a question from Madeeasy workbook. where they had mentioned we only consider the dependencies from the consecutive instructions only. So I’m a confused...

asked 5 days ago in CO & Architecture by ummokkate (58 points) | 21 views

0 votes

1 answer

GATE GURU TEST SERIES MATHS
A cancer institute has a testing methodology. The methodology produces 95% positive result, also 10% rate of false-positive(i..e showing a non cancer person as a cancer affected patient). If there are 0.5% of the people have cancer. Suppose a person is classified as a disease affected person, what is the probability that the person is really have cancer? _______________

answered 6 days ago in Probability by shaktipratap (9 points) | 104 views

0 votes

0 answers

Self doubt GRAPH THEORY

asked 6 days ago in Graph Theory by Abhipsa (26 points) | 9 views

0 votes

0 answers

Self Doubt recurrence equation

asked 6 days ago in Combinatory by Abhipsa (26 points) | 6 views

0 votes

1 answer

Operating System Concepts (9th Ed) - Gagne, Silberschatz, and Galvin

answered May 30 in Operating System by Kushagra गुप्ता (407 points) | 27 views

0 votes

0 answers

TOC GATE2013-32 doubt regarding dcfl
$L2 = \left \{ 0^p1^q0^r ∣ p,q,r ≥ 0, p ≠ r \right \}$ Is the above language dcfl? The comments in the question state that it is but what about the case when #1’s = 0. Then how is the first half of 0’s separated from the second half of 0’s deterministically? Ref – https://gateoverflow.in/1543/gate2013-32

asked May 30 in Theory of Computation by abhijit_m (6 points) | 12 views

0 votes

0 answers

Page Faults in Operating Systems
If we can find an entry for the requested page in the page table, then are there any chances of page fault? If yes, then how? Thank you!

asked May 30 in Operating System by yagneshmb (6 points) | 25 views

To see more, click for the full list of questions or popular tags.

Recent questions and answers

7,415 questions

1,744 answers

10,719 comments

90,375 users