Class Notes (836,580)
Canada (509,856)
CS 240 (49)
Lecture

tutorial 3

1 Page
143 Views
Unlock Document

Department
Computer Science
Course
CS 240
Professor
Brad Lushman
Semester
Winter

Description
CS 241 { Week 3 Tutorial Assembly Language Programming Pt. II Winter 2014 Problem ▯ Write an assembly language program that determines the last element in a non-empty, non-circular linked list using a recursive procedure. The linked list is represented by an array as follows: { Any two consecutive array elements A[i] and A[i + 1] form a \node" of the linked list. { For the node starting at index i of the array, A[i] is the list element and A[i + 1] is a \pointer" giving the array index (not the memory address) of the next node. { The ▯rst node’s element and \next node" pointer are in A[0] and A[1], respectively.
More Less

Related notes for CS 240

Log In


OR

Join OneClass

Access over 10 million pages of study
documents for 1.3 million courses.

Sign up

Join to view


OR

By registering, I agree to the Terms and Privacy Policies
Already have an account?
Just a few more details

So we can recommend you notes for your school.

Reset Password

Please enter below the email address you registered with and we will send you a link to reset your password.

Add your courses

Get notes from the top students in your class.


Submit