chars,signed and unsigned

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/RSSB-SENIOR-COMPUTER-INSTRUCTOR/paper-2-programming-fundamentals/c-fundamentals/data-type-fundamentals/asset-charssigned-and-unsigned after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
  3. Paper-1 & 2 | Data Interpretation: Data Interpretation
  4. Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
  5. Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
  6. Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
  7. Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
  8. Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
  9. Paper-2 | Fundamentals of Computer: Basics of COA, Number System, Floating Point Rep, Number Representation
  10. Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits
  11. Paper-2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Linux OS, Distributed Systems
  12. 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, Relational Calculus, File Organization & Indexing, Transaction Management, Concurrency Control
  13. Paper-2 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  15. Paper 2 | Oops, C++, Java: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
  16. 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
  17. Paper 2 | Emerging Trends and AI: Emerging Tech Trends, Artificial Intelligence
  18. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Advanced Algorithms
  19. Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, 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, Network Security, Ethical Hacking
  20. Paper-2 I Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  21. Paper-2 | Computer Organization and Architecture: Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations
  22. Paper-2 | Web Development: JavaScript-Basics, HTML Basics, CSS, XML
  23. Pedagogy: Child Development, Concept of Pedagogy, Psychology, Theories, Inclusive Education, Experiential Pedagogy, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
  24. Live Sessions: RSSB Live Sessions
  25. RSSB Paper 1 - Full Mock Tests:
  26. RSSB Paper 2 - Full Mock Tests:
  27. SCI Previous Year Papers:
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…