Updating search results...

Search Resources

50 Results

View
Selected filters:
  • java
Open Data Structures: An Introduction
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.

Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees.

A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.

Subject:
Applied Science
Computer Science
Material Type:
Textbook
Provider:
Athabasca University
Author:
Pat Morin
Date Added:
02/18/2015
Slideshow with soundtrack html file editor
Conditional Remix & Share Permitted
CC BY-SA
Rating
0.0 stars

By sharing this editor, our objective is to provide teachers with a way to easily convert a slideshow into an online course, so that they can experiment with hybrid pedagogies of the blended learning course type.

The solution proposed here is the adaptation to HTML 5 of a development carried out under Flash in 2006 and which proved very effective. In a few weeks, around sixty online course sessions had been created.

Its great advantage is that it can be implemented very easily by a teacher, without requiring the support of specialists in educational digital technologies.

More sophisticated solutions can be made, but this one has all the essential features.

The screens are available in both English and French, and it's very easy to add more translations if you want.

Subject:
Education
Educational Technology
Material Type:
Diagram/Illustration
Interactive
Lecture
Lesson
Teaching/Learning Strategy
Unit of Study
Author:
Renaud Gicquel
Date Added:
11/02/2023
Techniques in Artificial Intelligence (SMA 5504)
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

6.825 is a graduate-level introduction to artificial intelligence. Topics covered include: representation and inference in first-order logic, modern deterministic and decision-theoretic planning techniques, basic supervised learning methods, and Bayesian network inference and learning.
This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5504 (Techniques in Artificial Intelligence).

Subject:
Applied Science
Computer Science
Engineering
Life Science
Material Type:
Full Course
Provider Set:
MIT OpenCourseWare
Author:
Kaelbling, Leslie
Lozano-Pérez, Tomás
Date Added:
09/01/2002
Testing the Edges
Read the Fine Print
Educational Use
Rating
0.0 stars

Students gain experience using the software/systems (engineering) design process, specifically focusing on the testing phase. This problem-based learning activity uses the design process to solve open-ended challenges. In addition to learning about test cases for testing software, students utilize the design process as a vehicle to work through a problem and arrive at a solution.

Subject:
Applied Science
Computing and Information
Education
Engineering
Material Type:
Activity/Lab
Provider:
TeachEngineering
Provider Set:
TeachEngineering
Author:
Brian Sandall
Janet Yowell
Ryan Stejskal
Date Added:
09/18/2014
Testing with JUnit
Read the Fine Print
Educational Use
Rating
0.0 stars

JUnit is a testing method that is included with NetBeans (Java) installs or can be downloaded from the web and included in the Java build. In this activity, students design tests for a provided Java class before the class methods are constructed using a process called test-driven development. To create a design, the software/system design process, which is a specific case of the engineering design process, is followed. After students create a design, it is implemented and tested and if necessary, the design undergoes editing to make sure it functions by testing the Java class correctly. To conclude the activity, students write the methods in the Java class using their tests to debug the program.

Subject:
Applied Science
Computing and Information
Education
Engineering
Material Type:
Activity/Lab
Provider:
TeachEngineering
Provider Set:
TeachEngineering
Author:
Brian Sandall
Ryan Stejskal
Date Added:
09/18/2014
Think Data Structures: Algorithms and Information Retrieval in Java
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Data structures and algorithms are among the most important inventions of the last 50 years, and they are fundamental tools software engineers need to know. But in my opinion, most of the books on these topics are too theoretical, too big, and too bottom-up:

*Too theoretical: Mathematical analysis of algorithms is based on simplifying assumptions that limit its usefulness in practice. Many presentations of this topic gloss over the simplifications and focus on the math. In this book I present the most practical subset of this material and eliminate the rest.

*Too big: Most books on these topics are at least 500 pages, and some are more than 1000. By focusing on the topics I think are most useful for software engineers, I kept this book under 250 pages.

*Too bottom-up: Many data structures books focus on how data structures work (the implementations), with less about how to use them (the interfaces). In this book, I go “top down”, starting with the interfaces. Readers learn to use the structures in the Java Collections Framework before getting into the details of how they work.

Finally, many present this material out of context and without motivation: it’s just one damn data structure after another!

I try to alleviate the boredom by organizing the topics around an application—web search—that uses data structures extensively, and is an interesting and important topic in its own right.

This application also motivates some topics that are not usually covered in an introductory data structures class, including persistent data structures, with Redis, and streaming algorithms.

I have made difficult decisions about what to leave out, but I have made some compromises. I include a few topics that most readers will never use, but that they might be expected to know, possibly in a technical interview. For these topics, I present both the conventional wisdom as well as my reasons to be skeptical.

This book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercise that allows readers to apply what they have learned. Each exercise includes automated tests that check the solution. And for most exercises, I present my solution at the beginning of the next chapter.

This book is intended for college students in computer science and related fields, as well as professional software engineers, people training in software engineering, and people preparing for technical interviews.

I assume that the reader knows Java at an intermediate level, but I explain some Java features along the way, and provide pointers to supplementary material.

People who have read Think Java or Head First Java are prepared for this book.

Subject:
Applied Science
Computer Science
Material Type:
Textbook
Provider:
Green Tea Press
Author:
Allen Downey
Date Added:
01/01/2016
Think Java: How to Think Like a Computer Scientist
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Think Java is an introduction to Java programming for beginners. It is tailored for students preparing for the Computer Science Advanced Placement (AP) Exam, but it is for anyone who wants to learn Java.

Subject:
Applied Science
Computer Science
Material Type:
Textbook
Provider:
Green Tea Press
Author:
Allen B. Downey
Chris Mayfield
Date Added:
01/01/2012
Tic Tac Toe Game in Java
Unrestricted Use
CC BY
Rating
0.0 stars

Tic Tac Toe game in Java!in this Java source, students will learn how to develop a simple game for two persons. This game is developed in three versions. The first one does not use an array and only uses primitive variables. The second version uses a 1-dimensional array and the third one uses a 2-dimensional array

Subject:
Computer Science
Material Type:
Activity/Lab
Case Study
Lesson
Simulation
Author:
Saeid Samadidana
Date Added:
01/27/2022
Using JUnit
Read the Fine Print
Educational Use
Rating
0.0 stars

Students focus on the testing phase of the design process by considering how they have tested computer programs in the past and learning about a new method called JUnit to test programs in the future. JUnit is a testing method that is included with NetBeans (Java) installs or can be downloaded from the web and included in the Java build. Students design tests using JUnit and implement those tests.

Subject:
Applied Science
Computing and Information
Education
Engineering
Material Type:
Lesson Plan
Provider:
TeachEngineering
Provider Set:
TeachEngineering
Author:
Brian Sandall
Ryan Stejskal
Date Added:
09/18/2014