C PROGRAMMING - OUR FIRST PROGRAM

Duration: 14 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/programming-data-structures-oop-java/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. 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
  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
  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.

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…