C PROGRAMMING - OUR FIRST PROGRAM

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/TPSC-ASSISTANT-TECHNICAL-OFFICER/programming-in-c/c-fundamentals/intro-data-types/asset-c-programming-our-first-program after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Paper 2 | Computer Organization And Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Control Unit Design, Instr Formats & Modes, Programming the Basic Computer
  4. Paper 2 | Analog And Digital Communication: Introduction to Communication Systems & Random Signals, Analog Communication Systems, Information Theory & Digital Communication Fundamentals, Digital Modulation & Detection Techniques, Error Control, Synchronization & Multiple Access Techniques
  5. Paper 2 | Programming in C: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  6. Paper 2 | Data Structures And Programming: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  7. Paper 2 | Algorithms: Algorithm Analysis, Sorting Algorithms, Time Complexity Analysis, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  8. 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
  9. Paper 2 | 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
  10. Paper 2 | Databases: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  11. Paper 2 | Information Systems and Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  12. Paper 2 | Computer Networks: 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
  13. Paper 2 | Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, CSS, XML, HTML5
  14. Paper 2 | Cyber Security And Emerging Technologies: Emerging Tech Trends
  15. Paper 2 | Cloud Technology: Cloud Computing
  16. Paper 2 | Probability and statistics: Probability, Statistics
  17. Paper-1 English: Vocabulary, Preposition, Articles, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage), Sentence Construction
  18. Paper 1 General Mental Ability & Logical reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Powers and Exponents (Surds and Indices), Algebra, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Pipe and Cistern, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Arithmetic, Speed Mathematics and Basic Mathematics, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Analogy
  19. Paper-1 General Knowledge & Current Affairs: State Wise GK, History, Geography, GK- Current Affairs, Static General Knowledge
  20. Full Length Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces writing a first C program by calculating simple interest. It begins with an OnlineGDB editor showing the formula si = p * n * r / 100 and output 255.000000, then explains program structure using statements ending with semicolons in a free-form language. The session covers comment syntax using /* and */, noting comments cannot be nested but can span multiple lines. It defines main() as a collective name for statements and introduces printf() with format specifiers %f, %d, and %c. Finally, it demonstrates scanf() requiring the address-of operator & before variables to store user input.

Chapters

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

    The video opens with a title slide reading 'Break' and subtitle '6-First program', then transitions to an OnlineGDB code editor. The instructor introduces the first C program for calculating simple interest, displaying the formula si = p * n * r / 100. The program output shows a value of 255.000000 at the bottom of the compiler window, establishing practical context before detailed variable explanations.

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

    The lecture explains basic C program rules, emphasizing that statements are entered in lowercase and must end with a semicolon as a statement terminator. The instructor highlights that C is a free-form language with no specific rules for statement position, using the simple interest code as a visual example. Red dashes highlight individual statements to illustrate sequential execution order and the concept that each instruction is separate.

  3. 5:00 – 10:00 05:00-10:00

    The session covers comment rules in C, showing that comments must be enclosed within /* and */ and can appear before, after, or within statements. The instructor demonstrates that comments cannot be nested but can span multiple lines as multi-line comments, using 'This is a jazzy comment' as an example. A slide then states that main() is a collective name given to a set of statements, with 'Void main()' circled in red for emphasis.

  4. 10:00 – 13:35 10:00-13:35

    The lecture explains that C has no built-in output instruction, introducing printf() with format specifiers: %f for real values, %d for integers, and %c for characters. Examples show printf("%d %d %f %f", p, n, r, si) with notes that \n is called newline. The final section demonstrates scanf("%d %d %f", &p, &n, &r), emphasizing that the ampersand (&) before variables is mandatory as it provides the memory location where user-supplied values are stored.

The lecture progresses from practical program execution to theoretical syntax rules. It starts with a working simple interest calculator in OnlineGDB, then systematically breaks down C language fundamentals: statement structure with semicolon terminators, free-form formatting flexibility, comment syntax and nesting restrictions, the main() function definition, output via printf() with format specifiers, and input via scanf() requiring address-of operators. The simple interest example (p=1000, n=3, r=8.5) serves as a consistent thread throughout, making abstract syntax rules concrete through repeated reference to the same code. The teaching approach prioritizes doing before understanding, writing a complete program first before dissecting its components.

Loading lesson…