Theme-Logo
  • Login
visualization
  • FC Overview
  • FC Course graph
  • FC Course Similarity
  • FC Curricula Similarity
  • FC Trajectory
  • FC Upload files
Info
  • FC Publications
  • FC R&D team
  • FC Feedback
node
Id
Label
Node Type
Cognitive Level
Description
Similar nodes pairs

Data structures

(Year: 1 Period: 2 Category: Compulsory )


Create
Evaluate
Analyze
Apply
Understand
Remember
Course
Knowledge Unit
Knowledge Point / Sub Knowledge Point

* Please save changes after editing the graph

Node Description:
Click on a node to see its description.
Course Objectives:
  • 1. (apply)Implementing fundamental data structures and algorithms in C
  • 2. (analyze)Analyzing the resource usage of an algorithm with big O notation
  • 3. (analyze)Know the difference between worst case, best case, upper bound and lower bound
  • 4. (understand)Explain how a data structure is stored in memory

Related Course

Discrete Mathematics and Logic

Year: 1 Period: 2

similar nodes
Networks and Network Security

Year: 2 Period: 1

similar nodes
Modern Databases for IN/IK

Year: 2 Period: 4

similar nodes
Algorithms & Complexity

Year: 2 Period: 4

similar nodes
Introduction Computational Science

Year: 2 Period: 4

similar nodes
Theory of Functional Programming

Year: 3 Period: 4

similar nodes