Data Structures and Algorithms for Engineers - Revision history

Dvernon: /* Student assessment */

2017-11-22T14:00:13Z

‎Student assessment

Dvernon: /* Student assessment */

2017-11-22T13:58:42Z

‎Student assessment

Dvernon at 15:19, 18 April 2017

2017-04-18T15:19:09Z

Dvernon at 15:17, 18 April 2017

2017-04-18T15:17:31Z

Dvernon at 07:32, 17 April 2017

2017-04-17T07:32:36Z

Dvernon at 10:37, 30 March 2017

2017-03-30T10:37:20Z

Dvernon: /* Acknowledgments */

2017-03-27T05:49:00Z

‎Acknowledgments

Dvernon: /* Student assessment */

2017-03-27T05:46:56Z

‎Student assessment

Dvernon: /* Content details */

2017-03-27T05:45:32Z

‎Content details

Dvernon: /* Content details */

2017-03-27T05:44:40Z

‎Content details

@@ Line 296: / Line 296: @@
 Marks will be awarded as follows.
-Seven individual assignments 70%.
+Best six of seven individual assignments: 60%.
-Final examination  30%.
+Mid-semester examination: 10%.
 <!-- Instructor Judgement 10% (We will use time tracking and observation to determine this part of the grade). -->

@@ Line 292: / Line 292: @@
 ==<span style="color:#AB0000">Student assessment</span> ==
-This course includes several hands-on programming and analysis assignments. Students will program mainly in C/C++. The programming assignments include individual assignments and a team capstone project in teams of 2-3 people. In addition to programming assignments, students will be assigned readings to support the lecture material.
+This course includes several hands-on programming and analysis assignments. Students will program in C/C++. The programming assignments include seven individual assignments. In addition to programming assignments, students will be assigned readings to support the lecture material.
 Marks will be awarded as follows.

@@ Line 7: / Line 7: @@
 <!-- <span style="color:#AB0000">Course discipline: TBD</span> -->
-<!-- <span style="color:#AB0000">Core</span> 	-->
+<span style="color:#AB0000">Core</span>
 <span style="color:#AB0000">Units: 12</span>

@@ Line 6: / Line 6: @@
 <span style="color:#AB0000" ><span style="font-size:18px">Data Structures and Algorithms for Engineers</span></span>
-<span style="color:#AB0000">Course discipline: TBD</span>
+<!-- <span style="color:#AB0000">Course discipline: TBD</span> -->
+<!-- <span style="color:#AB0000">Core</span> 	-->
 <span style="color:#AB0000">Core</span>
-−
 <span style="color:#AB0000">Units: 12</span>

@@ Line 185: / Line 185: @@
 <span style="color:#AB0000">Complex Networks</span><BR>
 <!-- * Complex systems and large networks
 * Community detection
 * Network evolution -->
@@ Line 199: / Line 194: @@
 * Path length, BFS, Connectivity, Components
 * Clustering coefficient
 * Communities
 * Fundamental Hypothesis

← Older revision		Revision as of 05:49, 27 March 2017
Line 298:		Line 298:

	==<span style="color:#AB0000">Acknowledgments</span> ==		==<span style="color:#AB0000">Acknowledgments</span> ==
−	This syllabus is based mainly on Course 04-630 Computer Science Principles for Practicing Engineers given by Mel Rosso-Llopart and Anthony J. Lattanze at Carnegie Mellon University ~~and~~ Course CS-CO-412 Algorithms and Data Structures given by David Vernon at Innopolis University.	+	This syllabus is based mainly on Course 04-630 Computer Science Principles for Practicing Engineers given by Mel Rosso-Llopart and Anthony J. Lattanze at Carnegie Mellon University, USA, Course CS-CO-412 Algorithms and Data Structures given by David Vernon at Innopolis University, Russia, and Course IT706A Scientific Theory in Informatics given by David Vernon and others at the University of Skövde, Sweden.

