Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
32 views

Sort The Following Data Using Heap Sort and Show All The Intermediate Steps

This document outlines the details of an assignment for a lab course. It includes the course code, title, assignment number, maximum marks, weightage, and due dates. The assignment has four parts and students must answer all questions in each part. Each part is worth 10 marks and lab records are worth an additional 10 marks. The remaining 20 marks are for a viva voce exam. Part 1 involves sorting data using heap sort and writing an algorithm in C to implement it. Part 2 involves writing a shell script to find lines in a text file with words of a certain length and starting with a capital letter, using Windows commands to communicate with another machine on the same domain, using Telnet to connect to remote machines, and

Uploaded by

neha_04sep
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
32 views

Sort The Following Data Using Heap Sort and Show All The Intermediate Steps

This document outlines the details of an assignment for a lab course. It includes the course code, title, assignment number, maximum marks, weightage, and due dates. The assignment has four parts and students must answer all questions in each part. Each part is worth 10 marks and lab records are worth an additional 10 marks. The remaining 20 marks are for a viva voce exam. Part 1 involves sorting data using heap sort and writing an algorithm in C to implement it. Part 2 involves writing a shell script to find lines in a text file with words of a certain length and starting with a capital letter, using Windows commands to communicate with another machine on the same domain, using Telnet to connect to remote machines, and

Uploaded by

neha_04sep
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Title Assignment Number Maximum Marks Weightage Last Date of Submission

: : : : : :

MCSL-025 Lab Course MCA(2)/025/Assign/2010 100 25% 31st October, 2010 (for July, 2010 session) 30th April, 2011 (for January, 2011 session)

This assignment has four parts. Answer all questions of each part. Each part is of 10 marks. Lab Records of each part will carry 10 Marks. Rest 20 marks are for viva voce. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation.
PART-I: MCS-021 Question 1: Sort the following data using heap sort and show all the intermediate steps.

78, 17, 34, 93, 11, 26, 55, 45, 35, 19, 88
Write an algorithm in C to implement this and find its time complexity. (5 Marks) Question 2: 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. (5 Marks) 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. PART-II: MCS-022 Question 1: Write a shell script in Unix/Linux to find the lines numbers of a text file are having words which are 5 to 10 characters long and having first letter as a capital letter. (3 Marks) Question 2: Use Windows 2000 command and communicate with your friend sitting on a different machine but in a same domain group. (2 Marks) Question 3: Use Telnet to get connected with other remote machine. Write the problems you encounter during connection with remote machine. (2 Marks) Question 4: How can you change the time of execution of the job, Explain? Set the execution time of two jobs so that it can run automatically tomorrow one at 11:00 a.m. and stop at 12.00 Noon and for another Job starts at 1:00 p.m and stop after its completion. (3 Marks)

You might also like