Basics of Python with Data Structures and Algorithms

BY
Coding Ninjas

Enhance your programming skills with Python by pursuing the certification of Basics of Python with Data Structures and Algorithms by Coding Ninjas.

Mode

Online

Duration

6 Months

Fees

₹ 16998

Quick Facts

particular details
Medium of instructions English
Mode of learning Self study, Virtual Classroom
Mode of Delivery Video and Text Based
Learning efforts 12-18 Hours Per Week

Course overview

The Basics of Python with Data Structures and Algorithms certification course is an online program that can be accessed through the website of Coding Ninjas. Candidates who take up the course will be knowledgeable about programming concepts related to Python. Students will be able to understand topics such as dynamic programming, conditions, loops, recursion, etc. The course can be completed in the time span of 2 to 8 months. The study material is already given in the Basics of Python with Data Structures and Algorithms certification syllabus which consists of different modules, assignments, projects, etc. Students get access to the chatroom just to get their doubts cleared regarding any topic. Students can interact with the faculty members well as batch mates. Students can qualify for the exam and become eligible to acquire a certificate of completion as well as a certification of excellence at the end of the Basics of Python with Data Structures and Algorithms online course.

The highlights

  • 2-8 months course
  • Assignments available
  • Free trial
  • 60 hours of video sessions
  • Online programme
  • Study material available
  • Certificate achievable
  • Self-paced learning

Program offerings

  • Video sessions
  • Assignments
  • Projects
  • Exam
  • Modules
  • Chat room

Course and certificate fees

Fees information
₹ 16,998
  • Students can join the free trial of the programme without paying any amount.

Basics of Python with Data Structures and Algorithms fee details

Plan 

Amount in INR

Basic

6,999

Standard13,998
Pro16,998
Premium29,998
certificate availability

Yes

certificate providing authority

Coding Ninjas

Who it is for

The Basics of Python with Data Structures and Algorithms by Coding Ninjas is suitable for the following participants- 

  • Students who are interested in the programme.
  • Students who want to pursue this as a career. 

Eligibility criteria

Education

Candidates who have the fundamental knowledge of Mathematics are apt for the programme.

Certification Qualifying Details

Students will be eligible to get a certificate of completion if they qualify with a minimum of 60% and a certificate of excellence if they get at least 90%. 

What you will learn

Knowledge of algorithms Knowledge of python

Participants will understand the following points after graduating from the Basics of Python with Data Structures and Algorithms certification

  • Candidates will be able to learn the fundamentals of programming.
  • Learners will acquire knowledge regarding Algorithms and their functions.
  • Participants will come to know about two-dimensional lists in the Basics of Python with Data Structures and Algorithms training.
  • Candidates will learn about recursion and time and space complexity.
  • Students will gain information on OOPs and linked lists.
  • Candidates will learn about stacks and queues and BST etc in the Basics of Python with Data Structures and Algorithms programme.
  • Students will learn dynamic programming and Tries and Huffman coding. 

The syllabus

Introduction to Programming

Basics of Programming
  • Flowcharts
    • Introduction to flowcharts, 
    • Decision-making using flowcharts, 
    • Loops, 
    • Example problems
  • Variables and Data Types
    • First program, 
    • Variables and data types, 
    • Taking input, 
    • How data is stored in memory, 
    • Arithmetic Operators
  • Conditional Statements
    • Introduction to If else, 
    • Relational and logical operators, 
    • Nested conditionals
Loops and Functions
  • While Loops
    • While loops, 
    • Flow of execution of statements in while loop, 
    • Example problems using while loop
  • Patterns
    • Introduction to patterns, 
    • Basic Patterns, 
    • Square Patterns, 
    • Triangular Patterns, 
    • Character Patterns, 
    • Reverse Triangle, 
    • Inverted patterns, 
    • Isosceles triangles
  • For Loops
    • For loops, 
    • Break and Continue, increment - decrement operators
  • Functions
    • Introduction to functions, 
    • Working of function calling, 
    • Variables and its scope, 
    • Pass by value
Arrays
  • Introduction to Arrays
    • Introduction to arrays, 
    • How arrays are stored in memory, 
    • Passing arrays to functions
  • Searching and Sorting
    • Understanding Binary Search, 
    • Selection sort, 
    • Bubble sort, 
    • Insertion sort, 
    • Merging two sorted arrays
Strings and 2D Arrays
  • Strings
    • Introduction to strings, storage of strings, and their inbuilt functions
  • 2D Arrays
    • 2D arrays, 
    • Storage of 2D arrays, 
    • Example problems using 2D Arrays

Data Structures & Algorithms

Problem Solving Techniques
  • Recursion
    • Introduction to recursion, 
    • Principle of mathematical induction, 
    • Fibonacci numbers, 
    • Recursion using arrays, 
    • Recursion using strings, 
    • Recursion using 2D arrays
  • Time and Space Complexity
    • Order complexity analysis, 
    • Theoretical complexity analysis, 
    • Time complexity analysis of searching and recursive algorithms, 
    • Theoretical space complexity, 
    • Space complexity analysis of merge sort
