QEEE - D2S - Session on
“Linear Data Structures and Applications - Data Structures and Algorithms”
13th, 14th & 15th September, 2017
A D2S Session on “Linear Data Structures and Applications” was conducted under QEEE Minor on September 13th, 14th & 15th, 2017 at Dronacharya Group of Institutions, Greater Noida. QEEE-D2S project is funded by MHRD, Government of India. QEEE-Minor has been introduced in Phase-VIII wherein the theory topics are self-study modules (through Coursepack) with proctored quiz to be administered by local faculty.
The objective of conducting the session was to clarify the principles and process of Linear Data Structures which are primarily designed to solve interesting problems with elegance and efficiency. Prof. Dr. Supratim Biswas, IIT Bombay conducted the sessions. Mr. Manoj Kumar Yadav and Ms. Monu Singh, Assistant Professor (CSE Dept.) of DGI, Greater Noida coordinated the sessions as the Local Faculty Coordinators. 48 students from 3rd Semester of CSE, CSIT and IT attended the sessions.
September 13, 2017
Prof. Supratim Biswas started his lecture with an overview of LINEAR AND NON LINEAR TYPES of Data Structure and how to efficiently code the program block for the given problem. He emphasized that data structures are generally based on the ability of a computer to fetch and store data at any place in its memory, specified by a pointer a bit string, representing a memory address, that can be itself stored in memory and manipulated by the program. Thus the linked data structures are based on storing addresses of data items within the structure itself. He concluded his lecture by solving the queries of the participants.
September 14, 2017
Dr Supratim Biswas initiated the second day session with a brief recapitulation of the first day session and discussed about the Linked List Programming and its importance over Array. He further discussed about Dynamic Memory Allocation. He laid emphasis on the following: During linked List programming, a list always has a reference to the first node, check whether your dynamic allocation of a node did succeed or not. Either return the head pointer, or use double pointer or reference to head pointer. Check whether you are dereferencing a NULL pointer. Check whether you are freeing a NULL pointer. Check whether you are freeing a node after its required use.
September 15, 2017
On the third and final day, Prof. Supratim Biswas started the session with a brief recapitulation of the first and second day sessions. He further discussed the advantages of Linked List and explained how it maintains its linear fashion useful for it to be used in Stacks and Queues. He also discussed the precautions one must observe while executing STACK AND QUEUE.
The sessions were very informative to the students of Computer Science & Engineering and Information Technology.