{"id":1309,"date":"2015-12-28T18:16:05","date_gmt":"2015-12-28T10:16:05","guid":{"rendered":"http:\/\/people.utm.my\/dayangnor\/?page_id=1309"},"modified":"2016-01-11T12:14:36","modified_gmt":"2016-01-11T04:14:36","slug":"classes-course-outline-scj-2013sck-2013-data-structures-and-algorithms","status":"publish","type":"page","link":"https:\/\/people.utm.my\/dayangnorhayati\/classes-course-outline-scj-2013sck-2013-data-structures-and-algorithms\/","title":{"rendered":"Classes Course Outline – SCJ 2013@SCK 2013 Data Structures and Algorithms"},"content":{"rendered":"

COURSE OUTLINE<\/b><\/span>
\nCourse Code:<\/b> SCJ 2013 \/ SCK 2013<\/span>
\nCourse Name:<\/b> Data Structures and Algorithms<\/span>
\nTotal Contact Hours:<\/b> 42 hours<\/span>
\nCourse Pre-requisite:<\/b> None<\/span><\/p>\n

SYNOPSIS<\/b><\/span>
\nThis course provides an introduction to data structure and algorithms, types of data structures and programming principles. Student will learn abstract data type concepts using class and apply ADT concept in the implementation of data structures. Recursive function, algorithm efficiency, order of magnitude analysis and Big O notation will be discussed. Students will implement operations that can be applied to data structures using various sorting and searching techniques. Further, students will be exposed to linear data structures such as linked lists, stack and queue. Non-linear data structures such as tree and graphs will also be discussed. At the end of the course, students should be able to implement and apply the theory and concepts of data structure in the mini project which is conducted in group.<\/span><\/p>\n

Click Here For More Detailed Course Plan<\/a><\/b><\/span><\/p>\n

Click Here For Teaching Material_OCW<\/a><\/b><\/span>
\nFor Download By Chapter;<\/span>
\n1. Introduction to Data Structures & Algorithms<\/a>
\n2. Abstract Data Type and C++ Class<\/a>
\n3. Recursive & Algorithm Efficiency Analysis
\n\u00a0 \u00a0 \u00a0 -i- Recursive<\/a><\/span>
\n\u00a0 \u00a0 \u00a0 -ii- Algorithm Efficiency Analysis<\/a><\/span>
\n4. Sorting Algorithms<\/a>
\n5. Advanced Sort<\/a>
\n6. Searching Techniques<\/a>
\n7. Linked List Concept and Implementation I<\/a>
\n8. Linked List Concept and Implementation II<\/a>
\n9. Stack Concept and Structure<\/a>
\n10.Stack Application
\n11.Queue (Part 1)<\/a>
\n12.Queue (Part 2)
\n13.Tree Concept<\/a>
\n14.Search Tree<\/p>\n

Click Here For Teaching Material_MOOCs<\/a><\/b><\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

COURSE OUTLINE Course Code: SCJ 2013 \/ SCK 2013 Course Name: Data Structures and Algorithms Total Contact Hours: 42 hours Course Pre-requisite: None SYNOPSIS This course provides an introduction to data structure and algorithms, types of data structures and programming principles. Student will learn abstract data type concepts using class and apply ADT concept in […]<\/p>\n","protected":false},"author":377,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1309","page","type-page","status-publish","hentry","entry"],"_links":{"self":[{"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/pages\/1309","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/users\/377"}],"replies":[{"embeddable":true,"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/comments?post=1309"}],"version-history":[{"count":0,"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/pages\/1309\/revisions"}],"wp:attachment":[{"href":"https:\/\/people.utm.my\/dayangnorhayati\/wp-json\/wp\/v2\/media?parent=1309"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}