Programming Assignments for CSL102

Assignment-1 |Assignment-2|Assignment-3 |Assignment-4 |Assignment-5

Assignment-1

1. Learn how to login, logout and change your password
2. Download tutor.vi and go through interactive tutorial lessons to learn the usage of the `vi' editor.
3. Learn how to use the mailer to read and send emails.
4. Send an email to the course instructor with subject "CSL102"
5. Learn how to use a browser to access the CSL102 home page.
6. Type in the two programs here and learn how to execute them in the SML interactive environment.

Assignment-2

1. Learn the basics of Unix. Unix tutorial for beginners is a good place to start.

Assignment-3

1. Computing factorial of a given integer using both recursive and iterative procedures.
2. Computing x^n in O(n) time. Write both recursive and iterative versions.
3. Computing x^n in O(log n) time. Write both recursive and iterative versions.
4. Computing the nth fibonacci number. First use the algorithm given by the following functional description: fib(1) = 1; fib(2) = 1; fib(n) = fib(n-1)+fib(n-2) for n > 2. Also develop O(n) and O(log n) iterative algorithms for the same problem.
5. The integer square root of n is the integer k such that k^2 <= n < (k+1)^2. The integer square root can be computed using the following inductive process:
   1. Compute the integer square root i of m = n div 4 recursively. We then have that i^2 <= m < (i+1)^2.
   2. Since m and i are integers we have that (m+1) <= (i+1)^2. We thus have (2i)^2 <= 4m <= n < 4m + 4 <= (2i + 2)^2. Hence we have that the integer square root of n is either 2i or 2i+1.
   Write a recursive ML program corresponding to the above algorithm. Indicate the type of the function and derive the number of steps required.
6. Study the problem of computing perfect numbers from the the lecture notes (Example 3.13) and implement the ML program. Also study the following discussion on scope rules. You will be questioned on this problem during the demonstration.
7. Solve the problems of Minor 1 from last year and write the programs.

Please submit a single tarball (tar.gz file) for your submission. Click here for help on making a tarball.

Last date of submission: August 31. The assignment should be submitted through the Moodle page for CSL102.

Assignment-4

1. Generation of Pascal's triangle (discussed in class).
2. The array problem of Minor I (Hamming)
3. The searching and sorting methods discussed in the class: Sequential search, Binary search, Selection sort, Bubble sort, Insertion sort, Merge sort and Quick sort. Click here for a graphical illustration of the sorting methods discussed in the class

4. The problem of computing the maximum subsequence sum from Minor II of last year (http://www.cse.iitd.ernet.in/~suban/CSL102/minor2/minor2.pdf).

Last date of submission: September 27. The assignment should be submitted through the Moodle page for CSL102.

Assignment-5