Monalisa CS

Ch 1.1.0: Logic | Propositions ,negation

Ch-2.11:Conversion of Regular Grammar→Regular Expression and Regular Expression→Regular Grammar

GATE CS 2016 Set-1,Q46: Consider the following Syntax Directed Translation Scheme (SDTS), with

GATE CS 2021,Set-2,Q9:Let L ⊆{0,1}* be an arbitrary regular language accepted by a minimal DFA with

GATE CS 2024 | Set 1 | Question: 32 Consider the following recurrence relation: 𝑇(𝑛) = {√𝑛𝑇(√𝑛) + 𝑛)

GATE CS 2017 Set 1 | Q1: The statement (¬p)⇒(¬q) is logically equivalent to which of the statements

GATE DA 2024| Question: 42 Let H, 𝐼, 𝐿, and 𝑁 represent height, number of internal nodes, number of

GATE DA 2024 | Question: 22 The fundamental operations in a double-ended queue D are:insertFirst(e)

Ch 3.15:Three-Address Code for Array | Compiler Design lecture for GATE CSE

Snow ❄️ storm

Ch 2.2:Ambiguous Grammar|Unambiguous Grammar|How to convert Ambiguous to Unambiguous grammar

Ch 1.3.1: Logic | THE UNIVERSAL QUANTIFIER ,THE EXISTENTIAL QUANTIFIER

Ch-3.11:Recursive Set Vs Recursive Enumerable Set | Closer Properties

GATE CS 2023 | GA Q 9:f(x) and g(y) are functions of x and y, respectively, and f (x) = g (y) for

Ch 3.43:Run-Time Environments |Storage Organization|Code,Static ,Stack & Heap |Static Versus Dynamic

Ch 1.5.3: Logic | Rules of Inference | Fallacies

GATE CS 2024 | Set 2 | Question: 52 Let 𝐿1 be the language represented by the regular expression 𝑏∗𝑎

GATE CS 2021 Set 1 | Q 7 : Let p and q be two propositions. Consider the following two formulae in

GATE CS 2024 | Set 2 | Question: 42 Consider a context-free grammar G with the following 3 rules.𝑆→𝑎

Ch 1.1.4: Logic | Precedence of Logical Operators , Logic and Bit Operations

GATE CS 2018 | Q 28 : Consider the first-order logic sentence 𝜑 ≡ ∃s∃t∃u∀v∀w∀x∀y 𝜓(s,t,u,v,w,x,y)

Ch-4.2:Rice Theorem |TOC Lecture for GATE CSE

GATE CS 2016 Set 2 | Q 1:Consider the following expressions:I.false II.Q III.true IV.P ∨Q V. ¬Q ∨P

Ch-1.27: NFA Example part-1 | TOC Lecture for GATE CSE

Ch 1.4 : Attributes type ,Simple and composite. ,Single-valued and multivalued. ,Stored and Derived

GATE CS 2010 ,Q10:In a binary tree with n nodes, every node has an odd number of descendants.Every

Ch 3.30:The Data-Flow Analysis Schema |Compiler design lectures for GATE CSE by Monalisa Pradhan

GATE CS 2021 Set 1 | Q 47:Consider a dynamic hashing approach for 4 bit integer keys:There is a main

GATE CS 2017 Set 1 | Q29: Let p, q and r be propositions and the expression (p→q)→r be a ...

GATE CS 2021 Set 1 | Question: 34Let G be a group of order 6, and H be a subgroup of G such that

Compiler Design Syllabus for GATE CS

Ch 3.13 : Test for Empty Relations, exists & not exists | DBMS lectures by @MonalisaCS​

GATE DA 2024 | GA Question: 1 If ‘→’ denotes increasing order of intensity, then the meaning of the

Ch 3.6 Graph Coloring | Graph Theory Lectures by

GATE CS 2024 | Set 1 | Question: 13 Let 𝐿1,𝐿2 be two regular languages and 𝐿3 a language which is

GATE CS 2015 Set 1 | Q1‏: 4Which one of the following is NOT equivalent to p↔q?(A) (¬p∨q)∧(p∨¬q)

Ch 2.5: Cardinality of Sets | Countable Sets ,Uncountable Sets

GATE CS 2023 | Q 29: Consider the context-free grammar G below S→ aSb | X X → aX | Xb | a | b

Ch 2.9.0 : Closures of Relations | Set Theory Lectures

GATE CS 2014 Set-2,Q34:For a C program accessing X[i][j][k], the following intermediate code is

GATE CS 2016 Set 1 | Q1:Let p,q,r,s represents the following propositions.p :x∈{8,9,10,11,12}q :x is

Ch 4.4:Merge sort Algorithm with Example | Divide and conquer| Algorithm GATE lectures

GATE CS 2021,Set-2,Q12: Let L1 be a regular language and L2 be a context-free language. Which of the

All the best for GATE Exam

Ch 2.1.2: The Size of a Set , Power Sets | Set Theory

Ch-2.18:Acceptance of PDA:Acceptance by empty stack & Acceptance by Final State| Operation in PDA

Ch-2.10:Conversion of Left Linear Grammar→Finite Automata and Finite Automata→Left Linear Grammar

Graph , Finite graph , Simple graph , Directed graph

Beautiful Niagara falls illuminations

Ch 2.11.4 : Greatest lower bound (glb), least upper bound (lub) | Poset | Set Theory Lectures

Happy new year to all my students