The GOTO Keyword

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/programming-fundamentals/control-flow/switch-jump-stmts/asset-the-goto-keyword after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow 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
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video, presented by Sanchit Jain Sir from Knowledge Gate, discusses the C programming language's 'goto' keyword. The lecture begins by strongly advising against using 'goto', citing that it makes programs unreliable, unreadable, and hard to debug, and that there is seldom a legitimate reason for its use. The instructor argues that structured control flow constructs like 'if', 'for', 'while', and 'switch' are more elegant and logical. To illustrate the concept, the video presents two code examples. The first example uses 'goto' to jump to a label 'sos' based on a condition, demonstrating how it can be used to exit a program. The second, more complex example shows a nested loop structure where a 'goto' statement is used to exit all loops at once when a specific condition is met, with a label 'out' placed after the loops. The video uses on-screen text and code snippets to support the explanation.

Chapters

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

    The video opens with a title slide displaying 'Break' and '2 - The goto Keyword'. The instructor, Sanchit Jain Sir, begins by explaining that the 'goto' keyword should be avoided as it makes a C programmer's life miserable. He states that there is seldom a legitimate reason for using 'goto' and that its use is a primary reason programs become unreliable, unreadable, and hard to debug. He acknowledges that some programmers find 'goto' seductive because it seems easy to use for control flow, but he emphasizes that structured programming constructs like 'if', 'for', 'while', and 'switch' are far more logical and easier to understand. The on-screen text reinforces these points, highlighting the negative consequences of 'goto'. The instructor's tone is cautionary, aiming to dissuade the use of 'goto' in favor of structured programming.

  2. 2:00 – 2:41 02:00-02:41

    The video transitions to a code example to demonstrate the 'goto' keyword. The first code snippet shows a 'main()' function that prompts the user to enter the number of goals scored against India. It uses an 'if' statement to check if the number of goals is less than or equal to 5. If true, it executes a 'goto sos' statement, which jumps to the label 'sos'. The label 'sos' is defined at the end of the function, and the code at that point prints a message about soccer players learning C and then exits the program. The second example shows a more complex scenario with three nested 'for' loops. The loops iterate over variables i, j, and k. Inside the innermost loop, a condition checks if i, j, and k are all equal to 3. If true, a 'goto out' statement is executed, which immediately transfers control to the label 'out', bypassing the rest of the loops. The label 'out' is placed after the loops, and the code at that point prints 'Out of the loop at last!'. The instructor explains that 'goto' can be used to break out of multiple nested loops, which is a common use case for this keyword.

The video provides a comprehensive lesson on the 'goto' keyword in C programming. It begins with a strong pedagogical stance against its use, arguing that it leads to poor code quality and is a hallmark of unstructured programming. The instructor contrasts this with the benefits of structured control flow. To balance this theoretical argument, the video presents two practical code examples. The first demonstrates a simple use of 'goto' to exit a program, while the second illustrates its utility in breaking out of deeply nested loops, a scenario where 'goto' can be a practical solution. The synthesis is that while 'goto' is generally discouraged, it is not entirely obsolete and can be used in specific, well-justified situations, though the primary takeaway is to prefer structured programming constructs.

Loading lesson…