﻿ GATE CS Applied Course

## All Questions

#### 10

Replies
##### Digital Logic
what is the minimal expression of (x + x y^ + x y ^ z) ?

#### 8

Replies
##### ALGORITHM
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort? A) O(n) B) O(n Log n) C) O(n2) D) O(n!)

#### 7

Replies
##### ALGORITHM
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 tree

#### 6

Replies
##### Completion 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.

#### 5

Replies
##### GATE 2022
Does anyone started preparing for GATE 2022? Which subject did you start?

#### 4

Replies
##### COA
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 .

#### 3

Replies
##### ALGORITHM
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)

#### 3

Replies
##### Locality 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 fault

#### 3

Replies
##### c 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); }

#### 3

Replies
##### Equivalance realtion
how to find the #Equicalance realtion possible in some given set.?

#### 3

Replies
##### 1nf 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 preserving

#### 2

Replies
##### Memory 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 fault

#### 2

Replies
##### CN 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

Replies
##### PYQs
Should PYQs be also solved with daily practice questions of a subject? Should I solve PYQs after completing a subject?

#### 2

Replies
##### Preparation
Does any one started their preparation from september?

#### 2

Replies
##### Grand Tests
Have you all started giving Grand Tests?

#### 1

Replies
##### ALGORITHM
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)); }

#### 1

Replies
##### ALGORITHM
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?

#### 1

Replies
##### EMAT 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)

#### 1

Replies
##### TOC 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 why

#### 1

Replies
##### Hit 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?

#### 1

Replies
##### Error control in transport layer
What if the checksum bits are also corrupted while we are sending actual data

#### 1

Replies
##### COA
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) 64

#### 1

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.