4 тысяч подписчиков
970 видео
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 2023 | Question: 26 Consider the following program :int main(){ f1();f2(2); f3(); return
GATE CS 2016,Set-2,Q18: Consider the following types of languages:L1 :Regular, L2: Context -free,
Ch-2.24:DPDA|NPDA|Closer Property of DCFL|Closer Property of CFL
GATE CS 2020 | Q 39: Which one of the following predicate formulae is NOT logically valid?Note that
Ch 1.8:The Role Of The Lexical Analyzer |Secondary Function Of Lexical Analyzer |Error Recovery
GATE CS 2012 | Q 29:Let G be a weighted graph with edge weights greater than one and G′ be the graph
Ch-1.33:Conversion of ∈- NFA to DFA with example | TOC Lecture for GATE CSE
GATE CS 2023 | GA Q 8:Which one of the following sentence sequences creates a coherent narrative?
GATE CS 2022 | Q5: Consider the problem of reversing a singly linked list. To take an example, given
Ch 1.3.4: Logic | Translating from English into Logical Expressions
GATE CS 2017,Set-1,Q38 :Consider the following languages over the alphabet Σ = {a, b, c}.Let L1 = {a
GATE CS 2024 | Set 1 | Question: 28 Consider the following grammar 𝐺, with 𝑆 as the start symbol.
GATE CS 2021,Set-1,Q1:Suppose that L1 is a regular language and L2 is a context-free language. Which
Ch-1.56:Conversion of Regular Expression to Finite Automata|Method of Synthesis| RE → FA
Ch 4.2:Min Max problem | Divide and conquer | Algorithm lectures for GATE CSE by Monalisa Pradhan
GATE CS 2015,Set-1,Q3: For any two languages L1 and L2 such that L1 is context-free and L2 is recurs
GATE CS 2022 | Q37: Consider the following languages:L1={a^nwa^n|w∈{a,b}*}L2={wxw^R|w,x∈{a,b}*,|w|
Ch 1.1 : Instances and Schemas ,Data Models |DBMS Intro |DBMS lectures by
Ch 3.12:The Value-Number Method for Constructing DAG’s| Compiler Design lecture for GATE CSE
Ch 5.3:Maintaining the heap property | MAX-HEAPIFY procedure with Examples |
Ch 1.18: Analysis of Recursive Algorithms |Ex 1:Factorial function |Method of backward substitutions
GATE CS 2020,Q33:Consider the productions A → PQ and A → XY. Each of the five non-terminals A,P,Q,X,
Ch-2.9:Conversion of Right Linear Grammar→Finite Automata and Finite Automata→Right Linear Grammar
GATE CS 2021,Set-1,Q26:Consider the following grammar (that admits a series of declarations, follow
GATE CS 2024 Set 1| GA Question: 3 Consider the following sample of numbers:9, 18, 11, 14, 15, 17,
GATE CS 2021,Set-2,Q41:For a string w , we define wR to be the reverse of w.For example ,if w=01101
Ch 3.11:DAG examples| Compiler Design 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
