Mumbai University BE IT syllabus

Mumbai University · Final Year Information Technology · Rev-2019 'C' Scheme

Big Data Analytics

ITDO8011 · Department Optional Course 5 · Semester VIII · 3 credits · Internal tests 20 (average of two) + end-semester 80

End-semester paper (3 hours): Six questions of 20 marks; Q1 is compulsory and you answer four.

One of the Department Optional Course 5 options.

All notes for this subject
  1. Module 1: Introduction to Big Data

    3 hours

    Characteristics and types of big data; traditional versus big data approaches; challenges; real-life examples and applications.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • Big data and its characteristics
    • Types of data
    • Traditional versus big data approaches
  2. Module 2: Big Data Frameworks

    6 hours

    Hadoop, its components and ecosystem; Apache Spark; NoSQL key–value, graph, column-family and document stores; MongoDB.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • Hadoop and HDFS
    • The Hadoop ecosystem
    • Apache Spark and in-memory computing
    • NoSQL data architecture patterns
    • MongoDB
  3. Module 3: MapReduce

    7 hours

    Map tasks, grouping by key, reduce tasks and combiners; node failures; matrix–vector and matrix multiplication; selection, projection, union, intersection, difference, join, grouping and aggregation by MapReduce.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • MapReduce programming model
    • Shuffle, sort, partitioner and combiner
    • Relational algebra operations with MapReduce
    • Matrix multiplication with MapReduce
  4. Module 4: Mining Big Data Streams

    7 hours

    The stream data model; sampling; Bloom filters; counting distinct elements with Flajolet–Martin; counting ones in a window with DGIM.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • The stream data model
    • Sampling and filtering streams with Bloom filters
    • Flajolet-Martin algorithm
    • DGIM algorithm
  5. Module 5: Big Data Mining Algorithms

    7 hours

    PCY and SON frequent itemset algorithms; CURE, canopy and MapReduce clustering; parallel SVM; nearest-neighbour classification for big data.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • PCY and SON frequent itemset algorithms
    • CURE and canopy clustering
    • Parallel SVM and nearest-neighbour classification
  6. Module 6: Big Data Analytics Applications

    7 hours

    PageRank and its computation with MapReduce; topic-sensitive PageRank; link spam; hubs, authorities and HITS; clustering social graphs and finding communities; recommendation engines.

    Examined in the 80-mark end-semester paper; the class tests cover what has been taught by then

    • PageRank and topic-sensitive PageRank
    • Hubs, authorities and HITS
    • Community detection in social graphs
    • Recommendation systems

Module contents are summarised from the official Mumbai University syllabus . AiCanCode.org is not affiliated with the University of Mumbai.