Scribd
Upload
121 views1 page

Data Structure Course Objectives

This course aims to teach students algorithm analysis techniques, how to write efficient algorithms, and how to implement various data structures like linked lists, trees and graphs. It also covers advanced data structures such as AVL Trees, Splay Trees and Red Black Trees. Students will learn problem solving using greedy methods, dynamic programming and divide and conquer strategies. Upon completing the course, students will be able to choose the right data structures and algorithms for problems, write efficient algorithms, and solve problems using common data structures and design methods.

Uploaded by

tasder1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
121 views1 page

Data Structure Course Objectives

This course aims to teach students algorithm analysis techniques, how to write efficient algorithms, and how to implement various data structures like linked lists, trees and graphs. It also covers advanced data structures such as AVL Trees, Splay Trees and Red Black Trees. Students will learn problem solving using greedy methods, dynamic programming and divide and conquer strategies. Upon completing the course, students will be able to choose the right data structures and algorithms for problems, write efficient algorithms, and solve problems using common data structures and design methods.

Uploaded by

tasder1
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

DATA STRUCTURE Course Objectives: The primary objectives of this course are to: Be familiar with basic techniques

s of algorithm analysis Be able to write efficient algorithms Master the implementation of various data structures such as linked lists, trees, graphs etc. Be familiar with advanced data structures such as AVL Tree, Splay tree, Red black tree, Biconnected Graphs Master problem solving using greedy method, dynamic programming and diivde and conquer strategy. Upon completion of this course, the student will be able to: Assess how the choice of data structures and algorithm design methods impacts the performance of programs. Choose the appropriate data structure and algorithm design method for a specified application Write efficient algorithms and compute their complexities. Solve problems using data structures such as linear lists, stacks, queues, binary trees, heaps, advanced search trees, graphs. Solve problems using algorithm design methods such as the greedy method, divide and conquer; and dynamic programming

You might also like