CodeJam - Arrays, Stacks and Queues

Learn more about some fundamental data structures like stacks, queues and arrays which are very commonly used in problem solving

Jan 27, 5:00 – 6:30 AM

42
RSVP'd

RSVP Now

Key Themes

Career Development

About this event

Stacks, queues, and arrays are fundamental data structures that serve as building blocks for efficient algorithmic solutions in computer science. Arrays, as a versatile and straightforward structure, store elements in contiguous memory locations, enabling quick access and retrieval. Stacks follow the Last In, First Out (LIFO) principle, making them ideal for managing function calls, parsing expressions, and tracking execution history. In contrast, queues adhere to the First In, First Out (FIFO) principle, making them well-suited for scenarios like task scheduling and managing resources in a sequential manner. Learn more about these data structures and how they are used in problem solving during the session

Organizers

  • Prabhav Kashyap

    GDSC Lead

  • ADARSH U

    Machine Learning Lead

  • Sridhar D Kedlaya

    Competitive Programming Lead

  • TANISHA AGARWAL

    Content and Socials Lead

  • IMON BANERJEE

    Open Source and Development Lead

  • Likhith .

    Event and Resource Management Lead

Contact Us