{"id":4,"title":"Data Structure","credit_hour":"4","lecture_hour":"60","outcome":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n<ul>\r\n<li>Navigate, organize, compile C++ projects of moderate complexity (many objects and dependencies)<\/li>\r\n<li>Decompose a problem into its supporting data structures such as lists, stacks, queues, trees, etc.<\/li>\r\n<li>Diagnose appropriate approaches or algorithms to solve problems involving graph search, tree traversal, optimization, data organization, etc., together with appropriate data structures.<\/li>\r\n<li>Implement classic and adapted data structures and applications.<\/li>\r\n<li>Analyze the efficiency of implementation choices.<\/li>\r\n<\/ul>\r\n<\/body>\r\n<\/html>","description":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n<p>Data representation and storage in elementary data structures like arrays and linked lists (both singly linked lists and doubly linked lists). Abstract Data Types (ADT): Stack, Queue, Priority Queue. Comparative analysis of different implementations of ADTs (Array based and linked list based). Binary Search Tree (including red\/black trees), Heap, Efficient Priority Queue (Heap based). Complexity analysis of dictionary operations (insertion\/deletion\/search) on ADTs. Use of data structures in the design and implementation of smart searching and sorting algorithms (Binary search, Heap sort). Graphs (Connectivity graph, Directed and Undirected graph).<\/p>\r\n<\/body>\r\n<\/html>","books":"<!DOCTYPE html>\r\n<html>\r\n<head>\r\n<\/head>\r\n<body>\r\n<ol>\r\n<li><a title=\"Data Structures by Aho, Ullman, Hopcroft\" href=\"https:\/\/www.amazon.com\/Data-Structures-Algorithms-Alfred-Aho\/dp\/0201000237\" target=\"_blank\"><em>Data Structures & Algorithms<\/em> by Aho, Ullman, Hopcroft<\/a><\/li>\r\n<li><a title=\"C++Plus Data Structure by Nell Dale\" href=\"https:\/\/www.amazon.com\/Plus-Data-Structures-Nell-Dale\/dp\/1449646751\" target=\"_blank\"><em>C++ Plus Data Structure<\/em> by Nell Dale<\/a><\/li>\r\n<li><a href=\"https:\/\/www.amazon.com\/Data-Structures-Algorithms-Alfred-Aho\/dp\/0201000237\" target=\"_blank\"><em>Data Structures and Their Algorithms<\/em> by H. Lewis, L. Denenberg<\/a><\/li>\r\n<\/ol>\r\n<\/body>\r\n<\/html>","created_at":"2016-07-30 22:44:21","updated_at":"2016-10-18 04:57:43"} Details | Department of Computer Science and Engineering, IUB

CSC 203 + Lab: Data Structure

Offered Under: B.Sc. in Computer Science (CSC)

Description

Data representation and storage in elementary data structures like arrays and linked lists (both singly linked lists and doubly linked lists). Abstract Data Types (ADT): Stack, Queue, Priority Queue. Comparative analysis of different implementations of ADTs (Array based and linked list based). Binary Search Tree (including red/black trees), Heap, Efficient Priority Queue (Heap based). Complexity analysis of dictionary operations (insertion/deletion/search) on ADTs. Use of data structures in the design and implementation of smart searching and sorting algorithms (Binary search, Heap sort). Graphs (Connectivity graph, Directed and Undirected graph).

Prerequisites:

CSC 101+ Lab : Introduction to Computer Programming

CSC 201 : Discrete Mathematics

Course Type	Major
Credit Hour	4
Lecture Hour	60

Expected Outcome(s):

Navigate, organize, compile C++ projects of moderate complexity (many objects and dependencies)
Decompose a problem into its supporting data structures such as lists, stacks, queues, trees, etc.
Diagnose appropriate approaches or algorithms to solve problems involving graph search, tree traversal, optimization, data organization, etc., together with appropriate data structures.
Implement classic and adapted data structures and applications.
Analyze the efficiency of implementation choices.

Suggested Books:

Grading Policy:

Letter Grade	Marks	Grade Point
A	90 - 100	4.00
A-	85 - 89	3.70
B+	80 - 84	3.30
B	75 - 79	3.00
B-	70 - 74	2.70
C+	65 - 69	2.30
C	60 - 64	2.00
C-	55 - 59	1.70
D+	50 - 54	1.30
D	45 - 49	1.00
F	00 - 44	0.00