Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Our current time in (CST) is
 
Study Smarter, Score Higher
View This Document For FREE!
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
Bye Good to Discrete Mathematics!! CS340: Discrete Mathematics Sets Venn Diagrams Abstract visualization of a Universal set, U as a rectangle, with all subsets of U shown as circles. Shaded portion represents the corresponding set , X (Y Z) (X Y) Z Sets Mathematical Logic Example: Determine whether statement formula A logically implies statement formula B. Let A: (~(p q )) and B: (q p ) Truth Table Relations Relations Matrices Calculate AB and BA Functions Basic Counting Principles Basic Counting Principles Permutation Combination and Permutation Combination Discrete Probability Algorithms and Time Complexity Algorithms and Time Complexity Graph Theory Graph Theory Euler Circuit Hamiltonian Cycle Many Algorithms Trees and Networks Traversal: Inorder, Preorder, Postorder Trees and Networks Network Flow Boolean Algebra Boolean Algebra Combinatorial Circuits Many Basic Gates: And Gate Or Gate Not Gate NAnd Gate NOr Gate Some Circuits: Half Adder Full Adder Combinatorial Circuits Finite Automata and Languages Finite Automata and Languages
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 12: Algorithms and Time Complexity II Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about algorithm analysis Become familiar with big-O, omega, and theta notations Explore various algorithms and their...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 15: Graph Theory II Discrete Mathematical Structures: Theory and Applications Learning Objectives 10 Learn the basic properties of graph theory Learn about walks, trails, paths, circuits, and cycles in a graph Explore how graphs are rep...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 6: Matrices Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about matrices and their relationship with relations Become familiar with Boolean matrices Learn the relationship between Boolean matrices an...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 1: Foundations: Sets Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about sets Explore various operations on sets Become familiar with Venn diagrams Learn how to represent sets in computer memory Le...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about Boolean expressions Become aware of the basic properties of Boolean algebra Explore the application of Boolean algebr...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 18: Trees and Networks II Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn the basic properties of trees Explore applications of trees Learn about networks Discrete Mathematical Structures: Theory...
IUPUI >> CSCI >> 340 (Fall, 2008)
Lecture 8: Functions II Discrete Mathematical Structures: Theory and Applications Learning Objectives Learn about functions Explore various properties of functions Learn about binary operations Discrete Mathematical Structures: Theory and Appli...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (1) Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 2.1 Sets Introduction Sets are used to group...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 2: Basic Structures: Sets, Functions, Sequences, and Sums (2) Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 2.2 Set Operations Introduction DEFINITION 1...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 5: Counting Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 5.1 The Basics of Counting Basic Counting Principles Examples A password on a computer syste...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 4: Induction and Recursion Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 4.1 Mathematical Induction Introduction Mathematical Induction is used to show...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 1: The Foundations: Logic and Proofs Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 1.3 Predicates and Quantifiers Predicates Statements involving variab...
IUPUI >> CSCI >> 340 (Fall, 2008)
Discrete Mathematics and Its Applications Chapter 3: The Fundamentals: Algorithms, the Integers, and Matrices Lingma Acheson (linglu@iupui.edu) 1 Department of Computer and Information Science, IUPUI 3.1 Algorithms Introduction Algorithm: a proc...
IUPUI >> CSCI >> 355 (Spring, 2008)
Denotational Semantics Based on recursive function theory Define for each language entity both a mathematical object and a function that maps instances of that entity onto instances of the mathematical object. The method is named denotational beca...
IUPUI >> CSCI >> 355 (Spring, 2008)
CSCI 355 Spring 2008 Homework 1 Solution Chapter 3 Each problem is worth 10 points. Total 100 points. 2c. <switch_stmt> switch ( <expr> ) {case <literal> : <stmt_list> {case <literal> : <stmt_list> } [default : <stmt_list>] } 8. The following two d...
IUPUI >> CSCI >> 355 (Spring, 2008)
3.5 Dynamic Semantics Meanings of expressions, statements, and program units Static semantics type specifications Dynamic semantics briefed as semantics, meaning There is no single widely acceptable notation or formalism for describing semantic...
IUPUI >> CSCI >> 355 (Spring, 2008)
CSCI 355 Spring 2008 Homework 2 Solution Chapter 5 Each problem is worth 25points. Total 100 points. 2. The advantage of a typeless language is flexibility; any variable can be used for any type values. The disadvantage is poor reliability due to th...
IUPUI >> CSCI >> 355 (Spring, 2008)
Ambiguity in Grammars A grammar is ambiguous if and only if it generates a sentential form that has two or more distinct parse trees Copyright 2006 Addison-Wesley. All rights reserved. 318 An Ambiguous Expression Grammar <assign> -> <id> = <expr...
IUPUI >> CSCI >> 355 (Spring, 2008)
Chapter 7 Expressions and Assignment Statements ISBN 0-321-33025-0 Chapter 7 Topics Introduction Arithmetic Expressions Overloaded Operators Type Conversions Relational and Boolean Expressions Short-Circuit Evaluation Assignment Statements...
IUPUI >> CSCI >> 355 (Spring, 2008)
IEEE Standard 754 Floating Point Numbers Steve Hollasch / Last update 2005-Feb-24 IEEE Standard 754 floating point is the most common representation today for real numbers on computers, including Intel-based PC\'s, Macintoshes, and most Unix platform...
IUPUI >> CSCI >> 355 (Spring, 2008)
Subscript Bindings and Array Categories In some languages the lower bound of the subscript range is implicit, e.g. C-based languages 0; Fortran 95 1. In some other languages, subscript ranges must be completely specified by the programmer. Copyri...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Basic SQL and SQLPlus - Querying using SELECT Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Relational Data Model RDBMSs are ba...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Basic SQL and SQLPlus - Querying using SELECT Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Relational Data Model RDBMSs are ba...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Database Programming Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu 12/17/08 Dale Roberts 1 DataBase Programming Creating a Database Applica...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Database Programming Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu 12/17/08 Dale Roberts 1 DataBase Programming Creating a Database Applica...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI PL/SQL Introduction Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts PL/SQL Introduction The limits of my language mean the limits o...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI PL/SQL Introduction Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts PL/SQL Introduction The limits of my language mean the limits o...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Introduction to Relational Databases Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Sharing Knowledge and Success Oracle is a r...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Introduction to Relational Databases Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Sharing Knowledge and Success Oracle is a r...
IUPUI >> CSCI >> 431 (Fall, 2008)
Introduction to UTL_HTTP and UTL_SMTP Think of the Possibilities! By Mike OMara, TUSC Bradley Brown, TUSC 12/17/08 TUSC, Copyright 2001 1 Developers can no longer be an expert just in a particular tool or product; you must keep abreast of all sor...
IUPUI >> CSCI >> N311 (Fall, 2008)
Introduction to UTL_HTTP and UTL_SMTP Think of the Possibilities! By Mike OMara, TUSC Bradley Brown, TUSC 12/17/08 TUSC, Copyright 2001 1 Developers can no longer be an expert just in a particular tool or product; you must keep abreast of all sor...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Data Modeling Introduction and Normalization Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Sample Table StudentName AdvisorNam...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Data Modeling Introduction and Normalization Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Sample Table StudentName AdvisorNam...
IUPUI >> CSCI >> 431 (Fall, 2008)
CSCI N311 Advanced Database Programming, Oracle Final Project Proposal Purpose All database projects begin with a project proposal to meet some need. The purpose of this assignment is to create a project proposal for your final database project. A co...
IUPUI >> CSCI >> N311 (Fall, 2008)
CSCI N311 Advanced Database Programming, Oracle Final Project Proposal Purpose All database projects begin with a project proposal to meet some need. The purpose of this assignment is to create a project proposal for your final database project. A co...
IUPUI >> CSCI >> 431 (Fall, 2008)
Project 1: Introduction to Oracle SQL*Plus Objectives After completing this lab you should be able to: Login to Oracle running SQL*Plus from Linux Submit a query to the Oracle database Login to Oracle running SQL*Plus from Windows Due for Projec...
IUPUI >> CSCI >> N311 (Fall, 2008)
Project 1: Introduction to Oracle SQL*Plus Objectives After completing this lab you should be able to: Login to Oracle running SQL*Plus from Linux Submit a query to the Oracle database Login to Oracle running SQL*Plus from Windows Due for Projec...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Object-Relational Features Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Object-Relational Databases Types, Object Views, Meth...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Object-Relational Features Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Object-Relational Databases Types, Object Views, Meth...
IUPUI >> CSCI >> 431 (Fall, 2008)
Oracle Database PL/SQL User\'s Guide and Reference 10g Release 2 (10.2) B14261-01 June 2005 Oracle Database PL/SQL Users Guide and Reference 10g Release 2 (10.2) B14261-01 Copyright 1996, 2005, Oracle. All rights reserved. Contributors: Shashaanka ...
IUPUI >> CSCI >> N311 (Fall, 2008)
Oracle Database PL/SQL User\'s Guide and Reference 10g Release 2 (10.2) B14261-01 June 2005 Oracle Database PL/SQL Users Guide and Reference 10g Release 2 (10.2) B14261-01 Copyright 1996, 2005, Oracle. All rights reserved. Contributors: Shashaanka ...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI SQL Tuning Introduction Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu 12/17/08 Dale Roberts 1 Oracle Data Dictionary Data Dictionary: store...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI SQL Tuning Introduction Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu 12/17/08 Dale Roberts 1 Oracle Data Dictionary Data Dictionary: store...
IUPUI >> CSCI >> 431 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Data Modeling Attributes, Roles, Subclasses, Keys and Weak Entities Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Attributes on...
IUPUI >> CSCI >> N311 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI Data Modeling Attributes, Roles, Subclasses, Keys and Weak Entities Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Dale Roberts 1 Attributes on...
IUPUI >> CSCI >> 450 (Spring, 2008)
Providing a Philosophical Basis for Ethical Decisions Andrew Olson Copyright 2001. All rights reserved. Contact the author for permission before copying. No permission granted for use in commercial products. All copies must contain this copyright no...
IUPUI >> CSCI >> 450 (Spring, 2008)
Liability in Software Development Andrew Olson Copyright 2001. All rights reserved. Contact the author for permission before copying. No permission granted for use in commercial products. All copies must contain this copyright notice. The issue of ...
IUPUI >> CSCI >> 450 (Spring, 2008)
\"Selected Abstracts Related to Software Quality _ Forum On Risks To The Public In Computers And Related Systems ACM Committee on Computers and Public Policy, Peter G. Neumann, moderator http:/catless.ncl.ac.uk/Risks = Risks Digest, Volume 3, Issue 3...
IUPUI >> CSCI >> 450 (Spring, 2008)
Assignment 1 Due by the beginning of class, September 5, 2001 Create an Engineering Notebook with a ring binder or Ecco-style cover so that you can add and remove pages. Include in it the following information: a. a title page with your name, course...
IUPUI >> CSCI >> 481 (Fall, 2008)
Lingma Acheson Department of Computer and Information Science, IUPUI linglu@iupui.edu 1.1 Motivation: Why data mining? 1.2 What is data mining? 1.3 Data Mining: On what kind of data? 1.4 Data mining functionality: What kinds of Patterns Ca...
IUPUI >> CSCI >> 550 (Fall, 2008)
Rendering Rendering: computing how each pixel of the picture of a scene should look. Shading model (illumination model): method of modeling how lights interact with objects in a scene. Rendering hierarchy: rendering methods using different shading mo...
IUPUI >> CSCI >> 550 (Fall, 2008)
Texture Mapping Enhancing rendering realism by adding surface textures to faces of mesh objects. Texture image: a function f ( s, t ) : [0,1] [0,1] D where D is the color domain. It is often represented as a 2D image (bitmap), but can also be compu...
IUPUI >> CSCI >> 550 (Fall, 2008)
CSCI 550 Interactive Computer Graphics Shiaofen Fang Department of Computer and Information Science Indiana University Purdue University Indianapolis What is computer graphics ? Computer graphics is concerned with Producing pictures using computer. ...
IUPUI >> CSCI >> 550 (Fall, 2008)
CSCI 550 (Fall 2008) Assignment #3 Handout: Monday, Oct. 27, 2008 Due: 1:30pm, Wednesday, Nov. 24, 2008 Non-programming assignments can be either in any format: Word, PDF, plain text or hand-writing. Programming assignments can be submitted either o...
IUPUI >> CSCI >> 550 (Fall, 2008)
2D affine transformations 2D homogeneous coordinates: Point: (x,y,1); vector: (x,y,0) 2D affine transformation: x m11 x\' y \' = T y = m 21 1 0 1 x\' x m11 y \' = T y = m 21 0 0 0 m12 m22 0 m12 m22 0 m13 x m1...
IUPUI >> CSCI >> N100 (Fall, 2008)
Design Concepts: Module A: The Science of Color CSCI N241: Fundamentals of Web Design Copyright 2004 Department of Computer & Information Science Goals Understand the origin of natural color Understand the Additive Color Model Understand the Su...
IUPUI >> CSCI >> N100 (Fall, 2008)
Design Concepts: Module B: Adding Images CSCI N241: Fundamentals of Web Design Copyright 2004 Department of Computer & Information Science Goals Understand how what dithering and gamma are Understand how image compression works Understand how t...
IUPUI >> CSCI >> N201 (Fall, 2008)
Basic History of Computing Al Kwarizmi pascaline Jacquard Loom Lady Ada Babbage Analytical Engine Hollerith Tabulator Zuse Turing Eniac Grace Hopper ...
IUPUI >> INFO >> I112 (Fall, 2008)
Basic History of Computing Al Kwarizmi pascaline Jacquard Loom Lady Ada Babbage Analytical Engine Hollerith Tabulator Zuse Turing Eniac Grace Hopper ...
IUPUI >> CSCI >> N201 (Fall, 2008)
CSCI N100 Principles of Computing Basic Problem-Solving Course Goals Overcome fear of computers Wide range of applications Strong programming skills Whats different about computers? You know lots of machines Computers seem different They seem...
IUPUI >> INFO >> I112 (Fall, 2008)
CSCI N100 Principles of Computing Basic Problem-Solving Course Goals Overcome fear of computers Wide range of applications Strong programming skills Whats different about computers? You know lots of machines Computers seem different They seem...
IUPUI >> CSCI >> N201 (Fall, 2008)
CSCI N201 Programming Concepts and Database 4 History of Programming Languages Lingma Acheson linglu@iupui.edu Department of Computer and Information Science, IUPUI 1 Progression Hardware Machine code Assemblers Compilers Interpreters 2 H...
IUPUI >> CSCI >> N201 (Fall, 2008)
CSCI N201 Programming Concepts and Database 8 Conditions Lingma Acheson linglu@iupui.edu Department of Computer and Information Science, IUPUI 1 Task: Ask the user to input a required integer, and compare the input to the required integer. If i...
IUPUI >> CSCI >> N207 (Fall, 2008)
CSCI N207 Data Analysis Using Spreadsheet S.T.A.I.R Lingma Acheson linglu@iupui.edu Department of Computer and Information Science, IUPUI Problem Solving Technique Fundamental When you get stuck When things go wrong What is STAIR? A problem...
IUPUI >> CSCI >> N305 (Fall, 2008)
Blackbelt Project # 4 Banner 5 points Purpose The purpose of this project is to extend the functionality of the regular banner function to implement a complete character set. Description Extend the functionality of the banner program to display any t...
IUPUI >> CSCI >> N305 (Fall, 2008)
1 1 Introduction to Computers, the Internet and the Web 2007 Pearson Education, Inc. All rights reserved. 2 The chief merit of language is clearness. Galen Our life is frittered away by detail. Simplify, simplify. Henry David Thoreau He had a w...
IUPUI >> CSCI >> N305 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Introduction to Computers - Languages Dale Roberts, Lecturer Computer Science, IUPUI E-mail: droberts@cs.iupui.edu Computer Organization A Typical Von-Neumann Archit...
IUPUI >> CSCI >> N305 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Information Representation: Characters and Images Dale Roberts, Lecturer IUPUI droberts@cs.iupui.edu Dale Roberts Information Representation Review All information ...
IUPUI >> CSCI >> N305 (Fall, 2008)
Department of Computer and Information Science, School of Science, IUPUI CSCI 230 Arrays Declarations Dale Roberts, Lecturer IUPUI droberts@cs.iupui.edu Dale Roberts Arrays Array Group of consecutive memory locations Same name and type, ex: an ar...
IUPUI >> CSCI >> N305 (Fall, 2008)
Character Arrays char string1[] = first; Note : string1 contains 5 characters plus a string termination character or null character \. char string1[] = { f , i , r , s , t , \ }; A String is an array of characters. A character array repr...
What are you waiting for?
View This Document For FREE!