Interactive Session for NPTEL Online Course
"Programming, Data Structures and Algorithms" by Prof Hema A Murthy
16th March 2016
To discuss and resolve queries with students,ï¿½IIT Madrasï¿½organized anï¿½Interactive Sessionï¿½byï¿½Prof Hema A Murthyï¿½forNPTEL Online course "Programming, Data Structures and Algorithms"ï¿½onï¿½16th March 2016.ï¿½Students from various departments along with the facultyï¿½Ms. Ashu Khurana,ï¿½Assistant Professor, Department of Computer Science & Engineering,ï¿½Ms. Dipti Girdhar,ï¿½Assistant Professor, Department of Applied Science & Engineering,ï¿½Ms. Jyoti Pruthi,Assistant Professor, Department of Information Technology andï¿½Ms. Priyanka Mahani,ï¿½Assistant Professor, Department of Electronics and Computer Engineering attended the session. The objective of this session was to discuss the problems faced by the students during the course.
Dr. Hema A. Murthyï¿½received herï¿½B.E. (1980)ï¿½in Electronics and Communications Engineering fromï¿½Osmania University, Hyderabad, India, M.E (1986)ï¿½in Electrical and Computer Engineering fromï¿½McMaster University,ï¿½Canada,ï¿½andï¿½Ph.D. (1992)ï¿½in Computer Science and Engineering fromï¿½Indian Institute of Technology Madras (IIT - M),ï¿½India.ï¿½She worked as Scientific Officer with the Speech andï¿½Digital Systemsï¿½Tata Institute of Fundamental Research, Bombay, Indiaï¿½from1980 - 1983. In 1988,ï¿½she joined as a faculty in the Department of Computer Science and Engineering,ï¿½IIT - M, India.
Dr. Hemaï¿½started with a brief introduction of time complexity. In Computer Science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the string representing the input. Then students asked a query from complexity.
Then she discussed about stack, queue and linked list. A stack is a container of objects that are inserted and removed according to theï¿½last - in first - out (LIFO)ï¿½principle. In the pushdown stacks only two operations are allowed : push the item into the stack, and pop the item out of the stack. A stack is a limited access data structure - elements can be added and removed from the stack only at the top. Push adds an item to the top of the stack, pop removes the item from the top. A queue is a container of objects (a linear collection) that are inserted and removed according to theï¿½first - in first - out (FIFO)principle. An excellent example of a queue is a line of students in the food court of the UC. New additions to a line made to the back of the queue, while removal (or serving) happens in the front. After that students asked the queries.
The session was very interactive and beneficial for the students.ï¿½Dr. Hemaï¿½discussed the topics by giving real life examples. Some of the queries raised by students were also discussed and solved in the session through interactive means.
Dr. Hemaï¿½concluded the session by giving tips about how to solve problems related to programming and data structures. She advised the students to be calm, have the right attitude, and focus on the basics and be always willing to learn something new.