COCS 304
|
|
1
|
|
Course number:
|
COCS 304
|
Name :
|
Data Structures
|
|
2
|
|
Credits:
|
4
|
Contact hours:
|
42 Hrs Lecture 28 Hrs Lab
|
|
|
|
|
|
|
|
|
3
|
|
Course coordinator’s name:
|
Dr.Lal Bihari
|
|
|
|
|
|
|
4
|
|
Textbook:
|
Nell Date, Daniel T. Joyce, Chip Weems, Object –Oriented Data Structures Using Java, Jones & Batlett
Publiher, 2002, ISBN 0763710792.
|
|
|
|
|
|
|
|
a
|
Other references:
|
William H. Ford, William R. Topp, Data Structures
with Java, Prentice Hall, 2005, ISBN 0-13-047724-9.
Stuart Reges and Marty Stepp, Building Java
Programs: A Back to Basics Approach, 2nd edition,
Addison Wesley ,March 2010 , ISBN 0136091814
Micheal T Goodrich and Roberto Tamasia, Data Structure & Algorithms in JAVA, Fourth Edition, John Wiley & Sons, Inc, 2004
|
|
|
|
|
|
|
5
|
a)
|
Synopsis:
|
Synopsis: This course is a continuation of COCS 202 and COCS 203. While COCS 202 focused on procedural programming issues, COCS 203 on object oriented programming method and COCS 304 focuses on data issues. The course also introduces the notion of complexity and performance tradeoffs in examining classic algorithms such as sorting and searching and classic data structures such as lists, sets, and maps. The course will include a mixture of data structure implementation as well as using off-the-shelf components from the Java Collections Framework.
|
|
|
|
|
|
|
b)
|
Prerequisites:
|
COCS 203-Proramming II
|
|
c)
|
Type of course:
|
CS Core Course
|
|
|
|
|
|
|
6
|
a)
|
Course Learning Outcomes
Upon finishing this course, the students should be able to:
· The ability to apply knowledge of computing and mathematics to data representation (a)
· The ability to analyze a problem, identify and define a computing requirement for a linear data structures (b)
- The abilitytousecurrenttechniques,skills,andtoolsnecessary for a linear data structures (i)
|
|
|
b)
|
Student Outcomes: This course aims to meet student outcomes (a), (b) and (i) of ABET criterion.
|
STUDENT OUTCOMES
|
|
a
|
b
|
c
|
d
|
e
|
f
|
g
|
h
|
i
|
j
|
k
|
|
X
|
X
|
|
|
|
|
|
|
X
|
|
|
.
|
|
7
|
|
Brief list of topics and their duration
|
Number
|
Description
|
Duration in weeks
|
|
1
|
Reviews of Java Programming
|
1
|
|
2
|
Representation of Numeric Data
|
1
|
|
3
|
Representation of Character Data
|
1
|
|
4
|
Strings and string processing
|
1
|
|
5
|
Array, Matrices and Sparse Matrix
|
1
|
|
6
|
Exam 1
|
|
|
7
|
Array, Matrices and Sparse Matrix
|
1
|
|
8
|
SEMESTER BREAK
|
|
|
9
|
Linked Lists: representation of single, two and multi dimensional arrays
|
1
|
|
10
|
Stacks Queues: array based implementation in push & Pop operations, infix to postfix conversion, postfix evaluation,
|
1
|
|
11
|
Queues: array based implementation, circular queues, De-queue, Priority Queues
|
1
|
|
12
|
Exam 2
|
1
|
|
13
|
Trees: Terminology and basic properties, binary tree, representing binary trees threaded binary trees, Binary search trees.
|
1
|
|
14
|
Searching And Sorting: Linear search, binary search Hashing
|
1
|
|
|
Final Exam
|
|
|
|
8
|
|
Grading System
|
Assessment Type
|
Percentage of Mark
|
|
Assignment
|
15 %
|
|
Quiz
|
5 %
|
|
Lab Exam
|
10 %
|
|
Exam 1
|
15 %
|
|
Exam 2
|
15 %
|
|
Final Exam
|
40 %
|
|
Total
|
100 %
|
|
|
Last Update
10/5/2018 3:43:21 PM
|
|
|
|