Data Structure detailed syllabus scheme for Electronics & Telecommunication Engineering (ET), 2017 onwards has been taken from the DBATU official website and presented for the Bachelor of Technology students. For Subject Code, Course Title, Lecutres, Tutorials, Practice, Credits, and other information, do visit full semester subjects post given below.
For 6th Sem Scheme of Electronics & Telecommunication Engineering (ET), 2017 Onwards, do visit ET 6th Sem Scheme, 2017 Onwards. For the Elective-VII scheme of 6th Sem 2017 onwards, refer to ET 6th Sem Elective-VII Scheme 2017 Onwards. The detail syllabus for data structure is as follows.
Data Structure Syllabus for Electronics & Telecommunication Engineering (ET) 3rd Year 6th Sem 2017 DBATU
Pre-requisite:
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier.
.
Course Objectives:
- To assess how the choice of data structures and algorithm design methods impacts the performance of programs.
- To choose the appropriate data structure and algorithm design method for a specified application.
- To study the systematic way of solving problems, various methods of organizing large amounts of data.
- To solve problems using data structures such as linear lists, stacks, queues, binary trees, binary search trees, and graphs and writing programs for these solutions.
- To employ the different data structures to find the solutions for specific problems
Course Outcomes:
On completion of the course, student will be able to:
- Discuss the computational efficiency of the principal algorithms such as sorting andsearching.
- Write and understand the programs that use arrays and pointers in C.
- Describe how arrays, records, linked structures are represented in memory and use them in algorithms.
- Implement stacks and queues for various applications.
- Understand various terminologies and traversals of trees and use them for various applications.
- Understand various terminologies and traversals of graphs and use them for various applications.
Unit 1
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
Unit 2
Searching and Sorting
Need of searching and sorting, why various methods of searching and sorting, Sorting methods: Linear, binary search and Fibonacci Search. Sorting methods: Bubble, insertion, selection, merge, Time complexity of each searching and sorting algorithm, Hashing Techniques.
Unit 3
Stack and Queues
Stacks: Concept, Basic Stack operations, Array representation of stacks, Stack as ADT, Stack Applications: Reversing data, Arithmetic expressions conversion and evaluation. Queues: Concept, Queue operations, Array representation of queues, Queue as ADT, Circular queues, Application of queues: Categorizing data, Simulation of queues.
Unit 4
For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdf platform to make students’s lives easier..
Unit 5
Trees
Introduction to trees: Basic Tree Concepts, Binary Trees: Concept and Terminologies, Representation of Binary Tree in memory, Traversing a binary tree, Binary Search Trees (BST): Basic Concepts, BST operations.
Unit 6
Graphs
Basic Concepts and terminology, Sequential representation of graphs; Adjacency matrix, Path matrix, Linked representation of a graph, Operations on graph, Traversing a graph, Spanning trees; Minimum Spanning tree, Kruskals Algorithm, Prims Algorithm. Dijkstra’s Shortest Path Algorithm.
Reference/Text Book:
- Ellis Horowitz, Sartaj Sahni, Fundamentals of Data Structures, Galgotia Books Source. ISBN 10: 0716782928.
- Richard F. Gilberg and Behrouz A. Forouzan, Data Structures A Pseudocode Approach with C, Cengage Learning, second edition. ISBN-10: 0534390803.
- Seymour Lipschutz, Data Structure with C, Schaums Outlines, Tata Mc Graw Hill. ISBN-10: 1259029964.
- E Balgurusamy – Programming in ANSI C, Tata McGraw-Hill, Third Edition. ISBN-10: 1259004619.
- Yedidyah Langsam, Moshe J Augenstein, Aaron M Tenenbaum – Data structures using C and C++ – PHI Publications, Second Edition) ISBN 10: 8120311779.
For detail syllabus of all subjects of Electronics & Telecommunication Engineering (ET) 6th Sem 2017 onwards, visit ET 6th Sem Subjects of 2017 Onwards.