Scribd
Upload
5 views2 pages

Course Plan

The document outlines the course plan for CSE 221 at Amrita School of Engineering, detailing topics covered in lectures, keywords, and objectives for each section. Key areas include programming fundamentals, data abstraction, concurrency, and evaluation models. The evaluation pattern consists of internal assessments and an end-semester exam totaling 100 marks.

Uploaded by

Supriya M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views2 pages

Course Plan

The document outlines the course plan for CSE 221 at Amrita School of Engineering, detailing topics covered in lectures, keywords, and objectives for each section. Key areas include programming fundamentals, data abstraction, concurrency, and evaluation models. The evaluation pattern consists of internal assessments and an end-semester exam totaling 100 marks.

Uploaded by

Supriya M
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Amrita Vishwa Vidyapeetham

Amrita School of Engineering

CSE 221 Structure and Interpretation of Computer Programs

Course Plan

Lecture Topics Keywords Objectives


No(s)
1 to 4 The Elements of Programming Expression, Procedures, Substitution Models To know the basic entities of
programming and programming
languages
5 to 8 Procedures and Processes Recursion, Iteration, Tree Recursion, Order of To understand the differences
Growth between procedures and processes
09/12/12 Formulating Abstractions with Higher-Order Procedures as Arguments, General Methods and To understand the different ways of
Procedures Returned Values formulating abstractions
13 - 15 Introduction to Data Abstraction Data, Abstraction Barriers To understand the abstraction at the
Data level
16 - 19 Hierarchical Data and Closure Property Sequences, Interfaces, Hierarchical Structures To understand hierarchical data
Periodical I
20 - 23 Symbolic Data Quotation To understand symbolic data and
scheme utility in handling them
24 - 27 Multiple Representations for Abstract Data Tagged Data, Data-directed Programming To understand abstract data and
their multiple representations
28 - 31 Systems with Generic Operations Generic Operations, Data Types To understand how to achieve
generic operations by combining
data of different types
32 - 35 Assignment and Local State Assignment, Local State Variables To understand the costs and benefits
of introducing assignments
36 - 39 The Environment Model of Evaluation Evaluation, Frames as Repository To understand the necessity of
maintaing Environment and thus
scoping
Periodical 2
40- 43 Modelling with Mutable Data Queues, Tables, Mutable List To understand Mutable Data viz.
List queues and tables and their
representation
44 - 46 Concurrency Nature of Time, Controlling Concurrency To understand the various
characteristics of concurrent
systems
47 - 50 Streams Delayed Lists, Infinite Streams To understand streams and their role
in delayed evaluation
50 - 54 The Metacircular Evaluator Data structure, Syntactic Analysis, Execution To understand the Evaluator
55 - 57 Lazy Evaluation Orders of Evaluation To understand the necessity of
delayed evluation
58 - 60 Overview of Non-deterministic Computing Amb, Search, Query To know about the variations on
and Logic Programming Scheme

Evaluation Pattern:

Internal Assesment: Periodical I: 20 Marks


Peridocal II: 20 Marks
Quizzes, Assignments: 20 Marks

End Semester: 40 Marks

You might also like