Data structures provide a means to manage large amounts of data for use in
databases and internet indexing services. Efficient data structures are key
for designing efficient algorithms and obtaining maintainable software
design.
In this Computer Science course, you will start by learning basic data
types, such as numbers, and gradually build a conceptual framework for
organizing and managing efficient structures. A preliminary understanding
of implementing sequence structures such as stacks, queues, and linked
lists, will also be covered.
The topics covered in this course:
-
Basic Data Types, Notion of an Abstract Data Type
-
Mathematical Properties of Sequences
-
Special Types of Sequences: Stacks, Queues, Strings
-
Implementation of Sequence Type: Arrays and Linked Lists
-
Trees
-
Sets and Maps
-
Graphs
The detailed description is given below:
Topic 1: Basic Data Types and Abstract Data Type
-
Learn the basic Built-in Data Types
-
Know how to build on with Data Structures and Algorithm
-
Learn to identify and strive to solve the Programming problem
-
Get a clear disposition on Abstract Data Types
Topic 2: Numbers
Topic 3: Sequences
Topic 4: Implementation of Sequence Type: Arrays and Linked Lists
-
Know how to implement Stacks
-
Learn the implementation of Stacks using Arrays and Linked Lists
-
Know how to implement Queues
-
Learn the implementation of Queues using Arrays and Linked Lists
Topic 5: Trees
-
Know the basics of Binary Tree
-
Learn how to operate the Binary Search Tree
-
Learn about General Trees and Rooted Trees
Topic 6: Sets, Maps, and Graphs
-
Learn the nitty-gritties of Graph representation
-
Know the sequence of node in Walk, Path and Cycle
-
Learn how to traverse a graph
-
Know more about the search and sort