Stacks and Queues

Here is a Java applet that simulates a circular implementation of a queue, it helps visualize what happens:

http://www.cosc.canterbury.ac.nz/mukundan/dsal/CQueueAppl.html

Here is also a link that explains a few real-world applications of stacks:

http://jcsites.juniata.edu/faculty/kruse/cs240/stackapps.htm

Enjoy the snow!

Makeup Lecture

As agreed, the makeup lecture (Dr. Ibrahim's section) will be inshaAllah on Sunday at 1:00 PM.

Spread the word!

Exam1

Grades of Exam 1 are ready. You pass by my office between 10:00 and 12:00 to receive them.

You can also have a look at the solutions for the two functions here:
- DeleteMNodes.
- O(n) Sort.

-Ibrahim

Assignment 2 Posted!

Enjoy!

New Tutorial Sessions

There will be two tutorial sessions this week:

• Tuesday 12/11/2013 (IT-206): Sorting Algorithms.
• Wednesday 13/11/2013 (IT-206): Linked Lists.

Make sure not to miss these sessions as the exam is approaching. Any suggestions regarding these tutorial sessions and how they are conducted are also welcome.

Assignment 1 Submission Link

Assalamu Alaikum,

For Dr. Ibrahim's section,

- Submit your solution to the assignment as a soft copy before Sunday 10/11/2013 midnight on this link.
- Please also bring your solution as a hard copy to the lecture on Monday 11/11/2013.

Bittawfeeq!

Tutorial Sessions

As promised, there will be two tutorial sessions this week on the analysis of algorithms:

Tuesday (5-11-2013) at 2 PM in Room 206.
Wednesday (6-11-2013) at 2 PM in Room 206.

Please do not miss these sessions if you have any problem with the course material covered so far or if you have missed any lecture in the previous days for any reason.

I encourage you all to attend,

Bittawfeeq!

Assignment 1

Assignment 1 is ready! Check the assignments tab.

Enjoy!

Asymptotic Analysis

Eid Mubrark every one~!

Here is a good-short-informal summary of the asymptotic analysis of algorithms.

At the end of the video Big-Theta and Big-Omega are mentioned, which we do not cover in this course. More about them in the "Design and Analysis of Algorithms" course inshaAllah.

A Change in Office Hours (Dr. Ibrahim)

Due to the changes in my course schedule, I have changed the office hours to be:

Su, Tu, Th: 10:00-12:00

What is an Algorithm?

A short video that explains informally what an algorithm is and how to compare between algorithms.

For any algorithm that we design, we should ask ourselves three questions:

• How quick is the algorithm?
• How much space does it require?
• Is it correct?

In this course, we will concentrate mainly on the basics of answering the first question. The course "Design and Analysis of Algorithms" may go deeper in answering all the three questions.

Welcome

Assalamu Alaikum All, and welcome to the world of Data Structures!

This blog will be our interaction arena, so feel free to browse the available tabs and subscribe to the posts by entering your email in the subscription box at the top-right of the page.

Make sure also to try the forum tab. You can post there anything related to the course, ask questions and also answer questions asked by your colleagues.

Have fun!