- Design, implementation and analysis of basic data structures using Java language.
- Free tutorial
- Rating: 4.6 out of 54.6 (1,281 ratings)
- 55,595 students
- 5hr 37min of on-demand video
- Created by Muhammad Tariq
- English
What you’ll learn
- 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.
Show less
Course content
7 sections • 31 lectures • 5h 37m total lengthCollapse all sections
Introduction to Data Structure1 lecture • 7min
- Introduction07:24
List6 lectures • 1hr
- Arrary Basics08:47
- Add Method – Part 111:07
- Add Method – part 209:39
- Remove Method15:05
- Unit Testing15:07
- Code00:09
Linked List6 lectures • 54min
- Linked List Introduction09:29
- Add Method18:17
- InsertAt Method12:14
- Remove Method – Part 110:27
- Remove Method – Part 203:28
- Code00:08
Josephus Problem3 lectures • 28min
- Problem Introduction11:43
- Solution Implementation16:37
- Code00:02
Stack Data Structure8 lectures • 1hr 35min
- Stack Introduction10:01
- Uses of Stack11:42
- Infix to Postfix Conversion14:17
- Infix to Postfix Implementation – Part 124:39
- Infix to Postfix Implementation – Part 213:56
- Postfix Evaluation06:19
- Postfix Expression implementation13:43
- Code00:05
Runtime Analysis4 lectures • 50min
- Measuring Time Complexity – Part 109:49
- Measuring Time Complexity – Part 212:45
- Measuring Time Complexity – Part 315:50
- Measuring Time Complexity – Part 411:49
Code Analysis3 lectures • 42min
- Code Analysis – Part 116:05
- Code Analysis – Part 209:25
- Code Analysis – Part 316:59
