HOT

Data Structures and Algorithms-Part-1

Development

Data Structures and Algorithms-Part-1, available at $69.99, has an average rating of 4.3, with 152 lectures, 2 quizzes, based on 20 reviews, and has 128 subscribers.

Rating4.3
Enroll Now

You will learn about Basics of Linear Data Structures such as Arrays, Stack, Queue and Linked List and the differences between static and dynamic data structures 1D, 2D and Multi dimensional arrays and write coding for given problem which uses arrays Stack data structure and its implementations with example Applications of Stack which help to derive an idea where to use stack data structure for a given problem Queue data structure, its implementations and applications with suitable example and coding Linked Lists such as Singly LL, Doubly LL, Circularly Linked List and Doubly Circularly Linked List Students will be able to write logic for any given problem which uses linear data structures This course is ideal for individuals who are Beginners who wish to learn data structures or Undergraduate & Post graduate students or Students who have completed their graduation and preparing for job interviews It is particularly useful for Beginners who wish to learn data structures or Undergraduate & Post graduate students or Students who have completed their graduation and preparing for job interviews.

Enroll now: Data Structures and Algorithms-Part-1

Summary

Title: Data Structures and Algorithms-Part-1

Price: $69.99

Average Rating: 4.3

Number of Lectures: 152

Number of Quizzes: 2

Number of Published Lectures: 152

Number of Published Quizzes: 2

Number of Curriculum Items: 154

Number of Published Curriculum Objects: 154

Original Price: ₹1,199

Quality Status: approved

Status: Live

What You Will Learn

  • Basics of Linear Data Structures such as Arrays, Stack, Queue and Linked List and the differences between static and dynamic data structures
  • 1D, 2D and Multi dimensional arrays and write coding for given problem which uses arrays
  • Stack data structure and its implementations with example
  • Applications of Stack which help to derive an idea where to use stack data structure for a given problem
  • Queue data structure, its implementations and applications with suitable example and coding
  • Linked Lists such as Singly LL, Doubly LL, Circularly Linked List and Doubly Circularly Linked List
  • Students will be able to write logic for any given problem which uses linear data structures

Who Should Attend

  • Beginners who wish to learn data structures
  • Undergraduate & Post graduate students
  • Students who have completed their graduation and preparing for job interviews

Target Audiences

  • Beginners who wish to learn data structures
  • Undergraduate & Post graduate students
  • Students who have completed their graduation and preparing for job interviews

This course covers the concepts and implementations of Linear data structures such as Arrays, Stacks, Queues and Linked List. Relevant examples with pictorial representations are  given for better understanding. The differences between static and dynamic data structures have been dealt with practical implementations. Applications of stack such as Infix to Postfix Conversion, Postfix Evaluation, Decimal to Binary Conversion and Palindrome checking have been elaborately discussed with suitable simple coding. Similarly, the  applications of queue such as Stack implementation using Single queue and Double queues have been discussed in detail.   Introduction to Liked List and its types such as Singly Linked List, Circularly Linked List, Doubly Linked List and Doubly Circular Linked List  and its operations , Creation of node, Insertion of node at different positions of Linked List, Deletion of node from different positions, Traversal of Linked List have been explained with simple understandable code. This course also covers basics of object oriented programming such as writing functions, passing parameters to the functions and calling them. It also emphasizes on writing default constructor and  parameterized constructors.  This course includes almost 25  downloadable resource files, which includes concept wise java coding. The demo for each program have also been included in this course. All program files are made in txt format, so that the user can easily use it without any difficulty.

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Lecture 2: Course highlights

Lecture 3: Essentials 1-Functions

Lecture 4: Essentials-2-Functions

Lecture 5: Essentials 2-Programs

Lecture 6: Essentials 3- Constructors

Chapter 2: Data Structure Definition and its types

Lecture 1: Data Structure Definition and its types

Lecture 2: Data Structure Types

Chapter 3: Arrays – Definition & Types

Lecture 1: Arrays-Definition, Types of Arrays & Why Array?

Chapter 4: 1D Array Programs

Lecture 1: Introduction

Lecture 2: Print first and last element and Reversal of an array

Lecture 3: Find Minimum and Maximum of an 1D Array-Logic & Program

Lecture 4: Linear Search-Logic

Lecture 5: Linear Search-Program

Lecture 6: Binary Search-Procedure

Lecture 7: Binary Search-Program

Lecture 8: Find Missing element in sorted 1D Array

Lecture 9: Find Missing Elements-Program & Output

