Algorithm and Advance data structure

It is three simple assignments. Assignment 1 is about Lists, Stacks, Queues, Trees. In this assignment you will work on a toy JSON parser. Your task is to implement a parser for JSON stored in text files with specific formatting where every value or control character is stored on a separate line. Assignment 2 is about Sorting, Priority Queues, Hashing. In this assignment you will work on data processing application and hashing. The aim is to demonstrate to you how the knowledge you have mastered about sorting algorithms and data structures such as maps can be applied to practical problems. Assignment 3 is about Graphs. In this assignment you will work on a directed graph API implementation. You are free to choose the graph representation for yourself, as long as your implementation supports all of the required interface methods. To keep it simple, the nodes of the graph will be identified by integers and no additional attributes will be required to support for nodes as well as edges. Note: The full description of assignments are attached as PDF files.