Improve logic and over come the fear of programming
—
What you’ll learn
- Programs using Numbers.
- Programs using Strings.
- Programs using Arrays.
- Programs using Recursion.
- Programs on Patterns.
- Concepts of Time Complexity.
- Programs on Sorting.
- Programs on Searching.
- Implement Data Structures.
- Create LinkedLists.
- Create Stack.
- Work with Queues.
- Implement Trees.
- Work on problems using Data Structures.
- And more in easy steps.
Course Content
- Introduction –> 3 lectures • 3min.
- Numbers –> 22 lectures • 1hr 4min.
- Strings –> 8 lectures • 22min.
- Recursion –> 4 lectures • 10min.
- Arrays and Matrices –> 16 lectures • 37min.
- Patterns –> 9 lectures • 25min.
- Algorithm Complexity –> 7 lectures • 10min.
- Sorting –> 9 lectures • 23min.
- Searching –> 5 lectures • 16min.
- Linked List –> 17 lectures • 41min.
- Stack –> 9 lectures • 20min.
- Queue –> 3 lectures • 6min.
- Wrap Up –> 1 lecture • 1min.
Requirements
—
All source code is available for download
Responsive Instructor – All questions answered within 24 hours
Professional video and audio recordings (check the free previews)
—-
Are you a College Student with Python background who is interested in improving your programming skills or overcome the fear of coding , this course is for you.This course is for experienced developers as well.
You will start working on simple programs and move using numeric types
Print Digits in a number
Sum of Digits in a number
Check if a number is palindrome or not
Convert integer to binary and visa versa
Check if a given number is Special and Perfect Number
and More
Work with Strings:
Reverse a String in different ways
Count the words in given text
Find words,Remove Vowels
Find Duplicates,Replace Next Character
and More
Understand Recursion and write programs using it
Write programs using Arrays and Matrices
Sum of positive and negative numbers in a array
Find min and max element in a array
Reverse elements in a array
Check if a given matrix is a sparse matrix
Do Matrix Transpose
Swap Rows and Columns
Work with patterns:
Print Right Triangle
Print Inverted Right Triangle
Mirrored Right Triangle
Understand Time and Space Complexity
Implement Bubble Sort and enhance it
Implement Selection Sort
Implement Linear Search
Implement Binary Search using recursive and non recursive ways
Data Structures:
What are Data Structures
Different Types of Data Structures
Linked Lists:
Create a LinkedList
Insert at the end
Insert at the beginning
Insert in the middle
Delete at different positions
Traverse
Find Nth Node
Check if list has a loop
Reverse a List
Work with Double LinkedList
Stacks:
Create a stack using an array
Create a stack using a List
Push,Pop,Peek
Reverse a String using a stack
Check if symbols are balanced
Queues:
Create a Queue using an Array
Create a Queue using a List
enQueue, deQueue