Programming Logic and Design
Chapter 3 Assessments
1. In Figure 310 the process of buying and planting flowers in the spring was shown
using the same structures as the generic example in Figure 39.
Programming Logic and Design
Chapter 2 Assessments
1. If productCost and productPrice are numeric variables, and productName is a
string variable, which of the following statements are valid assignmen
Jamie Williams
CIS221
Predict the Output
14. Output: The node of 56.4 will display, then call on the next node of 34.2 on the
next line.
15. Output: This takes both nodes of 56.4 and 34.2 and calls to
Shreya Patel
MUSC 108
February 13, 2017
MidTerm Project
Part One:
Guided Listening Quick Summary
INTRODUCTION
0:00  0:17
The beginning of the song starts with a melody that is created with an electr


1. List all the communication errors that Jon made.
he doesnt check his emails
he doesnt answer his phone/ return any of his phone calls
he doesnt communicate well with his employees, he assumes
1.) Pass/fail program:
Write a program that informs the user whether they passed or failed the course.
The passing grade has to be greater than or equal to 60.
The grade must be retrived from a textbo

Functional strategies are detailed action plans for implementing the growth and competitive
strategies of the company.
True
An effective operations unit is one that promises the maximum efficiency
Shreya Patel
MUSC 108
March 24, 2017
1. I think I may be wrong, but I believe that Bela and the people were the path, that created
the river which identifies as the music. The people were the path to
1.) Pass/fail program:
Write a program that informs the user whether they passed or failed the course.
The passing grade has to be greater than or equal to 60.
The grade must be retrived from a text
Minimum Spanning Trees
CIS 606
Spring 2010
Problem
A town has a set of houses and a set of
roads.
A road connects 2 and only 2 houses.
A road connecting houses u and v has a
repair cost w(u, v).
Goal:
Elementary Graph Algorithms
CIS 606
Spring 2010
Graph representation
Given graph G = (V, E). In pseudocode,
represent vertex set by G.V and edge set
by G.E.
G may be either directed or undirected.
Two
Greedy Algorithms
CIS 606
Spring 2010
Greedy Algorithms
Similar to dynamic programming.
Used for optimization problems.
Idea
When we have a choice to make, make the
one that looks best right now. Make
Dynamic Programming
CIS 606
Spring 2010
Dynamic Programming
Not a specific algorithm, but a technique
(like divideandconquer).
Developed back in the day when
programming meant tabular method
(like l
RedBlack Trees
CIS 606
Spring 2010
Redblack trees
A variation of binary search trees.
Balanced: height is O(lg n), where n is the
number of nodes.
Operations will take O(lg n) time in the
worst case
Binary Search Trees
CIS 606
Spring 2010
Search trees
Data structures that support many
dynamicset operations.
Can be used as both a dictionary and as a
priority queue.
Basic operations take time prop
Hash Tables
CIS 606
Spring 2010
Hash tables
Many applications require a dynamic set
that supports only the dictionary
operations INSERT, SEARCH, and
DELETE. Example: a symbol table in a
compiler.
A ha
Quicksort
CIS 606
Spring 2010
Quicksort
Worstcase running time: (n2).
Expected running time: (n lg n).
Constants hidden in (n lg n) are small.
Sorts in place.
Quicksort
Quicksort is based on the thre
Heapsort
CIS 606
Spring 2010
Overview
Heapsort
Sorts in placelike insertion sort.
O(n lg n) worst caselike merge sort.
Combines the best of both algorithms.
To understand heapsort, well cover heaps
an
DivideandConquer
CIS 606
Spring 2010
Analyzing DivideandConquer
Algorithms
Use a recurrence to characterize the
running time of a divideandconquer
algorithm.
Solving the recurrence gives us the
Growth of Functions
CIS 606 Spring 2010
Asymptotic Notation
Onotation
O(g(n) = cfw_ f(n): there exist positive constants
c and n0 such that 0 f(n) c g(n) for all n
n0 .
Asymptotic Notation
g(n) is a
Introduction
CIS 606 Spring 2010
The sorting problem
Input: A sequence of n numbers ? a1,
a2, , an ? .
Output: A permutation (reordering) ? a1,
a2, , an ? of the input sequence such
that a1 a2 an.
The
CIS 600 Advanced Computer
Architecture
Lecture 6 Instruction Level
Timothy Arndt
Computer and Information Science
Parallelism
Cleveland State University
Review from Last Time #1
Leverage Implicit Par