Data Structure - Part I

Design, implementation and analysis of basic data structures using Java language.
Rating: 3.9 out of 5 (849 ratings)
34,556 students
Data Structure - Part I
Rating: 3.9 out of 5 (849 ratings)
34,571 students
The course prepares the students for (and is a prerequisite for) the more advanced material students will encounter in later courses. The topics covered in the course are among the most fundamental material in all of computer science. The students will not only understand the working behaviour of data structures but also be able to implement those from scratch. The course will cover well-known data structures such as dynamic arrays, linked lists, stacks, queues and tree.

Requirements

  • Students should have basic programming knowledge and knows how to program in at least one programming language (like C, Java, or Python).
Description

Data Structures is a core course in a typical undergraduate Computer Science course. The topics covered in the course are among the most fundamental material in the field of computer science. Yo become a successful computer scientist or software programmer, you should have strong understanding of Data Structure and this course will polish your skills.

In this course we will work together and implement well-known data structures such as dynamic arrays, linked lists, stacks, queues, tree and time complexity analysis.

We tried our best to designed this course to be easily understood by absolute beginners.

Who this course is for:
  • This course is for anyone using a computer to address large problems (and therefore needing efficient algorithms). This course is suitable for all computer science students and professionals including people majoring in engineering, biology, physics, chemistry, economics, and many other fields, not just computer science.
Curriculum
7 sections • 31 lectures • 5h 37m total length
  • Introduction
  • Arrary Basics
  • Add Method - Part 1
  • Add Method - part 2
  • Remove Method
  • Unit Testing
  • Code
  • Linked List Introduction
  • Add Method
  • InsertAt Method
  • Remove Method - Part 1
  • Remove Method - Part 2
  • Code
  • Problem Introduction
  • Solution Implementation
  • Code
  • Stack Introduction
  • Uses of Stack
  • Infix to Postfix Conversion
  • Infix to Postfix Implementation - Part 1
  • Infix to Postfix Implementation - Part 2
  • Postfix Evaluation
  • Postfix Expression implementation
  • Code
  • Measuring Time Complexity - Part 1
  • Measuring Time Complexity - Part 2
  • Measuring Time Complexity - Part 3
  • Measuring Time Complexity - Part 4
  • Code Analysis - Part 1
  • Code Analysis - Part 2
  • Code Analysis - Part 3

Instructor
Problem Solving School
Log(n) Academy
  • 3.9 Instructor Rating
  • 955 Reviews
  • 42,136 Students
  • 5 Courses

Log(n) is a professional training academy in IT technologies. Log(n) Academy provides ONLINE training beyond geographical barriers where you can study at your own pace and set off for a bright future. We also provide ONSITE training for Students, Professionals and Companies on demand.

Team Log(n) Academy

All our trainers are skilled trainers and additions have the real time experience with proven track record in technical trainings. This experience qualifies them as specialists in training deliver. We understand how important the training is for you to achieve your career goals. So we work hard to provide you all the resources to complete your training with satisfaction and on-time.

Over the years, Log(n) Team has established strong reputation of delivering high quality online training, so our students come back even after years for their training needs.

Our Trainers

Senior level and well experienced in their respective fields.

Currently working at reputed organizations in the field they are teaching.

Capable of integrating practical experience with theoretical topics.

Have superior training/teaching experience and skills.


Consultancy, Business Collaboration & Partnership opportunities

Please send us message and we will happy to talk to you.