C PROGRAMMING - OUR FIRST PROGRAM

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-1-programming-language/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: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | 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, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: 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, Security
  15. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. 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
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. 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…