Data Structure and Algorithms: Fall 2017

Information

Course Outline

Introduction to Data Structures and Algorithms, Greedy Algorithms, Divide & Conquer, Dynamic Programming, Basic Data Structures, Dynamic Arrays and Amortised Analysis, Priority Queues and Disjoint Sets, Direct Addressing and Chaining, Binary Search Trees, Decomposition of Graphs, Paths in Graphs, Minimum Spanning Trees, Advanced Shortest Paths


Reference Book

Adapted From: UCSD
By: University of California, San Diego

Marks Distribution

10Quiz
20Assignment
10Project
20Midterm
40Final
Lectures

Week Lecture ID Topic Notes Description Other Reading
1 # DSAF1701 Introduction to Course DSAF1701.pdf Data Structures & Algorithms
1 # DSAF1702 Solve a Challenging Code Problem DSAF1702.pdf Maximum Pairwise Product
1 # DSAF1703 Why Study Algorithms? DSAF1703.pdf An Introduction
2 # DSAF1704 Fibonacci Series DSAF1704.pdf Algorithm
2 # DSAF1705 Big-O Notation DSAF1705.pdf Computing Runtimes
2 # DSAF1706 Basic Data Structure DSAF1706.pdf Arrays, Multi-Dimensional Arrays Assignment
3 # DSAF1707 Linked List DSAF1707.pdf Singly Linked List & Doubly Linked List
3 # DSAF1708 Stacks DSAF1708.pdf Implementation & Applications
3 # DSAF1709 Stack Application DSAF1709.pdf Reverse Polish Notation
4 # DSAF1710 Queues DSAF1710.pdf Implementation & Applications
4 # DSAF1711 Trees DSAF1711.pdf Terminology & Applications
5 # DSAF1712 Tree Traversal DSAF1712.pdf Breadth-First & Depth-First Traversals
5 # DSAF1713 Binary Trees DSAF1713.pdf In-Order, Pre-Order & Post-Order Traversals
6 # DSAF1714 Priority Queues DSAF1714.pdf Naïve implementation
6 # DSAF1715 Binary Heaps DSAF1715.pdf Priority Queues
6 # DSAF1716 Complete Binary Trees DSAF1716.pdf How to keep a tree shallow?
7 # DSAF17Mid Midterm Exam Questions and Answers Midterm
8 # DSAF1717 Disjoint Sets DSAF1717.pdf Naïve Implementation
8 # DSAF1718 Disjoint Sets DSAF1718.pdf Efficient Implementation - Forest
9 # DSAF1719 Hash Tables DSAF1719.pdf Introduction
9 # DSAF1720 Hash Tables DSAF1720.pdf Hash Functions
10 # DSAF1721 Binary Search Trees DSAF1721.pdf Introduction
10 # DSAF1722 Binary Search Trees DSAF1722.pdf Basic Operations Read
11 # DSAF1723 Decomposition of Graphs DSAF1723.pdf Representing and Exploring Graphs
11 # DSAF1724 Decomposition of Graphs DSAF1724.pdf Connectivity
12 # DSAF1725 Directed Acyclic Graph DSAF1725.pdf Topological Sorting
12 # DSAF1726 Directed Graph DSAF1726.pdf Strongly Connected Components
13 # DSAF1727 Paths in Graph DSAF1727.pdf Most Direct Route - BFS
13 # DSAF1728 Paths in Graph DSAF1728.pdf Fastest Route - Dijkstra Algorithm
14 # DSAF1729 Minimum Spanning Tree DSAF1729.pdf Kruskal & Prim Algorithms Read
15 # DSAF17PP Past Papers DSPastPapers.rar
SKILLS
  • Research & Development 90%
  • Project Management 80%
  • Client Communication 80%
  • Team Management 85%
  • Microsoft Project and Visio 80%
  • GUI Design 90%
  • Web & Mobile Application 95%
  • CMS Design & Development 85%
PROGRAMMING SKILLS
  • HTML 5 90%
  • CSS 3.0 90%
  • PHP / MySQL 90%
  • JS / JQuery 85%
  • JAVA 60%
  • C# / ASP.NET 50%
  • SQL 95%
  • C++ 90%
SEMANTIC WEB
  • XML / XML Schema 90%
  • XPath / XQuery 90%
  • RDF / RDFs 90%
  • SPARQL 80%
  • OWL 80%