Updating search results...

Search Resources

9 Results

View
Selected filters:
  • sorting
American Government
Unrestricted Use
CC BY
Rating
0.0 stars

 American Government is designed to meet the scope and sequence requirements of the single-semester American government course. This title includes innovative features designed to enhance student learning, including Insider Perspective features and a Get Connected Module that shows students how they can get engaged in the political process. The book provides an important opportunity for students to learn the core concepts of American government and understand how those concepts apply to their lives and the world around them. American Government includes updated information on the 2016 presidential election.Senior Contributing AuthorsGlen Krutz (Content Lead), University of OklahomaSylvie Waskiewicz, PhD (Lead Editor)

Subject:
Government/Political Science
Government/Political Science and Law
Social and Behavioral Sciences
Material Type:
Full Course
Provider:
Rice University
Provider Set:
OpenStax College
Date Added:
06/03/2021
Foundations of Software Engineering, Fall 2000
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Foundations subject in modern software development techniques for engineering and information technology. Covers the design and development of component-based software (using C# and .NET); data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications.

Subject:
Computer Science
Information Technology
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Amaratunga, Kevin
Date Added:
01/01/2000
Introduction to Computers and Engineering Problem Solving, Spring 2012
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This course presents the fundamentals of object-oriented software design and development, computational methods and sensing for engineering, and scientific and managerial applications. It cover topics, including design of classes, inheritance, graphical user interfaces, numerical methods, streams, threads, sensors, and data structures. Students use Java programming language to complete weekly software assignments. How is 1.00 different from other intro programming courses offered at MIT? 1.00 is a first course in programming. It assumes no prior experience, and it focuses on the use of computation to solve problems in engineering, science and management. The audience for 1.00 is non-computer science majors. 1.00 does not focus on writing compilers or parsers or computing tools where the computer is the system; it focuses on engineering problems where the computer is part of the system, or is used to model a physical or logical system. 1.00 teaches the Java programming language, and it focuses on the design and development of object-oriented software for technical problems. 1.00 is taught in an active learning style. Lecture segments alternating with laboratory exercises are used in every class to allow students to put concepts into practice immediately; this teaching style generates questions and feedback, and allows the teaching staff and students to interact when concepts are first introduced to ensure that core ideas are understood. Like many MIT classes, 1.00 has weekly assignments, which are programs based on actual engineering, science or management applications. The weekly assignments build on the class material from the previous week, and require students to put the concepts taught in the small in-class labs into a larger program that uses multiple elements of Java together.

Subject:
Computer Science
Engineering
Information Technology
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Christopher Cassa
George Kocur
Marta C. Gonzalez
Date Added:
01/01/2012
Introduction to Sociology 2e
Unrestricted Use
CC BY
Rating
0.0 stars

Introduction to Sociology 2e adheres to the scope and sequence of a typical, one-semester introductory sociology course. It offers comprehensive coverage of core concepts, foundational scholars, and emerging theories, which are supported by a wealth of engaging learning materials. The textbook presents detailed section reviews with rich questions, discussions that help students apply their knowledge, and features that draw learners into the discipline in meaningful ways. The second edition retains the book’s conceptual organization, aligning to most courses, and has been significantly updated to reflect the latest research and provide examples most relevant to today’s students. In order to help instructors transition to the revised version, the 2e changes are described within the preface.

Subject:
Social and Behavioral Sciences
Sociology
Material Type:
Full Course
Provider:
Rice University
Provider Set:
OpenStax College
Date Added:
08/12/2021
Introduction to Sociology 2e, Education, Theoretical Perspectives on Education
Conditional Remix & Share Permitted
CC BY-NC
Rating
0.0 stars

Define manifest and latent functions of educationExplain and discuss how functionalism, conflict theory, feminism, and interactionism view issues of education

Subject:
Sociology
Material Type:
Module
Author:
OER Librarian
Date Added:
08/12/2021
Randomized Algorithms, Fall 2002
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest paths, and minimum cuts. Geometric algorithms: convex hulls, linear programming in fixed or arbitrary dimension. Approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.

Subject:
Computer Science
Geometry
Information Technology
Mathematics
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Karger, David
Date Added:
01/01/2002