Lecture 10: Find repeating element from 1D array

Lecture 11: Move negative numbers to one side of an Array-Logic

Lecture 12: Move Negative numbers program and output

Lecture 13: Find Pair of elements for a given pairsum – Logic & Program

Chapter 5: Two Dimensional Array(2D Array)

Lecture 1: Introduction

Lecture 2: Types of Matrices-Row,Column,Rectangular & Square

Lecture 3: Types of Matrices-Indentity,Scalar, Diagonal, Upper triangular etc

Lecture 4: Identity Matrix

Lecture 5: Diagonal Matrix

Lecture 6: Scalar Matrix

Lecture 7: Transpose of a Matrix

Lecture 8: Print Matrix in Spiral Form

Lecture 9: Print Matrix in Spiral Form-Program

Lecture 10: LeetCode Problems on Array-287 Find the Duplicate Element

Lecture 11: LeetCode Problem On Array-121 Best time to Buy and Sell the Stock

Lecture 12: LeetCode Problem on Array-169 Majority Element

Lecture 13: LeetCode Problem on Array-48 Rotate Image

Lecture 14: LeetCode Problem on array-53 Maximum subarray

Lecture 15: LeetCode Problem on Array-75 Sort Colors

Lecture 16: LeetCode -50 implementing Power Function

Lecture 17: Leetcode-759 Number of Subarrays with bounded Maximum

Chapter 6: Sparse Matrix

Lecture 1: Introduction

Lecture 2: Applications of Sparse Matrix

Lecture 3: Sparse Matrix representation in Triples format

Lecture 4: Sparse Matrix representation in CSR format

Lecture 5: Sparse Matrix Operations-Addition

Lecture 6: Sparse Matrix Operations-Transpose

Lecture 7: Sparse Matrix Operations-Multiplication

Chapter 7: Implementations of Sparse Matrix

Lecture 1: Implementation of Sparse Matrix into Triplet format(Row, Column, Value)

Lecture 2: Implementation of Sparse Matrix into Row Column Value Format

Lecture 3: Implementation of CSR Format

Lecture 4: Implementation of Sparse Matrix Addition

Lecture 5: Implementation of Sparse Matrix Addition -Program

Chapter 8: Pattern Matching

Lecture 1: Pattern Mactching-Brute Force

Lecture 2: Pattern Matching-Horspool

Chapter 9: Analysis of Algorithms

Lecture 1: Algorithm analysis-Examples-1

Lecture 2: Algorithm Analysis- Examples-2

Lecture 3: Analysis of Algorithms-Linear Search & Finding Duplicates

Lecture 4: Asymptotic Analysis

Lecture 5: Asymptotic Analysis Rules

Lecture 6: Efficiency of Algorithms

Chapter 10: Sorting Techniques

Lecture 1: Analysis of Sorting

Lecture 2: Bubble Sort

Lecture 3: Optimized version of Bubble Sort

Lecture 4: Insertion Sort

Lecture 5: Insertion Sort-Execution for sample input

Lecture 6: Insertion sort Execution and Analysis

Lecture 7: Selection Sort

Lecture 8: Selection Sort-Implementation

Lecture 9: Selection Sort-Analysis

Lecture 10: Merge Sort-Recursive

Lecture 11: Merge sort Recursive Calls

Lecture 12: How merging works-Procedure

Lecture 13: Merge Sort-Iterative

Lecture 14: Analysis of Merge Sort

Lecture 15: Count Sort

Lecture 16: Count Sort Implementation

Lecture 17: Quick Sort

Chapter 11: Arraylist

Lecture 1: Array Vs ArrayList

Chapter 12: Stack

Lecture 1: Stack Introduction & Stack Operations

Lecture 2: Procedure of Stack Push & Pop

Lecture 3: Stack implementation using Arrays

Chapter 13: Applications of Stack

Lecture 1: Infix to Postfix-Application-1

Lecture 2: Conversion of infix to Postfix-Example

Lecture 3: Infix to Postfix-Program

Lecture 4: Postfix Expression Evaluation-Application-2

Lecture 5: Reversal of a String-Application -3

Instructors

Rating Distribution

  • 1 stars: 1 votes
  • 2 stars: 1 votes
  • 3 stars: 1 votes
  • 4 stars: 5 votes
  • 5 stars: 12 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!

You may also like

Content Creation with ChatGPT + AI Tools

Blogging For Beginners: Start, Grow and Monetize (Sinhala)

(NEW) The Complete Growth Hacking & Conversion Course