Open In App

Walk-Through DSA3 : Data Structures and Algorithms Online Course by GeeksforGeeks

Last Updated : 08 Nov, 2023
Improve
Improve
Like Article
Like
Save
Share
Report

This is a 10 weeks long online certification program specializing in Data Structures & Algorithms which includes pre-recorded premium Video lectures & programming questions for practice. You will learn algorithmic techniques for solving various computational problems and will implement more than 200 algorithmic coding problems. This course offers you a wealth of programming challenges that you may face at your next job interview. The course focuses mainly on Data Structure & Algorithms: the key to selection in top product based companies. Recommended for:

  • Pre-Final/Final year students preparing for the Placement drives
  • Employees looking for a job change

This post is designed for all the registered users of the DSA3 course to get familiar with the learning environment of the course. Let’s begin our tour of the DSA3 course. Open GeeksforGeeks | Practice. Click on slider on the right side named “Live Batches” to access batches of all of the courses in which you are registered. Click on the batch for DSA3 course, named “DSA Online 3 – Basic to Advance“. Clicking on the above link will take you to the landing page of the DSA3 Batch. The landing page of the DSA3 course batch is shown below. The main page of the batch for DSA3 contains the following components:

  1. Tracks: This part of the batch contains, all of the tracks topic wise, which are released weekly. You can find the details about the topics week wise on the DSA3 Course Page.
  2. Contests: This part contains the contests associated with the weekly tracks. For each week there will be a contest where you can practice your skills in a timed environment. The contests have their own specific rules that are available on the contest page.
  3. Leader Board: This is the leaderboard of the course and will display ranks of all of the users registered in the course.
  4. Discussion: This is the discussion forum where you can ask any of your queries to our moderators.
  5. Notice Board: The noticeboard is on the rightmost part of the page and will contain all of the important updates related to the course.

Let us look at each of the above-mentioned sections in details and about how to use them?

TRACKS

Each week a cluster of new tracks will be published. The tracks will have an overview, theory, video lectures, problems, and quiz sections. You are advised to read the theory and watch the videos before solving the problems and quiz. We have used the second track of the first week of the course to show you a glimpse of the details of different parts of tracks.

  • Overview: This section contains an overview of the corresponding track. It contains details about the track content, objective, assessments etc.
  • Classroom: The classroom tab contains all video lectured on the topics to be covered in the track. All of the video lectures are recorded by Mr. Sandeep Jain, Founder and C.E.O. of GeeksforGeeks.
  • Theory: This tab contains premium articles discussing the topics to be covered in the track. These are the written tutorials of the topics to be covered in the tracks.
  • Problems: This tab lists some top picked problems for practice which are asked in interviews and will also help you test your knowledge about the topics covered in the tracks and also to improve your implementation skills. We recommend you to read the theory and watch the videos before solving the problems.
  • Quiz: This section contains multiple choice questions on the topics covered in the track.

CONTESTS

The Contests page contains a list of all of the contests associated with the tracks in a particular week. Contests are also released weekly along with the tracks and are open for the entire duration of the week with a time constraint of 2 Hours. That is, any registered user can complete the learning part of the week as soon as possible and can take part in the corresponding contest of that week at any time and can compete for a duration of 2 hours. For each week there will be a contest where you can practice your skills in a timed environment. The contests have their own specific rules that are available on the contest page. Below is the screenshot of the contest page of the course.

Discussion

We have also designed a discussion forum to help you troubleshoot the problems that you might comes across. You can ask queries to our doubt-solving team anytime and we assure you to get a reply within 2 hours. Below is the screenshot of the discussion page: Doubt Solving:

  1. Please post your doubt with the link to the question in which you are facing difficulty.
  2. We assure you to provide assistance within 2 hours.
  3. You may ask queries during Weekdays in the time-slot 10 AM to 10 PM (IST), and during Weekend in the slot 10 AM to 6 PM (IST).
  4. If you think a particular reply answers your query then please click on resolved.
  5. For non-coding queries like certificates and all, please shoot a mail to geeks.classes@geeksforgeeks.org

