Course Code : CS-63

Assignment Number : BCA(3)-63/TMA/2005

Maximum Marks: 10

Last Date of Submission : 15^th October, 2005

This is a Tutor Marked Assignment. There are four questions in this Assignment. Answer all the questions. You may use illustrations and diagrams to enhance explanations.

Question 1: Write an algorithm to abbreviate a full name which consists of the first name, middle name and the last name. (2 Marks)

Question 2: (i) Generate a parse tree for the expression a * b / (c+d) + e^5/g. (1 ½ Marks)

Question 3: Comment on validity of the following statement:
"The UNIX scheduling policy favors interactive processes over non-interactive processes". (2 Marks)

Question 4: Write the UNIX commands for the following: (2 ½ Marks)

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

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

(iii) To display the name of the oldest file (and only the oldest file) in the current 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.