11 тысяч подписчиков
2 тысяч видео
L5.27 | Equivalent Functional dependency Sets in DBMS | How to check whether two FD sets are equal
L3.9 | Examples: How to remove left recursion from Context Free Grammar | Eliminate Left Recursion
L5.6 | What is Handle / Handle Pruning in Compiler Design | How handles used in bottom up parsing
L1.155 | Examples: Conversion from FA to Regular Expression, State Elimination Method
L3.48 | Dangling-else Grammar (observation) in Compiler Design(CD)
L5.37 | Method-3: Lossless and Lossy Decomposition in DBMS | easiest way to check Lossless
L4.3 | Top-down parser with Backtracking (Brute-force Approach) in Compiler Design(CD)
L5.21 | Prime Attributes in DBMS | Non prime Attributes in DBMS | Key Attribute | Non key Attribute
C programming | Static and Dynamic scoping | Scoping rules | Lexical scoping | Fluid Binding
L8.10 | Clustering index | Clustering index in dbms with example | Sparse index | Dense index
L3.10 | Examples: How to remove left recursion from Context Free Grammar | Eliminate Left Recursion
L1.7 | Expressive Power of an Automata | DFA NFA DPDA NPDA PDA LBA HTM TM | Theory of Computation
L1.9: Real Time OS | Hard Real Time vs Soft Real Time OS
L6.6: Static linking vs Dynamic linking and Static loading vs Dynamic loading
L1.14: Set Associative mapping cache Hardware, working and analysis
L4.42: Fork and join example-2 & 3 in Concurrent programming
L2.1 | What is Entity in DBMS | What is Entity Set in DBMS | Entity Type in DBMS
L7.4 | What is Schedule in DBMS | Serial Schedule | Concurrent Schedule | Non serial schedule
L4.1| Control Unit in Computer Organization | Processor Design
L4.3| Instruction fetch and decode internal working in control unit
L4.4| Operand fetch in control unit for all addressing modes
L4.2| Registers processor must hold | PC, IR, MBR, MAR
L7.41 | Recoverable Schedule in DBMS | Irrecoverable Schedules in DBMS | Recoverability
L1.9 | Types of Finite Automata | Finite Automata as acceptor | Finite Automata as Transducer
L7.27: Directory structure in file system OS | Single level, two level Directory
L1.5 | What is power of an alphabet in TOC | What is Kleene closure in TOC | Positive closure in TOC
L4.9: Disabling interrupts in Synchronization Mechanism | Busy waiting solution
L7.34 | View Serializability | How to test View Serializability | View serializable schedule
L7.3: Disk Transfer Time | Seek Time | Rotational Latency | Formula
L5.20 | Prime Attributes in DBMS | Non prime Attributes in DBMS | Key Attribute | Non key Attribute
How to compute time complexity of Recursive algorithms | Recursive algorithm time complexity
L2.7| Types of Attributes in DBMS | Simple, Composite, Single valued, Multi valued, Stored, Derived
L6.13 | SDD for Type Checking | Compiler Design (CD)
L5.18 | How Many Super Keys | Super keys | Super key in dbms | Given candidate key
L5.19 | GATE-2014 | Maximum number of super keys | How Many Super Keys
Lec-10 | SQL: Updating tuples in a relation | Data manipulation Language
L5.26: Deadlock Ignorance | Ostrich Algorithm in Deadlock in OS
L1.12: Types of CPU modes | User mode vs Kernel mode
L4.8: Control signals to execute complete instruction
L4.23 | GATE 2004 Maximum and Minimum Number of Tuples Natural Join | Relational Algebra operation
L4.19 | Maximum Tuples in natural Join | Relational Algebra operations in DBMS
L5.38| Lossless and Lossy Decomposition in DBMS | To check whether decomposition is Lossless in DBMS
Lec-46 | What is EXISTS operator | What is NOT EXISTS operator | EXISTS with Nested query Part-1
L7.7 | What is Concurrent Schedule with example | Non serial schedule | Concurrent Schedule in DBMS
L1.25: Associative Law
L3.6 | Recursive context free Grammar and non recursive context free grammar with example
L 1.89 | Compound Automata concept with with example | Compound DFA concept with example
L2.2 | Relationship in database | Relationship Set in ER Diagram | Relationship in ER Diagram
GATE 2021 Exam Dates and Updates 25 July 2020 Media Briefing IIT Bombay |
L5.1 | Functional Dependency in DBMS | Dependency in dbms | FD in DBMS
