SlideShare a Scribd company logo
Structures and Unions in C
D.SEETHALAKSHMI
Assistant Professor of Computer Applications
Bon Secours College for Women
Thanjavur
Objectives
Be able to use compound data structures in
programs
Be able to pass compound data structures as
function arguments, either by value or by
reference
Be able to do simple bit-vector manipulations
Structures and Unions 2
Structures and Unions 3
Structures
Compound data:
A date is
 an int month and
 an int day and
 an int year
Unlike Java, C doesn’t
automatically define functions
for initializing and printing …
struct ADate {
int month;
int day;
int year;
};
struct ADate date;
date.month = 2;
date.day = 4;
date.year = 2021;
Structures and Unions 4
Structure Representation & Size
sizeof(struct …) =
sum of sizeof(field)
+ alignment padding
Processor- and compiler-specific
62
61 EF BE AD DE
c1 c2 i
padding
struct CharCharInt {
char c1;
char c2;
int i;
} foo;
foo.c1 = ’a’;
foo.c2 = ’b’;
foo.i = 0xDEADBEEF;
x86 uses “little-endian” representation
Structures and Unions 5
Typedef
Mechanism for creating new type names
 New names are an alias for some other type
 May improve the portability and/or clarity of the
program
typedef long int64_t;
typedef struct ADate {
int month;
int day;
int year;
} Date;
int64_t i = 100000000000;
Date d = { 2, 4, 2021 };
Overload existing type
names for portability
Simplify complex type names
Structures and Unions 6
Constants
Allow consistent use of the same constant
throughout the program
 Improves clarity of the program
 Reduces likelihood of simple errors
 Easier to update constants in the program
