Practice Questions
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
- Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a detailed analysis of whether the Boolean function f(a, b) = a' + b is functionally complete. The instructor begins by testing the function with identical inputs, showing that f(a, a) and f(b, b) both result in a constant logic 1, which initially suggests limitations. However, the core of the lesson involves manipulating the inputs to derive fundamental logic gates. By setting the second input to logic 0, the function simplifies to f(a, 0) = a', successfully generating the NOT operation. Subsequently, the instructor demonstrates how to generate the OR operation by nesting the function, specifically calculating f(f(a, 0), b), which simplifies to a + b. Since the set containing NOT and OR is a known functionally complete set, the instructor concludes that the original function f(a, b) = a' + b is indeed functionally complete.
Chapters
0:00 – 1:33 00:00-01:33
The lecture starts with the question 'f(a, b) = a' + b is functionally complete?'. The instructor writes down test cases f(a, a) = a' + a = 1 and f(b, b) = b' + b = 1, marking them with an X to show they yield constant outputs. He then rewrites the function f(a, b) = a' + b. To prove completeness, he sets b=0, deriving f(a, 0) = a' + 0 = a', which represents the NOT gate. Next, he constructs a nested function f(f(a, 0), b) to find the OR gate. Substituting the previous result, he gets f(a', b) = (a')' + b = a + b. Finally, he confirms that since both NOT and OR are generated, the function is functionally complete.
This lesson illustrates the practical application of functional completeness testing. Instead of memorizing rules, the instructor demonstrates a constructive proof method. By systematically substituting constants (0 and 1) and variables into the function, he successfully isolated the NOT and OR operations. This confirms that the implication-like function (a' + b is equivalent to a -> b) can implement any digital circuit, provided constants are available as inputs. The visual step-by-step derivation on the whiteboard reinforces the algebraic manipulation required to solve such problems in digital logic design.

