Skip to main content
Side panel
Course Catalog
My Dashboard
Help
Getting Started
Help Center & FAQ
Search
Close
Search
Toggle search input
Log in or Sign up
Course Catalog
My Dashboard
Help
Getting Started
Help Center & FAQ
CS201: Elementary Data Structures
Sections
Course Introduction
Course Syllabus
Unit 1: Abstract Data Types and Arrays in C++
Unit 2: Introduction to Stacks and Queues
Unit 3: Pointers and References in C++
Unit 4: Dynamic Memory Allocation
Unit 5: Linked Stacks, Queues, and Lists
Unit 6: Algorithm Efficiency
Unit 7: Searching and Sorting Algorithms
Unit 8: Hash Tables, Graphs, and Trees
Study Guide
Course Feedback Survey
Certificate Final Exam
Resources
Activities
Quizzes
Home
My programs
My certificates
CS201: Elementary Data Structures
Home
Courses
Course Catalog
Computer Science
CS201: Elementary Data Structures
Sections
Unit 1: Abstract Data Types and Arrays in C++
1.6: Arrays
Array Programming Exercises
Back to '1.6: Arrays\'
Array Programming Exercises
Mark as completed
Attempt these exercises to gauge your understanding of arrays.
Click
http://www.w3resource.com/c-programming-exercises/array/index.php
link to open resource.
Mark as completed
Previous
Jump to...
Jump to...
Course Syllabus
Course Terms of Use
Data Abstraction
Sort Template with Callback
Abstract Data Types
Abstract Data Types in C++
Standard Template Library
Arrays
Memory Allocation in C++
Pointers in C++
Singly and Doubly-Linked Lists
Examples of Linked Lists
Linked List Programming Exercises
Arrays in C
Additional Features of Arrays
Representations of Arrays
Unit 1 Assessment
Lists
Array-Based Lists
Stacks and Queues
Stacks
More on Stacks
Data Structures of Stacks
The Stack Data Structure
Queues
More on Queues
Data Structures of Queues
Unit 2 Assessment
C Data Types
Words in Computer Architecture
Backtracking Pseudocode
Pointers
Everything You Need to Know about Pointers in C
Memory Allocation
C Syntax – Pointers
Pointers
Unit 3 Assessment
Memory Management
Dynamic Memory
C Data Structures
C Pointers and Dynamic Memory Allocation
Stacks and Heaps
Allocations and Deallocations
Unsafe Languages
Unit 4 Assessment
Linked Lists
Introduction to Linked Lists
Other Ways to Use Linked Lists
Doubly-Linked Lists
Linked Stacks
Implement a Stack using a Linked List
Linked Queues
q Module
Unit 5 Assessment
Algorithm Efficiency
Introduction to Efficiency
Big-O
Algorithm Analysis
Introduction to Algorithms
Space-Time Tradeoff
Unit 6 Assessment
Algorithmic Thinking and Peak Finding
Models of Computation and Document Distance
Insertion Sort and Merge Sort
Divide and Conquer Methods, Merge Sort, and Exceptions
Insertion Sort
Merge Sort
Examples of Insertion and Merge Sorts in C++
Linear Search
Fibonacci Search
Binary Search, Bubble Sort, and Selection Sort
Binary Search, Bubble Sort, and Selection Sort in C++
Quicksort and Randomized Algorithms
Recursive Quicksort in C++
Non-Recursive Quicksort in C++
Unit 7 Assessment
Hashing with Chaining
Table Doubling and Karp-Rabin
Open Addressing and Cryptographic Hashing
Hashing
Graphs
Graphs and Network Flows
Finding Non-Cyclical Paths between Arbitrary Pairs of Nodes
C Program for Depth-First Search in a Graph
Breadth-First Search
Dijkstra's Algorithm
Bellman's Algorithm
Minimum Spanning Trees – Kruskal's Algorithm
Minimum Spanning Trees – Prim's Algorithm
Trees
Binary Trees
Non-Binary Trees
Unit 8 Assessment
CS201 Study Guide
Course Feedback Survey
CS201: Certificate Final Exam
Next