All Questions
25 Questions
0
Votes10
RepliesDigital Logic
what is the minimal expression of (x + x y^ + x y ^ z) ?3
Votes8
Replies0
Votes7
RepliesALGORITHM
Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false? A) Every minimum spanning tree of G must contain emin B) If emax is in a minimum spanning tree, then its removal must disconnect G C) No minimum spanning tree contains emax D) G has a unique minimum spanning tree11
Votes6
RepliesCompletion of syllabus
How much syllabus you have completed till now? I wanted to track my progress because I have started my preparation few days ago?Plz answer honestly.13
Votes5
Replies2
Votes4
RepliesCOA
how many 256x4 RAM chips are required to organise a memory of capacity 32KB and the size of decoder required in this implementation to select a row of chip? pls friends I need explanation .0
Votes3
RepliesALGORITHM
In a permutation a1.....an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What would be the worst case time complexity of the Insertion Sort algorithm, if the inputs are restricted to permutations of 1.....n with at most n inversions? A) ? (n2) B) ? (n log n) C) ? (n1.5) D) ? (n)1
Votes3
RepliesLocality of reference
Locality of reference implies that the page reference being made by a process A) will always be to the page used in the previous page reference B) is likely to be to one of the pages used in the last few page references C) will always be to one of the pages existing in memory D) will always lead to a page fault1
Votes3
Repliesc programing
int incr (int i) { static int count = 0; count = count + i; return (count); } main () { int i, j; for (i = 0; i <= 4; i++) j = incr (i); }0
Votes3
RepliesEquivalance realtion
how to find the #Equicalance realtion possible in some given set.?0
Votes3
Replies1nf 2nf
is it necessary ,if it is in 1 nf or 2 nf or 3 nf then it must be lossless and dependency preserving? in bcnf can we have a case where it is not lossless but dependency preserving0
Votes2
RepliesMemory management operating system
Locality of reference implies that the page reference being made by a process A) will always be to the page used in the previous page reference B) is likely to be to one of the pages used in the last few page references C) will always be to one of the pages existing in memory D) will always lead to a page fault2
Votes2
RepliesCN Selective Repeat Question
In selective repeat protocol, we are transmitting 10,000 packets and every 100th packet is lost can anyone tell how many retransmissions will be there?0
Votes2
RepliesPYQs
Should PYQs be also solved with daily practice questions of a subject? Should I solve PYQs after completing a subject?5
Votes2
RepliesPreparation
Does any one started their preparation from september?0
Votes2
RepliesGrand Tests
Have you all started giving Grand Tests?0
Votes1
RepliesALGORITHM
The time complexity of the following C function is (assume n > 0) int recursive (mt n) { if (n == 1) return (1); else return (recursive (n-1) + recursive (n-1)); }0
Votes1
RepliesALGORITHM
Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. Which of the following is the Huffman code for the letter a, b, c, d, e, f?0
Votes1
RepliesEMAT in case of Page fault
As per GALVIN, To calculate Effective memory access time in case of page fault we used: EMAT= page fault rate*(page fault service time) + (1-page fault rate)*(memory access time) My doubt is: In case of NO PAGE FAULT, why we considered only one memory access time . Why not TWO memory accesses, one for page table + one for accessing actual byte. ? That is: Why not this formula: EMAT= page fault rate*(page fault service time) + (1-page fault rate)* (2 * memory access time)0
Votes1
RepliesTOC Regular and non regular Languages
If L1: {a^nb^m,|n,n>=0} and L2:{a^p|p is prime} then is L1 intersection L2 regular. If not then why0
Votes1
RepliesHit Time and read access time for cache access
Is the hit ratio implicitly accounted for in hit time and read access time? In the subject test for MemoryOrganization in Computer Architecture some questions some questions explicitly account for hit ratio and some don't.How to resolve this confusion?2
Votes1
RepliesError control in transport layer
What if the checksum bits are also corrupted while we are sending actual data2
Votes1
RepliesCOA
How many 512k x 8 static RAM chips are needed to design the 2M x 32 memory module . a) 32 b)8 c)16 d) 641
Votes1
Replies#DBMS #Normalization State True/False for 3NF.
Statement: A non prime attribute can be transitively dependent on a key in a 3NF relation. Is it True/False. please explain it with a reason.0
Votes1
RepliesPreparation
Is it possible to crack GATE in 3 months?Related Tags
algorithm gate2019 c-programming gate2004 algorithms gate2007 gate2000 timecomplexity gate2003 gate2001 Operating system Gate1997 Operating system OS pagefault scheduling #digital GATE 2015 SET 1 Networking memory c test 3 General gate2005 TOC revision practice PYQs timeManagement gate2022 pg hostel gate2021 Gate preparation pgee iiithyd Test Series 2023 GATE CS Database Management and Warehousing"The Forum is to encourage students discussions. If you expect our mentors to resolve your doubts/queries please reach out to us by posting comments under the video lectures or sending us a mail on gatecse@appliedcourse.com. Our mentors will get back to you in 3-4 working hours."
© 2024 - All rights are reserved- AAIC Technologies pvt ltd