book

Computer Programming and IT

by ITL Education Solutions Limited, Ashok N. Kamthane, Raj Kamal

February 2012

Intermediate to advanced

520 pages

11h 43m

English

Pearson India

Read now

Unlock full access

1.1 Introduction1.2 Characteristics of Computers1.3 Evolution of Computers1.4 Computer Generations1.5 Classification of Computers1.6 Application of Computers1.7 Basic Computer Organization1.8 Stored Program Architecture of a Computer1.9 Evolution of ProcessorsSummaryExercises
2.1 Introduction2.2 Memory Hierarchy2.3 Random Access Memory (RAM)2.4 Read Only Memory (ROM)2.5 RAM, ROM, and CPU Interaction2.6 Types of Secondary Storage Devices2.7 Magnetic Tape2.8 Magnetic Disk2.9 Types of Magnetic Disks2.10 Optical Disk2.11 Types of Optical Disks2.12 Magneto-Optical Storage Devices2.13 Universal Serial Bus (USB)2.14 Memory Stick2.15 Mass Storage DevicesSummaryExercises
3.1 Introduction3.2 Software3.3 Types of Software3.4 Software Terminologies3.5 Installing and Uninstalling Software3.6 Software Piracy3.7 Starting a Computer (Booting)3.8 Software Development StepsSummaryExercises
4.1 Introduction4.2 Problem-Solving Techniques4.3 Program Control Structures4.4 Programming Languages4.5 Generations of Programming Languages4.6 Language Translators4.7 Features of a Good Programming LanguageSummaryExercises
5.1 Introduction5.2 Binary Addition Arithmetic5.3 Arithmetic Number Representations5.4 Binary Subtraction5.5 Binary Multiplication of Unsigned Numbers5.6 Multiplication Method When Multiplier is 2n Where n is an Integer5.7 Multiplication Method When Multiplier is a Small Number5.8 Multiplication Method for n-Bit by N-Bit Signed Numbers,X and Y5.9 Binary Arithmetic Division by Successive Subtraction Method5.10 Floating Point Numbers5.11 Code Converters5.12 Equality and Magnitude Comparators Between Two 4-Bit Numbers5.13 Odd Parity and Even Parity Generators5.14 The 4-Bit AND, OR, XOR Between Two WordsSummaryExercises

6.1 Introduction6.2 Overview of Compilers and Interpreters6.3 Structure of a C Program6.4 Intermediate Code6.5 Object and Executable Codes6.6 Programming Rules6.7 Importance of Braces ({ }) in a C Program6.8 Executing the Program6.9 Flowchart for the Execution of a C ProgramSummaryExercises
7.1 Introduction7.2 C Character Set7.3 Delimiters7.4 C Keywords7.5 Identifiers7.6 Constants7.7 Variables7.8 Rules for Defining Variables7.9 Data Types7.10 Declaring Variables7.11 Initializing Variables7.12 Dynamic Initialization7.13 Type Conversion7.14 Constant and Volatile VariablesSummaryExercises
8.1 Introduction8.2 Expressions8.3 Properties of Operators8.4 Priority of Operators and their Clubbing8.5 Comma and Conditional Operators8.6 Arithmetic Operators8.7 Relational Operators8.8 Logical Operators8.9 Bitwise OperatorsSummaryExercises
9.1 Introduction9.2 Input and Output Functions9.3 Formatted Functions9.4 Flags, Width, and Precision with the Format String9.5 Unformatted Functions9.6 Commonly used Library Functions9.7 Control Structures9.8 if Statement9.9 if-else Statement9.10 Nestedif-else Statements9.11 switchStatement9.12 What is a Program Loop?9.13 for Loop9.14 Nested for Loops9.15 while Loop9.16 do-while Loop9.17 do-while Statement with while Loop9.18 break Statement9.19 continue Statement9.20 go to StatementSummaryExercises
10.1 Introduction10.2 Scope of a Variable10.3 Automatic Variables10.4 External Variables10.5 Static Variables10.6 Register VariablesSummaryExercises
11.1 Introduction11.2 Macro Substitution11.3 The#defineDirective11.4 Undefining a Macro11.5 Token Pasting and Stringising Operators11.6 The#includeDirective11.7 Conditional Compilation11.8 The#ifndefDirective11.9 The#errorDirective11.10 The#lineDirective11.11 TheinlineDirective11.12 The#pragmaSaveregs11.13 The#pragmaDirective11.14 The Predefined Macros in ANSI and Turbo-C11.15 Standard I/O Predefined Streams instdio.h27811.16 The Predefined Macros in ctype.h11.17 AssertionsSummaryExercises
12.1 Introduction12.2 Array Initialization12.3 Definition of an Array12.4 Characteristics of an Array12.5 One-Dimensional Array12.6 Predefined Streams12.7 Two-Dimensional Array12.8 Three- or Multi-Dimensional Arrays12.9 Thesscanf()andsprintf() Functions12.10 Operations with ArraysSummaryExercises
13.1 Introduction13.2 Features of Pointers13.3 Pointer Declaration13.4 Arithmetic Operations with Pointers13.5 Pointers and Arrays13.6 Pointers and Two-Dimensional Arrays13.7 Array of Pointers13.8 void PointersSummaryExercises
14.1 Dynamic Memory Allocation14.2 Memory Models14.3 Dynamic Memory Management FunctionsSummaryExercises
15.1 Introduction15.2 Features of Structures15.3 Definition, Declaration, and Initialization of Structure15.4 Structure Within Structure15.5 Array of Structures15.6 Pointer to Structure15.7 Structure and Functions15.8 typedef15.9 Bit Fields15.10 Enumerated Data Type15. 11 union15. 12 Calling BIOS and DOS Services15. 13 unionof StructuresSummaryExercises
16.1 Introduction16.2 Streams and File Types16.3 Steps for File Operations16.4 File I/O16.5 Command Line Arguments16.6 Applications of Command Line ArgumentsSummaryExercises
17.1 Introduction17.2 Definition of Function17.3 Definition of Syntax Function and Function Prototypes17.4 ThereturnStatement17.5 Types of Functions17.6 Call by Value and Reference17.7 Function Returning More Values17.8 Function as an Argument17.9 Function with Operators17.10 Function and Decision Statements17.11 Function and Loop Statements17.12 Functions with Arrays and Pointers17.13 Passing Characters and String to Function17.14 Recursion17.15 Pointer to FunctionSummaryExercises
18.1 Introduction18.2 Declaration and Initialization of String18.3 Display of Strings with Different Formats18.4 String Standard FunctionsSummaryExercises

Content preview from Computer Programming and IT

Chapter 14 Dynamic Memory Allocation

CHAPTER OUTLINE

14.1 Dynamic Memory Allocation

14.2 Memory Models

14.3 Dynamic Memory Management Functions

14.1 DYNAMIC MEMORY ALLOCATION

For execution of a program, it is essential to bring the program into the main memory. When a program does not fit into the main memory, parts of it are brought into the main memory one by one and the full program is executed eventually. Of course, parts of the program that are not currently in main memory are resident at secondary memory locations, such as floppy, hard disk, or any other magnetic disk. When a new segment of a program is to be moved into a full main memory, it must replace another segment already resident in the main memory. The programmer should not ...