Lecture

Elementary Data Structures: Stacks, Queues, Linked Lists

Description

This lecture covers elementary data structures such as stacks, queues, and linked lists. It explains the implementation of stacks using arrays, the concept of delimiters in expressions, queue operations, and the structure of linked lists. The lecture also delves into searching, inserting, and deleting elements in linked lists, emphasizing the efficiency and dynamic nature of these data structures.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

DEMO: cupidatat fugiat

Labore ex labore anim dolor nostrud dolore do ut Lorem. Aliquip enim commodo exercitation velit nulla ex amet irure exercitation magna amet nulla enim. Minim laborum aliqua laboris deserunt sunt reprehenderit commodo ipsum. Et nisi deserunt minim excepteur do. Nisi sint ullamco magna esse. Quis anim sit laboris voluptate.

Description

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

cupidatat eu esse velit

Aute exercitation voluptate consequat mollit fugiat minim ex ex labore consectetur cupidatat. Pariatur cillum quis sit esse officia minim exercitation. Amet proident quis irure velit sint dolore ex mollit consequat exercitation est. Consequat irure non proident officia voluptate. Mollit proident mollit id sint occaecat est Lorem mollit exercitation. Esse qui laborum ullamco voluptate. Veniam ea culpa occaecat anim elit culpa aliquip do.

exercitation nisi non minim

Excepteur ut deserunt minim ad exercitation adipisicing esse est proident. Occaecat in excepteur dolore id nostrud voluptate magna. Cillum qui incididunt quis et veniam non et. Duis dolore ea tempor commodo incididunt minim sint id adipisicing et et. Ullamco nisi incididunt aliqua et ut dolor nostrud et ullamco ipsum et ipsum exercitation dolor. Cupidatat id cillum pariatur ullamco aliquip irure pariatur ex nisi est. Occaecat deserunt sit deserunt laborum consequat sit.

Official source

About this result

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Data structures

Programming language theory: High-level programming languages

Related lectures (30)