Skip to main content
NounStudy
Back to Course Catalog
CIT216Sciences2 Unitsintermediate

Fundamentals of Data Structures

This course introduces the fundamental concepts of data structures and algorithms. It covers basic data types, including lists, stacks, and queues, and explores their underlying principles. The course also delves into object-oriented programming concepts using Java, focusing on implementing various data structures. Additionally, it examines algorithm design techniques such as greedy algorithms, divide-and-conquer, and dynamic programming, providing a comprehensive understanding of data organization and problem-solving strategies.

Generate AI Study Notes

Transform this course into personalized study materials with AI

45h
Study Time
13
Weeks
3h
Per Week
basic
Math Level
Course Keywords
Data StructuresAlgorithmsJavaProgrammingObject-Oriented

Course Overview

Everything you need to know about this course

Course Difficulty

Intermediate Level
Builds on foundational knowledge
65%
intermediate
➕
Math Level
Basic Math
🔬
Learning Type
Hands-on Practice

Course Topics

Key areas covered in this course

1

Data Types

2

Data Structures

3

Arrays

4

Lists

5

Stacks

6

Queues

7

Hashing

8

Trees

9

Java Programming

10

Algorithms

11

Sorting

12

Graphs

Total Topics12 topics

Ready to Start

No specific requirements needed

This course is designed to be accessible to all students. You can start immediately without any prior knowledge or specific preparation.

Assessment Methods

How your progress will be evaluated (3 methods)

assignments

Comprehensive evaluation of course material understanding

Written Assessment

tutor-marked assessments

Comprehensive evaluation of course material understanding

Written Assessment

final examination

Comprehensive evaluation of course material understanding

Computer Based Test

Career Opportunities

Explore the career paths this course opens up for you

Software Developer

Apply your skills in this growing field

Data Analyst

Apply your skills in this growing field

Algorithm Engineer

Apply your skills in this growing field

Database Administrator

Apply your skills in this growing field

System Designer

Apply your skills in this growing field

Industry Applications

Real-world sectors where you can apply your knowledge

Software DevelopmentData ScienceWeb DevelopmentMobile Application DevelopmentDatabase Management

Study Schedule Beta

A structured 13-week journey through the course content

Week
1

Module 1: Foundational Data Structures

3h

Unit 1: Fundamentals

3 study hours
  • •Understand the definitions of data type, abstract data type, and data structure.
  • •Classify different data types and provide examples.
  • •Explain the relevance of data structures in programming.
Week
2

Module 1: Foundational Data Structures

3h

Unit 2: Arrays

3 study hours
  • •Describe arrays, their dimensionality, and declaration.
  • •Explain the terms element and array name.
  • •Express a two-dimensional array linearly.
  • •Distinguish between static and dynamic arrays.
  • •Explain the importance of arrays in computer applications.
Week
3

Module 1: Foundational Data Structures

3h

Unit 3: The List Data Structure

3 study hours
  • •Describe a List.
  • •Identify the elements of a List.
  • •Explain the operations and implementations of Lists.
Week
4

Module 1: Foundational Data Structures

3h

Unit 4: The Stack Data Structure

3 study hours
  • •Describe the stack data structure.
  • •Identify two basic modes of implementing a stack.
  • •Outline the applications of stacks in computing.
  • •Explain the two methods of storing a stack.
Week
5

Module 1: Foundational Data Structures

3h

Unit 5: The Queue Data Structure

3 study hours
  • •Describe a queue data structure.
  • •Give at least three applications of queues.
  • •Explain the operations on a queue.
  • •Describe two basic modes of queue storage.
Week
6

Module 2: Hashing and Trees

3h

Unit 1: Hashing

3 study hours
  • •Explain the basic idea of hashing.
  • •Describe hash keys and functions.
  • •Give the basic implementation of hash functions.
  • •Define a hash table.
  • •Explain the applications of hash tables.
Week
7

Module 2: Hashing and Trees

3h

Unit 2: Trees

3 study hours
  • •Give a basic definition of a tree.
  • •Describe binary trees.
  • •Explain tree traversals.
  • •Evaluate arithmetic expressions by means of tree traversals.
Week
8

Module 2: Hashing and Trees

3h

Unit 3: Search Trees

3 study hours
  • •Explain what a search tree is.
  • •Describe a successful search.
  • •Describe an unsuccessful search.
  • •Explain the implementation of AVL search trees.
Week
9

Module 2: Hashing and Trees

3h

Unit 4: Garbage Collection and Other Heap

3 study hours
  • •Describe garbage.
  • •Explain garbage collection.
  • •Describe the mark-and-sweep garbage collection.
  • •Explain the fragmentation problem.
Week
10

Module 2: Hashing and Trees

3h

Unit 5: Memory Allocation

3 study hours
  • •Explain the concept of memory allocation.
  • •Discuss the first fit allocation technique.
  • •Explain the best fit allocation technique.
  • •Describe the buddy system.
Week
11

Module 3: Introduction to Java Programming

3h

Unit 1: Object-Oriented Programming Concepts

3 study hours
  • •Define an object.
  • •Explain what a class is.
  • •Define an Inheritance.
  • •Explain the term 'object-oriented programming'.
Week
12

Module 3: Introduction to Java Programming

6h

Unit 2: Variables

3 study hours
  • •Define a variable.
  • •Describe types of java programming variables.
  • •Explain the naming conventions of variables.

Unit 3: Operators

3 study hours
  • •Explain the term 'operators'.
  • •Describe simple assignment operators.
  • •Explain arithmetic operators.
  • •Discuss unary operators.
  • •Explain equality and relational operators.
  • •Discuss the conditional operators.
Week
13

Module 3: Introduction to Java Programming

6h

Unit 4: Expressions, Statements and Blocks

3 study hours
  • •Define an expression.
  • •Describe statements, giving typical examples of expression statements.
  • •Discuss the concept of blocks.

Unit 5: Control Flow Statements

3 study hours
  • •Describe control flow statements.
  • •Gain knowledge of the decision-making statements.
  • •Explain the looping statements.

This study schedule is in beta and may not be accurate. Please use it as a guide and consult the course outline for the most accurate information.

Course PDF Material

Read the complete course material as provided by NOUN.

Access PDF Material

Study Tips & Exam Preparation

Expert tips to help you succeed in this course

1

Create flashcards for key data structure definitions (stacks, queues, trees).

2

Practice implementing basic data structures in Java without reference materials.

3

Review and understand the time complexity of different sorting algorithms.

4

Focus on understanding the core concepts of object-oriented programming in Java.

5

Work through examples of greedy, divide-and-conquer, and dynamic programming algorithms.

6

Create a cheat sheet of common Java syntax and data structure methods.

7

Allocate specific time slots for practicing coding problems related to data structures and algorithms.

8

Review all tutor-marked assignments (TMAs) and address any areas of weakness.

9

Form a study group to discuss challenging concepts and practice problem-solving together.

10

Prioritize understanding over memorization - focus on applying concepts to solve problems.

11

Practice writing code by hand to simulate exam conditions.

12

Review graph algorithms and their applications, such as shortest path problems.

13

Create concept maps linking different data structures and algorithms to understand their relationships.

Related Courses

Other courses in Sciences that complement your learning

ESM292

Environmental Economics

2 Units
FMT204

Introduction To Mathematical Economics

2 Units
CHM291

Practical Manual Inorganic Chemistry III

2 Units
View All Sciences Courses