Machine Learning 2022-23

Assignments

Date	Assignment	Instructions	Deadline	Submission
23/08/2022	Decision Tree implementation on 5 UCI datasets	Decision Tree	11/10/2022 5:00PM IST	Submit
06/10/2022	Back propagation on 2 UCI datasets	BackPropagation	22/10/2022 5:00PM IST 31/10/2022 5:00PM IST	Submit

Compiler Design 2022-23

Assignments

Date	Assignment	Instructions	Deadline	Submission
16/09/2022	LL(1) Parser Implementation	LLParser	10/10/2022 5:00PM IST	Submit

Assignment-I: Submit a file with name rollno_LLParser.zip  

Find summary

Compiler Design 2021-22

Assignments

Date	Assignment	Instructions	Deadline	Submission
06/10/2021	AST Construction	Resource	20/10/2021 09:00AM (100% grade) 22/10/2021 09:00PM (Max 90% grade) 23/10/2021 12:00Noon (Max 80% grade) 27/10/2021 09:00PM (Max 40% grade)	Submit
08/10/2021	StackOverflowQuestions	Check	18/10/2021 09:00AM 23/10/2021 12:00Noon	Submit

Assignment-I: Submit a file with name rollno_calcConstructAST.zip  

BIGDATA Analytics 2021-22

Assignments

Date	Assignment	Instructions	Deadline	Submissionlink
19/08/2021	Generic Stack	Check	22/08/2021 11:59PM	Submit
07/10/2021	StackOverflowQuestions	Check	18/10/2021 09:00AM 23/10/2021 12:00Noon	Submit
27/10/2021	Read Papers FillGroupInfo	Check	25/11/2021 12:00Noon	Submit

Examinations

Date	Exam	Key
06/10/2021	Quiz-I	QKey
06/10/2021	MID-I	MKey

Map reduce examples : check the ppts

Hadoop Lab 2021-22

Date	Resource	Evaluation	Feedback
27/08/2021
03/09/2021
23/09/2021 01/10/2021	Installation Manual
30/09/2021 04/10/2021
21/10/2021	Partitioner
29/10/2021	RecordContents	Submit

First phase record submission: Contents

Second phase record submission: Contents

Lab Internal: Paper

30/09/2021 ( 61-92) and 01/10/2021 (1-34)

Word count program code:  Code

07/10/2021 (61-92)

Experiment-1:

Frequent itemset: an itemset X is called frequent for database 𝐷 if and only if it is contained in more than min support many transactions: support(X) >= min support

1. Download the data set from here: groceries.csv 

2. Write a Map-reduce program to find 1-frequent item set with 25% min support 

3. Write a Map-Reduce program to find 2-frequent item set with 23% min support

4. Write a Map-reduce program to find 3-frequent item set with 20% min support

Experiment-2:

1.Download MovieLens data set  

2. Use ratings.csv file , Write a Map-Reduce Program to find the average rating of movies . Where average rating of movie X is defined as  =  (sum of ratings of movie X/ total number of ratings of X)      (not a great formula, come up with your own)

3. Use  movies.csv file, Write a Map-reduce program to find the total number of movies in each genre.

Data source of First question:

Groceries Market Basket Dataset | Kaggle

Compiler Design Lab 2021-22

Date	Resource	Evaluation	Feedback
15/09/2021	gccOptions,ScreenShotsByHarsha		Submit
22/09/2021	Maketutorial	EvaluationLink	Submit
24/09/2021	TinyC description
29/09/2021	Lex examples		Submit
06/10/2021	RDPLexExamples	EvaluationLink	Submit
23/10/2021	ASTEvalTypeCheckAndYacc	EvaluationLink	Submit
27/10/2021	Pending work
03,05/11/2021

BIGDATA & HADOOP at JNTUK-UCEV (2016-17)

Installation manual: clickhere

Hadoop Installation in Stand alone and Pseudo Distributed: Clickhere