SizeOf Operator

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/c-programming/c-fundamentals/understanding-operators/asset-sizeof-operator after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. 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
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces the sizeof() operator in C, defining it as a compile-time mechanism that determines the size of data types or variables in bytes. A central teaching point is that expressions within sizeof() are not executed, meaning side effects like assignments do not occur. The instructor uses specific code examples to demonstrate that while sizeof() returns the size of an integer (e.g., 2 bytes on a 16-bit machine), variables modified inside the operator remain unchanged. The syntax allows sizeof to be applied to variables, types, values, or expressions.

Chapters

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

    The video begins by defining the sizeof() operator as a tool to find the size in bytes of a datatype, variable, or expression. The slide explicitly states it is the only operator evaluated at compile time. A key rule highlighted with red circles and underlining is that expressions inside sizeof are not executed. The instructor presents the syntax sizeof (variable | type | value | expression) and uses a code example where int x = sizeof(a = 10); is shown. The output explanation clarifies that while x stores the size of an integer (2 bytes), the variable a remains 5 because the assignment inside sizeof is ignored.

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

    The final segment revisits the core concept that sizeof() is evaluated at compile time and expressions are not executed. The instructor uses printf statements to show the output of a variable that was never modified inside sizeof(). The slide displays int x = sizeof(a > 10); to show that even relational expressions are not evaluated for their truth value but only for the size of the result type. The output remains consistent: a is 5, and x holds the integer size (2 bytes). This reinforces that sizeof() operates on types rather than runtime values.

  3. 5:00 – 8:29 05:00-08:29

    The lecture continues to reinforce the non-execution rule of expressions within sizeof(). The instructor emphasizes that side effects, such as assignments or increments, do not happen inside the operator. A code snippet demonstrates int a = 5; followed by sizeof(a = 10), where the output confirms a is still 5. The slide notes that sizeof returns the size of an integer, which varies by architecture (e.g., 2 bytes on a 16-bit machine). Handwritten annotations show arithmetic like 10 + 3 to illustrate that sizeof evaluates the type size, not the expression result.

The lecture establishes that sizeof() is a compile-time operator unique for not executing its operand expressions. This prevents side effects, ensuring variables retain their original values even if modified inside sizeof(). The operator returns the byte size of a type, which depends on the machine architecture (e.g., 2 bytes for int on 16-bit systems). Examples consistently show that assignments like a = 10 inside sizeof(a = 10) are ignored, and the variable remains unchanged. The syntax supports variables, types, values, or expressions, but only the type size is returned.

Loading lesson…