Object Oriented Programming
  • Basics of OOPS
    • Introduction to OOPS, 
    • Creating objects, 
    • Getters and setters, 
    • Constructors and related concepts, 
    • Inbuilt constructor and destructor, 
    • Example classes
  • Advance Concepts of OOPS
    • Static members, 
    • Function overloading and related concepts, 
    • Abstraction, 
    • Encapsulation, 
    • Inheritance, 
    • Polymorphism, 
    • Virtual functions, 
    • Abstract classes, 
    • Exception handling
Linear Data Structures
  • Linked Lists
    • Introduction to linked list, 
    • Inserting node in linked list, 
    • Deleting node from linked list, 
    • Midpoint of linked list, 
    • Merge two sorted linked lists, merge sort of a linked list, 
    • Reversing a linked list
  • Stacks and Queues
    • Introduction to stacks, Stack using arrays, 
    • Dynamic Stack class,
    • Stack using linked list, 
    • Inbuilt stack, 
    • Queue using arrays, 
    • Dynamic queue class, 
    • Queue using linked list, 
    • Inbuilt queue
Trees
  • Generic Trees
    • Introduction to Trees, 
    • Making a tree node class, 
    • Taking a tree as input and printing, 
    • Tree traversals, 
    • Destructor for tree node class
  • Binary Trees
    • Introduction to Binary Trees, 
    • Taking a binary tree as input and printing, 
    • Binary Tree traversals, 
    • Diameter of binary tree
  • Binary Search Trees
    • Introduction to Binary Search Trees, 
    • Searching a node in BST, 
    • BST class, 
    • Inserting and Deleting nodes in BST, 
    • Types of balanced BSTs
Advanced Data Structures
  • Priority Queues
    • Introduction to Priority Queues, 
    • Ways to implement priority queues, 
    • Introduction to heaps, 
    • Introduction to Complete Binary Trees and its implementation, 
    • Insert and Delete operations in heaps, 
    • Implementing priority queues, 
    • Heap sort, 
    • Inbuilt Priority Queue
  • Hashmaps
    • Introduction to Hashmaps, 
    • Inbuilt Hashmap, 
    • Hash functions, 
    • Collision handling, 
    • Insert and Delete operation implementation in hashmap, 
    • Load factor, 
    • Rehashing
  • Graphs
    • Introduction to Graphs, 
    • Graph Terminology, 
    • Graph implementation, 
    • Graph Traversals (DFS and BFS), 
    • Weighted and Directed Graphs, 
    • Minimum Spanning Trees, 
    • Cycle Detection in Graphs, 
    • Kruskal's algorithm, 
    • Prim's Algorithm, 
    • Dijkstra's algorithm
Dynamic Programming
  • Introduction to Dynamic Programming
    • Introduction to Memoization, 
    • Introduction to Dynamic Programming, 
    • Fibonacci numbers using recursion, memoization and dynamic programming
  • Applications of Dynamic Programming
    • Longest Common Subsequence (LCS) using recursion, memoization and dynamic programming, 
    • Edit distance using recursion, memoization and dynamic programming, 
    • Knapsack problem using recursion, memoization and dynamic programming

Admission details

The following guidelines should be adhered to while applying for the Basics of Python with Data Structures and Algorithms certification- 

Step 1- Students have to register through the course webpage.

Step 2- Students need to sign up or log in to the Coding Ninjas account. 

Step 3- Students must click on the Enrol now option given on the page.

Step 4- Students must pay the course fee to get into the programme.

How it helps

This course provides the confidence to apply for jobs and internships in reputed organizations. The course is a complete package that helps in improving your coding and developing skills. Students can boost their profile with the certification and also mention the skills gained throughout the course on their CVs and resumes. The certification can also be used in case the student wants to apply for the higher level of the programme in a similar specialization. The course will also give a great start to your career. 

FAQs

Does the platform provide placement opportunities for this course?

No, Coding Ninjas does not provide placement opportunities for the programme.

What if I have any doubt regarding the topic in the Basics of Python with Data Structures and Algorithms programme?

Students can clear their doubts with TAs or can contact the faculty through Slack.

What is the duration of the course?

The course duration is between two to eight months.

What are the prerequisites for the online course?

Students who get enrolled in the course must have prior knowledge of basic Mathematics.

Why opt for the Premium Plan?

The premium plan is ideal for students who are looking for a complete learning journey. The premium plans cover data structures, MERN stack development in addition to grabbing additional skills, placement preparation, creating an ideal profile, and resume review. 

Articles

Popular Articles

Latest Articles

Trending Courses

Popular Courses

Popular Platforms

Learn more about the Courses

Download the Careers360 App on your Android phone

Regular exam updates, QnA, Predictors, College Applications & E-books now on your Mobile

Careers360 App
150M+ Students
30,000+ Colleges
500+ Exams
1500+ E-books