Write to a File

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/c-language/dmas-macros/file-handiling-in-c/asset-write-to-a-file after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
  10. 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
  13. General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, 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, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture segment introduces C programming functions for writing data to files, focusing on the distinction between various output methods and practical implementation using file pointers. The instructor begins by presenting a comparative table of five key functions: fprintf(), fputs(), fputc(), fputw(), and fwrite(). Each function is defined by its specific output type, such as formatted strings, whole lines, single characters, numbers, or binary bytes. The teaching flow emphasizes the syntax and usage of fprintf() as similar to printf(), utilizing a formatted string and variable arguments list. Visual cues like red underlines highlight critical terms such as 'formatted string' and 'newline at the end', while checkmarks indicate covered functions. The lecture transitions into a code demonstration where the instructor declares a FILE pointer, initializes a data string, and opens 'file.txt' using fopen() with the write mode argument "w". The code includes a conditional check to verify if the file pointer is NULL, ensuring successful creation before proceeding. The segment concludes by demonstrating how fputs() writes the string data to the file and fclose() closes the connection, with handwritten notes clarifying that 'w' mode creates a new file or overwrites an existing one.

Chapters

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

    The video opens with an introduction to C file writing functions beyond standard fprintf() and fputs(). A table lists five specific functions: fprintf(), fputs(), fputc(), fputw(), and fwrite(). The instructor uses red underlines to emphasize key terms like 'formatted string' for fprintf() and 'newline at the end' for fputs(). Visual checkmarks appear next to functions as they are discussed. The on-screen text explicitly states that fprintf() is similar to printf(), using a formatted string and variable arguments list. This section establishes the theoretical foundation for different output types before moving to code examples.

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

    The instructor demonstrates writing data to a file using C code. The segment shows the declaration of a FILE pointer named fpPtr and initialization of a data string. The code opens 'file.txt' using fopen() with the access mode "w". A red circle highlights the file pointer declaration and the 'w' argument. The code includes an if statement checking if fptr is NULL to handle errors. The fputs() function is used to write the data string into the file, followed by fclose(fptr) to close it. The output section confirms successful operations with messages like 'The file is now opened'. Red circles and checkmarks guide the viewer through each step of the file handling process.

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

    The final segment reinforces the behavior of the 'w' mode in fopen(). The instructor circles the 'w' argument and adds a handwritten note explaining that this mode either creates a new file or overwrites an existing one. The code structure is revisited, showing the sequence of opening a file pointer, checking for errors, writing data using fputs() and puts(), and closing the file. The output section displays success messages for 'file.txt'. Visual annotations connect the code execution flow to the resulting file operations. The instructor emphasizes that 'w' mode is destructive, potentially overwriting previous content.

The lecture systematically progresses from theoretical definitions to practical implementation of file writing in C. The initial phase establishes a taxonomy of output functions, distinguishing between formatted text, lines, characters, and binary data. The instructor uses visual aids like red underlines and checkmarks to direct attention to syntax specifics, such as the 'formatted string' requirement for fprintf(). The middle section transitions to a concrete code example, walking through the lifecycle of file handling: declaration, opening with 'w' mode, error checking via NULL comparison, writing data using fputs(), and closing. The final phase clarifies the side effects of 'w' mode, noting its overwrite capability through handwritten annotations. This progression ensures students understand not just how to write data, but also the specific behaviors of different functions and modes. The consistent use of visual cues like circles and underlines reinforces key syntax elements, making the code structure memorable for exam preparation.

Loading lesson…