You may ask any question by clicking on the “Ask / Start a new Discussion” button and filling up the modal as shown below:


author
harsh.agarwal0
Improve
Next Article
Data Structures and Algorithms Online Courses : Free and Paid

Similar Reads

Learn Data Structures and Algorithms for your Dream Job with this online Course
According to a study by employability assessment company Aspiring Minds in 2017, only 4.77 percent of candidates can write the correct logic for a program — a minimum requirement for any programming job. Another survey shows that only 7 percent of the engineering graduates in India are suitable for core engineering jobs. What could be the root caus
4 min read
DSA Self Paced Course – Basic to Advanced Online Course By GeeksforGeeks
If you're preparing for a tech interview with a product-based company or planning to do the same? Are you looking for a DSA Course? Don't know how to begin with data structures and algorithms? Then you are at the right place. Almost every IT giant including Facebook, Google, Amazon, etc. focuses more on the DSA skills of the candidates during the i
6 min read
Live Classes for Data Structures and Algorithms: Interview Preparation Focused Course
Engineers have the power to change the world by solving real-world problems but underneath its DSA that plays a crucial role in solving all the problems we are surrounded with. These all are the reasons people from all age groups love to move towards programming and want to learn it. Also, all the major tech companies (Google, Microsoft, Amazon, Fa
4 min read
Data Structures and Algorithms Online Courses : Free and Paid
Data Structures and Algorithms is one of the most important skills that every computer science student must-have. It is often seen that people with good knowledge of these technologies are better programmers than others and thus, crack the interviews of almost every tech giant. Now, you must be thinking to opt for a quality DSA Course to build
8 min read
Data Structures and Algorithms (DSA) MCQ Quiz Online
Welcome to our Data Structures and Algorithms (DSA) MCQ Quiz Online! This DSA MCQ is all about Quizzes for solving problems and learning the fundamentals of Algorithms and Data Structures. You'll see multiple-choice questions (MCQs) that test how well you understand the basics and Data structure Algorithms. We'll cover every topic of DSA like Array
4 min read
Does a Data Scientist/Machine Learning Engineer require in depth knowledge of Data Structures and Algorithms?
In today's world, data scientists and machine learning engineers play a crucial role in analyzing data and building intelligent systems. As technology continues to advance, the demand for these experts is growing rapidly. Real-world data problems are complex, requiring strong skills in handling data and creating efficient algorithms. In this articl
10 min read
Count the number of walks of length N where cost of each walk is equal to a given number
Given a weighted undirected graph, Length of walks N and Cost X. The task is to count the number of different walks W of length N such that Cost(W) = X.We define the cost of a walk W, as the maximum over the weights of the edges along the walk.The nodes are numbered from 1 to n. The graph does not contain any multiple edges or self-loops. Examples:
10 min read
Implementation of Page Rank using Random Walk method in Python
Prerequisite: Page Rank Algorithm and Implementation, Random Walk In Social Networks page rank is a very important topic. Basically page rank is nothing but how webpages are ranked according to its importance and relevance of search. All search engines use page ranking. Google is the best example that uses page rank using the web graph. Random Walk
3 min read
Number of land cells for which we cannot walk off the boundary of Grid
Given an N x N binary matrix grid, where 0 represents a sea cell and 1 represents a land cell. A move consists of walking from one land cell to another adjacent (4-directionally that is left, right, up, and down) land cell or walking off the boundary of the grid. Find the number of land cells in the grid for which we cannot walk off the boundary of
15+ min read
Count the number of ways a person can walk, roll or jump
A person has to cover a distance, He can either walk, roll, or jump, each of these actions covers one unit distance. These actions are represented by: walk: w, roll: r, jump: j. Each person is eligible for the trophy if they meet the following criteria : The Person rolled for less than 2 unit distance in total.The Person jumped less than 3 consecut
9 min read
Article Tags :
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox