Go to Main Content

Lebanese American University WWW Information System

 

HELP | EXIT

Detailed Course Information

 

Date
Mar 24, 2017
Transparent Image
Information Select the desired Level or Schedule Type to find available classes for the course.

BIF 310 - Algorithms and Data Structures
This course presents the fundamental computing algorithms and data structures, with emphasis on design and analysis. Topics include the asymptotic analysis of upper and average complexity bounds, the best, the average, and the worst, case behaviors. Recurrence relations, sets, hashing and hash tables, trees and binary trees (properties, tree traversal algorithms), heaps, priority queues, and graphs (representation, depth- and breadth-first traversals and applications, shortest-path algorithms, transitive closure, network flows, topological sort). The course also covers the sorting algorithms and performance analysis which include mergesort, quicksort and heapsort. As well, the course details the fundamental algorithmic strategies (divide-and-conquer approach, greedy, dynamic programming, and backtracking). Introduction to NP-completeness theory. Prerequisites: BIF 245 Objects and Data Abstraction and MTH207: Discrete Structures I.[3-0, 3 cr.]
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Tutorial

Bioinformatics Department

Restrictions:
May not be enrolled in one of the following Programs:     
      Freshman Science
      Freshman Arts
May not be enrolled in one of the following Degrees:     
      Executive MBA

Prerequisites:
(Undergraduate level BIF 245 Minimum Grade of D) and (Undergraduate level MTH 207 Minimum Grade of D)

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.5.4