Get updates on Eligibility, Admission, Placements Fees Structure
Quick Facts
| Medium Of Instructions | Mode Of Learning | Mode Of Delivery |
|---|---|---|
| English | Self Study | Video and Text Based |
Course Overview
Java is an object-oriented programming language used worldwide for both the development of applications as well as websites. Java is the key ingredient behind Google Maps, Internet Routers and what not which makes knowledge about how Java works and its Data Structure a must when looking for opportunities in the Cyber World.
Advanced-Data Structure in Java by Coursera offers all that is required to master the computer language. This course is designed to teach candidates how to analyze and develop algorithms and study complex data structures, which in turn will help them resolve real-world problems of the field.
The contents of the course will be lined with videos, exercises, pre-course quizzes and multiple readings all of which have concepts being tied to the final event; making a route planning application. This course ensures to open a lot of doors for the candidates’ careers and thus, is exactly what the opportunists need.
The Highlights
- 100% Online Programme
- Requires 28 hours for completion
- Offered by University of California San Diego
- Easy to access in both English and Spanish
Programme Offerings
- Self paced learning
- quizzes
- course videos
- Reading
- assignments.
Courses and Certificate Fees
| Certificate Availability | Certificate Providing Authority |
|---|---|
| yes | Coursera |
Advanced Data Structure in Java Fee Details
Course | Fees in INR |
1 Month | Rs. 1,676 |
3 Months | Rs. 3,369 |
6 Months | Rs. 5,029 |
Eligibility Criteria
Certification Qualifying Details
Candidates have to pass all the graded quizzes and exercises and submit all the projects, to be later approved by the trainers, to receive a certificate at the end of the programme.
What you will learn
When the candidates have finished their Advanced Data Structure in Java course, they would be holding a firm grasp on the following concepts:
- They will be masters of course structure and orientation to starter code
- They will have an absolute hold on central later structures and graph definitions
- They will be learning all there is to class design and graph Search
- They will be brilliantly explained the ways of finding the shortest paths to weighted graphs problems
- They will master the skill of route planning and even have a project extension to learn even more about mapping applications
Who it is for
Application Details
Candidates who wish to enrol themselves into the programme have to follow the below mentioned Advanced Data Structure in Java admission process:
Step 1: Visit the official website of this course and press on 'Enroll Now'.
Step 2: Candidates will have to register themselves either with their email, Google or Facebook account.
Step 3: When candidates have registered, they will get two options; either the course with all its features including getting the certificate at the end of the audited course which gives them just the course materials to study for free. Candidates have to choose which programme they would be most interested in.
Step 4: If the candidates choose the unaudited course, they have to fill in their bank details.
Step 5: They will then be the recipients of a 7-day free trial after which they can choose whether they want to pursue the course to its fulfilment or not. If they choose to pursue they will have to pay the fees.
Step 6: Candidates who chose the audited course will have to fill in a form after which they will be approved for the programme.
The Syllabus
Videos
- Welcome
- Your path through this course
- Concept challenges
- Project Prototype
Readings
- After completing this course, you will be able to ...
- Is this course right for me?
- Up Next: A short survey
- If you want more practice before you begin...
- The structure of this course
- Welcome from the Google engineers
- Project Overview
- Setting up Java and Eclipse
- Getting and Setting up the Starter Code
- Project: Orientation to the Starter Code, Data Files and Front-end
Assignments
- Pre-course quiz
- Survey: Your goals for the course
- Course Structure and Starter Code Quiz (make sure you can run the starter code first)
Discussion Prompt
- Introduce Yourself!
Videos
- Introduction
- Core: Graph Definition
- Core: Adjacency list
- Core: Adjacency Matrix
- Core: Implementing graphs in Java
- In the real world : Graphs at google
- In the real world : Performance implementation of graphs
- In the real world: more graphs at google
- When I struggled: Analysing implementations
- In the real world: performance considerations
- Core: Neighbours
- Support: Multiplying Adjacency matrices
- Support: Coding 2 – Hop neighbours
- Project: programming assignment walkthrough
Readings
- A note about week numbers
- By the end of this week, you will be able to...
- (Read only AFTER finishing Graphs Quiz)
- Graph definitions and implementation: a glossary
- Week 2: Additional Resources
- Programming Assignment FAQ
- Graph definitions and implementations Quiz Answer explanations (Read ONLY after you pass the quiz)
Assignments
- Graphs
- Where to next?
- Graph definitions and implementation
Programming Assignment
- Project: Implementing Graphs
Videos
- Introduction
- Project: Route Finding Project Overview
- Core: Intro to Class Design
- When I struggled: Building useful classes
- In the Real World: Design patterns
- Core: DFS, Part 1
- Core: DFS, Part 2
- Core: BFS
- Support: Developing Small Examples to Test Your Code
- When I struggled: Data structures jargon
- When I struggled: The right data structure for the job
- Concept Challenge: Performance of DFS and BFS
- Core: Class Design
- When I struggled: If you fail to plan ...
- When I struggled: ... but don't forget to start!
- In the real world: Planning ahead with design
- Core: Refactoring
- Support: Where to start the project design?
- In the Real World: Why is code refactored?
- Project: Programming Assignment Walk-through
Readings
- By the end of this week, you will be able to ...
- Week 3: Additional Resources
- End of Week Quiz Answers
Assignments
- Where to next?
- End of Week Quiz (complete project and peer review first)
Programming Assignment
- End of Week Quiz (complete project and peer review first)
- Where to next?
Peer Review
- Code Design Peer Review
Videos
- Introduction
- Project: Shortest Path Overview
- Core: Shortest Path with BFS
- Core: Geographic Maps
- Core: Dijkstra's Algorithm
- Concept Challenge: Performance of Dijkstra's Algorithm
- Core: A* Search Algorithm
- When I struggled: Tackling large programming projects
- When I Struggled: Remembering classical algorithms
- Project: Shortest Path Programming Assignment Walkthrough
Readings
- By the end of this week, you will be able to ...
- Week 4: Additional Resources
- Test cases and debugging guide for the quiz
- End of Week Quiz Answers
Assignment
- End of Week Quiz (very short, do programming assignment first)
Programming Assignment
- Project: Shortest Path
Videos
- Introduction
- Core: Traveling Salesperson Problem (TSP)
- Concept Challenge: An algorithm for TSP
- Core: TSP Brute-Force Algorithm
- Core: TSP Algorithm Running Time
- Core: NP Hard
- Core: Approximations and Heuristics
- Core: Hamiltonian Graphs
- Core: Eulerian graphs
- Core: Eulerian graphs, an algorithm
- Core: An application in bioinformatics
Readings
- By the end of this week, you will be able to ...
- Week 5: Additional Resources
- End of Week Quiz Answers
Assignment
- End of Week Quiz
Videos
- End of course message
Readings
- Week 6 Introduction
- Project: Week 6 Description -- REQUIRED EXTENSION
Assignment
- Week 6 Project Quiz (Complete your project extension first)
Peer Review
- Project Extension Feedback