Main & Command Line Arguments
Duration: 25 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
- Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
- Paper 2 | Programming and Data Structures: 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | Theory Of Computation/Automata Theory: 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
- 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
- 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
- Paper 2 | DataBase Management System/DBMS: 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 Database Recovery
- Paper 2 | Computer Networks: Introduction to CN 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This lecture introduces the main function in C programming and command-line arguments. The instructor begins by defining main as a system-defined, unchangeable entry point that provides resources to the program. The structure of main() is broken down into its return type, function name, argument list, and body scope. The lesson then transitions to command-line arguments, detailing three variations of the main function signature: a normal main(), a two-argument version using argc and argv, and a three-argument version including environment variables. A practical example demonstrates compiling a C program with gcc and executing it with specific arguments (10, 3.14, hi), showing how these map to the argv array at indices 0, 1, and 2. Finally, a Java example is introduced to compare command-line argument handling across languages.
Chapters
0:00 – 2:00 00:00-02:00
The lecture introduces the main function in C, listing four primary characteristics: it is a system-defined function, the entry point of a program, provides resources to it, and there cannot be two entry points. The structure of main() is displayed with an argument list and body, noting that the name 'main' cannot be changed. On-screen text includes 'Main Function in C', 'System-defined function', and 'Entry point of a program'.
2:00 – 5:00 02:00-05:00
The instructor elaborates on the main function's properties, adding a handwritten note '(runtime)' next to the entry point description. A simple code example with '#include <stdio.h>' and 'int x=10;' is written above the main function structure. Red annotations accumulate, including a box around 'main' to emphasize its fixed name and checkmarks beside list items 1 and 2. The text 'Name cannot be changed' is prominently displayed.
5:00 – 10:00 05:00-10:00
The focus shifts to the structure of main(), where 'void' is identified as a return type and the argument list corresponds to command line arguments. The instructor circles 'void' and writes '(type or void)' next to it. Arrows point from the word 'Scopes' to the opening and closing braces of the main function. The code structure displays 'void main(argument_list)' with a red label 'Scopes' indicating the function's boundaries.
10:00 – 15:00 10:00-15:00
The lecture covers command-line arguments, outlining three variations of the main function signature: 'main() // normal', 'main(int argc, char *argv[]) // 2 arg.', and a third form including environment variables. The instructor explains that 'argc' represents the argument count and 'argv' is an array of strings. A C program named 'prog1.c' is written and compiled using the command 'gcc prog1.c', then run as 'prog1.exe'.
15:00 – 20:00 15:00-20:00
The instructor demonstrates how to use argc and argv to access the number of arguments and their values. A command-line example shows 'prog1.exe' run with arguments '10', '3.14', and 'hi'. These arguments are mapped to the argv array at indices 0, 1, and 2. The instructor notes that argc equals 3 in this example. On-screen text includes 'argc -> argument count (number of arguments)' and 'argv -> argument vector (array of strings)'.
20:00 – 24:48 20:00-24:48
The instructor compares command-line arguments in C and Java. A diagram shows how command-line inputs like '10', '3.14', and 'hi' map to the argv array. A Java example is added, showing 'javac' and 'java' commands with similar arguments. The instructor circles the 'char *argv[]' parameter in the second main function signature to emphasize its role. The text 'env -> environment variables (array of strings)' is also visible.
The lecture progresses from the theoretical definition of the main function in C to its practical application with command-line arguments. Key concepts include the fixed nature of the main function name, its role as the program's entry point, and the structure of its signature. The transition to command-line arguments introduces argc and argv as mechanisms for passing data from the command line to the program. The practical example of compiling and running a C program with specific arguments reinforces how these concepts work in practice. The final comparison with Java highlights the similarities and differences in handling command-line arguments across languages.

