Certificate In Data Structures

In computer science, a data structure is a data organization, management and storage format that enables efficient access and modification.

Syllabus:

• Introduction of Data Structure: Data structure introduction, types of data structure, advantages of data structures, properties of the array, advantages array, memory allocation of the array, accessing elements of an array, 2D array.
• Sorting and Searching:  Searching and sorting, linear search, a non- recursive program for linear search, a recursive program for linear search, binary search, algorithm, a non-recursive program for binary search, a recursive program for binary search, bubble sort, non-recursive program for selection sort,  recursive program for selection sort.
• Linear Data Structure: Array data structure, java arrays, creating java arrays, multi-dimensional arrays, java lists: classes VS interfaces, accessing list elements, stack data structure, stack operations, queue data structure.
• Nonlinear Data Structure: Introduction Terminology, Tree Presentation, Binary Tress, Abstract data type, Properties of Binary Trees, Binary Representation, Binary traversal, Binary search trees, Graph terminology & Representation, Depth First search, Spanning trees, Prim’s Algorithm.
• Hashing and File Structures:  A simple hash function, implementation issues, other collision resolution techniques, patterns of record access, physical files and logical files, opening files, closing files, UNIX directory structure, file – related header files, UNIX file system commands.
• Stacks and Queue: Stack representation, basic operations, algorithms for push operation, algorithm for pop operation, Queue representation, Enqueue operation, algorithm Enqueue operation, Dequeue operation, algorithm Dequeue operation, Queue program in C.