CS311 Yoshii - HW2 PART 1 Algorithm Analysis & Search (Based on
Week3)
=
=
DUE:
Week 4 Friday
TOTAL: 20 points
Your score is:
Your NAME:
Date Turned in: 9/22/2017
-Purpose: To demonstrate your understanding of analyzing
algorithms.
Starting with this assi
CS311 Yoshii - Homework 1 Part 1 Getting Started (based on Weeks
1-2)
Topics: Stack and Queue application
Due: Week 3 Friday before midnight
Total: 42 points.
Your score is:
Your Name:
Date Submitted: 9/15/2017
-Purpose: To be able to choose the correct d
CS311 Yoshii - Homework 1 Part 2 Vector Stack (based on
Week2)
=
=
Due:
Week 4 Wednesday
Total:
18 points
Your score is:
Your name: Parth Kapur
Date submitted: 9/20/2017
=
=
Purpose: To appreciate the fact that we can use a different
implementation of a s
CS311 Yoshii Week 2 Part 1 (Notes-2A) Queues
=
HW1P1
HW1P1 Week 2 Tasks (Finish the Stack part):
1. complete stack.cpp
2. compile stack.cpp and make sure there are no syntax errors
3. compile and run with my stacktest.cpp; make sure there are no runtime
CS311 Yoshii - Homework 1 Part 1 Getting Started (based on Weeks 1-2)
Topics: Stack and Queue application
Due: Week 3 Thursday before the beginning of lecture.
Total: 42 points.
Your score is:
Your Name: Fan Fang
Date Submitted: 2/11/2016
-Purpose: To be
cs311 Yoshii HW4 Binary Search Tree (based on week 8)
=
DUE:
TOTAL:
Week 10 Tuesday before the beginning of class
16 pts Your score is:
Your name: Fan Fang
Date turned in: 4/5/2016
*Did you do the extra credit?[5pts] <answer here or we will not look for i
CS311 Yoshii - Homework 1 Part 2 Vector Stack (based on Week2)
=
Due:
Week 4 Tuesday before the beginning of class
Total: 18 points
Your score is:
Your name: Fan Fang
Date submitted: 2/15/2016
=
Purpose: To appreciate the fact that we can use a different
CS311 Yoshii - HW2 PART 1 Algorithm Analysis Warm Up (Based on Week3)
=
DUE: Week 5 Tuesday before the beginning of the class
TOTAL: 20 points
Your score is:
Your NAME: Fan Fang
Date Turned in: 2/22/2016
-Purpose: To demonstrate your understanding of anal
CS311 Yoshii HW3 Part 1 - Linked List Class (based on week 6)
=
DUE: Week 7 Thursday before the beginning of class
TOTAL: 29 points
Your score is:
Your NAME: Fan Fang
Date turned in: 3/9/2016
-Purpose: Review and improve your linked list.
-=
PRE-PROGRAMMI
CS311 Yoshii HW3 Part 3 - Linked List Extended (based on Week 7)
=
DUE:
TOTAL:
Week 9 Tuesday before the beginning of the class
20 pts Your score is:
*Your Name: Fan Fang
*Date Turned In: 3/29/2016
*Did you do the extra credit?[5pts] <answer here or we wi
=
CS311 Yoshii - HW5 Binary Heap and Balanced Trees (based on week 9 and 10)
=
DUE: Week 11 Tuesday before the beginning of class
TOTAL 30 points
Your score is:
Your Name: Fan Fang
Date turned in: 4/11/2016
-Purpose: To be able to follow the algorithms fo
CS311 Yoshii - HW2 Part 2 Sorting Analysis (based on week4 - week 5)
=
DUE: Week 6 Tuesday before the beginning of the class
TOTAL: 37 points
Your score is:
Your NAME: Fan Fang
Date Turned in: 3/1/2016
-Purpose: To demonstrate your understanding of analyz
CS311 Yoshii - HW6 Intro to Graphs (based on Week 10 - Week 12)
DUE: Week 13 Tuesday before the beginning of class
Start working on HW7P1 early so that you will have lots of time to do
HW7P2.
Total: 36 points
Your score is:
Your Name: Fan Fang
Date Turned
CS311 Yoshii HW3 Part 2 - Inherited Linked List (based on week 6)
=
DUE: Tuesday of week 8 before the beginning of class
TOTAL: 26 points Your score is:
Your NAME: Fan Fang
Date Turned in: 3/15/2016
-Purpose: To be able to extend the linked list class to
CS111
Kazumi Slott
Intro to C+ programming Assignment operator, arithmetic operators, mixed datatypes
Assignment operator =
= puts a new value into a box/variable
A variable = A combination of constant values, variables, functions, and operators;
e.g. 10,
CS111
Kazumi Slott
Algorithms - repetition
Reminder
True on the right and False on the left.
F
average >= 75
T
Output Proceed to the next class
Problem solving and algorithm development
<Problem 1>
Make an algorithm for a program that will let a teacher e
CS111
Lecture 3-1: if, nested if
Kazumi Slott
Selection
Use a selection (if-else) when we want the computer to choose between alternative actions.
e.g.
Make an algorithm for the program to read 2 numbers from keyboard and output the larger number.
Start
I
CS111
Kazumi Slott
Introduction to C+ programming
You have learned to solve problems and make algorithms over the past four lectures. When you are given a
problem, you need to come up with an algorithm/flowchart first (90% of your work) then you convert y
CS111 Spring 2015
Kazumi Slott
WK 1-2
1-28-16
Problem solving and algorithm development
We are going to do more practice on solving problems and making algorithms. Making algorithms is like
solving math problems. You should see a lot of examples and work
CS111
Kazumi Slott
Reminder
Windows user: install Putty
Mac users: SSH (you dont need to download Putty)
Open terminal, ssh [email protected]
To download C+ program files onto a local computer, download FileZilla watch out for freeware
To print a
CS111 Lab
Written By Kazumi Slott
Due at the end of todays lab
craps.cpp
Make a program that will simulate the game of craps.
Roll a pair of dice first_roll
If first_ roll is 7 or 11, win
If first_ roll is 2, 3, or 12, lose
If first_ roll is something els
CS111
Kazumi Slott
Assignment 5
Programs on functions
Absolutely NO late submissions will be accepted.
DO NOT forget to print out your runs using the test cases provided in
the instructions for submission. You would lose 50 points if you didnt
give me any
CS111 Spring 2015
Kazumi Slott
WK 1-1
1-21-15
Problem solving and algorithm development
The following shows the flow of making a program.
Given a problem
Analyze it
90%
Come up with a general solution (algorithm = a step by step procedure) Design phase
Co
.data
str: .asciiz "How many numbers would you like to add together?: "
str1: .asciiz "\n"
str2: .asciiz "The sum of the numbers is: "
str3: .asciiz "Please enter an integer: "
.text
main:
#LOADING STRING HEADER QUESTION
li $v0,4
la $a0, str
syscall
li $s
.data
str: .asciiz
"Program Description:" "\t\t\t\t" " This program is written to
mimic a very basic calculator"
str1: .asciiz "Author:"
"\t\t\t\t" "Brandon Cain"
str2: .asciiz "Creation date:" "\t\t\t\t" "02/01/2017"
str3: .asciiz "Please enter an intege
Time Complexity
CS 311 Data Structures
Math and Computer Science
Mathematics play an important role in
computer science.
In array-based queues, we use the mod
operation to update the index.
The hashing that we will cover later relies on
mathematical pr
Queue
CS 311 Data Structures
Queue Overview
Queue is like a line of people waiting to be served.
Queue Overview
You can add an element to the rear of the Queue.
You can remove an element from the front of the
Queue.
Queue Overview
It's not possible to
MIPS Arithmetic
Instructions
Sahar Mosleh
California State University San Marcos
Page
1
# This program will take input (integer) from user and print the message input value is
# plus the integer that is input by user. By looking at system call table we wi
Continue on
Machine Language
Representation of Instruction
Sahar Mosleh
California State University San Marcos
Page
1
What happens if we have immediate in the instruction
I-Type layout is used for instruction that uses one of the following:
registers wi
Chapter 8 Example
Given the population is normal or near-normal, assume = 30,
sample size n = 16, s = 6.
Compute P (xBar > 34.2)
CSUSM, Math 242, L Chen
Solution:
1) Calculate t-score = (xBar - ) / (s / sqrt(n) = (34.2 30) / ( 6/4 ) =
2.8
2) Calculate df: