Subroutine

Duration: 9 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/digital-computer-organization-and-architecture/programming-the-basic-computer/program-control-io-handling/asset-subroutine 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.

This video is a lecture on subroutines in computer architecture, presented by an instructor. The lecture begins with a definition of a subroutine as a reusable set of instructions, highlighting its benefits of reusability and modularity. It explains that a branch can be made to a subroutine from any part of the main program and that the return address must be stored to enable a successful return. The instructor identifies the BSA (Branch and Save Address) instruction as the fundamental mechanism for linking the main program to a subroutine. The second part of the video transitions to a practical example, showing a program in assembly language that demonstrates the use of subroutines. The program's goal is to shift the content of the Accumulator (AC) four times. The instructor walks through the code, which includes a main program and a subroutine, and uses red annotations to illustrate the flow of control, showing how the BSA instruction branches to the subroutine and how the return address is managed. The final segment focuses on the subroutine itself, detailing the loop that performs the four left shifts and the return instruction (BUN SH4 I) that transfers control back to the main program, completing the subroutine call and return cycle.

Chapters

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

    The video starts with a slide titled 'Subroutines'. The instructor defines a subroutine as 'A set of common instructions that can be used (called) in a program many times'. He emphasizes the benefits of reusability and modularity. The slide also states that a branch can be made to a subroutine from any part of the main program and that the return address must be stored to successfully return. The instructor explains that in a basic computer, the BSA (Branch and Save Address) instruction is the link between the main program and the subroutine. He begins to write 'functions' in red next to the title, and then adds 'reusability / modularity' to highlight the key advantages.

  2. 2:00 – 5:00 02:00-05:00

    The instructor continues to explain the concept of subroutines, emphasizing that they are a set of common instructions that can be called multiple times. He underlines the phrase 'A set of common instructions that can be used (called) in a program many times is called a subroutine' and adds 'reusability / modularity' in red. He then discusses the need to store the return address, writing 'stack' in red below the third bullet point, indicating that the return address is stored on the stack. He also underlines the word 'branch' in the second bullet point, reinforcing the idea of jumping to the subroutine.

  3. 5:00 – 9:14 05:00-09:14

    The video transitions to a new slide titled 'Program to demonstrate the use of subroutines: Shifting content of AC four times to the left'. The slide displays a table of assembly code. The instructor explains the main program, which loads a value into the accumulator (AC) and then branches to a subroutine using the BSA instruction. He points to the BSA SH4 instruction at location 102, explaining that it branches to the subroutine at location 109. He then explains the subroutine, which performs four left shifts (SH4) and then returns to the main program using the BUN SH4 I instruction. He uses red annotations to draw arrows showing the flow of control, labeling the main program and the subroutine, and highlighting the BSA and return instructions to illustrate the complete subroutine call and return process.

The lecture provides a comprehensive overview of subroutines, starting with a conceptual definition and its benefits, then moving to the technical implementation. It clearly explains the fundamental role of the BSA instruction in initiating a subroutine call and the necessity of storing the return address, which is managed by the stack. The practical example of shifting the accumulator content four times effectively demonstrates the entire process, from the main program's call to the subroutine's execution and its return, solidifying the understanding of how subroutines enable modular and efficient program design.

Loading lesson…