How to Declare & Initialize Array in C

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/data-structures/array/array-basics-ops/asset-how-to-declare-initialize-array-in-c after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This C programming lecture introduces array declaration, initialization, and element modification. The instructor first presents the general syntax `datatype arrayName[arraySize];`, using `int data[100];` as a concrete example. A diagram maps zero-based indices to element positions, emphasizing that indexing starts at 0 and ends at arraySize-1. The lesson then transitions to initialization, showing `int mark[5] = {19, 10, 8, 17, 9};` and the size-omitted form `int mark[] = {19, 10, 8, 17, 9};`, where the compiler infers size from the initializer list. Finally, the video demonstrates changing individual elements via index assignment: `mark[2] = -1;` (third element) and `mark[4] = 0;` (fifth element).

Chapters

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

    The instructor introduces array declaration in C with the syntax `datatype arrayName[arraySize];` and the example `int data[100];`. A block diagram shows an array named `num` with five elements (values 2, 8, 7, 6, 0), mapping indices `num[0]` through `num[4]` to Element 1 through Element 5. The lesson then transitions to initialization, displaying `int mark[5] = {19, 10, 8, 17, 9};` and the alternative `int mark[] = {19, 10, 8, 17, 9};`, noting the compiler infers size when omitted.

  2. 2:00 – 3:26 02:00-03:26

    The video demonstrates changing array element values using index assignment. Starting from `int mark[5] = {19, 10, 8, 17, 9};`, the instructor shows `mark[2] = -1;` to set the third element to -1 and `mark[4] = 0;` to set the fifth element to 0. On-screen text explicitly labels these as "make the value of the third element to -1" and "make the value of the fifth element to 0," reinforcing zero-based indexing where element position n corresponds to index n-1.

The lecture follows a clear progression: declaration syntax, memory layout visualization, initialization with and without explicit size, and element modification. Key takeaways include: (1) C arrays use zero-based indexing, so an array of size N has valid indices 0 through N-1; (2) the compiler can infer array size from an initializer list when the size is omitted in brackets; (3) individual elements are accessed and modified using bracket notation with a specific index. The visual diagrams connecting element positions to indices help students avoid the common off-by-one error.

Loading lesson…