CS502 Assignment No. 02 Spring 2013 Fundamentals of Algorithms Last date 15/05/2013

No Comments

Assignment No. 02, Semester: Spring 2013, CS502-Fundamentals of Algorithms     last date  15/05/2013
Lectures Covered:  7   to 15

Objective
To solve Recurrence relations using   Iteration method.

Uploading instructions:
Please view the Assignment Submission Process document provided to you by the Virtual University for uploading assignments.

  •   
  • Your assignment must be in .doc format. (Any other formats like        scan images, PDF, Zip, rar, bmp etc. will not be accepted).
  •   
  • Save your assignment with your ID (e.g. bc020200786.doc).
  •   
  • No assignment will be accepted through email.

Rules for Marking:
It should be clear that your assignment   will not get any credit if:

  •   The assignment is   submitted after due date.
  •   The submitted   assignment does not open or file is corrupted.
  •   Your assignment is   copied from internet, handouts or from any other student
      (Strict disciplinary action will be   taken in this case).


Solve the following   recurrence relation using Iteration method.

T(n)=   1             if n=1 , 4T (n/4)+ n^2

NOTE:   Submit “.doc” file only. Every student should provide his/her own work, exact   copying of the assignment (or some portion of the assignment) from the   internet or other students will lead to copy case and zero marks will be   awarded. Different softwares will be used to check plagiarism in assignments.   Do not put any query on MDB about this assignment, if you have any query   then  email at CS502@vu.edu.pk

Next PostNewer Post Previous PostOlder Post Home

0 comments

Post a Comment