Homework#8(Due:Mar.24)
Total 300 points
Please write down your name, ISU net-ID, and lab section on your homework.
Please submit your homework online through Blackboard by Friday 10:00pm.
Late homework will not be accepted.
Important: Your submission mus
Homework#11(Due:Apr.21)
Total 300 points (and 120 bonus points)
Please write down your name, ISU net-ID, and lab section on your homework.
Please submit your homework online through Blackboard by Friday 10:00pm.
Late homework will not be accepted.
Importa
Homework#9(Due:Mar.31)
Total 300 points
Please write down your name, ISU net-ID, and lab section on your homework.
Please submit your homework online through Blackboard by Friday 10:00pm.
Late homework will not be accepted.
Important: Your submission mus
Homework#12(Due:Apr.28)
Total 200 bonus points
Please write down your name, ISU net-ID, and lab section on your homework.
Please submit your homework online through Blackboard by Friday 10:00pm.
Late homework will not be accepted.
Important: Your submissi
HW#11 Solutions
Lecture 32 & 33
1. Notice that different from the machine in Question 4 of Lectures 30 & 31, this one has an
explicit input P and its outputs are different. A Moore machine with six states is shown below.
2.
3.
4. A Mealy machine is design
HW#9 Solutions
Lecture 23
1.
2.
0
1
3. B3 B2 B1 B0 A3 A2 A1 A0 + 24 = B3 B2 B1 B0 + (1 1 1 1 A3 A2 A1 A0) + 1, which can be
easily computed with one ripple-carry adder and four NOT gates. A3 A2 A1 A0 > B3 B2 B1 B0 if
and only if the carry out C4 of the ri
HW#7 Solutions
Lecture 18
1. (a) The critical delay path is shown in red below.
(b) It passes through one AND gate and 8 FAs (i.e., 16 gates). So the delay of the path is 17 units.
Lecture 19
1. -9.62510 = -1001.101 = -1.001101 23. In IEEE 754 single-prec
HW#6 Solutions
Lecture 15
1. (a) According to the circuit in Figure 3.4(b), ci+1 = (xi yi)ci + xi yi
(b) ci+1 = (xi yi)ci + xi yi
= (xi yi + xi yi )ci + xi yi
= xi yi ci + xi yi ci + xi yi
= yi ci + xi ci + xi yi
This expression is the same as the one in
HW#9 Solutions
Lecture 26
1.
2.
Lecture 27
1. We can construct the circuit using four D flip-flops and four 4-to-1 MUXs only.
2. w=16, x=3, y=16, z=32, p=1, q=4, r=16
Lecture 28
1.
2.
3.
4.
CPRE 288, Spring 2017 Programming
Project 2
Sorting and Searching
Problem Overview
Sorting is of enormous importance in the practice of computing. Rare is the application that does not
include sorting in its implementation. Everything from word processing
Name: Lab Section:
CprE 288 Spring 2017 Homework 10
Due: Friday, April 14, 11.00 PM (on Blackboard)
Instructions:
Homework is individual work. Adhere to the Universitys policy relating to the integrity of
scholarship. See http:/catalog.iastate.edu/academ
Name: Lab Section:
CprE 288 Spring 2017 Homework 8
Due: Monday, March 31, 8.00 AM (on Blackboard)
Instructions:
Homework is individual work. Adhere to the Universitys policy relating to the integrity of
scholarship. See http:/catalog.iastate.edu/academic
Name: Lab Section:
CprE 288 Spring 2017 Homework 11
Due: Friday, April 21, 11.00 PM (on Blackboard)
Instructions:
Homework is individual work. Adhere to the Universitys policy relating to the integrity of
scholarship. See http:/catalog.iastate.edu/academ
Name:
Lab Section:
CprE 288 Spring 2017 Homework 1 (Solutions)
Note: Unless otherwise specified, all problems assume the TM4C123 is being used
Question 1 (15 pts)
Note: The purpose of this question is to refresh your understanding of numeric representatio
Homework#10(Due:Apr.14)
Total 300 points
Please write down your name, ISU net-ID, and lab section on your homework.
Please submit your homework online through Blackboard by Friday 10:00pm.
Late homework will not be accepted.
Important: Your submission mus
HW#10 Solutions
Lecture 29
1. Q0 toggles at each positive clock edge. Q1 toggles whenever Q0 = 1. Q2 toggles whenever Q1 = 1.
So the counting sequence is 000, 001, 010, 111.
2. (a) The path with the longest delay in the circuit is from the Q output of the
Important Notes
1. All course notes and homeworks will be available from the course web page only on Blackboard
Learn (https:/bb.its.iastate.edu). If you encounter any problems in accessing the web page,
obtaining or printing the course material, please e
Iowa State University
Department of Electrical and Computer Engineering
CprE 310: Theoretical Foundations of Computer Engineering
Spring 2017
Homework #6
Date out: April 11, 2017
Date due: April 25, 2017
1. Solve the following recurrence equation:
an = 4a
\ k I _ ,L 2/
/ ,~ ,-~. 1
bv Llc k f+l
1A4 24 '
w
14+! L 77*!
M 4m +1~J~ 954 < 9 2-K 7"
kztl \ /
a"? 4 L 5&7 1w
(
' but! \ K
L La 4 a /- 7/ l
9.?1/ \ k4" ax]
e! Q~
?/
IL
, L X1
I K. L X (t4 2 1km
it 2(144 2
,/ LL- cfw_2)
@a
H - Lg L. , \*:1
2! i 7/ \A
CprE 310 / Spring 2017
Practice Problems Set 5 - Solutions
1. A binary tree is a very common data structure in software and computer engineering. In a binary
tree, each record (represented by a node) is linked to two successor nodes referred to as the lef
CprE 310 / Spring 2017
Practice Problems Set 5
1. A binary tree is a very common data structure in software and computer engineering. In a binary
tree, each record (represented by a node) is linked to two successor nodes referred to as the left
and right
Section
Report
Lab 8
Shreyash.S.Singh
04/7/2017
1.
Data from lab 8
2.
Personal experience
Data from Lab7
#include <stdio.h>
#define MAXPOINTS 10000
/ compute the average of the first num_items of buffer
double avg(double buffer[], int num_items);
/update
Section
Report
Lab 6
Shreyash.S.Singh
03/10/2017
1.
Data from lab 6
2.
Personal experience
Data from Lab6
Part1
#include <stdio.h>
#include <math.h>
int close_to(double tolerance, double point, double value);
double mag(double ax, double ay, double az);
d
Section
Report
Lab 8
Shreyash.S.Singh
04/7/2017
1.
Data from lab 8
2.
Personal experience
Data from Lab7
#include <stdio.h>
#define MAXPOINTS 10000
/ compute the average of the first num_items of buffer
double avg(double buffer[], int num_items);
/update
Section T
Report
Lab 2
Shreyash.S.Singh
09/14/2016
1.
Data from lab 2
2.
Personal experience
Data from Lab2
#include<stdio.h>
int main(int argc, char* argv[])cfw_
printf("Shreyash Shreshtha Singh, cpre185, 9\7\16 ");
return 0;
#include<stdio.h>
int main(
#include <stdio.h>
int main()
cfw_
int array1[100][100],array[100],array2[100][100], p, c, d, swap, q,i,j;
printf("Enter number of size of a 2D array\n");
scanf("00", &p, &q); /* stores the value for number of elements(0)*/
for (i=0;i<p;i+)
cfw_
printf("E