Data Structure For C Programming

# Data Structure For C Programming

It is said, "One month of IT is equivalent to one social year." The domains of IT are expanding by each passing day, month and year. Everyday, newer application software is being developed, with programming as the base, which itself has its essentials in Data Structure and File Structure. A good programmer is expected to possess both these skills. Standard software like Customer Relationship Management and ERP, which need Data Structures are in great demand. Even search engine programming needs Data Structure.

Chapter 1

BASIC CONCEPTS OF DATA REPRESENTATION

1.1 INTRODUCTION

1.2 CONCEPTUAL VIEW OF RAM

1.2.1 Uses of RAM

1.3 ABSTRACT AND SYSTEM DEFINED DATA TYPES

1.3.1 Abstract Data Type

1.3.2 Representation, Primitive data structures

1.3.3 Variables

1.3.3.1 Numeric variable categories

1.3.3.2 Approximate range

1.3.3.3 Precision

1.3.3.4 int versus short

1.3.3.5 Integer variables : Signed by fault

Conceptual Problem

Key Points

Exercise

Chapter 2

INTRODUCTION TO ALGORITHM DESIGN AND

DATA STRUCTURE

2.1 INTRODUCTION

2.2 ALGORITHM

2.3 ALGORITHM DESIGN

2.3.1 Top down design

2.3.2 Refinement of data specification

2.4 ALGORITHM COMPLEXITY

2.4.1 Time complexity

2.4.2 Space complexity

2.6 BIG OH NOTATION

2.7 STRUCTURED PROGRAMMING

2.8 DATA STRUCTURE

2.8.1 Linear data structure

2.8.2 Non linear data structure

2.9 MEMORY ALLOCATION

2.9.1 Static memory allocation

2.9.2 Dynamic memory allocation

Conceptual Problem

Key Points

Exercise

Chapter 3

ARRAYS

3.1 INTRODUCTION

3.2 SINGLE-DIMENSIONAL ARRAYS

3.2.1 Storage of arrays in main memory

3.2.2 Use of array elements

3.2.3 Types of array subscripts

3.2.4 Allowable subscripts

3.2.5 Example Program

3.3 MULTIDIMENSIONAL ARRAY

3.3.1 Representing two-dimensional array in memory

3.3.1.1 Row major order

3.3.1.2 Column major order

3.3.2 Three- or Four-dimensional arrays

3.4 NAMING ARRAYS

3.5 DECLARING ARRAYS

3.6 INITIALIZING SINGLE-DIMENSIONAL ARRAYS

INITIALIZING MULTIDIMENSIONAL ARRAYS

3.7

3.8 64K OF DATA VARIABLES

3.9 TO CALCULATE THE STORAGE SPACE REQUIRED

3.9.1 Size of () operator

3.10 ARRAYS Vs. POINTERS

3.10.1 Using a pointer for one dimensional array

Conceptual Problem

Key Points

Exercise