@@ Line 95: / Line 95: @@
 * Predicate logic
 * Analysis
 <span style="color:#AB0000">Analysis of Complexity</span><BR>
@@ Line 244: / Line 243: @@
 * OO design principles: open/close principle, design by contract principle, dependency inversion principle, other design principles, documentation
 -->
 <span style="color:#AB0000">Automata Theory</span><BR>
 * Regular Languages

@@ Line 64: / Line 64: @@
 * Algorithmic Strategies
 * Analysis of Correctness
-* Databases
+<!-- * Databases -->
-* Programming Paradigms
+<!-- * Programming Paradigms -->
 * Automata Theory
 * Computability Theory
@@ Line 145: / Line 145: @@
 * Circular queues
 * Performance considerations
-* Deque
+<!-- * Deque -->
 <span style="color:#AB0000">Trees</span><BR>
@@ Line 155: / Line 155: @@
 * Height-balanced trees: AVL Trees, RR, RL, LR, LL rotations
 * Height-balanced trees: Red-Black Trees, single promotion, zig-zag promotion, recolouring and restructuring
-* Non-search trees: parse trees, array implementation, linked list implementation
+<!-- * Non-search trees: parse trees, array implementation, linked list implementation -->
-* Forests
+<!-- * Forests -->
 <span style="color:#AB0000">Heaps</span><BR>
@@ Line 167: / Line 167: @@
 * Implementation of heap
 * Heap sort
-* d-ary heaps
+<!-- * d-ary heaps -->
-* Leftist  heaps
+<!-- * Leftist  heaps -->
 <span style="color:#AB0000">Graphs</span><BR>
@@ Line 181: / Line 181: @@
 * Dijkstra's shortest path algorithm
 * Floyd-Warshall's all-pairs algorithm
-* Graphs problems: routes, Hamilton paths, network flows, covering problems, museum guard problem
+<!-- * Graphs problems: routes, Hamilton paths, network flows, covering problems, museum guard problem -->
-* Fleury's Euler circuit algorithm
+<!-- * Fleury's Euler circuit algorithm -->
 <span style="color:#AB0000">Complex Networks</span><BR>
@@ Line 201: / Line 201: @@
 * Hash tables: current value tables, direct access tables
 * Managing collisions: chaining, overflow areas, re-hashing, linear probing, quadratic probing
-* Evaluating hash functions: prime division, mid-square, folding, load factor
+<!-- * Evaluating hash functions: prime division, mid-square, folding, load factor -->
 * Example application: dictionaries
-* Generating hash functions and using hash structures
+<!-- * Generating hash functions and using hash structures -->
 <span style="color:#AB0000">Algorithmic Strategies</span><BR>
@@ Line 213: / Line 213: @@
 * Combinatorial search and backtracking
 * Branch and bound
-* Heuristics and heuristic algorithms
+<!-- * Heuristics and heuristic algorithms -->
-* Probabilistic algorithms
+<!-- * Probabilistic algorithms -->
 <span style="color:#AB0000">Analysis of Correctness</span><BR>
@@ Line 228: / Line 228: @@
 * Verification and validation strategies
 <span style="color:#AB0000">Databases</span><BR>
 * Databases: relational databases, hierarchical databases, NoSQL databases
@@ Line 233: / Line 234: @@
 * Compression strategies, dictionary algorithm, LZ algorithm
 * File structure strategies.
+-->
 <span style="color:#AB0000">Programming Paradigms</span><BR>
 * Imperative programming
@@ Line 241: / Line 243: @@
 * OO design methodology: UML class diagram, composite-structure diagram, architecture diagram, package diagram, object diagram, component diagram, deployment diagram, activity diagram, sequence diagram, communication diagram, interaction diagram, timing diagram, use case diagram, state machine diagram
 * OO design principles: open/close principle, design by contract principle, dependency inversion principle, other design principles, documentation
 <span style="color:#AB0000">Automata Theory</span><BR>