Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 10 additions & 0 deletions Course1.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
Hello My name is Anup Mishra
My Favorite module would be Arrays and Linked Lists.
This module helped me land a job at my current employer. Also this module helped me understand to use the large arrays efficiently.This module also helped me to think logically for ADT's.

Gagan Raj M
1)Variable and Datatypes
Learnt basics of OOPS and Java Programming.

A_Ganesh
1)learnt detailed datatypes
16 changes: 16 additions & 0 deletions Course2.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
Hello you can tell us your name and the module name from course2 you want to contribute to.
You can choose onemodule from the list below:-
1)Algorithm Analysis
2)Divide and Conquer Algorithms
3)Divide & Conquer Algorithms
4)Greedy Algorithm
5)Dynamic Programming


Pawan Dubey
Dynamic Programming
Understanding the prolem and implementing a solution which is space and time efficient by structuring it into sub problems.

I_Ganesh
data strutures and alogorithmns
Understand different types of alog and alogorithmns
19 changes: 19 additions & 0 deletions Course3.txt
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
Hello you can tell us your name and the module name from course1 you want to contribute to.
You can choose onemodule from the list below:-
1)Stacks & Queues
2)Hashtables
3)Binary Trees & BSTs
4)Priority Queues & Heaps
5)Graphs & Graph Algorithms

Saubhik Mukherjee
Graphs & Graph Algorithms
I learnt how to implement a graph using edge list, adjacency lists and adjacency matrix.
I learnt how to do BFS and DFS traversals on a graph.
I learnt how to use Dijkstra's algorithm to find the shortest path from a vertex in a directed graph.

Q_Ganesh
Dynamic programming
learning different problem solving techniques