MCSL-025 Lab Course Solved Assignment 2018-19

-

PART-1: MCS-021 
Question 1: Write a program in C language for multiplication of two matrices using Pointers    (5 marks)
Question 2: Write a program in C language that will accept a Graph as input and will perform a Depth First Search on it. Make necessary assumptions.       (5 marks)

PART-2: MCS-022 
Question 1: Write a shell script in Linux/Unix that accepts a text file as input and prints the number of words in the file which do not have a vowel.     (5 marks)
Question 2: Your PC is on a network. Make necessary settings in your PC so that one of the folders in any drive is always shared with Public        (5 marks)

PART-3: MCS-023 
Question 1: Create a database consisting of Name of University, Number of affiliated Colleges, Total number of Programmes offered, Total number of students enrolled. After creating the database, perform the following tasks:    (10 marks)

(i) List the names of those Universities  which are having total number of more than 100 affiliated colleges

PART-4: MCS-024 

Question 1:  Write a program in Java for the addition of two sparse matrices.                (5 marks)
Question 2:Write a program in Java that connects to a database and generates a report that consists of the list of names of Universities which are offering a particular programme. Input to the Java program will be the Programme. Make assumptions wherever necessary. 


👇Click below to Download👇


Comments

Post a Comment

Popular posts from this blog

Asymptotic notations

-
  Data Structure The main idea of asymptotic analysis is to have a measure of efficiency of algorithms that doesn’t depend on machine specific constants,  and doesn’t require algorithms to be implemented and time taken by programs to be compared. Asymptotic notations are mathematical tools to represent time complexity of algorithms for asymptotic analysis.  The following 3 asymptotic notations are mostly used to represent time complexity of algorithms. 1) Θ Notation, 2) Big O Notation, 3) Ω Notation. Click here to learn more
Read more
-
  STACKS in Data Structure A stack is  an abstract data type that holds an ordered, linear sequence of items . In contrast to a queue, a stack is a last in, first out (LIFO) structure. A real-life example is a stack of plates: you can only take a plate from the top of the stack, and you can only add a plate to the top of the stack... Click here to Know more
Read more

Array

-
Image
  An array is a collection of similar data elements stored at contiguous memory locations. It is the simplest data structure where each data element can be accessed directly by only using its index number. For instance, if we want to store the marks scored by a student in 5 subjects, then there’s no need to define individual variables for each subject. Rather, we can define an array which will store the data elements at contiguous memory locations. · array  marks[5]  defines the marks scored by a student in 5 different subjects where each subject marks are located at a particular location in the array i.e.  marks[0]  denotes the marks scored in first subject,  marks[1]  denotes the marks scored in 2nd subject and so on.
Read more