Request for consultation
Thanks for your request. You’ll soon be chatting with a consultant to get the answers you need.
Your form is submitting...
{{formPostErrorMessage.message}} [{{formPostErrorMessage.code}}]
Quick Navigation
Overview
International MindTap Instant Access for Azevedo/Cutajar’s Java Data Structures,1st Edition, is the digital learning solution that powers students from memorization to mastery. It gives you complete control of your course--to provide engaging content, to challenge every individual, and to build their confidence. Empower students to accelerate their progress with MindTap. MindTap: Powered by You.
MindTap gives you complete ownership of your content and learning experience. Customize the interactive syllabi, emphasize the most important topics and add your own material or notes in the ebook.
All online text media materials accessible through this access code are available in EMEA, Latin America, Asia, and India only.
- MindTap is an outcome-driven application that propels students from memorization to mastery. It’s the only platform that gives you complete ownership of your course. With it, you can challenge every student, build their confidence, and empower them to be unstoppable.
- ACCESS EVERYTHING YOU NEED IN ONE PLACE. Cut down on prep with preloaded, organized course materials in MindTap. Teach more efficiently with interactive multimedia, assignments, quizzes and more. And give your students the power to read, listen and study on their phones, so they can learn on their terms.
- EMPOWER YOUR STUDENTS TO REACH THEIR POTENTIAL. Twelve distinct metrics give you actionable insights into student engagement. Identify topics troubling your entire class and instantly communicate with struggling students. And students can track their scores to stay motivated toward their goals. Together, you can accelerate progress.
- YOUR COURSE. YOUR CONTENT. Only MindTap gives you complete control over your course. You have the flexibility to reorder textbook chapters, add your own notes and embed a variety of content including OER. Personalize course content to your students’ needs. They can even read your notes, add their own and highlight key text to aid their progress.
- A DEDICATED TEAM, WHENEVER YOU NEED THEM. MindTap isn’t just a tool; it’s backed by a personalized team eager to support you. Get help setting up your course and tailoring it to your specific objectives. You’ll be ready to make an impact from day one. And, we’ll be right here to help you and your students throughout the semester—and beyond.
Module 1:
Algorithms and Complexities:
Developing Our First Algorithm.
Measuring Algorithmic Complexity with Big O Notation.
Identifying Algorithms with Different Complexities.
Module 2:
Sorting Algorithms and Fundamental Data Structures:
Introducing Bubble Sorting.
Understanding Quick Sort.
Using Merge Sort.
Getting Started with Fundamental Data Structure.
Module 3:
Hash Tables and Binary Search Tree:
Introducing Hash Tables.
Getting Started with Binary Search Trees.
Module 4:
Algorithm Design Paradigms:
Introducing Greedy Algorithms.
Getting Started with Divide and Conquer Algorithms.
Understanding Dynamic Programming.
Module 5:
String Matching Algorithms:
Naive Search Algorithms.
Getting Started with the Boyer-Moore String.
Searching Algorithms.
Introducing Other String Matching Algorithms.
Module 6:
Graphs, Prime Numbers, and Complexity Classes:
Representing Graphs.
Traversing A Graph.
Calculating Shortest Paths.
Prime Numbers in Algorithms.
Other Concepts in Graphs.
Understanding Complexity Classes of Problems.
Algorithms and Complexities:
Developing Our First Algorithm.
Measuring Algorithmic Complexity with Big O Notation.
Identifying Algorithms with Different Complexities.
Module 2:
Sorting Algorithms and Fundamental Data Structures:
Introducing Bubble Sorting.
Understanding Quick Sort.
Using Merge Sort.
Getting Started with Fundamental Data Structure.
Module 3:
Hash Tables and Binary Search Tree:
Introducing Hash Tables.
Getting Started with Binary Search Trees.
Module 4:
Algorithm Design Paradigms:
Introducing Greedy Algorithms.
Getting Started with Divide and Conquer Algorithms.
Understanding Dynamic Programming.
Module 5:
String Matching Algorithms:
Naive Search Algorithms.
Getting Started with the Boyer-Moore String.
Searching Algorithms.
Introducing Other String Matching Algorithms.
Module 6:
Graphs, Prime Numbers, and Complexity Classes:
Representing Graphs.
Traversing A Graph.
Calculating Shortest Paths.
Prime Numbers in Algorithms.
Other Concepts in Graphs.
Understanding Complexity Classes of Problems.