Java Logical Programs and Data Structures For Beginners

Java Logical Programs and Data Structures For Beginners, available at $74.99, has an average rating of 4.67, with 164 lectures, based on 232 reviews, and has 2852 subscribers.

You will learn about 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 This course is ideal for individuals who are College Students Attending Interviews or Students who have completed my Core Java Made Easy Course or Students who want to improve logic or Students who want to overcome fear of programming It is particularly useful for College Students Attending Interviews or Students who have completed my Core Java Made Easy Course or Students who want to improve logic or Students who want to overcome fear of programming.

Enroll now: Java Logical Programs and Data Structures For Beginners

Summary

Title: Java Logical Programs and Data Structures For Beginners

Price: $74.99

Average Rating: 4.67

Number of Lectures: 164

Number of Published Lectures: 161

Number of Curriculum Items: 180

Number of Published Curriculum Objects: 177

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will 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

Who Should Attend

College Students Attending Interviews
Students who have completed my Core Java Made Easy Course
Students who want to improve logic
Students who want to overcome fear of programming

Target Audiences

College Students Attending Interviews
Students who have completed my Core Java Made Easy Course
Students who want to improve logic
Students who want to overcome fear of programming

—

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 withCore 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.

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

Trees:

Create a Tree

Perform PreOrder,InOrder,PostOrder traversals

max, search, find and findMin

Course Curriculum

Chapter 1: Introduction

Lecture 1: Course Introduction

Lecture 2: How to make the best of this course

Lecture 3: Download Projects

Chapter 2: Numbers

Lecture 1: Even or Odd

Lecture 2: Leap Year Checker

Lecture 3: Credit Card Issuer

Lecture 4: Print digits in a number

Lecture 5: Sum of digits in a number

Lecture 6: Sum of prime digits

Lecture 7: Count the digits in a number

Lecture 8: Check for Duck Number

Lecture 9: Reverse a number

Lecture 10: Palindrome or not

Lecture 11: Palindrome or not 2nd way

Lecture 12: Integer to binary

Lecture 13: Integer to Binary 2nd way

Lecture 14: Fibonacci Series

Lecture 15: Recursion Logic

Lecture 16: Fibonacci Series using recursion

Lecture 17: Niven Number

Lecture 18: Special Number

Lecture 19: Print Prime Numbers

Lecture 20: Perfect Number Check

Lecture 21: Armstrong Number Check

Chapter 3: Strings

Lecture 1: Reverse a String

Lecture 2: Reverse a String Take 2

Lecture 3: Count the words

Lecture 4: Count words Take 2

Lecture 5: Check if String Ends with a String

Lecture 6: Find Max Occurrences

Lecture 7: Find Gold

Lecture 8: Remove Vowels

Lecture 9: Add Duplicates

Lecture 10: Print Even Words

Lecture 11: Replace with next char

Lecture 12: Check Order

Lecture 13: Find Duplicate Consecutive Characters

Lecture 14: Middle of the string

Chapter 4: Recursion

Lecture 1: Introduction

Lecture 2: Factorial

Lecture 3: Sum of numbers till N

Lecture 4: Power

Chapter 5: Arrays & Matrices

Lecture 1: Create Array from user input

Lecture 2: Print Even Numbers

Lecture 3: Sum of Positive and Negative

Lecture 4: Reverse elements in a array

Lecture 5: Mini Peaks

Lecture 6: Min and Max in a array

Lecture 7: Print last M elements

Lecture 8: Create and print matrix

Lecture 9: Matrix Addition

Lecture 10: Print diagonal elements

Lecture 11: Sparse Matrix

Lecture 12: Swap Rows

Lecture 13: Matrix Transpose

Lecture 14: Symmetric or not

Lecture 15: Swap Columns

Chapter 6: Patterns

Lecture 1: Right Triangle

Lecture 2: Right Triangle – Two Variations

Lecture 3: Inverted Right Triangle

Lecture 4: Mirrored Right Triangle

Lecture 5: Mirrored right triangle Pattern 2

Lecture 6: Pascals Triangle

Lecture 7: Reverse Pascals Triangle

Lecture 8: Sand Glass

Chapter 7: Algorithm Complexity

Lecture 1: Algorithm

Lecture 2: Time Complexity

Lecture 3: Constant Time Complexity

Lecture 4: Logarithmic Time Complexity

Lecture 5: Linear Time Complexity

Lecture 6: Quadratic Time Complexity

Lecture 7: Exponential Time Complexity

Chapter 8: Sorting

Lecture 1: Bubble Sort Introduction

Lecture 2: Implement Bubble Sort

Lecture 3: Enhancement 1

Lecture 4: Enhancement 1 Implementation

Lecture 5: Enhancement 2

Lecture 6: Enhancement 2 Implementation

Lecture 7: Selection Sort Implementation

Lecture 8: Insertion Sort

Lecture 9: Insertion Sort Implementation

Instructors

Bharath Thippireddy
IT Architect and Best Selling Instructor- 700000+ students

Rating Distribution

1 stars: 4 votes
2 stars: 4 votes
3 stars: 16 votes
4 stars: 84 votes
5 stars: 124 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