All Questions
25 Questions
100
Votes0
RepliesGate 2022 Preparation
Hi, I am looking for preparation partner for Gate CSE 2022 . Any one serious to crack gate 2022.17
Votes0
RepliesScholarship test
Is there any scholarship test?? If yes then when it will be taken?13
Votes5
Replies11
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.8
Votes0
RepliesRevision in Nov,Dec and Jan
How did you plan to spend the rest of the months on revision, test series and solving PYQs after completion of syllabus? What's your schedule?5
Votes2
RepliesPreparation
Does any one started their preparation from september?3
Votes8
Replies3
Votes0
RepliesStay In Hyderabad
Does any one stays in hyderabad(hostels) and preparing for gate 2021. if any one is there let me know.2
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 .2
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?2
Votes0
RepliesCache and pagging
Consider a virtually indexed physically tagged cache with following configurations: Virtual address = 32 bits Page size 8 KB 4-way set associative cache Cache Size 512 KB Cache Block Size 64 bytes How many bits ofthe virtual address should remain unchanged for the memory hierarchy to work2
Votes1
RepliesError control in transport layer
What if the checksum bits are also corrupted while we are sending actual data2
Votes0
Repliesnotes of data structure and algorithm
can anyone please self notes of data structure and algorithm other than what sir has provided bcz thats quite unreadable to me as compared to c notes(which is very great)2
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
Votes0
RepliesALGORITHM
Let T(n) be the function defined by T(1)= 1, T(n)= 2T (?n/2?) + ?n for n?2. Which of the following statement(s) is true? a. T(n) = O(?n) b. T(n) = O(n) c. T(n) = O(log n) d. None of the above1
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); }1
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.1
Votes1
Repliesrange
what is sence of range %c ( -128to+127/0-255)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
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 tree0
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)0
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 faultRelated 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