Orthogonal Function

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/unit-i-discrete-mathematical-structure/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. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, 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. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. Paper 2 | Compiler Design: 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…