fb

Data Structures and Application

Comprehend the fundamentals and the applications of various Data Structures comprehensively through hands-on coding. Designed for learners who wants to become a great programmer and strengthen their Data Structure Skills, an essential computer science concept.

365 days course access

Live instructor-led online classes

Industry-based projects

Master the problem solving and programming fundamentals using C.

E-box Job Assistant

Get noticed by the top hiring companies

Amphi - The Super teacher
Guide from “Amphi”

The Super teacher

Data Structures and Application

Includes:

  • 3 hrs of video lectures
  • 110 hands-on practice exercises
  • 3 Mock IA tests
  • 5 Assessment exercises
  • 50 code analysis exercises
  • 170 knowledge based questions
  • 5 Live connect sessions
             (Master classes)
  • Lifetime access

Data Structures and Application

ABOUT THE COURSE

In this course, you will learn the concept of Data structures through abstract Data structures including lists, stacks, queues, deques, sets, directed acyclic graphs, and graphs; and implementations including the use of linked lists, arrays, binary search trees, hash tables, complete trees, and adjacency matrices and lists.

Course Learning Objectives:

This course will enable students to get practical experience in design, develop, implement, analyze and evaluation/testing of
  • Asymptotic performance of algorithms.
  • Linear data structures and their applications such as stacks, queues and lists
  • Non-Linear data structures and their applications such as trees and graphs
  • Sorting and searching algorithms

Course Outcomes:

The student will be able to:
  • Use different types of data structures, operations and algorithms
  • Apply searching and sorting operations on files
  • Use stack, Queue, Lists, Trees and Graphs in problem solving
  • Implement all data structures in a high-level language for problem solving.

Laboratory Outcomes:

The student should be able to:
  • Analyze and Compare various linear and non-linear data structures
  • Code, debug and demonstrate the working nature of different types of data structures and their applications.
  • Implement, analyze and evaluate the searching and sorting algorithms
  • Choose the appropriate data structure for solving real world problems

Course Content

Module 1: Introduction

In this module, you will have an introduction to Data structures by working out certain exercises on Strings, 1-D Arrays and 2-D Arrays. Introduction: Data Structures, Classifications (Primitive & Non Primitive), Data structure Operations, Review of Arrays, Structures, Self-Referential Structures, and Unions. Pointers and Dynamic Memory Allocation Functions. Representation of Linear Arrays in Memory, Dynamically allocated arrays. Array Operations: Traversing, inserting, deleting, searching, and sorting. Multidimensional Arrays, Polynomials and Sparse Matrices. Strings: Basic Terminology, Storing, Operations and Pattern Matching algorithms.

Module 2: Stack and Queue

In this module, you will learn about Load counter. Basically, you will be knowing designs 2,3,4 - bit counters. Here, you are going to load a initial value to the counter and starts counting from that loaded value.

Module 3: Linked List

In this module, you will learn about Linked List. Linked Lists: Definition, Representation of linked lists in Memory, Memory allocation, Garbage Collection. Linked list operations: Traversing, Searching, Insertion, and Deletion. Doubly Linked lists, Circular linked lists, and header linked lists. Linked Stacks and Queues. Applications of Linked lists – Polynomials, Sparse matrix representation.

Module 4: Trees

In this module, you will learn about Trees. Trees: Terminology, Binary Trees, Properties of Binary trees, Array and linked Representation of Binary Trees, Binary Tree Traversals - Inorder, postorder, preorder; Additional Binary tree operations. Threaded binary trees, Binary Search Trees – Definition, Insertion, Deletion, Traversal, Searching, Application of Trees-Evaluation of Expression, Programming Examples

Module 5: Graphs

In this module, you will learn about Graphs, Sorting and Searching, Hashing, Files. Graphs: Definitions, Terminologies, Matrix and Adjacency List Representation Of Graphs, Elementary Graph operations, Traversal methods: Breadth First Search and Depth First Search. Sorting and Searching: Insertion Sort, Radix sort, Address Calculation Sort. Hashing: Hash Table organizations, Hashing Functions, Static and Dynamic Hashing. Files and Their Organization: Data Hierarchy, File Attributes, Text Files and Binary Files, Basic File Operations, File Organizations and Indexing.

Lab 1:

In this module you will analyze the program and how to write the correct program on Arrays and Strings by solving Lab exercise and other simple problems.

Lab 2:

In this module you will analyze the program and how to write the correct program on Stack and Queue by solving Lab exercise and other simple problems.

Lab 3:

In this module you will analyze the program and how to write the correct program on Linked List by solving Lab exercise and other simple problems.

Lab 4:

In this module you will analyze the program and how to write the correct program on Trees by solving Lab exercise and other simple problems.

Lab 5:

In this module you will analyze the program and how to write the correct program on Graphs by solving Lab exercise and other simple problems.

Get in Touch with Us

9482174641

Mysore

#2462, Sugamya corner
High Tension Line road,
2nd stage, Vijayanagar,
Mysuru - 570017

Electronic City, Bangalore

"VARAM" #228, 2nd Cross Neeladri Nagar
Electronic City,1st phase
Bangalore - 560100

COIMBATORE, TAMILNADU

123 to 127, kattoor Street
Gandhipuram,
Coimbatore - 641037

About E-Box

E-Box is a Technology Enabled Active Learning and
Assessment platform for technology and engineering
domains apart from the basic LMS components like
quizzes, assignments, lesson components.

Connect with us