Partially complete Function

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/CDAC-C-CAT-COMPLETE-PREPARATION/section-c-digital-electronics/boolean-expression/functional-completeness/asset-partially-complete-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Section A | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Preposition, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Articles, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Verbal Analogy (Word Based Analogy)
  2. Section A | Quant Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Arithmetic, Algebra, Powers and Exponents (Surds and Indices), Average, Age Problems, Percentage, Profit and Loss, Partnership, Time and Work, Simple Interest and Compound Interest, Mensuration and Geometry, Probability, Pipe and Cistern
  3. Section A | Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Calendar, Clock, Blood Relations, Directions (Direction Test), Seating Arrangements, Ranking, Order and Sequence, Puzzle Solving (Puzzles)
  4. Section B | C Programming: C Programming by Yash Sir, Coding Questions by Yash Sir
  5. Section B | Data Structures: Algorithm Analysis, Greedy Algorithms, Time Complexity Analysis, Sorting Algorithms, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs
  6. Section B | OOP (C++): Object Oriented Programming (OOPS), Programming in C++
  7. Section B | OS: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS
  8. Section B | Networking: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  9. Section B | AI & Big Data Basics: AI & ML by Arun Sir, Big Data Systems
  10. Section C | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  11. Section A, C | Comp. Fundamentals, COA: 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
  12. MOCK TEST:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture focuses on the digital logic concept of 'Partially Functionally Complete' functions. The instructor defines this property as the ability to implement any digital circuit using a specific function, with the constraint that logic 0 or 1 can be used as input lines, but complemented forms of inputs are not allowed. He uses the function f(a,b) = a' . b as a case study to demonstrate how to verify this property through algebraic manipulation.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor begins by writing the formal definition on the whiteboard: 'A function is said to be partially functionally complete, if it can be implement any digital circuit with support of logic 0 or 1 as a input line (can't use complemented form).' He introduces the specific function f(a,b) = a' . b and systematically evaluates it under different input conditions. He first checks f(a,a), which results in a' . a = 0. Next, he evaluates f(a,0), yielding a' . 0 = 0. Finally, he calculates f(a,1) = a' . 1 = a'. This last step is critical as it proves the function can generate a NOT gate (inverter) by simply tying one input to logic 1.

  2. 2:00 – 3:16 02:00-03:16

    Moving to the right side of the board, the instructor analyzes the nested expression f(f(a,1), b). He substitutes the previously derived result, replacing the inner f(a,1) with a'. This simplifies the expression to f(a', b). By applying the original definition f(x,y) = x' . y, he substitutes a' for the first variable, resulting in (a')' . b. The double negation cancels out, leaving a . b. This derivation proves that the function can implement an AND gate. Since the function can generate both NOT and AND operations, it satisfies the criteria for being partially functionally complete.

The lecture effectively bridges the gap between abstract definitions and practical circuit implementation. By breaking down the function f(a,b) = a' . b, the instructor demonstrates that partial functional completeness relies on the availability of constant inputs to generate fundamental logic gates like NOT and AND. This capability allows the construction of any complex digital circuit, provided the specific constraints regarding complemented inputs are respected. The step-by-step algebraic proof serves as a template for analyzing other functions for this property.

Loading lesson…