Main »

CS552 Homework 0

Tasks

edit SideBar

Use the print tab on the right-hand top corner, create a printable version of this form, print it and submit legibly handwritten answers to all questions.

1.  Problem 1

Fill out the following information : If you have a photo handy, attach it to this sheet when you turn it in.

  • Name (last name, first name)
  • Name you would like to be called
  • E-mail address
  • Year in School
  • Major Field
  • What other courses are you taking this semester





  • Final Degree Goal (e.g. Ph.D)
  • Previous Education (degrees, institutions)





  • Previous Computer Architecture Courses





  • Previous Computer Science Courses





  • Relevant Work Experience





  • What you expect to get out of this course





  • Outside Interests





  • Long term goals





Start each item on a new line. Please print clearly.

2.  Problem 2

Make sure that you:

    * Know how to get to the course home page
    * Have received email on the course mailing list 

3.  Problem 3

Activate CS login and other computing requirements for course

4.  Problem 4 on CS/ECE 354 Prerequisite (Not Graded)

Translate the MIPS assembly language instruction add $3, $4, $5 into machine language. Express your answer in both 32-bit binary and 8-digit hexadecimal.

5.  Problem 5 on CS/ECE 352 Prerequisite (Not Graded)

A sequence detector is a finite state machine that outputs "1" when a particular sequence is detected and outputs "0" otherwise. For example, a sequence detector designed to detect the sequence "1010" outputs "1" every time this sequence is seen in the input stream. Thus, for an input stream "101010" the output will be "000101".

Specify the finite state machine state diagram for a sequence detector that detects the sequence that corresponds to the last two digits in your ID number, represented in binary coded decimal(BCD). For example, if your id is 902 631 9385 , the last two digits being 85, the sequence detector will detect 85, which is 10000101 in BCD. The sequence detector should also detect overlapping sequences.

Doing this problem will give you a head start on Homework 1.


Page last modified on January 21, 2013, visited 3 times

Edit - History - Print - Recent Changes (All) - Search