Data Structure and Algorithms: Fall 2016

Information

Course Outline

Introduction to Data Structures and Algorithms, Algorithm Analysis, Arrays, Link Lists, Circular & Doubly Linked List, Stacks, Queues, Infix to Postfix, Trees, Tree Traversals, Binary Tress, Heaps, Tree Applications, Dictionaries, Hashing and Graphs


Reference Book

Data Structure and Algorithm Analysis (3RD Edition)
By: Mark Allen Wiess

Marks Distribution

10Quiz
10Assignment
20Project
20Midterm
40Final
Lectures

Week Lecture ID Topic Notes Description Other Reading
1 # DSAF1601 Introduction to Data Structures DSAF1601.pdf Memory Allocation, Linked Allocation, Indexed Allocation, INode
1 # DSAF1602 Lists DSAF1602.pdf Relation, Operation, Implementation & Memory Requirements
1 # DSAF1603 Linked List DSAF1603.pdf Structure, Operations, Implementation Assignment
2 # DSAF1604 Stack DSAF1604.pdf Stack Implementation via Linked List & Arrays Assignment
2 # DSAF1605 Stack Application: Parsing XHTML DSAF1605.pdf Parsing XHTML using Stack Quiz
3 # DSAF1606 Stack Application: Infix to Postfix DSAF1606.pdf Infix, Postfix, Prefix Notations, Infix to Postfix Algorithm
3 # DSAF1607 Stack Application: Reverse Polish Notation DSAF1607.pdf Reverse Polish Notation Solution Algorithm
4 # DSAF1608 Queues DSAF1608.pdf Queue Implementation via Linked List & Arrays
4 # DSAF1609 Deque DSAF1609.pdf Abstract Deque, STL, Stepping though Deques, Iterators Assignment
5 # DSAF1610 The Tree Data Structure DSAF1610.pdf Tree Terminology, Tree Example: XHTML and CSS, MathML
5 # DSAF1611 Abstract Trees DSAF1611.pdf Tree Implementation
6 # DSAF1612 Tree Traversals DSAF1612.pdf Breadth First Search, Back Tracking, Depth First Search - Pre Order & Post Order
6 # DSAF1613 Binary Trees DSAF1613.pdf Full vs Complete Binary Tree, InOrder, PreOrder, PostOrder, Level Order, Euler Tour Traversals
7 # DSAF1614 Complete Binary Tree DSAF1614.pdf Recursive Algorithm, Array Storage, Finding Children, Finding Parent
7 # DSAF1615 N-ary Trees DSAF1615.pdf Ternary Trees, Quaternary Trees, TRIE
8 # DSAF1616 Balanced Trees DSAF1616.pdf Height Balancing, Null-Path-Length Balancing, Weight Balancing
8 # DSAF1617 Binary Search Trees DSAF1617.pdf BST Examples, BST Implementation, Finding Kth Object Read
9 # DSAF1618 AVL Trees DSAF1618.pdf AVL Trees, Height of an AVL Tree, Maintaining Balance Read
9 # DSAF1619 Graph Theory DSAF1619.pdf Undirected Graph, Degree, Sub Graphs, Path, Weighted Graph, Directed Graph, DAG Midterm
10 # DSAF1620 Graph Data Structures DSAF1620.pdf Adjacency Matrix, Sparse Matrix
10 # DSAF1621 Graph Traversals DSAF1621.pdf Breadth First Traversal, Depth First Traversal Read
10 # DSAF1622 Connectedness DSAF1622.pdf Determining Connections, Connected Components
10 # DSAF1623 Single Source Un-weighted Path Length DSAF1623.pdf Determine Distances of all nodes from a single node
11 # DSAF1624 Identifying Bipartite Graph DSAF1624.pdf Bipartite Graph, Algorithm to find Bipartite Graphs
11 # DSAF1625 Minimum Spanning Tree DSAF1625.pdf Minimum Spanning Trees and Its Applications
11 # DSAF1626 Prims Algorithm DSAF1626.pdf Prims Algorithms Strategy and Execution
12 # DSAF1627 Kruskals Algorithm DSAF1627.pdf Kruskals Algorithm for Minimum Spanning Tree Read
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%