Certificate Course: Fundamentals of Programming (FoP)
Collaboration with: upGrad | Duration: January 2021 – June 2021
Students enrolled: 15


Students who have successfully completed the course: 13
1 | Anku Kumari | PGD | Data Science |
2 | Pranjal Kumar | PGD | Data Science |
3 | Mansi Pandey | B.Tech | CSE with Data Science |
4 | Anshuli Kashyap | B.Tech | CSE with Data Science |
5 | Ashish Kumar | B.Tech | CSE with Data Science |
6 | Chand Babu | B.Tech | CSE with Data Science |
7 | Kishor Kumar | B.Tech | CSE with Data Science |
8 | Krishna Agarwal | B.Tech | CSE with Data Science |
9 | Sagar Kishan Verma | MSc. | Data Science |
10 | Shivani Pal | B.Tech | CSE with Data Science |
11 | Taufeeq Ahmad | B.Tech | CSE with Data Science |
12 | Varun Kuttan | MSc | Data Science |
13 | Vishal Lakhera | B.Tech | CSE with Data Science |
Syllabus
Module Name | Session Topic |
Variables & Datatypes | · Installation of JDK |
· Primitive Data Types | |
· Arrays | |
· Comments in Java | |
Conditionals, Loops & Functions | · Conditional statements |
· Use loops to reduce the repetition of logic | |
· Create functions to make your program efficient | |
· Use loops to reduce the repetition of logic | |
Object Oriented Programming | · Benefits of object-oriented programming |
· The ‘this’ keyword | |
· The second principle of OOP — encapsulation | |
· The second principle of OOP — encapsulation | |
· Inheritance vs Composition | |
Arrays & Linked Lists | · Inheritance vs Composition |
Abstract classes | |
Interfaces | |
· Dynamic Polymorphism | |
String Handling | |
· Arrays | |
· Basic operations in ArrayList and LinkedList | |
· Iterators | |
· Structure of ArrayList and LinkedList | |
· Introduction to Stacks | |
· Stacks | |
. Applications of Stacks & Operations of stacks | |
· Solving the parenthesis matching problem using stacks | |
. Queues | |
· Industry Demonstration: file versioning system | |
· Implement a stack using two queues | |
· Delete duplicate parenthesis problem | |
· Introduction to Hash Tables | |
· Collisions in hash tables | |
· Introduction to hashmap and hashset | |
· First unique character problem | |
· Check array of contiguous integers problem | |
· Find itinerary from all tickets problem | |
· The title problem | |
· Introduction to trees | |
·Properties of binary tree | |
· Representation of binary tree | |
· DFS pseudocode and code | |
· Tree traversal : BFS | |
Graphs | |
Heaps | |
Algorithm Analysis | · Parameters of Algorithm Efficiency |
· Asymptotic notations | |
· Time vs Space complexity trade off | |
· Fibonacci sequence | |
Searching & Sorting | · Introduction to Searching |
· Linear Search and its Java implementation | |
· Divide & Conquer algorithms | |
· Binary Search and its Java implementation | |
· Bubble Sort and its Java implementation | |
· Selection Sort and its Java implementation | |
· Insertion Sort and its Java implementation | |
· Time Complexity of Insertion Sort | |
· Merge Sort and its Java implementation | |
· Quick Sort and its Java implementation | |
· Quick Sort demonstration through cards game + Doubt resolution | |
· Comparison of Sorting Algorithms |