Introduction to Data Structures I
Lynchburg College Computer Science
Click to see Table of Contents

A study of data structures, algorithms and abstraction and they relate to the efficient storage and retrieval of data in digital computers. Topics may include sorting, searching, lists, queues, stacks, trees, graphs, networks, hashing, key structures, file structures as well as techniques of object-oriented analysis and structured programming.

    By the end of the course students will
  1. Understand structured, object-oriented programming concepts
  2. Have a intermediate knowledge of the C++ language
  3. Be proficient in the use of subprograms to write complete, structured C++ programs and libraries.
  4. Know common debugging techniques applicable to any language.
  5. Understand the mathematical concepts required to create, analyze and use data structures.
  6. Know how to utilize elementary data structures to solve problems.

The text for the course this semester is Data Structures and Algorithms in C++, Third Edition by Drozdek . The publisher is Thomson.

The course is being taught this semester by Prof. Constantine Roussos.
More information about the course and instructor is given below.
Course Resources
Course Syllabus Course Syllabus, Required and Recommended Materials, Grading Policies, etc..
Code of Conduct Code of Conduct for class meetings
Dr. Roussos' Schedule Contact information for Dr. Roussos
Resources Here are some C++ and Data Structures Resources on the Web
Discrete Math Selected Topics from Discrete Math
DataStructures Topics Selected Data Structures Topics
Assignments Programming and Homework Assignments
Labs Required Lab Exercises
Test Aids Study Guides, Tests, etc.
Software Engineering Goals Software Engineering Goals that we should strive to achieve when writing program code.
Tutor Available Help with CS-141 and CS-241 topics; especially C++


Study Guides, Sample Tests, etc.
Test #1 and test #1 topics A complete Test #1 and a list of possible test #1 topics
Test #2 and test #2 topics A complete Test #2
Test #3A complete Test #3
Final ExamA complete Final Exam
Practice Programs Using Recursion A Collection of Practice Programs that can be solved using recursion.



The Instructor

Constantine "Conny" Roussos

Dr. Roussos is a Professor of Computer Science and has been at Lynchburg College since 1981. He formerly served as Director of College Computing Services and Chair of the Computer Science Department. Dr. Roussos received a B.A. degree in mathematics from Old Dominion University, an M.S. degree in mathematics from the College of William and Mary, and a Ph.D. in computer science from the University of Virginia.

For further information review Dr. Roussos' resume.



Top of this page   Top of page      Home page   Home page