Data Structure Using C Information Tech 3rd Sem Syllabus for Diploma BTEUP 2017

Data Structure Using C detail BTEUP Diploma syllabus for Information Technology, effective from 2017 is collected from BTEUP 2017 Syllabus official website and presented for diploma students. The course details such as exam duration, Teaching Hr/week, Practical Hr/week, Total Marks, internal marks, theory marks, duration and credits do visit complete sem subjects post given below. The syllabus PDFs can be downloaded from official website.

For all other information tech 3rd sem bteup diploma syllabus 2017 you can visit Information Tech 3rd Sem BTEUP Diploma Syllabus 2017 Subjects. The detail syllabus for data structure using c is as follows.

Rationale:

For solution of different problems ‘C’ is a very
powerful high level language. It is widely used in research
and engineering problems. A software technician aware of this language will be useful for working in computer environment.

DETAILED CONTENTS

1. BASIC CONCEPTS:

1. Problem solving concept, top down and bottom up design, Structured programming, concept of data type, variable And constants, Concept of pointer variable and constant, Introduction to data structure(Linear, Non Linear, Primitive, Non Primitive), Concept of data structure(Array, Linked list Stack, Queue, Trees, Graphs).
2. Arrays : Concept of arrays, single dimensional array, Two Dimensional array Representation of two dimensional array (Base address, L.B., U.B), Operation of arrays with algorithms (Searching, traversing, inserting, deleting)

2. LISTS:

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

3. Stacks And Queues

Introduction to stacks, representation of stacks with array and link List, Implementation of stacks, Application of stacks (Polish Notations, converting infix to post fix notation, evaluation of Post fix notation, tower of Hanoi), Recursion : concept and Comparsion between recursion and iteration, Introduction to queues, Implementation of queues, Circular queues, De-queues

4. SORTING ALGORITHMS

Introduction, Search algorithm(Linear and Binary), Concept Of sorting.
Insertion sorts, Bubble sort, Quicksort, Mergesort, Heapsort

5. Tables: –

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

6. TREES

Concept of Binary Trees (Complete, Extended Binary Tree), Concept Of representation of Binary Tree, Concept of balance Binary Tree, Traversing Binary Tree(Pre order, Post order and In Order),Searching Inserting and deleting in binary search tree.

7. Graphs:

Depths-first-search.

DATA STRUCTURE USING C

For complete syllabus and results, class timetable and more pls download iStudy Syllabus App. It’s a lightweight, easy to use, no images, no pdfs platform to make students life easier.

Reference Books:

1. Data Structure – Schaum’s Outline Series – McGraw Hill
2. Data Structure – Schaum’s Series – McGraw Hill Publications
3. Horwitz and Sartaj Sahni – Data Structure
4. Tanenbaum – Data Delhi Structures – Prentice Hall of India, New
5. Kanekar Yashwant – Data Structure through C, BPB Publication

For detail syllabus of all other subjects of BE Information Tech, effective from 2017 do visit Information Tech 3rd Sem BTEUP syllabus for 2017.

Dont forget to download iStudy Syllabus App for latest syllabus and results, class timetable and more.