CSE 15L:
Software Tools and Techniques
Laboratory
Fall 2017 - http:/ieng6.ucsd.edu/~cs15x/
Dr. ILKAY ALTINTAS ISAAC CHU
GARY GILLESPIE
Lecture 17
December 4th, 2017
Todays Topics
1. VMs and Contain
CSE 15L:
Software Tools and Techniques
Laboratory
Fall 2017 - http:/ieng6.ucsd.edu/~cs15x/
Dr. ILKAY ALTINTAS ISAAC CHU
Lecture 16
GARY GILLESPIE
November 29th, 2017
Todays Topics
1. Profiling usin
CSE 15L:
Software Tools and Techniques
Laboratory
Fall 2017 - http:/ieng6.ucsd.edu/~cs15x/
Dr. ILKAY ALTINTAS ISAAC CHU
Lecture 15
GARY GILLESPIE
November 27th, 2017
Software Correctness
and Effic
Chapter 18
Linear Diophantine Equations
In this chapter we will discuss question.
Question: Given integers a, b and c, find all integers m and n such that
am + bn = c.
Remark: If c = 0, the equation i
ICS 141: Discrete Mathematics I (Fall 2014)
2.3 Functions
Let A and B be nonempty sets. A function f from A to B is an assignment of exactly one element
of B to each element of A. If f is a function f
Chapter 19 Congruence of Integers
Definition: Let m Z, m 6= 0. Let a, b Z, we say a, b are congruent modulo m when
m|(a b) or a b = mq for some q Z. Notation: a b mod m. When the modules m is
clear, w
Notes for Math 109 Lecture C
Instructor: Ming Xiao
Chapter 15
The division theorem
Theorem: (The division theorem)
Let a, b Z with b > 0. Then there are unique integers q and r such that
a = bq + r, a
109 Spring 2011 - Practice Problems for Final Exam
Some of the problems on the test may be very similar to these. On the other hand, some of
these problems are harder than what will appear on the test
Chapter 20 Linear Congruence
Question: Given m ZZ + , a, b ZZ. How to find all solutions to ax b mod m?
Proposition:
(i) If gcd(a,m) doesnt divide b, then there are no solutions.
(ii) If there is a so
Midterm Date: April 1st.
It is a closed book exam and selected sample questions are enclosed.
Mini-Quiz 1-1
1. Instructions written in 0s and 1s are called _ language.
2. When writing a(n) _ program,
Midterm Date: April 1st.
It is a closed book exam and selected sample questions are enclosed.
Mini-Quiz 1-1
1. Instructions written in 0s and 1s are called _ language.
2. When writing a(n) _ program,
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to '2.2.1: Classes and Objects'
Started on Tuesday, July 4, 2017, 1:34 PM
State Finished
Completed on Tuesday, July 4, 2017, 1:36 PM
Time taken 1 min
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Thursday, May 4, 2017, 5:02 PM
State Finished
Completed on Thursday, May 4, 2017, 5:03 PM
Time taken 1 min 23 s
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 1:43 PM
State Finished
Completed on Tuesday, July 4, 2017, 1:47 PM
Time taken 3 mins 37
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 1:55 PM
State Finished
Completed on Tuesday, July 4, 2017, 1:57 PM
Time taken 2 mins 6 s
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 2:01 PM
State Finished
Completed on Tuesday, July 4, 2017, 2:05 PM
Time taken 3 mins 20
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 1:58 PM
State Finished
Completed on Tuesday, July 4, 2017, 2:00 PM
Time taken 2 mins 6 s
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 2:06 PM
State Finished
Completed on Tuesday, July 4, 2017, 2:08 PM
Time taken 1 min 36 s
CS102: INTRODUCTION TO COMPUTER SCIENCE II
Back to 'End of Unit Assessment'
Started on Tuesday, July 4, 2017, 1:51 PM
State Finished
Completed on Tuesday, July 4, 2017, 1:54 PM
Time taken 2 mins 37
Review Test Submission: Quiz Test #1
(Please read Ch. 1 text 3 time before you
start, whence start, you can not stop as
time counts)
Question 1
0.5 out of 0.5 points
The term, PC-compatible, refers to
8 Proof by induction.
Prove by induction that the following results are valid.
n
(i)
(ii)
a + a + ar 2 + + ar n1 =
1r
1r
a
).
n
r 3 = 14 n2 (n+1)2
r=1
Note Methods of proof will be discussed in some
CS 124: Data Structures
Programming Project 1 (Evaluation of Expressions)
Due: March 18, 2016
For this programming project, you will be implementing two abstract data types, stack and queue and you
wi
/ homework21.cpp : Defines the entry point for the console application.
/
/#include "stdafx.h"
#include "time.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm> / random s
Chapter 5 Assignment
Page:294
Ex-2
EX-2. Write a program that uses a loop to display the characters for the ASCII codes 0 to 127.
Display 16 characters in each line.
Answer:
START
Variable char
and le
Page 81
Exercise : 3
Flowchart :
START
Declare all the
necessary
variables
Multiply salestax and
purchase to get the
taxamount
Multiply countytax and
purchase to get the
countytax amount
Add saletax
a
Chapter 8 Assignment
Page- 464 All checkpoints
8.1 Describe the difference between the linear search and the binary search.
Answer:
Linear search is sometimes called sequential search, it uses a loop
Programming challenge Excersice 6
Pseudocode for Selection Sort
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
Input is an array of string
Output Is sorted string elements using selection sort.
Declare fu
Programming challenge EX-2
Pseudocode for Lottery Winners (This is a Linear search)
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
Define the size of the array as 10
Create an array to with the size 1