Orthogonal Function

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/digital-electronics/boolean-expression/boolean-function-counts/asset-orthogonal-function after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Speed Time and Distance, Mixture and Alligation, Data Interpretation, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Divisibility Rules, Age Problems, Pipe and Cistern, Partnership, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Speed Mathematics and Basic Mathematics, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Inequality, Data Sufficiency, Cubes & Dices
  3. Computer Networks & Cybersecurity: 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, Network Security
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. TOC & Compiler: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Complexity Theory, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture introduces the concept of orthogonal functions in Boolean algebra, defining them as functions where the complement (f') is equal to the dual (f^d). The instructor demonstrates this property using the XOR function, f = a'b + ab', showing that both its complement and dual simplify to the Ex-NOR function. The lecture also notes that a function cannot be simultaneously orthogonal and self-dual. The session concludes by transitioning to a new problem set asking students to identify which of the given minterm functions are self-dual.

Chapters

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

    The instructor begins by defining an orthogonal function with the on-screen text: 'A function f is said to be orthogonal if the compliment and dual of the function are same.' He writes the condition f' = f^d on the board. He also notes a property visible at the top: 'A function can never be both orthogonal and self-dual because it imply the function is same to its compliment, which is never possible.' To illustrate the definition, he writes the function f = a'b + ab' (XOR). He then calculates the dual by replacing AND with OR and OR with AND, resulting in (a'+b)(a+b'). Simultaneously, he calculates the complement using De Morgan's laws, which also results in (a+b')(a'+b). He labels both results as 'Ex-NOR' on the board, confirming that for this function, the complement equals the dual, thus making it orthogonal.

  2. 2:00 – 4:04 02:00-04:04

    After a 'Break' slide, the instructor presents a new question: 'Q which of the following functions are self-dual?' The slide lists four options involving minterm notation: f(a, b, c) = Σm(0, 3), F(a, b, c) = Σm(0, 1, 6, 7), F(a, b, c) = Σm(1, 2, 4), and F(a, b, c) = Σm(3, 5, 6, 7). The instructor stands by the board, preparing to explain the criteria for self-duality, which requires a function to be equal to its own dual (f = f^d). He gestures towards the options, indicating the start of a problem-solving session to determine which specific minterm combinations satisfy the self-dual condition.

The lesson progresses from defining orthogonal functions to applying the definition with a concrete XOR example, proving that its complement and dual are identical Ex-NOR expressions. It briefly establishes a theoretical constraint that orthogonal and self-dual properties are mutually exclusive. Finally, the lecture shifts focus to self-dual functions, presenting a multiple-choice question with minterm lists to test the student's ability to identify functions where f = f^d. The transition from theoretical definition to practical application marks the end of this segment.

Loading lesson…