ELEC 278 Fundamentals Of Information Structures Units: 4.00
Fundamentals of Data Structures and Algorithms: arrays, linked lists, stacks, queues, deques, asymptotic notation, hash and scatter tables, recursion, trees and search trees, heaps and priority queues, sorting, and graphs. Advanced programming in the C language. Introduction to object oriented programming concepts in the context of data structures.
(Lec: 3, Lab: 0.5, Tut: 0.5)
(Lec: 3, Lab: 0.5, Tut: 0.5)
Requirements: Prerequisites: APSC 142 or APSC 143 or MNTC 313
Corequisites:
Exclusions: CISC 235, MREN 178
Offering Term: F
CEAB Units:
Mathematics 12
Natural Sciences 0
Complementary Studies 0
Engineering Science 24
Engineering Design 12
Offering Faculty: Smith Engineering
Course Learning Outcomes:
- Identify and describe the standard data structures and algorithms.
- Describe fundamental techniques for comparing alternative data structures and algorithms.
- Implement fundamental data structures using the C programming language.
- Select the appropriate data structure or algorithm to efficiently solve a given computing problem.
- Analyze a given computing problem and solve it using suitable data structures and algorithms.
- Examine solutions using critical thinking to increase efficiency and robustness of a given computing problem solution.