chars,signed and unsigned

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ISRO/programming/c-fundamentals/data-type-fundamentals/asset-charssigned-and-unsigned after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. General Aptitude & Reasoning: Number System, Percentage, Ratio and Proportion (Ratios), Average, Profit and Loss, Simple Interest and Compound Interest, Algebra, Probability, Permutation and Combination, Venn Diagram, HCF LCM, Pipe and Cistern, Linear Algebra, Sequence and Series (Series), Statistics, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Calculus, Trigonometry, Vectors, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Series (Number and Letter Series) (Numerical Relations and Reasoning), Puzzle Solving (Puzzles), Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Calendar, Seating Arrangements, Coding Decoding, Blood Relations, Directions (Direction Test), Clock, Analytical Reasoning (Counting Figures Reasoning), Ranking, Order and Sequence, Logical Sequence Of Words, Cubes & Dices, Number System, Powers, Surds and Logarithms, Mathematical Operations, Simplification and Approximation, Percentages, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Transformation of Shapes, Signal Space and Optimum Detection, Alphabet and Word Tests, Syllogisms and Venn Diagrams, Analogy and Classification, Mensuration, Constraint Puzzles, Patterns in Two-Dimensional Figures, Three-Dimensional Patterns and Visualization, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Numerical Reasoning, Assembling and Grouping of Shapes, Coding and Decoding, Cubes and Dice, Series Completion, Direction Sense, Logical Deduction and Induction, Order, Ranking and Sequence, Clocks and Calendars, Critical Reasoning, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Algebra, Data Interpretation, Time and Work, Probability, Speed, Time and Distance, Statistics, Data Sufficiency, Trigonometry, Differential Calculus, Blood Relations, Mixture and Alligation, Speed Time and Distance, Combinatorics
  3. Computer Networks & Cybersecurity: 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
  4. Programming, Data Structures & Algorithms: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  5. AI, Machine Learning, Big Data & Cloud: Emerging Tech Trends, Artificial Intelligence, Big Data Systems, Approaches to AI, Search Algorithms, Knowledge Representation, Cloud Computing
  6. Digital Logic & Computer Organization: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, 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, 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, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Processor Organization and Instructions, Memory Hierarchy and Input/Output, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes, Semiconductor Memories and Programmable Logic
  7. TOC & Compiler: 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, 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
  8. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  9. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Distributed Systems
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Object Oriented Technology, HTML Basics, JavaScript-Basics, Java, XML
  11. Database Management System: 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, Data Warehousing & Mining, Enhanced Data Models, NoSQL
  12. Other Recurring CS Topics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, Multimedia
  13. Live Classes: ISRO Live classes
  14. Full Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture explains signed and unsigned character types in C, paralleling signed and unsigned integers. Both occupy one byte but differ in ranges. The instructor uses `char ch = 'A';` to show characters are stored as binary ASCII equivalents (65 for 'A'). He explains that if 65's binary is stored, -54's binary can also be stored in a signed char. The core distinction is defined: a signed char ranges from -128 to +127, while an unsigned char ranges from 0 to 255. The lecture demonstrates assigning a value outside this range, such as 291 to a signed char, results in overflow. The value wraps around to the other side, resulting in 35. Finally, the video addresses infinite loops. A loop iterating from 0 to 255 using a signed char fails because the value wraps to -128 after reaching +127, satisfying the loop condition indefinitely. The solution is using `unsigned char` with a loop limit of 254.

Chapters

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

    The instructor introduces "Chars, signed and unsigned" on the slide. He explains that parallel to signed and unsigned integers (short or long), chars also exist in both forms, occupying one byte each. He considers `char ch = 'A';` and explains that 'A' is stored as the binary equivalent of its ASCII value, 65. He posits that if 65's binary can be stored, then -54's binary can also be stored in a signed char. He explicitly states the ranges: a signed char is the same as an ordinary char with a range from -128 to +127, whereas an unsigned char has a range from 0 to 255.

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

    The instructor presents a program to illustrate the range: `main() { char ch = 291; printf( "\n%d %c", ch, ch ); }`. He asks what the output would be, noting that 291 is too big for a char (max +127). He explains that when the value exceeds +127, an appropriate value from the other side of the range is picked up. He draws a number line from -128 to +127 and performs a calculation: 291 minus 127 equals 164, and 164 minus 128 equals 36 (though the slide text says 35, he eventually points to 35). He concludes that the value stored is 35, and its corresponding character '#' gets printed out.

  3. 5:00 – 6:02 05:00-06:02

    The instructor shows another program: `main() { char ch; for ( ch = 0; ch <= 255; ch++ ) printf( "\n%d %c", ch, ch ); }`. He explains this is an indefinite loop because `ch` is a signed char. When `ch` is +127 and `ch++` is performed, it becomes -128 instead of +128. Since -128 is less than 255, the condition is satisfied. The value oscillates between -128 and +127. To overcome this, he suggests declaring `ch` as an `unsigned char`. However, he notes that even then, `ch++` at 255 would try to make it 256, which cannot be stored. He shows a workable program using `unsigned char ch` with the loop condition `ch <= 254`. He states the program is definitely less elegant, but workable all the same.

The video systematically builds understanding from the definition of char types to their behavioral quirks in code. It starts by defining the memory size and range differences between signed and unsigned chars. It then applies this knowledge to explain overflow behavior, showing how values wrap around the range limits. Finally, it connects this behavior to control flow, demonstrating how overflow can cause infinite loops and providing a corrected approach using unsigned types and adjusted loop bounds. This progression helps students understand not just the theory of data types, but their practical impact on program logic and debugging, ensuring they can write robust code that handles character ranges correctly.

Loading lesson…