Data Structure Using C/C++

At the end of the course, students will be able to: Understand and apply the fundamental data structures and ... Show more

Instructor

2 Students enrolled

0 reviews

Course details

Lectures : 20

Level : Intermediate

At the end of the course, students will be able to:

Distinguish between linear and nonlinear data structures.
Explain different operations performed on array, link list, stack, queue and binary tree.
Discuss different operations performed on binary tree, representation of binary tree using array and link list.
Explain about different sorting and searching algorithms applied on data.
Analyze the time complexity and space complexity of algorithm.
Design C++ program to show the operations performed on different data structure.

Please, login to leave a review

Basic info

List of Reference Books:

Weiss, Mark Allen. “Data Structures and Algorithm Analysis in C”. 3rd ed., Pearson, 2012
Sedgewick, Robert. “Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms”. 3rd ed., Addison-Wesley Professional, 2002.
Goodrich, Michael T., and Roberto Tamassia. “Data Structures and Algorithms in C”. 2nd ed., Wiley, 2011.
Gilberg, Richard F., and Behrouz A. Forouzan. “Data Structures: A Pseudocode Approach with C”. Narosa Publishing House, 2009.

Course requirements

Basic knowledge of Computer fundamentals and programmming using C/C++

Intended audience

B Sc (Computer Science/IT), BCA, PGDCA, M Sc (Computer Science/IT) students of FYUGP/FYIMP of Gauhati University, Assam