some other resources i found helpful

1. Ars Digita University ,aduni.org

2. NPTEL, nptel.iitm.ac.in

3. Prof. Raj Jain on various networking topics
www.cs.wustl.edu/~jain/videos.htm

4. NJIT operating systems http://cpe.njit.edu/dlvideos/CS630/

5 webcasts berkeley webcast.berkeley.edu

thank you ,

if you know more resources please let others know.

I am a third year computer engineering student at delhi college of engineering,delhi,India and I am looking for summer internship.can anybody suggest me where to apply?

thanks in advance

This the copy of the exercise:
----------------------------------------------------------
Exercise 2.22. Louis Reasoner tries to rewrite the first square-list procedure of exercise 2.21 so that it evolves an iterative process:



(define (square-list items)
(define (iter things answer)
(if (null? things)
answer
(iter (cdr things)
(cons (square (car things))
answer))))
(iter items nil))



Unfortunately, defining square-list this way produces the answer list in the reverse order of the one desired. Why?

Louis then tries to fix his bug by interchanging the arguments to cons:



(define (square-list items)
(define (iter things answer)
(if (null? things)
answer
(iter (cdr things)
(cons answer
(square (car things))))))
(iter items nil))



This doesn't work either. Explain.
-----------------------------------------------------------
My OS is WindowsXP,I can't use MIT Scheme there,only Dr-scheme instead.I chose "pretty big" as my language in Dr-Scheme,However,However I change my code,I just can not work out the problem.
Please share your answers with me!Thank you!

Exercise 2.57. Extend the differentiation program to handle sums and products of arbitrary numbers of (two or more) terms. Then the last example above could be expressed as


(deriv '(* x y (+ x 3)) 'x)


Try to do this by changing only the representation for sums and products, without changing the deriv procedure at all. For example, the addend of a sum would be the first term, and the augend would be the sum of the rest of the terms.

I don't know how to change the make-sum etc.
Please help me on this:)

Error unable to find body.

Problem 5 of Project 1:
Two important concepts must be applied together: abstraction and recursion.
We want to split up the problem by decomposing the procedure into a
basic calculation and a recursive call of the same procedure with a
smaller sized argument.
But what is a basic calculation in this case? We can use our procedure
"travel-distance-simple" that calculates the distance as a function of
alpha to create a procedure like (better-angle alpha beta) that takes
as arguments two angles and returns the angle that results in a greater
travel-distance.
We can apply this procedure we created in the same
way we can apply primitive procedures like addition or multiplication.
Now we are able to decompose the problem of findig the best angle in a range
of possible angles: we compare the smallest angle in this range with
the angle we get from applying our procedure recursively to a range
that begins with an incremented angle.
So here's my solution....


(define find-best-angle

(lambda (velocity elevation)

(define min_alpha 0)
(define max_alpha 90)
(define alpha-increment 1) ;; in degrees


(define (better-angle alpha beta)
(if (> (travel-distance-simple elevation velocity alpha)
(travel-distance-simple elevation velocity beta))
alpha beta))

(define (best-angle-between alpha beta)
(if (> alpha beta) beta
(better-angle alpha (best-angle-between (+ alpha alpha-increment) beta))))

(best-angle-between min_alpha max_alpha)
))

Oliver

Rather than simply using the Scheme that's available for this project like any logical person, I decided to use the logic "newer is better" and install the mit-scheme package for Ubuntu. Since that didn't come with 6001.com, I figured I could just copy the 6001.com from the archive file available from the course.

I can't run it successfully, however.

amaroq@Amaroq1:~/Desktop$ scheme -large -band 6001.com -edit
MIT/GNU Scheme running under GNU/Linux
Type `^C' (control-C) followed by `H' to obtain information about interrupts.


>> A hardware fault has occurred within critical section "garbage collector".
>> [signal 11 (SIGSEGV), code 1]
>> Successful recovery is unlikely.
Choose one of the following actions:
D = dump core
I = terminate immediately
N = terminate normally
R = attempt recovery
Q = terminate normally
Action ->

At that point, recovery attempt fails. So I just tell it to dump core.

What exactly does this 6001.com depend on? I would simply copy the files from the archived scheme presented in the course tools, but that version and the ubuntu-package version share many of the same files.

Rather than simply using the Scheme that's available for this project like any logical person, I decided to use the logic "newer is better" and install the mit-scheme package for Ubuntu. Since that didn't come with 6001.com, I figured I could just copy the 6001.com from the archive file available from the course.

I can't run it successfully, however.

amaroq@Amaroq1:~/Desktop$ scheme -large -band 6001.com -edit
MIT/GNU Scheme running under GNU/Linux
Type `^C' (control-C) followed by `H' to obtain information about interrupts.


>> A hardware fault has occurred within critical section "garbage collector".
>> [signal 11 (SIGSEGV), code 1]
>> Successful recovery is unlikely.
Choose one of the following actions:
D = dump core
I = terminate immediately
N = terminate normally
R = attempt recovery
Q = terminate normally
Action ->

At that point, recovery attempt fails. So I just tell it to dump core.

What exactly does this 6001.com depend on? I would simply copy the files from the archived scheme presented in the course tools, but that version and the ubuntu-package version share many of the same files.

In Project 5 the metacircular evaluator i am having difficulty in computer exercise 9. can anybody help me in this regard.

can anybody email me the full Scheme code for Project 2 as i am stuck.(email at dashing_waiting@yahoo.com)