CC

5273B: Advanced Data Structures Syllabus for Cloud Computing & Big Data 5th Sem 2021 Revision SITTTR (Professional Elective-I)

Advanced Data Structures detailed syllabus for Cloud Computing & Big Data (CC) for 2021 revision curriculum has been taken from the SITTTRs official website and presented for the Cloud Computing & Big Data (CC) students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Cloud Computing & Big Data 5th Sem scheme and its subjects, do visit Cloud Computing & Big Data (CC) 5th Sem 2021 regulation scheme. For Professional Elective-I scheme and its subjects refer to Cloud Computing & Big Data (CC) Professional Elective-I syllabus scheme. The detailed syllabus of advanced data structures is as follows.

Course Objectives:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Course Outcomes:

On completion of the course, the student will be able to:

  1. Demonstrate graph algorithms for transitive closure, topological sorting, shortest path and minimum spanning tree. 1
  2. Illustrate AVL trees and their operations.
  3. Explain Maps, Hash Tables and Set data structures
  4. Summarize text processing and associated algorithms.

Module 1:

Transitive Closure – Definition, Floyd Warshall Algorithm, Directed Acyclic Graphs – Definition, Applications, Topological Ordering algorithm, Weighted Graph, Shortest Path -Dijkstra’s Algorithm, Spanning Tree, Minimum Spanning Tree – Prim-Jarnik Algorithm -Kruskal’s Algorithm.

Module 2:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

Module 4:

Abundance of digitized text, Pattern-Matching algorithms – Brute Force approach, Text Compression – Huffman code, the Huffman Coding Algorithm, Tries, Standard Tries, Compressed Tries, Suffix Tries, Search Engine Indexing – Inverted Files

Text Books:

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

  1. Michael T. Goodrich, Roberto Tamassia, Michael H. Goldwasser, Data Structures and Algorithms in Python (An Indian Adaptation), Wiley; 1st edition (1 July 2021)

Reference Books:

  1. Bradley N Miller, Problem Solving with Algorithms and Data Structures Using Python, Franklin Beedle & Assoc; Second edition (1 January 2013)
  2. Kent D. Lee, Steve Hubbard, Data Structures and Algorithms with Python, Springer, 2015

Online Resources

For the complete syllabus, results, class timetable, and many other features kindly download the iStudy App
It is a lightweight, easy to use, no images, and no pdfs platform to make students’s lives easier.
Get it on Google Play.

For detailed syllabus of all other subjects of Cloud Computing & Big Data, 2021 revision curriculum do visit Cloud Computing & Big Data (CC) 5th Sem subject syllabuses for 2021 revision.

To see the syllabus of all other branches of diploma 2021 revision curriculum do visit SITTTR diploma all branches syllabus..

To see the results of Cloud Computing & Big Data of diploma 2021 revision curriculum do visit SITTTR diploma results..

For all Cloud Computing & Big Data academic calendars, visit Cloud Computing & Big Data all semesters academic calendar direct link.

Leave a Reply

Your email address will not be published. Required fields are marked *

*

This site uses Akismet to reduce spam. Learn how your comment data is processed.