- About Us
- Introduction
- Srishyla Educational Trust
- G M University
- GMU- Campus
- GMU Logo, Flag and Mascot
- GMU- Anthem
- Vision, Mission, Values, and Objectives
- Leadership
- Statutory Committees
- University Documents
- Organisation Structure
- University Best Practices
- Information and Communication Technology (ICT)
- Learning Management System (LMS)
- Human Resources (HR)
- Collaboration and Cooperation
- Campus life
- Events
- Proctorial System
- Student Placements
- IQAC
- Assessment
- Careers
- Contact Us
- Home About Us
- Introduction
- Srishyla Educational Trust
- G M University
- GMU- Campus
- GMU Logo, Flag and Mascot
- GMU- Anthem
- Vision, Mission, Values, and Objectives
- Leadership
- Statutory Committees
- University Documents
- Organisation Structure
- University Best Practices
- Information and Communication Technology (ICT)
- Learning Management System (LMS)
- Human Resources (HR)
- Collaboration and Cooperation
- Campus life
- Proctorial System
- Student Placements
- Contact Us
- Careers
- Programs
- Admissions
- Academics
- Research
- Skill Development
- Con, Innov.&Entr
- Library
- Grievances
Data Structures
GMUSD53
Credits: 2.00
Prerequisites : For Regular Pathway Eligibility the candidate must have passed class 12th and should have cleared the five exams covering all six modules. (Will be covered, if the knowledge gap is found)
Course Duration : 30 Hours / 12 Weeks
Start Date : 2024-03-15
End Date : 2024-07-15
Seats Remaining : 60
Aim & Summary
1. To provide the knowledge of basic data structures and their implementations. 2. To understand importance of data structures in context of writing efficient programs. 3. To develop skills to apply appropriate data structures in problem solving.| Week 1 | Basic Data Structures: Arrays, Strings, Stacks, Queues |
| Week 2 | Asymptotic analysis (Big-O notation) |
| Week 3 | Basic math operations (addition, subtraction, multiplication, division, exponentiation) |
| Week 4 | Basic math operations (addition, subtraction, multiplication, division, exponentiation (Continued) |
QUIZ 1 |
|
| Week 5 | Sqrt(n) primality testing |
| Week 6 | Euclid’s GCD Algorithm |
| Week 7 | Basic Recursion |
| Week 8 | Greedy Algorithms |
QUIZ 2 |
|
| Week 9 | Basic Dynamic Programming |
| Week 10 | Naive string searching |
| Week 11 | O(n logn) Sorting |
| Week 12 | Binary Searching |
PROJECT REPORT |
|
Course Certification
Certificate will have your name, photograph and the score in the final exam with the breakup. It will have the logos of GMU and company handling the course.