DSA and Algorithms

DSA and Algorithms, available at $44.99, 3 quizzes.

You will learn about an ability to understand advanced concepts in theory of computer science ; an ability to design and conduct experiments as well as to analyse and interpret data an ability to understand advanced concepts in applications of computer science;an ability to function in teams and to communicate effectively an ability to apply knowledge of advanced computer science to formulate and analyse problems in computing and solve them; an ability to learn emerging concepts in theory and applications of computer science; This course is ideal for individuals who are COMPUTER SCIENCE STUDENTS It is particularly useful for COMPUTER SCIENCE STUDENTS.

Enroll now: DSA and Algorithms

Summary

Title: DSA and Algorithms

Price: $44.99

Number of Quizzes: 3

Number of Published Quizzes: 3

Number of Curriculum Items: 3

Number of Published Curriculum Objects: 3

Number of Practice Tests: 3

Number of Published Practice Tests: 3

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

an ability to understand advanced concepts in theory of computer science ; an ability to design and conduct experiments as well as to analyse and interpret data
an ability to understand advanced concepts in applications of computer science;an ability to function in teams and to communicate effectively
an ability to apply knowledge of advanced computer science to formulate and analyse problems in computing and solve them;
an ability to learn emerging concepts in theory and applications of computer science;

Who Should Attend

COMPUTER SCIENCE STUDENTS

Target Audiences

COMPUTER SCIENCE STUDENTS

Discrete Mathematics or equivalent. Abstract data types: lists, stacks, queues, trees, heaps. Basic proof techniques. Bubble, selection, insertion, counting, radix, bucket, merge and quick sorts; binary search. Graphs: representation and algorithms.

· Introduction, Asymptotic notation for Execution time analysis. Function hierarchy. Forming and solving recurrences. Recursion tree and substitution method. Master theorem. Amortized cost.

· Inversions and sorting. Sorting algorithms: bubble, selection, insertion, counting, radix, and bucket. A lower bound for sorting by comparison. Heap sort.

· Divide and conquer: merge sort, quick sort, binary search, linear time rank, Strassen’s matrix multiplication, Closest pair of points in 2D.

· Dynamic programming: Fibonacci numbers, longest common substring, longest common subsequence, 0-1 Knapsack, matrix-chain multiplication, party planning and bitonic TSP.

· Greedy algorithms: Activity selection, Fractional Knapsack.

· Graphs: Representation. Graph explorations: DFS, BFS and their applications. Shortest paths: BFS, Dijkstra, Bellman-Ford, Floyd-Warshall. Minimum spanning trees: Prim’s and Kruskal’s.

· Maximum flow problems. Introduction, Ford Fulkerson method, Edmonds Karp algorithm, max flow min cut theorem. Applications.

· Introduction to NP-completeness. NP-Complete reductions 3SAT, clique, vertex Cover, maximum independent set.

· Introduction to Algorithms, 3rd ed., Cormen, Leiserson, Rivest, and Stein. MIT Press.

· Brassard, Gilles, and Paul Bratley. Fundamentals of algorithmics. Vol. 524. Englewood Cliffs: Prentice Hall, 1996.

· Jon Kleinberg, Éva Tardos. Algorithm Design.

· Problems on algorithms. Ian Parberry.

· Dasgupta, Sanjoy, Christos H. Papadimitriou, and Umesh Virkumar Vazirani. Algorithms. McGraw-Hill Higher Education, 2008.

Course Curriculum

Instructors

Gaurav Sharma
Instructor

Rating Distribution

1 stars: 0 votes
2 stars: 0 votes
3 stars: 0 votes
4 stars: 0 votes
5 stars: 0 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!

Menu