Skip to main content

MCSL-025 Assignment Questions July 2012

PART-1: MCS-021
Question 1: (5 marks)
Write a program in C language to implement 2-way merge sort. Input the following data to the program. Show all intermediate steps:
104,50,20,39,206,29,409,26,298,3,10,8
Question 2: (5 marks)
Write a program in C language to convert a Tree into a Binary Tree.
PART-2: MCS-022
Question 1: (5 marks)
Write a shell script in Linux/Unix that accepts a text file as input and prints the number of words which consist of at least one vowel.
Question 2: (5 marks)
Your PC is on a network. Now, take a print from a printer which is not the default printer for your PC.
PART-3: MCS-023
Question 1: (10 marks)
Create a database consisting of student’s Enroll. No. , Programme of study, and marks secured in each of the courses in MCA.
9
After creating the database, perform the following tasks:
(i) Find the no. of students who failed only in 1 course in all the 6 semesters.
(ii) Generate a report indicating the no. of students who secured marks between 60-70%, >70 – 80% and >80%
Part-4: MCS-024
Question 1: (5 marks)
Write a program in Java for the implementation of a doubly linked list.
Question 2: (5 marks)
Write a program in Java that connects to a database and generates grad cards of the students. Make necessary assumptions.

 Note: You must execute the program and submit the program logic, sample inputs and outputs along with the necessary documentation for this question. Assumptions can be made wherever necessary.
Labels:

Comments

Post a Comment

Popular posts from this blog

IGNOU Syllabus for interview/test for admission to PhD programme in Computer Science

COMPUTER SCIENCE AND APPLICATION (Syllabus for interview/test for admission to PhD programme in Computer Science) Computer Architecture: representation of numbers; Octal, Hexadecimal, and Binary 2’s complement and 1’s complement arithmetic, Floating point representation. Combinational Circuit Design, Sequential Circuit Design, Hardware and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organisation, interfacing peripheral devices, Interrupts. Data Structures & Algorithms: Arrays, stacks, queues, lists, linked, trees, graphs priority queues, heaps, Binary tree, AVL tree, B-tree and Hash tables. Graphs : connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning tree of a graph, Eccentricity of a vertex, radius and diameter of a graph. Hamiltonian, Eulerian graphs and Planar graphs. Sorting and Searching Algorithms, Binary Search, Analysis of Algorithms, Asymptotic notation...
Post a Comment
Read more

IGNOU ON-LINE EXAMINATION FORM

Students are required to pay examination fee @ Rs. 60/- per course for theory as well as practical. A late fee of Rs. 300/- from 1st October, 2012 to 20th October, 2012 and Rs. 500/- from 21st Ocltober, 2012 to 31st October 2012 also needs to be included, if submitted during this period. Mode of payment Credit Card  Demand Draft  Cash Payment Debit Card of Union Bank of India  Results of June, 2012 Term-end examinations are available on University website  www.ignou.ac.in  . Please see result status before filling examination form.  Click here to see the result status of June, 2012 Examination.   Select and enter Programme code and Examination Centre Code from the options available. If the centre opted by the student is not activated as examination centre or not allotted for any other reason, alternative examination centre will be allotted.  Select courses carefully. Courses for theory as well as practical needs to be selected separate...
Post a Comment
Read more