Orthogonal Function

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/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. Programming, Data Structures, OOP & Java: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep, Artificial Intelligence, साइबर सुरक्षा / Cyber Safety and Security, कंप्यूटर सॉफ़्टवेयर / Computer Software, ऑपरेटिंग सिस्टम / Operating System, वर्ड प्रोसेसिंग (MS Word) / Word Processing (MS Word), कंप्यूटर नेटवर्क / Computer Networks
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory, Number System & Place Value, Factors, Multiples, Divisibility, HCF & LCM, Mensuration — Perimeter, Area, Surface Area, Volume, Data Handling, Graphs & Probability, Coordinates & Graphs, Higher Mathematics — Trigonometry, Quadratics, Polynomials, Progressions, Statistics, Logarithms, समतल क्षेत्रमिति / Plane Mensuration, प्रतिचयन / Sampling
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…