IGNOU Solved MCA Assignments for Old Syllabus

Hello sir I am studying in MCA I sem in IGNOU now I want to get the Assignments for Old Syllabus so please tell me that from where can I get the assignments of this.

[Saksham]

You are looking for the IGNOU MCA I sem assignments for old syllabus so for your help I am providing the assignment questions here :

Question 1: Write an algorithm/program that accepts an input a decimal number and converts it into hexadecimal representation.

Question 2: Consider the following set of processes that arrive in the ready queue at the same time:
Process CPU time
P1 1
P2 3
P3 4
P4 5
P5 2
Consider the following scheduling algorithms:
First Come First Serve (FCFS), SJF (shortest job first) and Round Robin (quantum = 2)
•What is the turnaround time of each process for each of the above scheduling algorithms? Also find the average turnaround time.
•What is the waiting time of each process for each of the above scheduling algorithms? Also find the average waiting time.

Question 3:Write a shell program to generate the first “n” terms of the following sequence without using multiplication.
1 2 4 8 16 32………

For more questions Click on the attachment