0% found this document useful (0 votes)
71 views4 pages

MCSL 223

The document outlines the structure and requirements for the Computer Networks and Data Mining Lab exams for the Master of Computer Applications program. Each of the four sets includes two sections, with specific tasks related to TCP/UDP applications and data mining techniques, each carrying a total of 25 marks (20 for the task and 5 for viva-voce). Students are instructed to attempt only the sections they have not yet successfully completed.

Uploaded by

Saniya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
71 views4 pages

MCSL 223

The document outlines the structure and requirements for the Computer Networks and Data Mining Lab exams for the Master of Computer Applications program. Each of the four sets includes two sections, with specific tasks related to TCP/UDP applications and data mining techniques, each carrying a total of 25 marks (20 for the task and 5 for viva-voce). Students are instructed to attempt only the sections they have not yet successfully completed.

Uploaded by

Saniya
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MCSL-223 (Set-1)

MASTER OF COMPUTER APPLICATIONS


(MCA-NEW)
Computer Networks and Data Mining Lab

Duration : 2 hours Maximum Marks : 50

Note: There are two sections in this paper. Each section is of 1 hour duration.
Attempt only those section(s) in whom you are not yet successful. Answer
all the questions in each section. Each section carries 20 marks and the viva-
voce for each section is of 5 marks separately.

SECTION-A
Computer Networks Lab

1. Start a TCP application and monitor the packet flow. Make necessary
assumptions.

SECTION-B
Data Mining Lab

2. Create an EXCEL file. Convert the EXCEL file to .csv format and prepare it
as .arff file. Make necessary assumptions.

*****
MCSL-223 (Set-2)
MASTER OF COMPUTER APPLICATIONS
(MCA-NEW)
Computer Networks and Data Mining Lab

Duration : 2 hours Maximum Marks : 50

Note: There are two sections in this paper. Each section is of 1 hour duration.
Attempt only those section(s) in whom you are not yet successful. Answer
all the questions in each section. Each section carries 20 marks and the viva-
voce for each section is of 5 marks separately.

SECTION-A
Computer Networks Lab

1. Create a UDP client on a node n1 and a UDP server on a node n2.

SECTION-B
Data Mining Lab

2. Demonstrate the preprocessing mechanism on a data set of your choice. Make


necessary assumptions.

*****
MCSL-223 (Set-3)
MASTER OF COMPUTER APPLICATIONS
(MCA-NEW)
Computer Networks and Data Mining Lab

Duration : 2 hours Maximum Marks : 50

Note: There are two sections in this paper. Each section is of 1 hour duration.
Attempt only those section(s) in whom you are not yet successful. Answer
all the questions in each section. Each section carries 20 marks and the viva-
voce for each section is of 5 marks separately.

SECTION-A
Computer Networks Lab

1. Create a UDPClient and UDPServer nodes and communicate at a fixed data


rate. Make necessary assumptions.

SECTION B
Data Mining Lab

2. Find the frequent patterns using FP-growth algorithm on any dataset(s) of


your choice. Make necessary assumptions.

*****
MCSL-223 (Set-4)
MASTER OF COMPUTER APPLICATIONS
(MCA-NEW)
Computer Networks and Data Mining Lab

Duration : 2 hours Maximum Marks : 50

Note: There are two sections in this paper. Each section is of 1 hour duration.
Attempt only those section(s) in whom you are not yet successful. Answer
all the questions in each section. Each section carries 20 marks and the viva-
voce for each section is of 5 marks separately.

SECTION-A
Computer Networks Lab

1. Create a simple point to point network topology using two nodes. Make
necessary assumptions.

SECTION B
Data Mining Lab

1. Implement simple k-means Algorithm to demonstrate the clustering rule on


any dataset(s) of your choice.

*****

You might also like