- Course type: Self-paced
- Available Lessons: 88
- Average Lesson Length: 8 min
Eligible for Credit: Yes
Earn transferable credit by taking this course for credit.
Watch a preview:chapter 1 / lesson 1How to Setup a Coding Environment for Programming in Java
Course SummaryComputer Science 201: Data Structures & Algorithms has been evaluated and recommended for 3 semester hours and may be transferred to over 2,000 colleges and universities. With this self-paced course, you get engaging lessons, expert instructors who make even the most challenging data structure topics simple, and an excellent resource for getting a head start on your degree.
to start this course today
Try it risk-free for 30 days
Course Practice TestCheck your knowledge of this course with a 50-question practice test.
- Comprehensive test covering all topics
- Detailed video explanations for wrong answers
|Course Progress||Best Score|
|Lesson 1 - Data Structures & Algorithms: Assignment - Array Sorting and Hashmaps|
The objective of this course is to introduce the essentials of data structures using Java-focused data structures. Students will use Java to complete programming exercises and gain hands-on experience with object-oriented design, algorithms, trees, priority queues, text processing, memory management
Your grade for this course will be calculated out of 300 points. The minimum score required to pass and become eligible for college credit for this course is 210 points, or an overall course grade of 70%. The table below shows how your overall grade will be calculated.
|Proctored Final Exam||100|
Quizzes are meant to test your comprehension of each lesson as you progress through the course. Here's a breakdown of how you will be graded on quizzes and how they'll factor into your final score:
- You will have 3 attempts to take each quiz for a score.
- The highest score of your first 3 attempts will be recorded as your score for each quiz.
- When you've completed the course, the highest scores from your first 3 attempts at each quiz will be averaged together and weighed against the total possible points for quizzes. For instance, if your average quiz score is 85%, you'll receive 85 out of 100 possible points for quizzes.
- After your initial 3 attempts, you can take a quiz for practice as many times as you'd like.
- You will need to pass each quiz with a score of at least 80% to earn course progress for the lesson. However, it is not necessary to earn 80% within the first three quiz attempts.
Assignments are intended to assess your application, analysis, and critical thinking skills in relation to the concepts you learn in the course. One assignment is required for this course. You can access them here.
- All assignment scores will total up to 100 points.
- Your assignment(s) will be graded by a Study.com instructor.
- The instructor will provide a graded rubric for you along with feedback on what you did well and what could be improved.
- If you are unsatisfied with your score, you will be able to revise and resubmit your assignment(s) twice. You are free to resubmit an assignment within two weeks of your most recent exam attempt or at any point if you have an active college accelerator membership.
Proctored Final Exam
The proctored final exam is a cumulative test designed to ensure that you've mastered the material in the course.
- You'll earn points equivalent to the percentage grade you receive on your proctored final. (So if you earn 90% on the final, that's 90 points toward your final grade.)
- If you're unsatisfied with your score on the exam, you'll be eligible to retake the exam after a 3-day waiting period.
- You can only retake the exam twice, so be sure to use your study guide and fully prepare yourself before you take the exam again.
Items Allowed on Study.com Proctored Exam for Computer Science 201: Data Structures & Algorithms:
- Blank scratch paper
- Pen or pencil
Items NOT Allowed on Study.com Proctored Exam for Computer Science 201: Data Structures & Algorithms:
- Office programs, web browsers, or any programs other than Software Secure (including Study.com lessons)
- Textbooks (digital or physical)
- Mobile phones, headphones, speakers, TVs, or radios
- Notebooks or notes
- Any calculators
Upon completion of the course, you will be able to:
- Define object-oriented principles of design
- Design abstract data types
- Analyze various algorithms using the Big-O notation
- Explain and develop recursive algorithms
- Explain how search and sorting algorithms work
- Explain how stacks, queues and linked lists work
- Explain how trees, hash tables and graphs work
- Explain maps, graphs, and text processing
- Explain memory management
We recommend completing Computer Science 115: Programming in Java before beginning Data Structures & Algorithms.
Computer Science 201: Data Structures & Algorithms consists of short video lessons that are organized into topical chapters. Each video is approximately 5-10 minutes in length and comes with a quick quiz to help you measure your learning. The course is completely self-paced. Watch lessons on your schedule whenever and wherever you want.
At the end of each chapter, you can complete a chapter test to see if you're ready to move on or have some material to review. Once you've completed the entire course, take the practice test and use the study tools in the course to prepare for the proctored final exam. You may take the proctored final exam whenever you are ready.
How Credit Recommendations Work
This course has been evaluated and recommended by ACE for 3 semester hours in the lower baccalaureate degree category. To apply for transfer credit, follow these steps:
- If you already have a school in mind, check with the registrar to see if the school will grant credit for courses recommended by either ACE or NCCRS.
- Complete Computer Science 201: Data Structures & Algorithms by watching video lessons and taking short quizzes.
- Take the Computer Science 201: Data Structures & Algorithms final exam directly on the Study.com site.
- Request a transcript to be sent to the accredited school of your choice!
- Check out this page for more information on Study.com's credit-recommended courses.
|Basics of Java||Describe the fundamentals of Java and set a coding environment to test code; define important programming concepts, including pseudocode, documentation, commenting and testing.|
|Object-Oriented Design Fundamentals||Explain the fundamentals of object-oriented design, including inheritance, interfaces, abstract classes, exceptions and nested classes.|
|Core Data Structures||Evaluate fundamental data structures, such as arrays, linked lists, equivalency testing and cloned data structures.|
|Analyzing Algorithms||Define the concept of algorithm analysis; differentiate between experimental, asymptotic and simple justification techniques for algorithm analysis; use constant functions, logarithmic functions, linear functions, n-log-n functions, quadratic functions, cubic functions and exponential functions; use 'Big-O' notation and outline simple justification techniques.|
|Recursion & Recursive Algorithms||Explain the concept of recursion and address the practical uses of recursive algorithms.|
|Stacks, Queues & Lists in Java||Explain the applications of Java stacks, queues and double-ended queues.|
|List & Iterator Abstract Data Types||Describe the functions of arrays, positional lists and the Java collections framework; sort a list and iterate a set in Java.|
|Trees in Data Structure||Explain the applications of trees, binary trees and the comparison of trees.|
|Priority Queues in Java||Recognize priority queues and understand their implementation in Java; use heaps and sort priority queues.|
|Maps & Hash Tables in Data Structures||Define and evaluate the functions of maps, hash tables, sorted maps and separate chaining.|
|Search Trees & Types||Explain the functions of search trees; describe the different types of search trees, including binary, AVL, splay, 2,4 and red-black.|
|Sorting & Selection in Java||Discuss several sorting methods, including selection sort, insertion sort, quick sort and merge sort; explain how sorting methods can be implemented in the Java programming language; explain how 'Big-O' notation can measure sorting performances.|
|Text Processing||Apply brute force matching algorithms and explain the functions of tries, text compression and the greedy method.|
|Graph Data Structures||Compare different types of graph data structures; implement graphs using the Java programming language and apply them to solve problems|
|Memory Management||Explain the fundamentals of memory management and its usage in computer systems; tell how large blocks of memory are managed using data structures.|
Learn more about the College Accelerator Plan
Confirm College Accelerator Upgrade?
- Unlimited access to all video lessons
- Lesson Transcripts
- Tech support
- Practice quizzes & tests
- Tools for tracking progress
- Personalized coaching
- Access to instructors
- Certificates of Completion
- Create Custom Courses
- Earn college credit
- Take two exams per month
- Finish official exams remotely
- Learn more
By upgrading now, you will immediately have access to all features associated with your new plan. Because the change is in the middle of your billing cycle, your next charge will include the prorated amount for the rest of this month. For more info check our FAQ's.
What to Expect For the Exam
This Study.com course has been evaluated and recommended for college credit. Once you've completed this course, you can take the proctored final exam and potentially earn credit. Follow the steps below to take the exam.
Before taking the exam, all of the following requirements must be met:
|A College Accelerator Study.com membership.|
|Completed all lessons in Computer Science 201: Data Structures & Algorithms course and achieved 100% Quiz Progress.|
|Not attempted to take this exam within the last three days.|
|Have available proctored exams in this month of membership.|
|Have not taken this exam three times. (0/3)|
|Complete the exam readiness quiz.|
|Please note: Assignments are required to complete this course for credit. You have submitted / required assignments for this course.|
Please meet all of the pre-requirements in the Pre-Exam Checklist in order to take the exam.
Exam Process Details
1. Register For Exam
Registering for the exam is simple. First, be sure you meet the system requirements. Next, you'll need to agree to the academic integrity policy. Then just confirm your name and the exam name, and you're ready to go!
2. Download Software Secure
You'll receive an unique access code. Please write this down — you'll need it to take the exam. Then download Software Secure and follow the installation instructions.
3. Take Exam
The exam contains 50 - 100 multiple choice questions. You will have two hours to complete the exam, so don't start until you're sure you can complete the entire thing. And remember to pace yourself!
4. Get Exam Results
We will send you an email with your official exam results within 1 to 2 weeks. If you would like to raise your grade after receiving your exam results, you can retake quizzes with fewer than 3 attempts. You will then need to retake the final exam.
Earning College Credit
Did you know… We have over 200 college courses that prepare you to earn credit by exam that is accepted by over 1,500 colleges and universities. You can test out of the first two years of college and save thousands off your degree. Anyone can earn credit-by-exam regardless of age or education level.
To learn more, visit our Earning Credit Page
Transferring credit to the school of your choice
Not sure what college you want to attend yet? Study.com has thousands of articles about every imaginable degree, area of study and career path that can help you find the school that's right for you.
Research Schools, Degrees & Careers
Get the unbiased info you need to find the right school.
Browse Articles By Category
Browse an area of study or degree level.
- Biological and Biomedical Sciences
- Communications and Journalism
- Computer Sciences
- Culinary Arts and Personal Services
- Liberal Arts and Humanities
- Mechanic and Repair Technologies
- Medical and Health Professions
- Physical Sciences
- Transportation and Distribution
- Visual and Performing Arts
- Self-Paced Computer Training Programs and Requirements
- Colleges and Universities with German Degrees and Courses
- How to Become a Computer Instructor
- List of Free Online Data Entry Courses and Lessons
- What Are University and College Courses?
- Associates Degrees in Computer Science with Course Information
- Top College in Tulsa for a Computer Science Degree
- Best Graduate Degree for Data Science
- Illinois Data Science Master's Degrees
- Do I Need a Master's Degree for Data Science?
- Answers and detailed explanations to each question
- Video lessons to explain complicated concepts
Explore our library of over 79,000 lessons
- College Courses
- High School Courses
- Other Courses
Request more information
Get in contact with one of our transfer advisors to learn how to earn transferable college credit for Computer Science 201: Data Structures & Algorithms.