Assignments Sebesta textbook assignments are due one week after we finish the corresponding chapter in class. Coding assignments due dates will be tbd. Chapter 1



Download 8.67 Kb.
Date23.04.2018
Size8.67 Kb.
#46647
Assignments
Sebesta textbook assignments are due one week after we finish the corresponding chapter in class.
Coding assignments due dates will be TBD.
Chapter 1Introduction

Problem Set #3,4,5,7,8,10,15,18.

Coding assignment #1 (Unix).

Coding assignment #7 (Perl). due Tue 9/23

Chapter 2 – History

Problem Set #6,7,10,12,14,18, pp. 120-121. due Tue 9/23

Chapter 3 – BNF

PaperAssignment :: Problem Set #s 3, 7A, 7D, 8, 10, 11, 12, pages 170-172.

| Analyze real life example (e.g. write parse tree for http format, etc.)

| Convert BNF to Augmented BNF.

| Code simple BNF spec (e.g. sandwich)



due Tue 9/30

Coding Assignment #2 (LISP programming). due Tue 10/14

Chapter 5 - Binding, type checking and scope due Th Oct 16
Problem Set #s 2, 5, 6, 9, 11, and 13, pages 244-248.

Coding Assignment #3 (LISP programming). Don’t do this, instead write a “report” about MYREM code we did in class. due Tue 10/14

Chapter 6 - Data types due Th 11/13
Review Questions #s 9, 14, 22, 23 (page 307).
Problem Set #s 1, 2, 10, 15 (pages 308-309).

Chapter 7 - Expression and Assignment Statements due Th11/13

Problem Set #s 7, 8, 9a,c,e, 10a,c,e, 11, 12 a,d and 13 (pages 337-338).

Chapter 8 - Statement Level Control due next Th 11/20

Review Questions #1, 2, 3, and 5. p. 372.

Problem Set Questions #1, 4 and 8. p. 373.

Coding assignment #5. due next Th 11/20

Chapter 9 - Subprograms Due Tue Dec 2

Review Questions #1, 6, 9, and 19. pp. 422-423.

Problem Set #2 and 5. pp. 423-424.

Chapter 10 - Implementing Subprograms Due Th Dec 4

Review Questions #1, 8, 11 and 12. p. 453-454.

Problem Set #1, 3, and 9. p. 454-457.

Chapter 16 - Logic Programming Languages Due Th Dec 11 – last day of class

Review Questions # 4, 9, 11, 12, and 19. (p. 692-693, 7th ed. p.716-717, 8th ed.)
Note: responses to the review questions should be 2 or more sentences long.

Problem Set #5 from the 8th edition: Do NOT do number 5 from the 7th edition.

Write the following conditional statements as Prolog headed Horn clauses.


a. If Fred is the father of Mike, then Fred is an ancestor of Mike.
b. If Mike is the father of Joe and Mike is the father of Mary, then Mary is the sister of Joe.
c. If Mike is the brother of Fred aand Fred is the father of Mary, then Mike is the uncle of Mary.

Problem Set #6, 7, comparing Prolog with Common Lisp rather than Scheme. (p. 693, 7th ed. p. 717-718, 8th ed.)

Coding Assignment #6 (Prolog programming). Due Tue Dec 9

Download 8.67 Kb.

Share with your friends:




The database is protected by copyright ©ininet.org 2024
send message

    Main page