IGNOU BCA Sem-3 Assignment (CS-63: Introduction to Software)

  JHARKHAND BOARD You are here

CS-63: Introduction to Software

Assignment Number             :           BCA(3)-63/Assignment/2009

Maximum Marks                  :           25

Last Date of Submission       :           30 th April, 2009/30th October, 2009

 

There are seven questions in this Assignment. Answer all the questions

 

 Q. 1    Write an algorithm that converts a decimal number to Binary Coded Decimal (BCD) representation.                                                                    (3 Marks)

 

Q. 2       Discuss the usefulness of Context Free Grammar (CFG). Construct context free grammar for all the Conditional and Looping statements in C- language.                                                                                                                                        (4 Marks)

 

Q. 3       Summarize in 350 words the important features of the WINDOWS VISTA operating system.                                                                         (3 Marks)

 

Q. 4       Write a shell program to test whether the given number is a perfect number or not.                                                                                                        (3 Marks)

 

Q. 5       Consider the following set of processes that arrive in the ready queue at the same time:

 

                        Process                        CPU time

                           P1                                2

                           P2                                6

                           P3                                1

                           P4                                4

                           P5                                6

                       

      Consider the following scheduling algorithms: FCFS, SJF and Round Robin (quantum = 2)

 

(i)             Draw suitable Gantt charts for each of the above given scheduling algorithms.

(ii)           What is turnaround time for each process for each w.r.t  the above 

          scheduling algorithms? Also, find the average turn around time.

(iii)         What is the waiting time of each process for each w.r.t  the above

          algorithms? Also, find the average waiting time.

                                                                                                                               (4 Marks)

Q. 6        Write a shell script file called letter1. After running the script, it will prompt the user, for an English alphabet, confirm the alphabet chosen, and then search the current directory for all the files having that alphabet as its first letter in its file-name. Show the list of matching files on your screen.                                                                                                                                        (3 Marks)

 

Q .7        List and execute the following UNIX commands:

(i)      To display the sizes and names of the six largest files in the current directory, listed in descending order of their size.

 

                         (ii)     To display the number of words in the last 10 lines of any file.

 

(iii) To display the name of the oldest file (date of modification-wise) in the present working directory.

 

(iv)    To show the number of all files and directories (including hidden  

           ones, but not . or ..) in the directory /bin.

 

(v)     Use the ps command, and the grep command, in a pipeline to find all

             the processes owned by you.                                                      (5 Marks)

Download Attached PDF