Data Structures and Algorithms (Singly Linked List, Time Complexity)

Subject : Data Structures and Algorithms (Singly Linked List, Time Complexity) In this experiment, you are supposed to develop a toy DataBase Management System (DBMS) using File I/O, Structs and Pointer Arithmetic on Singly Linked List extensively. A DBMS is a kind of software which provides persistent storage and special access mechanisms for users' data. It provides a language to access data, to read and to modify it. In this experiment you will develop a domain specific, simple DBMS for storing and accessing product information using a simple domain specific language. A domain specific application or any other kind of specification is only valid for that particular domain which means it cannot be used in a generic fashion. Details are given in the following sections. Main aim of the experiment is to develop your skill of using Singly Linked List Data Structures with C programming language. Other aims of the experiment are to learn time complexity and also to perform file operations by using input/output (io) libraries of C.