article - data structure and algorithms using c

7/25/2019 Article - Data Structure and Algorithms Using C

1/4

PREFACE

An abstract data type, sometimes abbreviated ADT, is a logical description of how we

view the data and the operations that are allowed without regard to how they will be

implemented. This means that we are concerned only with what the data is representingand not with how it will eventually be constructed.

The implementation of an abstract data type, often referred to as a data structure, will

require that we provide a physical view of the data using some collection of

programming constructs

The data structures deal with the study of how the data is organized in the memory,

how efficiently it can be retrieved and manipulated and the possible ways in which

different data items are logically related.

Algorithms play the central role in both the science and practice of computing as utter

finite sequence of steps for accomplishing some computational tas.

Data Structure and Algorithms using C boo is designed for the use in

!ndergraduate level, Trimester or "emester course intended to provide #omputer

"cience, #omputer Applications, #omputing $nformation "ystem, $nformation

Technology and %usiness $nformation Technology "tudents with a strong foundation in

Data "tructures and Algorithms, in the logical and mathematic model & Approaches,

organisations, presentations and Techniques used in storing, accessing, manipulating

and retrieving data within computer 'emory.

This boo will be available in the !niversity (ibraries in printed copy as well as in A$!

#ampus 'undi 'agazine in Digital format.


2/4

MOTIVATION

This boo was written to address three problems $ see in teaching and course contents

delivery)

*. +ailure to incorporate applications and practical implementation of concepts

. -mission or inadequate coverage of subect matter and themes

/. 01cessive breadth with insufficient depth of topics coverage

INSTRUCTIONA APPROAC!

The philosophies of this boo are "ust#in#time#erudition , learning by case in point, and

(earning by doing and Demonstrating.

2ust3in3time3erudition means that students learn a concept, theory and4or technique at

the time they need to use it. Therefore, for this boo at each part, it includes e1ercises to

help student assess their understanding after reading and practicing about the concepts

and techniques.

(earning by case in point means that student is provided numerous e1amples and

illustrations to facilitate learning.

I do believe that students do not really comprehend a concept until they have

successfully applied it.

PRERE$UISITES

The boo assumes that a reader has gone through an introductory programming course

with # #ompiler and a standard course on fundamentals of 'athematics and4or discrete

'athematics. 5ith such a bacground, he or she should be able to handle the boo6s

material without undue difficulty.


3/4

EARNIN% OUTCOMES

At the end of the subect, it is e1pected that students will be able to)

Able to choose proper data type and algorithm to use in application to save memory.

Able to analyze Algorithms to structure the e1ecution flow of a program

Able to #reate and define data types and their abstraction.

Differentiating between ordered lists and sorted lists.

01plaining organization and manipulation of (inear and 7on (inear Data "tructures.

To develop an algorithms for real world problem.

Able to find the system4algorithms efficiency and comple1ity.

&OO' STRUCTURE

The boo introducing the student to Data "tructure and Algorithms and it is presented in

seven 8arts.

The book is designed in such a way that the reader understand from the basics to

advanced topics

Part one provides an -verview and fundamental concepts, classifications of Data

"tructures, Data structures9 operations and Algorithms design.

Part twoe1presses foundation of memory allocation, Arrays,

Part three cover the range of searching and "orting Techniques and their

implementations

Part four:epresentation of lined lists based data structure and their implementation

using arrays

Part fiveidentifies representational model of stac and queue based data structures and

their applications

Part six covers the data structure implementing ADT that simulates a hierarchicaltree

structure ;Trees and ard and

$ntractable 8roblems
http://en.wikipedia.org/wiki/Tree_structurehttp://en.wikipedia.org/wiki/Tree_structurehttp://en.wikipedia.org/wiki/Tree_structurehttp://en.wikipedia.org/wiki/Tree_structurehttp://en.wikipedia.org/wiki/Tree_structure


4/4

!tmost care has been taen in bringing out this boo? $ hope this boo will serve the

requirements of all readers. $t may happen that in the spite of being watchful, some

errors might have crept in. $ would be grateful if this is brought out as valuable

suggestions for improving the quality of the boo for the ne1t coming version.

A&OUT AUT!OR

A highly organized $T @oung professional who has a proven trac

record and innovative at every moment. 8ossessing a sound

nowledge to modern software development Technologies, uicly

learn? equally successful in both team and self3directed settings? and

proficient in a range of computer systems, 8rogramming(anguages, Tools and Testing methodologies and a trac record of achieving the desired

outcomes, on3time.

>is greatest strengths are being able to mould as the situations demand, patience,

sincere, committed to hard wor, self3learning, research and motivated to innovate.

>aving completed his %achelor of 0ngineering from the former Bigali $nstituted of

"cience and Technology ;B$"T=, 'asters of #omputer Applications from %angalore

!niversity and Annamalai !niversity for 'asters of "cience in "oftware 0ngineering,

he started his Doctorate studies in computer "cience at Atlantic $nternational !niversity

;A$!= in the area of #loud #omputing and "ecurity.

'banzabugabo 2ean %aptiste has a passion for writing and becoming an author of this

boo Data "tructures and Algorithms using # contributing to :wandan 0ducation in

#omputer "cience, #omputing and $nformation Technology. >is current affiliations

include being a Director of $#T at !niversity of Tourism Technology and %usiness

"tudies ;!T%=, a (ecturer of $T related courses in various :wandan !niversities and

colleges. >e can be reached at iCengineernetzero.com.

article - data structure and algorithms using c

Documents