int array[10];
for (i=0; i<10; i++) {
…
}
#define SIZE 10
int array[SIZE];
for (i=0; i<SIZE; i++) {
…
}
Preprocessor directive
Constant names are
capitalized by convention
Define once,
use throughout
the program
Structures and Unions 7
Arrays of Structures
Date birthdays[NFRIENDS];
bool
check_birthday(Date today)
{
int i;
for (i = 0; i < NFRIENDS; i++) {
if ((today.month == birthdays[i].month) &&
(today.day == birthdays[i].day))
return (true);
return (false);
}
Constant
Array declaration
Array index, then
structure field
Structures and Unions 8
Pointers to Structures
Date
create_date1(int month,
int day,
int year)
{
Date d;
d.month = month;
d.day = day;
d.year = year;
return (d);
}
void
create_date2(Date *d,
int month,
int day,
int year)
{
d->month = month;
d->day = day;
d->year = year;
}
Copies date
Pass-by-reference
Date today;
today = create_date1(2, 4, 2021);
create_date2(&today, 2, 4, 2021);
Structures and Unions 9
Pointers to Structures (cont.)
void
create_date2(Date *d,
int month,
int day,
int year)
{
d->month = month;
d->day = day;
d->year = year;
}
void
fun_with_dates(void)
{
Date today;
create_date2(&today, 2, 4, 2021);
}
today.month:
today.day:
today.year:
0x1000
0x1004
0x1008
month: 2
day: 4
year: 2021
0x30A0
0x30A4
0x30A8
d: 0x1000
0x3098
2
4
2021
Structures and Unions 10
Pointers to Structures (cont.)
Date *
create_date3(int month,
int day,
int year)
{
Date *d;
d->month = month;
d->day = day;
d->year = year;
return (d);
}
What is d pointing to?!?!
(more on this later)
Structures and Unions 11
Abstraction in C
struct widget;
struct widget *widget_create(void);
int widget_op(struct widget *widget, int operand);
void widget_destroy(struct widget *widget);
From the #include file widget.h:
From the file widget.c:
#include “widget.h”
struct widget {
int x;
…
};
Definition is hidden!
Structures and Unions 11
Structures and Unions 12
Collections of Bools (Bit Vectors)
Byte, word, ... can represent many Booleans
One per bit, e.g., 00100101 = false, false, true, ..., true
Bit-wise operations:
Bit-wise AND: 00100101 & 10111100 == 00100100
Bit-wise OR: 00100101 | 10111100 == 10111101
Bit-wise NOT: ~ 00100101 == 11011010
Bit-wise XOR: 00100101 ^ 10111100 == 10011001
Structures and Unions 13
Operations on Bit Vectors
const unsigned int low_three_bits_mask = 0x7;
unsigned int bit_vec = 0x15;
0…00 0111
0…01 0101
Always use C’s unsigned types for bit vectors
A mask indicates which bit positions we are interested in
0…00 0101 == 0…01 0101 & 0…00 0111
important_bits = bit_vec & low_three_bits_mask;
Selecting bits:
Result = ?
Structures and Unions 14
Operations on Bit Vectors
const unsigned int low_three_bits_mask = 0x7;
unsigned int bit_vec = 0x15;
0…00 0111
0…01 0101
bit_vec |= low_three_bits_mask;
Setting bits:
Result = ?
0…01 0111 == 0…01 0101 | 0…00 0111
Structures and Unions 15
Operations on Bit Vectors
const unsigned int low_three_bits_mask = 0x7;
unsigned int bit_vec = 0x15;
0…00 0111
0…01 0101
bit_vec &= ~low_three_bits_mask;
Clearing bits:
Result = ?
0…01 0000 == 0…01 0101 & ~0…00 0111
Structures and Unions 16
Bit-field Structures
Special syntax packs
structure values more
tightly
Similar to bit vectors, but
arguably easier to read
 Nonetheless, bit vectors
are more commonly
used.
Padded to be an integral
number of words
 Placement is compiler-
specific.
1 1 0 1 1 0 … …
f1 f2 f3
struct Flags {
int f1:3;
unsigned int f2:1;
unsigned int f3:2;
} my_flags;
my_flags.f1 = -2;
my_flags.f2 = 1;
my_flags.f3 = 2;
Structures and Unions 17
Unions
Choices:
An element is
 an int i or
 a char c
sizeof(union …) =
maximum of sizeof(field)
EF BE AD DE
c
i
padding
union AnElt {
int i;
char c;
} elt1, elt2;
elt1.i = 4;
elt2.c = ’a’;
elt2.i = 0xDEADBEEF;
Structures and Unions 18
Unions
A union value doesn’t “know” which case it
contains
union AnElt {
int i;
char c;
} elt1, elt2;
elt1.i = 4;
elt2.c = ’a’;
elt2.i = 0xDEADBEEF;
if (elt1 currently has a char) …
How should your program keep track
whether elt1, elt2 hold an int or
a char?
?
?
Basic answer: Another variable holds
that info
Structures and Unions 19
Tagged Unions
Tag every value with its case
I.e., pair the type info together with the union
Implicit in Java, Scheme, ML, …
Enum must be external to struct,
so constants are globally visible.
Struct field must be named.
enum Union_Tag { IS_INT, IS_CHAR };
struct TaggedUnion {
enum Union_Tag tag;
union {
int i;
char c;
} data;
};

More Related Content

Similar to Structure and Union.ppt (20)

PDF
Resource wrappers in C++
Ilio Catallo
 
PPTX
What's New in C++ 11/14?
Dina Goldshtein
 
PDF
Data structure manual
sameer farooq
 
PPS
C programming session 13
AjayBahoriya
 
DOCX
PPS 8.8.BASIC ALGORITHMS SEARCHING (LINEAR SEARCH, BINARY SEARCH ETC.)
Sitamarhi Institute of Technology
 
PDF
Python and PostgreSQL: Let's Work Together! | PyConFr 2018 | Dimitri Fontaine
Citus Data
 
ODP
(1) cpp abstractions user_defined_types
Nico Ludwig
 
PPS
C programming session 13
Vivek Singh
 
PDF
(1) cpp abstractions user_defined_types
Nico Ludwig
 
PDF
C programming & data structure [arrays & pointers]
MomenMostafa
 
PPTX
Excel DATEDIFF Function
Excel
 
PPTX
CHAPTER -4-class and structure.pptx
GebruGetachew2
 
PPTX
Structures_Final_KLE (2).pptx
ShreevatsaAlawandi
 
PDF
ELAVARASAN.pdf
dharmendra kumar jaiswal
 
PPTX
Structures
Mitali Chugh
 
PPT
Structures
Praveen M Jigajinni
 
PDF
13 -times_and_dates
Hector Garzo
 
PPTX
introductory concepts
Walepak Ubi
 
PPT
Chapter 10 - Structures, Unions, Bit Manipulations, and Enumerations
proj07462
 
PPT
3.pointers in c programming language.ppt
anithachristopher3
 
Resource wrappers in C++
Ilio Catallo
 
What's New in C++ 11/14?
Dina Goldshtein
 
Data structure manual
sameer farooq
 
C programming session 13
AjayBahoriya
 
PPS 8.8.BASIC ALGORITHMS SEARCHING (LINEAR SEARCH, BINARY SEARCH ETC.)
Sitamarhi Institute of Technology
 
Python and PostgreSQL: Let's Work Together! | PyConFr 2018 | Dimitri Fontaine
Citus Data
 
(1) cpp abstractions user_defined_types
Nico Ludwig
 
C programming session 13
Vivek Singh
 
(1) cpp abstractions user_defined_types
Nico Ludwig
 
C programming & data structure [arrays & pointers]
MomenMostafa
 
Excel DATEDIFF Function
Excel
 
CHAPTER -4-class and structure.pptx
GebruGetachew2
 
Structures_Final_KLE (2).pptx
ShreevatsaAlawandi
 
ELAVARASAN.pdf
dharmendra kumar jaiswal
 
Structures
Mitali Chugh
 
13 -times_and_dates
Hector Garzo
 
introductory concepts
Walepak Ubi
 
Chapter 10 - Structures, Unions, Bit Manipulations, and Enumerations
proj07462
 
3.pointers in c programming language.ppt
anithachristopher3
 

More from SeethaDinesh (20)

PPTX
Input Devices.pptx
SeethaDinesh
 
PPT
Generations of Computers.ppt
SeethaDinesh
 
PPT
Inheritance in java.ppt
SeethaDinesh
 
PPT
Arrays in JAVA.ppt
SeethaDinesh
 
PPTX
PROGRAMMING IN JAVA unit 1.pptx
SeethaDinesh
 
PPTX
Cloud Computing Basics.pptx
SeethaDinesh
 
PPT
unit 5 stack & queue.ppt
SeethaDinesh
 
PPT
Greedy_Backtracking graph coloring.ppt
SeethaDinesh
 
DOCX
Shortest Path Problem.docx
SeethaDinesh
 
PPT
BINARY TREE REPRESENTATION.ppt
SeethaDinesh
 
PPT
NME UNIT II.ppt
SeethaDinesh
 
PDF
DS UNIT 1.pdf
SeethaDinesh
 
PPT
Basics of C.ppt
SeethaDinesh
 
PPTX
chapter 1.pptx
SeethaDinesh
 
PPTX
DW unit 3.pptx
SeethaDinesh
 
PDF
DW unit 2.pdf
SeethaDinesh
 
PDF
DW Unit 1.pdf
SeethaDinesh
 
PPTX
NME WPI UNIt 3.pptx
SeethaDinesh
 
PDF
NME UNIT I & II MATERIAL.pdf
SeethaDinesh
 
PDF
graphtraversals.pdf
SeethaDinesh
 
Input Devices.pptx
SeethaDinesh
 
Generations of Computers.ppt
SeethaDinesh
 
Inheritance in java.ppt
SeethaDinesh
 
Arrays in JAVA.ppt
SeethaDinesh
 
PROGRAMMING IN JAVA unit 1.pptx
SeethaDinesh
 
Cloud Computing Basics.pptx
SeethaDinesh
 
unit 5 stack & queue.ppt
SeethaDinesh
 
Greedy_Backtracking graph coloring.ppt
SeethaDinesh
 
Shortest Path Problem.docx
SeethaDinesh
 
BINARY TREE REPRESENTATION.ppt
SeethaDinesh
 
NME UNIT II.ppt
SeethaDinesh
 
DS UNIT 1.pdf
SeethaDinesh
 
Basics of C.ppt
SeethaDinesh
 
chapter 1.pptx
SeethaDinesh
 
DW unit 3.pptx
SeethaDinesh
 
DW unit 2.pdf
SeethaDinesh
 
DW Unit 1.pdf
SeethaDinesh
 
NME WPI UNIt 3.pptx
SeethaDinesh
 
NME UNIT I & II MATERIAL.pdf
SeethaDinesh
 
graphtraversals.pdf
SeethaDinesh
 
Ad

Recently uploaded (20)

PDF
Vani - The Voice of Excellence - Jul 2025 issue
Savipriya Raghavendra
 
PPT
Indian Contract Act 1872, Business Law #MBA #BBA #BCOM
priyasinghy107
 
PPTX
PPT-Q1-WK-3-ENGLISH Revised Matatag Grade 3.pptx
reijhongidayawan02
 
PDF
Exploring the Different Types of Experimental Research
Thelma Villaflores
 
PPTX
ENG8_Q1_WEEK2_LESSON1. Presentation pptx
marawehsvinetshe
 
PDF
IMPORTANT GUIDELINES FOR M.Sc.ZOOLOGY DISSERTATION
raviralanaresh2
 
PPTX
Identifying elements in the story. Arrange the events in the story
geraldineamahido2
 
PDF
epi editorial commitee meeting presentation
MIPLM
 
PDF
Biological Bilingual Glossary Hindi and English Medium
World of Wisdom
 
PDF
Chapter-V-DED-Entrepreneurship: Institutions Facilitating Entrepreneurship
Dayanand Huded
 
PDF
Aprendendo Arquitetura Framework Salesforce - Dia 03
Mauricio Alexandre Silva
 
PDF
AI-Powered-Visual-Storytelling-for-Nonprofits.pdf
TechSoup
 
PPTX
Nitrogen rule, ring rule, mc lafferty.pptx
nbisen2001
 
PPTX
How to Create a Customer From Website in Odoo 18.pptx
Celine George
 
PPTX
infertility, types,causes, impact, and management
Ritu480198
 
PPTX
Post Dated Cheque(PDC) Management in Odoo 18
Celine George
 
PPTX
SD_GMRC5_Session 6AB_Dulog Pedagohikal at Pagtataya (1).pptx
NickeyArguelles
 
PDF
Stokey: A Jewish Village by Rachel Kolsky
History of Stoke Newington
 
PPTX
Introduction to Indian Writing in English
Trushali Dodiya
 
PPTX
DIGITAL CITIZENSHIP TOPIC TLE 8 MATATAG CURRICULUM
ROBERTAUGUSTINEFRANC
 
Vani - The Voice of Excellence - Jul 2025 issue
Savipriya Raghavendra
 
Indian Contract Act 1872, Business Law #MBA #BBA #BCOM
priyasinghy107
 
PPT-Q1-WK-3-ENGLISH Revised Matatag Grade 3.pptx
reijhongidayawan02
 
Exploring the Different Types of Experimental Research
Thelma Villaflores
 
ENG8_Q1_WEEK2_LESSON1. Presentation pptx
marawehsvinetshe
 
IMPORTANT GUIDELINES FOR M.Sc.ZOOLOGY DISSERTATION
raviralanaresh2
 
Identifying elements in the story. Arrange the events in the story
geraldineamahido2
 
epi editorial commitee meeting presentation
MIPLM
 
Biological Bilingual Glossary Hindi and English Medium
World of Wisdom
 
Chapter-V-DED-Entrepreneurship: Institutions Facilitating Entrepreneurship
Dayanand Huded
 
Aprendendo Arquitetura Framework Salesforce - Dia 03
Mauricio Alexandre Silva
 
AI-Powered-Visual-Storytelling-for-Nonprofits.pdf
TechSoup
 
Nitrogen rule, ring rule, mc lafferty.pptx
nbisen2001
 
How to Create a Customer From Website in Odoo 18.pptx
Celine George
 
infertility, types,causes, impact, and management
Ritu480198
 
Post Dated Cheque(PDC) Management in Odoo 18
Celine George
 
SD_GMRC5_Session 6AB_Dulog Pedagohikal at Pagtataya (1).pptx
NickeyArguelles
 
Stokey: A Jewish Village by Rachel Kolsky
History of Stoke Newington
 
Introduction to Indian Writing in English
Trushali Dodiya
 
DIGITAL CITIZENSHIP TOPIC TLE 8 MATATAG CURRICULUM
ROBERTAUGUSTINEFRANC
 
Ad

Structure and Union.ppt

  • 1. Structures and Unions in C D.SEETHALAKSHMI Assistant Professor of Computer Applications Bon Secours College for Women Thanjavur
  • 2. Objectives Be able to use compound data structures in programs Be able to pass compound data structures as function arguments, either by value or by reference Be able to do simple bit-vector manipulations Structures and Unions 2
  • 3. Structures and Unions 3 Structures Compound data: A date is  an int month and  an int day and  an int year Unlike Java, C doesn’t automatically define functions for initializing and printing … struct ADate { int month; int day; int year; }; struct ADate date; date.month = 2; date.day = 4; date.year = 2021;
  • 4. Structures and Unions 4 Structure Representation & Size sizeof(struct …) = sum of sizeof(field) + alignment padding Processor- and compiler-specific 62 61 EF BE AD DE c1 c2 i padding struct CharCharInt { char c1; char c2; int i; } foo; foo.c1 = ’a’; foo.c2 = ’b’; foo.i = 0xDEADBEEF; x86 uses “little-endian” representation
  • 5. Structures and Unions 5 Typedef Mechanism for creating new type names  New names are an alias for some other type  May improve the portability and/or clarity of the program typedef long int64_t; typedef struct ADate { int month; int day; int year; } Date; int64_t i = 100000000000; Date d = { 2, 4, 2021 }; Overload existing type names for portability Simplify complex type names
  • 6. Structures and Unions 6 Constants Allow consistent use of the same constant throughout the program  Improves clarity of the program  Reduces likelihood of simple errors  Easier to update constants in the program int array[10]; for (i=0; i<10; i++) { … } #define SIZE 10 int array[SIZE]; for (i=0; i<SIZE; i++) { … } Preprocessor directive Constant names are capitalized by convention Define once, use throughout the program
  • 7. Structures and Unions 7 Arrays of Structures Date birthdays[NFRIENDS]; bool check_birthday(Date today) { int i; for (i = 0; i < NFRIENDS; i++) { if ((today.month == birthdays[i].month) && (today.day == birthdays[i].day)) return (true); return (false); } Constant Array declaration Array index, then structure field
  • 8. Structures and Unions 8 Pointers to Structures Date create_date1(int month, int day, int year) { Date d; d.month = month; d.day = day; d.year = year; return (d); } void create_date2(Date *d, int month, int day, int year) { d->month = month; d->day = day; d->year = year; } Copies date Pass-by-reference Date today; today = create_date1(2, 4, 2021); create_date2(&today, 2, 4, 2021);
  • 9. Structures and Unions 9 Pointers to Structures (cont.) void create_date2(Date *d, int month, int day, int year) { d->month = month; d->day = day; d->year = year; } void fun_with_dates(void) { Date today; create_date2(&today, 2, 4, 2021); } today.month: today.day: today.year: 0x1000 0x1004 0x1008 month: 2 day: 4 year: 2021 0x30A0 0x30A4 0x30A8 d: 0x1000 0x3098 2 4 2021
  • 10. Structures and Unions 10 Pointers to Structures (cont.) Date * create_date3(int month, int day, int year) { Date *d; d->month = month; d->day = day; d->year = year; return (d); } What is d pointing to?!?! (more on this later)
  • 11. Structures and Unions 11 Abstraction in C struct widget; struct widget *widget_create(void); int widget_op(struct widget *widget, int operand); void widget_destroy(struct widget *widget); From the #include file widget.h: From the file widget.c: #include “widget.h” struct widget { int x; … }; Definition is hidden! Structures and Unions 11
  • 12. Structures and Unions 12 Collections of Bools (Bit Vectors) Byte, word, ... can represent many Booleans One per bit, e.g., 00100101 = false, false, true, ..., true Bit-wise operations: Bit-wise AND: 00100101 & 10111100 == 00100100 Bit-wise OR: 00100101 | 10111100 == 10111101 Bit-wise NOT: ~ 00100101 == 11011010 Bit-wise XOR: 00100101 ^ 10111100 == 10011001
  • 13. Structures and Unions 13 Operations on Bit Vectors const unsigned int low_three_bits_mask = 0x7; unsigned int bit_vec = 0x15; 0…00 0111 0…01 0101 Always use C’s unsigned types for bit vectors A mask indicates which bit positions we are interested in 0…00 0101 == 0…01 0101 & 0…00 0111 important_bits = bit_vec & low_three_bits_mask; Selecting bits: Result = ?
  • 14. Structures and Unions 14 Operations on Bit Vectors const unsigned int low_three_bits_mask = 0x7; unsigned int bit_vec = 0x15; 0…00 0111 0…01 0101 bit_vec |= low_three_bits_mask; Setting bits: Result = ? 0…01 0111 == 0…01 0101 | 0…00 0111
  • 15. Structures and Unions 15 Operations on Bit Vectors const unsigned int low_three_bits_mask = 0x7; unsigned int bit_vec = 0x15; 0…00 0111 0…01 0101 bit_vec &= ~low_three_bits_mask; Clearing bits: Result = ? 0…01 0000 == 0…01 0101 & ~0…00 0111
  • 16. Structures and Unions 16 Bit-field Structures Special syntax packs structure values more tightly Similar to bit vectors, but arguably easier to read  Nonetheless, bit vectors are more commonly used. Padded to be an integral number of words  Placement is compiler- specific. 1 1 0 1 1 0 … … f1 f2 f3 struct Flags { int f1:3; unsigned int f2:1; unsigned int f3:2; } my_flags; my_flags.f1 = -2; my_flags.f2 = 1; my_flags.f3 = 2;
  • 17. Structures and Unions 17 Unions Choices: An element is  an int i or  a char c sizeof(union …) = maximum of sizeof(field) EF BE AD DE c i padding union AnElt { int i; char c; } elt1, elt2; elt1.i = 4; elt2.c = ’a’; elt2.i = 0xDEADBEEF;
  • 18. Structures and Unions 18 Unions A union value doesn’t “know” which case it contains union AnElt { int i; char c; } elt1, elt2; elt1.i = 4; elt2.c = ’a’; elt2.i = 0xDEADBEEF; if (elt1 currently has a char) … How should your program keep track whether elt1, elt2 hold an int or a char? ? ? Basic answer: Another variable holds that info
  • 19. Structures and Unions 19 Tagged Unions Tag every value with its case I.e., pair the type info together with the union Implicit in Java, Scheme, ML, … Enum must be external to struct, so constants are globally visible. Struct field must be named. enum Union_Tag { IS_INT, IS_CHAR }; struct TaggedUnion { enum Union_Tag tag; union { int i; char c; } data; };