Introduction to Data Structures II
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 the mathematical concepts required to create, analyze and use data structures.
  2. Know how to utilize elementary data structures to solve problems.
  3. Be familiar with the implementation and applications of general trees and graphs.
  4. Program a variety of efficient sorting algorithms.
  5. Implement efficient searching algorithms.
  6. Solve elementary recurrence relations.
  7. Be familiar with indexing techniques such as B+ trees.
  8. Utilize advanced techniques of lists and arrays.
  9. Understand the theoretical limits to computation and NP completeness.

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 Sample Tests
Practice Programs Using Recursion A Collection of Practice Programs that can be solved using recursion.
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++
FREE online text books and courses from ACM ACM members are entitled to access to FREE online text books. The ACM Professional Development Center lists nearly 400 such books. These are high quality, professionally written books that cover most CS topics from C++ to Data Structures to HTML. Student Lite membership is only $19 and includes access to all the books and courses in the Professional Development Center as well as a print subscription to Crossroads and online access to CACM, with the email alert service Student Pointers, plus Guide access.
Apply at www.acm.org/membership/student/OnlineStudentApp.pdf


Sample Tests
Test #1 and current test #1 topics A complete Test #1 and a synopsis of current test #1 topics
Test #2 A complete Test #2
Test #3Topics for Test #3
Final ExamA complete Final Exam

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