Skip to content

Part 3 · Course

CS384 DATA STRUCTURES

Electrical Engineering and Computer Science · 2 versions

Offerings are listed from 2027-1 Fall through 2031-1 Fall.

CS384 DATA STRUCTURES

  • 3.0 credit hours
  • (BS=0.0, ET=3.0, MA=0.0)
  • Version 2019-2
  • In effect
Scope
This course is designed to build on the cadet's basic programming knowledge. Major emphasis is placed on object-based design, programming methodology, algorithms and algorithm analysis, data structures, and abstract data types as tools for the analysis, design, and implementation of software modules to meet specified requirements. Cadets will learn and employ several well-known algorithms and data structures. Techniques of searching, sorting, recursion, and hashing will be examined. Data structures such as sets, heaps, linked lists, stacks, queues, and trees will be covered. A block-structured programming language reflecting comprehensive support for good software engineering principles will be the foundation of application-oriented exercises. Cadets will design software solutions by employing problem decomposition and selecting the appropriate algorithms and abstract data types.
Lessons
30 @ 75 min (2.000 Att/wk)
Labs
0 @ 0 min
Special requirements
None
Prerequisites
one of
CS384 version 2019-2 offerings
Term Sections Section size Capacity Enrolled Wait list Seats Closed Details
2027-1 Fall 1 18 18 9 0 9 No Hours for 2027-1 Fall
2027-2 Spring 4 18 72 56 0 16 No Hours for 2027-2 Spring
2027-8 Fall Exch 1 18 18 0 0 18 No Hours for 2027-8 Fall Exch
2028-1 Fall 1 18 18 4 0 14 Yes Hours for 2028-1 Fall
2028-2 Spring 5 18 90 6 0 84 No Hours for 2028-2 Spring
2028-8 Fall Exch 1 18 18 0 0 18 No Hours for 2028-8 Fall Exch
2029-1 Fall 1 18 18 1 0 17 No Hours for 2029-1 Fall
2029-2 Spring 4 18 72 2 0 70 No Hours for 2029-2 Spring
2030-1 Fall 1 18 18 0 0 18 No Hours for 2030-1 Fall
2030-2 Spring 4 18 72 0 0 72 No Hours for 2030-2 Spring

CS384 DATA STRUCTURES

  • 3.0 credit hours
  • (BS=0.0, ET=3.0, MA=0.0)
  • Version 1998-1
  • Archived
Scope
This course is designed to build on the cadet's basic programming knowledge. Major emphasis is placed on object-based design, programming methodology, algorithms and algorithm analysis, data structures, and abstract data types as tools for the analysis, design, and implementation of software modules to meet specified requirements. Cadets will learn and employ several well-known algorithms and data structures. Techniques of searching, sorting, recursion, and hashing will be examined. Data structures such as sets, heaps, linked lists, stacks, queues, and trees will be covered. A block-structured programming language reflecting comprehensive support for good software engineering principles will be the foundation of application-oriented exercises. Cadets will design software solutions by employing problem decomposition and selecting the appropriate algorithms and abstract data types.
Lessons
40 @ 55 min (2.500 Att/wk)
Labs
0 @ 0 min
Special requirements
None
Prerequisites
one of