GATE CSE 2023 Paper & Analysis - Memory Based

Question

Hi All,

Find the GATE CSE 2023 Memory Based Questions & Analysis in this blog.

All Questions – 

https://gateoverflow.in/tag/memorybased-gatecse2023

 

$\color{\red}{\text{Theory of Computation:}}$

Question 1: PDA Push Down Automata Question

Question 2: Context Free Grammar But Language Regular

Question 3: Number of States in the Minimal DFA

Question 4: Intersection Closure Property based Question

Question 5: DFA to Regular Expression question: 1(0+11)*

$\color{\red}{\text{Compiler Design:}}$

Question 1: Lexical Analysis & NFA question (Digit, Letter)

Question 2: SDT Question: String 10#011

Question 3: Liveness Analysis of Control Flow Graph

$\color{\red}{\text{DBMS:}}$

Question 1: Degree(Arity) of a Relation

Question 2: SQL question Number of Tuples

Question 3: Primary Index on Data File, Binary Search

$\color{\red}{\text{Computer Organization & Architecture COA:}}$

Question 1: 8-way Set Associative Cache, Tag Bits

Question 2: Pipeline 3 Stages, 100 Instructions

Question 3: Assembly Code, U1,U2,U3,U4 Question

$\color{\red}{\text{Operating Systems OS:}}$

Question 1: Semaphore Question, Binary & Counting Semaphore

Question 2: LRU Question, Number of Page Faults

Question 3: Multi-Level Paging, Number of Levels

Question 4: Starvation in which CPU Scheduling 

Question 5: Threads need to save  stack pointer, PC, page table base register

$\color{\red}{\text{Computer Networks:}}$

Question 1: DNS + HTTP question, 10 objects, pipelined persistent connection

$\color{\red}{\text{DS+Algo:}}$

Question 1: BFS question value of B(Φ)

Question 2: Heap Extract min, insert

Question 3: Output of C program static x

Question 4: C function all activation tree

Question 5: Algo: Two function comparison

Question 6: Singly Linked list Doubly Linked List

$\color{\red}{\text{Engineering Maths:}}$

Question 1: Probability Independent Events Coin Toss

$\color{\red}{\text{Discrete Mathematics:}}$

Question 1: First Order Logic question, P(x) --> Q(x,y)

Question 2: Greedy Graph Coloring Algorithm

Question 3: Group Theory Question

Question 4: Permutation question, Separating Permutations of A,B

Question 5: Equivalence Classes, Surjective Function Question

---

$\color{\red}{\text{Complete Analysis of GATE 2023 Paper:}}$

https://youtube.com/playlist?list=PLIPZ2_p3RNHjHdn18a-3dcvHbYoovTtn8 

Share more Memory Based GATE CSE 2023 questions in the comments.

Comments

when is next analysis starting?

---

@gaurav_kumar 

Here it is:

GATE 2023 Complete Solutions & Analysis

---

Radix 4 representation of any number is 132. What is the number in the radix 5 representation?

---

110

---

the paper was easy to moderate, in this paper accuracy is a matter.

---

very easy paper, I don't want to discuss paper yet but I think except of 2-3 2 markers every question was answerable during the exam and yes accuracy will matter the most in this paper ;) Hope I haven't made any silly mistakes :).

---

I felt paper was very much like AIMT 3!!

---

Same,easy to moderate

---

What's the answer for keystroke question

---

The algorithm for graph colouring was to pick minimum from {1,2,3,......N} set of natural numbers and if the number doesn't belongs to any of your neighbours. It was an MSQ

A)The graph colouring will be right or something like that

B) It will return the chromatic number of the graph

C)It won't colour the graph properly

If anyone remembers options correctly then please add

---

Suppose typing happens at 1 keystroke per second.

Suppose a system uses polling where cpu does polling at every 10ms and time required to do that is 100 micro sec. If after this polling cpu get to know that keystroke was happened then it will take additional 200 micro sec to service that. Let T1 is the total time it took for polling in 1 second.

Another system implements interrupt based. Where device will interrupt cpu when keystroke happened and to service it total 1 ms time is taken. Let T2 is the total time for this in 1 second.

Find T1/T2

---

Aptitude-

1- there was a question,  Like in a country called Zombieland,  physically fit

Technical-

1. TOC-  closure property   question

2. Language accepted by PDA

3. Lexical analysis ( reg exp to NFA)

4. Liveliness Analysis

5. Pagefaults using LRU

6. A question of COA related to Assembly code

7. One asymptotic notation question( n and n^2 )

8. One question related to the context switch in thread

9. Greedy coloring ( chromatic number etc related)

10.1st order logic question

11. One question of implementing 4kb memory to four 1 kb each then some starting address of each block)

12. Wrap around time sequence number question

13. T1/T2 ratio question of COA

14. Hashing technique for maximum collision

Sir, Basically these questions are missing.

---

1200/1000 = 1.2

---

10.2

---

$1.02$