1. Use Weka
- Use "Associate" tab
1.1 Supermarket dataset: Show the top 4 association rules with Apriori using the default
parameters. Discuss what are the main parameters for Apriori that you can modify. Modify
support/confidence 3 times: low, medium hig
1.Research different types of CPUs today and summarize its brief spec:
RISC, CISC, MIPS, SPARCs, Intel family, AMD family, and others.
RISC, CISC, MIPS, SPARCs are instruction set architectures(ISA) whereas Intel and
AMD refer to processors. Intel mostly
Pseudocode:
Step 1:The program checks for the presence of the input file. If not present the program quits.
The max limit is set to 100 and is defined in the program.
1for (int COUNT_ELEM = 1;COUNT_ELEM < LIMIT;COUNT_ELEM+) cfw_
2
int HORLINES = 0;
3
int
Lab 4
1. Suppose you have a machine which executes a program consisting of 50% floating point multiply, 20%
floating point divide, and the remaining 30% are from other instructions.
(Read Amahls law section in the text book and answer)
a. Management wants
NAME:RANADEEP PODDAR
CWID:A20355112
SUBJECT: CS430
Problem 1 Order the following list of functions by the big-Oh notation. Group together (for
example, by underlining) those functions that are big-Theta of one another.
4n
n3
22n
ceil(n)
3n0.5
5n
6nlogn 21
NAME:RANADEEP PODDAR
CWID:A20355112
SUBJECT: CS430
Problem 1 Assume the priority queue also must support the update DELETE(A,i), where i gives
you the location in the data strucure where element i is located. In a binary heap, that would be
A[i]. Write ps
Problem 1 Given a directed graph G = (V, E) we define the graph G2 = (V, E2 ), such that (u, w) E2
if and only if for some v V , both (u, v) E and (v, w) E. That is, G2 contains an edge between
u and w whenever G contains a path with exactly two edges bet
NAME:RANADEEP PODDAR
CWID:A20355112
SUBJECT: CS430
Problem 1 Suppose you are given two n-element sorted sequences A and B, each representing a
set (none has duplicate entries). Describe an O(n)-time method for computing a sequence
representing the set A\B
Problem 1 Suppose you are given two sets A and B, each containing n positive integers. You
can choose to reorder each set however you like. After reordering, let ai be the ith element of set
A, and let bi be the ith element of set B. You then receive a pa