Scribd
Upload
19 views

Programming, Data Structures and Algorithms Course: Module 1: Basics

This course teaches programming, data structures, and algorithms through 4 modules that progress from basics to advanced topics. Module 1 covers variables, operators, conditionals, loops, arrays, pointers, and functions. Module 2 applies these basics to searching, sorting, and an introduction to classes and objects in C++. Module 3 introduces common data structures like lists, stacks, queues, trees, heaps, and graphs. Module 4 covers advanced algorithms including greedy algorithms, dynamic programming, and graph algorithms like Dijkstra's. The final module may be omitted depending on student interest and performance.

Uploaded by

jaskaran31
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views

Programming, Data Structures and Algorithms Course: Module 1: Basics

This course teaches programming, data structures, and algorithms through 4 modules that progress from basics to advanced topics. Module 1 covers variables, operators, conditionals, loops, arrays, pointers, and functions. Module 2 applies these basics to searching, sorting, and an introduction to classes and objects in C++. Module 3 introduces common data structures like lists, stacks, queues, trees, heaps, and graphs. Module 4 covers advanced algorithms including greedy algorithms, dynamic programming, and graph algorithms like Dijkstra's. The final module may be omitted depending on student interest and performance.

Uploaded by

jaskaran31
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Programming, Data Structures and Algorithms Course

This course is designed to make thought process of the attendee more logical. Approach of the course is
question based. Following are indicative of the basic theories which will help in reaching to optimum
solution of questions presented.

Module 1: Basics
Variables, operators & expressions
Conditional statements
Loops
Arrays
Pointers
Functions
Running time of a program
Computing time complexity

Module 2: Application of basics
Searching: Linear and Binary
Sorting I: Insertion, Merge
Sorting II: Counting, Radix
Structures and User-defined data types
Brief introduction to C++: Classes and objects

Module 3: Data Structures
Lists
Stacks: Last In First Out
Queues: First In First Out
Trees
Heaps
Graphs and Representation
Strings
Boyer-Moore String Matching Algorithm

Module 4: Algorithms
Greedy algorithms
Dynamic programming
Matrix Chain Multiplication
Dijkstra's Algorithm

PS: Module 4 is an advanced level course. This will be covered depending on the students interest and
their performance in tests.

You might also like