mcasemassigjan06
mcasemassigjan06
APPLICATIONS
(MCA)
ASSIGNMENTS
JANUARY 2006
CS-02 CS-04
CS-05
2
CONTENTS
Important Notes
1. Students are allowed to work in a group (but not more than 2) on projects.
2. Viva-voce will be held for the project evaluation.
3. Project report should contain the following:
3-4 pages write-up about the logic/algorithm and data structures used in the
programmes implementation.
The code listing (it should be well documented).
3
Course Code : CS-02
Course Title : Introduction to Software
Assignment Number : MCA(1)-02/TMA/06
Maximum Marks : 10
Last Date of Submission : 15th April, 2006
This is a Tutor Marked Assignment. There are five questions in this assignment.
Answer all questions. You may use illustrations and diagrams to enhance
explanations.
Question 1: Write an algorithm/program that accepts an input a binary number and converts it
into octal representation.
Question 2: What is the usefulness of the Context Free Grammar (CFG)? Also, give an
example.
Lexical Analysis
Syntax Analysis
Semantic Analysis
Code Generation.
Question 4: Summarise the features of UNIX system that have made them such a
phenomenally successful operating system.
(a) List the PID’s of all processes running as root on your computer on a line, separated
by commas. E.g.,: 1,2,3,4,5,657,658, ... Use pipes to create a one-line command that
accomplishes this.
(b) List all the usernames and names of the people logged on to the system presently.
(c) List all the files in the /tmp directory owned by the user root.
(d) To forcibly terminate a process using its process ID.
4
Course Code : CS-02
Course Title : Introduction to Software
Assignment Number : MCA(1)-02/Project/06
Maximum Marks : 15
Last Date of Submission : 30th April, 2006
Note: This is a Project. Answer all the questions. Each question carries equal
weightage.
You may use illustrations and diagrams to enhance explanations.
Question 3: Explain the important features of any Operating System (other than the UNIX
and the WINDOWS).
5
Course Code : CS-04
Course Title : Data Structures through C and Pascal
Assignment Number : MCA(1)-04/TMA/2006
Maximum Marks : 10
Last Date of Submission : 15th April, 2006
This is a Tutor Marked Assignment. There are two questions in this assignment.
Answer all questions. Each question carries 5 marks. You may use illustrations and
diagrams to enhance explanations.
Question 1: Write a program in ‘C’ language for the creation of a Binary tree. After creation is
complete, it should print the preorder, postorder and inorder traversal outputs of
the binary tree.
Question 2: Write a program in ‘C’ language for the non-recursive implementation of quick
sort.
This is a Project Assignment. Answer the following question. You may use
illustrations and diagrams to enhance the explanation.
Question 1: Write a program for the multiplication of two sparse matrices. Don’t store
matrices in arrays. Use Linked lists.
6
Course Code : CS-05
Course Title : Elements of System Analysis and Design
Assignment Number : MCA(1)-05/TMA/2006
Maximum Marks : 10
Last date of Submission : 15th April, 2006
This is a Tutor Marked Assignment. There are two questions in this assignment.
Answer all questions. Each carries 5 marks. You may use illustrations and diagrams
to enhance explanations.
Question 1: What is the role played by User Interface of the software in the successful
implementation of the system?
Question 2: Differentiate between Systems Analysis and Systems Design with the help of an
example.
This is a Project Assignment. Answer all the following question. You may use the
illustrations and diagrams to enhance your explanations.
Question 1: Develop analysis and design document for an Information system of your choice.