Algorithms and Data Structures Laboratory
Welcome to the Algorithms and Data Structures Lab WebPage
6 % Attendance and 9 % performance.
You can download the lab sheet from here.
This week we are going to talk about Arrays.
An array is a contiguous collection of objects of the same type
You can can download detailed contents of this lab week from here.
This lab session is going to be about Pointers.
A pointer is a variable whose value is the address of another variable.
You can download detailed contents of this lab week from here
This lab is going to be about structures which are data types suitable for grouping data elements together. The following topics are covered:
I invite you all to download the lab sheet from here and have a look at the material before our next session.
A stack is an ordered collection of items into which new items may be inserted and from which items may be deleted at one end called the top of the stack. A stack is a dynamic constantly changing object. There are 2 basic operations associated with stack:
You may download the lab sheet from here.
A queue is an ordered collection of items from which items may be deleted at one end (called the front of the queue) and into which items may be inserted at the other end (called the rear of the queue).
In this lab we get familiar with :
Please download the lab sheet from this link.
A linked list is comprised of a series of nodes, each node containing a data element, and a pointer to the next node. The following figure shows an example of a link list.
In this lab you learn how to create a link list using C programming.
Please download the lab sheet from here.