chars,signed and unsigned

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/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. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…