ALGORITHMS & RAPTOR
LOOPS
Lab Instructor: TAZI Khadija
E-mail: K.Tazi@aui.ma
LAB 4:
ALGORITHMS & RAPTOR
LOOPS
In todays lab we will learn:
How to solve problems with loops.
How to solve problems with selection + loops
How to solve problems with nested
Import java.util;
Public class Jacob
cfw_
Public static void main(String[] args)
cfw_
Int myAge;
String myName;
String myMaritialStatus;
myAge = 33;
myName = Jacob Loden;
myMaritalStatus = Married;
Import java.util;
Public class Jacob
cfw_
Public static void main(String[] args)
cfw_
Int myAge;
String myName;
String myMaritialStatus;
myAge = 33;
myName = Jacob Loden;
myMaritalStatus = Married;
1. Open your Ch5and6Design.docx under your Documents_YourName folder.
2. USE ECLIPSE to Program the Ch. 5 Programming Projects #9 from page 364 using the
design you created in the previous assignment. REQUIREMENT: You will need to
implement the class. Wri
UML
Instructions: Please keep the layout the way it is and in the order that it is in. You need to Copy and paste the algorithm
table, flow chart and test cases for EACH problem that you are asked to solve. It will reflect in the table of contents
above.
Assume the input data is structured as follows: first there is a non-negative integer specifying the
number of employee timesheets to be read in. This is followed by data for each of the employees.
The first number for each employee is an integer that spe
Instructions: Please keep the layout the way it is. You need to Copy and paste the below table for EACH problem that
you are asked to create an algorithm for. It will reflect in the table of contents above. At the end of the assignment,
scroll up, click o
Instructions: Please keep the layout the way it is. You need to Copy and paste the below table for EACH problem that
you are asked to create an algorithm for. It will reflect in the table of contents above. At the end of the assignment,
scroll up, click o
Instructions: Please keep the layout the way it is and in the order that it is in. You need to Copy and paste the algorithm
table, flow chart and test cases for EACH problem that you are asked to solve. It will reflect in the table of contents
above. At t
UML
Instructions: Please keep the layout the way it is and in the order that it is in. You need to Copy and paste the algorithm
table, flow chart and test cases for EACH problem that you are asked to solve. It will reflect in the table of contents
above.
UML
Instructions: Please keep the layout the way it is and in the order that it is in. You need to Copy and paste the algorithm
table, flow chart and test cases for EACH problem that you are asked to solve. It will reflect in the table of contents
above.
UML
Instructions: Please keep the layout the way it is and in the order that it is in. You need to Copy and paste the algorithm
table, flow chart and test cases for EACH problem that you are asked to solve. It will reflect in the table of contents
above.
Instructions: Please keep the layout the way it is. You need to Copy and paste the below table for EACH problem that
you are asked to create an algorithm for. It will reflect in the table of contents above. At the end of the assignment,
scroll up, click o
Chapter 9 section 1:
1. What output will be produced by the following code?
Int waitTime = 46;
Try
cfw_
System.out.println(Try block entered.);
If(waitTime> 30)
Throw new Exception(Time left exceeded.);
System.out.println(Leaving try block.);
Catch(Excep
Jacob Loden
CSC 120
Mrs. Trevedi
10/25/2013
2.
latch.
4.
6.
8.
10.
12.
14.
16.
18.
Chapter 7 End of Chapter Problems
Solve Problem 1 for the input waveforms in Figure 7-73 applied to an active-HIGH S-R
(See attached graph paper)
For a gated S-R latch, det
Jacob Loden
CSC120
Mrs. Trevedi
10/15/13
Hardware Lab 1
Debugging a Half and Full Adder
1.0
Introduction
The objective of Hardware Lab 1 was to build, test, and debug both a 1-bit half
adder and 1-bit full-adder combinational logic circuit using the pre-
Jacob Loden
CSC120
Mrs. Trevedi
11/22/2013
Ch. 8 and 9 End of Chapter Exercises
CH. 8
2. For the ripple counter in Figure 8-70, show the complete timing diagram for
sixteen clock pulses. Show the clock, Q0, Q1, and Q2 waveforms.
(See attached graph paper.
Jacob Loden
EEE120
Mrs. Trevedi
10/10/2013
Ch 6. Homework
2.
What are the full-adder inputs that will produce the following outputs?
a)
000
b)
001
c)
111
d)
101, 110, 011
4.
For the parallel adder in Fig. 6-73, determine the complete sum by analysis of th
EEE/CSE 120
Simulation Lab 2 Answer Sheet
4-Bit Full Adder, Multiplexer & Decoder
Name:_Jacob Loden_
Instructor and Class Time:_Mrs. Trevedi_
Date:_10/25/13_
Task 2-1: Design a Full Adder
Write down the canonical POS expressions for the Cout and SUM funct
EEE/CSE 120
Simulation Lab 4 Answer Sheet
The Brainless Microprocessor
Name: Jacob Loden_
Instructor and Class Time: Mrs. Trevedi_
Date: 11/28/2013_
Task 4-1: Build the 1-Bit and 4-Bit Registers
Cut and paste your LogicWorks 1-bit register circuit here:
D
EEE/CSE 120
Simulation Lab 3 Answer Sheet
Arithmetic and Logic Unit
Name: Jacob Loden_
Instructor and Class Time: Mrs. Trevedi_
Date: 11/7/2013_
Task 3-1: Build the NOT/NEG Circuit
Cut and paste your LogicWorks NOT/NEG circuit, that implements the functio
Jacob Loden
CSC120
Mrs. Trevedi
10/25/13
Hardware Lab 2:
TTL Characteristics, Three-State Buffers, Open-Collector Buffers
1.0
Introduction
The objective of Hardware Lab 2 was to investigate the effects of poor wiring
practices by intentionally wiring the
Let D R. D is said to be convex if a,b D, the line segment connecting and is contained in D.
Let D R. D is said to be connected if , D, : [0,1] D such that (0) = , (1) =
Let D . , x0 D. f is continuous at x0 if cfw_an x0, an D,
cfw_f(xn) f(x0).
Let D . ,
Let D R. D is said to be convex if a,b D, the line segment connecting is contained in D. Let D R. D is said to be connected if , = , (1) = Le t D . cfw_f(xn) f(x0).
a nd
D, : [0,1] D such that (0)
, x0 D. f is continuous at x0 if cfw_an x0, an D,
Le t D
DEFINITIONS N is an equivalence relation on set A if o a ~ a for all a A o if a ~ b, then b ~ a for all a,b A o if a ~ b and b ~ c, then a~c for all a,b,c A The Completeness Axiom If A is a subset of R, and A is bounded above, then sup (A) exists An infin
II. Let A be a countable set, B a subset of A and B is not finite. Prove that B is countable. A is countable. There exists a bijective function f : N A. there exists a function g : A N If you restrict the domain of g to B, then you get a new function h :
Name: _Solutions _ _ _ _
C SC/MATH 473
Sample Exam
b a b E a q b
3. RegExp NFA. Use the standard algorithm to convert (01)*(0+1)* to an NFA. (Show intermediate work to allow for partial credit.)
p
a O b
a
Midterm 1 TIME = 75 min Instructions: Write your n