Description
Course Name: CERTIFICATE IN DATA STRUCTURES
Course Id: CDS/Q1001.
Education Qualification: 12th Pass.
Duration: 90 Hrs.
How You will Get Diploma Certificate:
Step 1- Select your Course for Certification.
Step 2- Click on Enroll Now.
Step 3- Proceed to Enroll Now.
Step 4- Fill Your Billing Details and Proceed to Pay.
Step 5- You Will be Redirected to Payment Gateway, Pay Course and Exam Fee by Following Options.
Card(Debit/Credit), Wallet, Paytm, Net banking, UPI and Google pay.
Step 6- After Payment You will receive Study Material on your email id.
Step 7- After Completion of Course Study give Online Examination.
Step 8- After Online Examination you will get Diploma Certificate soft copy(Scan Copy) and Hard Copy(Original With Seal and Sign).
Step 9- After Certification you will receive Prospect Job Opportunities as per your Interest Area.
Online Examination Detail:
Duration- 60 minutes.
No. of Questions- 30. (Multiple Choice Questions).
Maximum Marks- 100, Passing Marks- 40%.
There is no negative marking in this module.
Benefits of Certification:
- Government Authorized Assessment Agency Certification.
- Certificate Valid for Lifetime.
- Lifetime Verification of Certificate.
- Free Job Assistance as per your Interest Area.
Syllabus
Certificate in Data Structures
Introduction of Data Structure
Sorting and Searching
Linear Data Structure
Nonlinear Data Structure
Hashing And File Structures
Misc
Introduction of Data Structure
Basic terminology, elementary data organization, built in data types in c. Algorithm, efficiency of an algorithm, time and space complexity, asymptotic notations: big oh, big theta and big omega, time-space trade-off. Abstract data types (adt).
Sorting and Searching
Sorting techniques – selection, bubble, insertion, merge, heap, quick, radix sort and address calculation. Linear search – binary search – hash table methods, insertion sort, quick sort, merge sort, heap sort, sorting on several keys, list and table sort.
Linear Data Structure
Array: representation of arrays, applications of arrays, sparse matrix and its representation, stack: stack-definitions & concepts, operations on stacks, applications of stacks, polish expression, reverse polish expression and their compilation, recursion, tower of hanoi, queue: representation of queue, operations on queue, circular queue, priority queue, array representation of priority queue, double ended queue, applications of queue, linked list: singly linked list, doubly linked list, circular linked list ,linked implementation of stack, linked implementation of queue, applications of linked list.
Nonlinear Data Structure
Tree-definitions and concepts, representation of binary tree, binary tree traversal (inorder, postorder, preorder), threaded binary tree, binary search trees, conversion of general trees to binary trees, applications of trees- some balanced tree mechanism, eg. Avl trees, 2-3 trees, height balanced, weight balance , graph-matrix representation of graphs, elementary graph operations,(breadth first search, depth first search, spanning trees, shortest path, minimal spanning tree ).
Hashing And File Structures
Hashing: the symbol table, hashing functions, collision-resolution techniques, file structure: concepts of fields, records and files, sequential, indexed and relative/random file organization, indexing structure for index files, hashing for direct files, multi-key file organization and access methods.
Misc
Trie Data Structure, heap Data Structures, play Tree fundamental Of The Ds,hash Table, preorder Traversal, tree Traver, salimple, mentation Of Queue Using Stacks, implementation Of Stack Using Queue, binomial Heap, postorder Traversal, sparse Matrix, detect Loop In A Linked Listin, order Traversal, convert Infix To Postfix Notation, convert Infix To Prefix Notation, conversion Of Prefix To Postfix Expression, conversion Of Postfix To Prefix Expression, remove The Loop In A Linked List, implement Two Stacks In An Array, reverse A Stack Using Recursion, detect Cycle In A Directed Graph, optimal Binary Search Tree, priority Queue Using Linked List, balanced Binary Search Tree, boundary Traversal Of Binary Tree, diagonal Traversal Of Binary Tree, vertical Traversal Of A Binary Tree, graph Algorithms, time Complexity Of Sorting Algorithms, applications Of Stack In Data Structure, dictionary Data Structure, structured Data And Unstructured Datalist Data Structure.