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.
- Programs on Sorting.
- Programs on Searching.
- Concepts of Time Complexity.
- And more in easy steps.
Course Content
- Introduction –> 3 lectures • 3min.
- Numbers –> 20 lectures • 1hr 9min.
- Strings –> 14 lectures • 52min.
- Recursion –> 6 lectures • 15min.
- Arrays & Matrices –> 13 lectures • 44min.
- Patterns –> 8 lectures • 32min.
- Algorithm Complexity –> 7 lectures • 10min.
- Sorting –> 7 lectures • 18min.
- Searching –> 5 lectures • 17min.
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 Core Java background who is interested in improving your programming skills or overcome the fear of coding , this course is for you.This course is also for those students who have completed my Core Java Made Easy Course.This course also helps experienced developers to improve their logic.
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