Scribd
Upload
0 views

Data Structure and Algorithm Course Outline

The document outlines the course structure for 'Data Structure and Algorithm' at Highland College, targeting second-year Information Technology students. It covers key concepts such as algorithm analysis, time complexity, various data structures, advanced sorting and searching algorithms, and hashing. The course aims to equip students with the skills to write efficient programs and analyze their complexities.

Uploaded by

sirabetegbar12
Copyright
© © All Rights Reserved
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
0 views

Data Structure and Algorithm Course Outline

The document outlines the course structure for 'Data Structure and Algorithm' at Highland College, targeting second-year Information Technology students. It covers key concepts such as algorithm analysis, time complexity, various data structures, advanced sorting and searching algorithms, and hashing. The course aims to equip students with the skills to write efficient programs and analyze their complexities.

Uploaded by

sirabetegbar12
Copyright
© © All Rights Reserved
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/ 2

Data structure and algorithm

Highland college injibara campus


Department of information technology
Course outline for the course data structure and algorithm
Course code: - ITec2052 Cr.Hr:- 3
Target group information technology students
Year: - II semester: - II

Course Description: - The goal of the course is to give a basic understanding of how
common computational problems can be solved efficiently on a computer. In general, the
course teaches students how to write fast and efficient programs and enables them to analyze
the efficiency of their programs.
Course Objective: - At the end of this course the students will be able to know
 Use dynamic memory management in their programs
 Implements linked lists, stacks, queues, trees, and graphs
 Write programs that utilize complex data structures (lists, stacks, trees)
 Analyze complexity algorithms
 Integrate different modules to solve a single problem
 Write fully functional programs that consists of multiple files

Course Content
Chapter one: - Algorithm Analysis concepts
At the end of this chapter the students will be able to know
 Measuring complexity
 Complexity of algorithm
 Big-oh notation and others
Chapter two: - time complexity of known algorithm
At the end of this chapter the students will be able to know
 Searching and sorting algorithms
 Sequential and binary searching algorithms with c++ code
 Coding examples on searching algorithms
 Insertion, selection and bubble sort
 Coding examples on sorting algorithm
Chapter three: - Data structures and applications
At the end of this chapter the students will be able to know
 Linked lists  Stacks
 Queues  Trees
 Graphs
Chapter Four:-Advanced sorting and searching algorithms
At the end of this chapter the students will be able to know
Data structure and algorithm

 Shell sort  Heap sort


 Quick sort  Merge sort

Chapter Five: - Hashing


References
 Algorithms and Data Structures: The Science of Computing by
Baldwin/Scragg. Charles River Media. 2004.
 MichaelT.GoodrichandRobertoTamassia,“DataStructuresandAlgorithms in Java”Wiley.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy