Section outline

  • In this part of the chapter, we delve into specialized data structures derived from classical linked lists. Specifically, we focus on stacks and queues, essential in computer science for efficiently organizing data in various applications. Stacks and queues, both abstract data structures, allow element storage according to specific rules, with operations to add and remove elements. While stacks follow a Last In, First Out (LIFO) order, queues adhere to a First In, First Out (FIFO) order. This part of the chapter explores their functionalities, implementation using special linked lists, and basic operation implementations.

    • Chapter 3 (Part 2) - Course Material File
      The second part of the course materials for Chapter 3 in English, available in PDF format.
      This document is formatted for double-sided printing, 2 pages per sheet.
    • Tutorial Series N°4 File

      This document contains the content for Tutorial Series No. 4, focusing on special linked lists, particularly Stacks and Queues. Based on the concepts covered in Lecture No. 3, this series offers hands-on applications to reinforce your understanding of the material. It includes exercises for independent practice, along with additional tasks to provide practical experience and enhance your comprehension of how stacks and queues operate.

    • Correction of the Tutorial Series N°4 File

      This document presents the standard solutions  for Tutorial Series No. 4 on Special Linked Lists.