Book Details

Fundamentals of Data Structures in C

Fundamentals of Data Structures in C

Published by uLektz

Course Code:EC8393

Author:uLektz

University: Anna University, Tamil Nadu

Regulation:2017

Categories:Electronics & Communication

Format : ico_bookePUB3 (DRM Protected)

Type :eBook

Rs.200 Rs.30 Rs.85% off

Preview Buy Now

Description :Fundamentals of Data Structures in C of EC8393 covers the latest syllabus prescribed by Anna University, Tamil Nadu for regulation 2017. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

Topics
UNIT I C PROGRAMMING BASICS

1.1 Structure of a C program - compilation and linking processes – Constants, Variables

1.2 Data Types – Expressions using operators in C – Managing Input and Output operations

1.3 Decision Making and Branching - Looping statements.

1.4 Arrays – Initialization –Declaration – One dimensional and Two-dimensional arrays.

1.5 Strings - String operations –String Arrays

1.6 Simple programs- sorting - searching – matrix operations

UNIT II FUNCTIONS, POINTERS, STRUCTURES AND UNIONS

2.1 Functions, Pass by value-Pass by reference, Recursion

2.2 Pointers - Definition, Initialization, Pointers arithmetic

2.3 Structures and unions - definition, Structure within a structure, Union, Programs using structures and Unions

2.4 Storage classes

2.5 Pre-processor directives

UNIT III LINEAR DATA STRUCTURES

3.1 Arrays And Its Representations

3.2 Stacks and Queues

3.3 Linked lists

3.4 Linked list-Based implementation of Stacks and Queues

3.5 Evaluation of Expressions - Linked list based polynomial addition

UNIT IV NON-LINEAR DATA STRUCTURES

4.1 Trees

4.2 Binary Trees – Binary tree representation and traversals –Binary Search Trees – Applications of trees

4.3 Set representations

4.4 Union-Find operations

4.5 Graph and its representations - Graph Traversals

UNIT V SEARCHING AND SORTING ALGORITHMS

5.1 Linear Search

5.2 Binary Search

5.3 Bubble Sort, Insertion sort – Merge sort – Quick sort

5.4 Hash tables – Overflow handling

loading