Data Structures In Java A Laboratory Course 1st Edition by Sandra Andersen ISBN 0763718165 9780763718169

Data Structures In Java: A Laboratory Course 1st Edition by Sandra Andersen – Ebook PDF Instant Download/Delivery. 0763718165, 9780763718169
Full download Data Structures In Java: A Laboratory Course 1st Edition after payment

Product details:

ISBN 10: 0763718165 
ISBN 13: 9780763718169
Author: Sandra Andersen

Data Structures in Java: A Laboratory Course defines active learning. With sixteen labs to choose from, this laboratory manual creates a “learn by doing” experience for its students by engaging them in implementation of data structures and in application of algorithms. Students are challenged to exercise their knowledge in each of the four-part structure laboratory assignments: Prelab: Students use the Prelab assignments to explore and implement the basic operations of a data structure. Bridge: During the Bridge exercises, students test and debug the advanced data types they developed in the prelab and are provided with substantial feedback and support. In-lab: Students gain programming experience during the in-lab projects as they apply the data structure to a real-world problem. Postlab: Following their lab class, students analyze and validate the efficiency or utility of the data structure in the Postlab exercise. ADT Implementation: The laboratories are designed to complement a variety of approaches to implementing each ADT. All ADT definitions stress the use of data abstraction and generic data elements. As a result, you can adapt them with minimal effort to suit different implementation strategies. For each ADT, class definitions that frame an implementation of the ADT are given as part of the corresponding Prelab exercise. This definition framework is also used in the visualization method that accompanies the laboratory. Should you elect to adopt a somewhat different implementation strategy, you need only make minor changes to the data members in the class definitions and corresponding modifications to the visualization routine. You do not need to change anything else in either the supplied software or the laboratory text itself.

Data Structures In Java: A Laboratory Course 1st Table of contents:

• Arrays and Strings

  • 2.1 Introduction to Arrays
  • 2.2 Array Operations: Insertion, Deletion, Searching
  • 2.3 Multidimensional Arrays
  • 2.4 Introduction to Strings in Java
  • 2.5 String Operations and Manipulations

• Linked Lists

  • 3.1 Introduction to Linked Lists
  • 3.2 Types of Linked Lists: Singly Linked List, Doubly Linked List, Circular Linked List
  • 3.3 Operations on Linked Lists: Traversal, Insertion, Deletion
  • 3.4 Implementing Linked Lists in Java

• Stacks

  • 4.1 Introduction to Stacks
  • 4.2 Stack Operations: Push, Pop, Peek
  • 4.3 Applications of Stacks
  • 4.4 Implementing Stacks using Arrays and Linked Lists

• Queues

  • 5.1 Introduction to Queues
  • 5.2 Queue Operations: Enqueue, Dequeue, Front, Rear
  • 5.3 Types of Queues: Circular Queue, Priority Queue, Deque
  • 5.4 Implementing Queues in Java

• Trees

  • 6.1 Introduction to Trees
  • 6.2 Binary Trees
  • 6.3 Binary Search Trees (BST)
  • 6.4 Tree Traversals: In-order, Pre-order, Post-order
  • 6.5 AVL Trees and Balancing
  • 6.6 Implementing Trees in Java

• Heaps

  • 7.1 Introduction to Heaps
  • 7.2 Min-Heap and Max-Heap
  • 7.3 Heap Operations: Insertion, Deletion, Peek
  • 7.4 Priority Queues using Heaps
  • 7.5 Implementing Heaps in Java

• Hashing

  • 8.1 Introduction to Hashing
  • 8.2 Hash Functions
  • 8.3 Hash Tables and Collisions
  • 8.4 Open Addressing and Chaining
  • 8.5 Implementing Hash Tables in Java

• Graphs

  • 9.1 Introduction to Graphs
  • 9.2 Types of Graphs: Directed, Undirected, Weighted
  • 9.3 Graph Representation: Adjacency Matrix, Adjacency List
  • 9.4 Graph Traversals: Depth First Search (DFS), Breadth First Search (BFS)
  • 9.5 Applications of Graphs

• Sorting and Searching Algorithms

  • 10.1 Introduction to Sorting
  • 10.2 Bubble Sort, Selection Sort, Insertion Sort
  • 10.3 Merge Sort and Quick Sort
  • 10.4 Binary Search
  • 10.5 Complexity Analysis of Sorting and Searching Algorithms

• Advanced Data Structures

  • 11.1 Tries
  • 11.2 Segment Trees
  • 11.3 B-Trees and B+ Trees
  • 11.4 Red-Black Trees
  • 11.5 Implementing Advanced Data Structures in Java

• Practical Laboratory Exercises

  • 12.1 Introduction to Laboratory Exercises
  • 12.2 Exercise 1: Implementing Arrays and Strings
  • 12.3 Exercise 2: Working with Linked Lists
  • 12.4 Exercise 3: Implementing Stacks and Queues
  • 12.5 Exercise 4: Tree Traversals and Operations
  • 12.6 Exercise 5: Graph Algorithms
  • 12.7 Exercise 6: Sorting Algorithms Implementation

People also search for Data Structures In Java: A Laboratory Course 1st:

data structures in java
    
about data structures in java
    
data structures in java interview questions
    
data structures in java pdf
    
data structures in java with examples