CIS3355: Business Data Structures in C/C++

Dr. Peeter J. Kirs

Fall, 2007

COBA Syllabi Policy Conformation


[ Home] [INFAQs] [Class Schedule] [Textbook] [Lecture Slides] [Additional Coverage] [Supplementary Material] [Evaluation Areas] [Course Submissions] [Student Information]


NOTE: Complete Course Information available at:

              This Syllabus Available at:


Instructor Office Hours:


1.              Monday (M) From 4:30 PM to 6:00 PM

2.              Tuesday and Thursday (TR) From 11:50 AM to 1:30 PM

Total Office Hours:  4.5


Instructor Contact Information:


1.              Office:  COBA Room 203

2.              Telephone: (915) 747 – 7733

3.              Email:

4.              Department Secretary: Ms. Mary Hernandez

5.              Secretary Telephone: (915) 747 - 7748

6.              Secretary Email:

7.              Department Fax: (915) 747 - 5126


Required Textbook and other material:


1.              Textbook:


Kirs, P.J., and Pflughoeft, K.A. “Abstract Data Structures for Business In C/C++”. Available for download at:


2.              Lecture Slides:


Kirs, P.J. Lecture Slides to Accompany Abstract Data Structures for Business In C/C++”. Available for download at:


3.              Additional Material:


Available for download at:





4.              Supplementary Material:


5.              Recommended Material:


“C++ for Business Programming, 1/e”, John C. Molluzzo, Pace University,

Prentice Hall, ISBN 0-13-577594-9


A good Reference Manual on C/C++


Dates for Submission of Assignments:


Note:  Actual Course schedule depends on the progress of the class. I would rather take more time to make sure you understand the material and cover less than hurry through all of the projected material.


*** Only if you have chosen this option




Items Due/Comments


Introduction (1˝)
Bits and Bytes (1˝)

Course Enrollment
Get Next set of Lecture Slides: Bits and Bytes
Get Next set of Lecture Slides:
Basic Data Types

Study, Study, Study!!!!


Bits and Bytes (1)
Basic Data Types (2)

Bits & Bytes Questions
Bits & Bytes Reference ***
Bits and Bytes Tutorials ***
Biography Submission
Bits & Bits On-Line Quiz
Get Next set of Lecture Slides: Intro to C/C++ Programming
Study, Study, Study!!!!


Introduction to C (6)

Basic Data Type Questions
Basic Data Type Reference Update***
Basic Data Types Tutorials***
Get Next set of Lecture Slides: RAM Allocation


Introduction to C (1˝)
Catch-up and Review (?)
Quiz 1 (1˝)

C/C++ Questions
C/C++ Reference Update***
C/C++ Tutorials***
Study, Study, Study!!!!


Project 1 Review (˝)
Lab Session  (1˝)
RAM Allocation  (1)

Study, Study, Study!!!!


RAM Allocation  (1˝)

Numeric Arrays (1)
Project 2 Review (1/2)

RAM Allocation Questions
RAM Allocation Reference Update***
RAM Allocation Tutorials***
Project 1
Get Next set of Lecture Slides: Numeric Arrays
Get Next set of Lecture Slides:
Study, Study, Study!!!!


Stacks and Queues
 ** If Time Allows
Numeric Arrays (2)
Strings (1)

String Questions
String Reference Update***
String Tutorial***
Numeric Array Questions
Numeric Array Reference Update***
Numeric Array Tutorials***
Get Next set of Lecture Slides: Structured Data Objects
Study, Study, Study!!!!


Structured Data Objects (1˝)
Catch-up and Review (?)
Quiz 2 (1˝)

Stacks and Queues Questions
Stacks and Queues Reference Updates***
Stacks and Queues Tutorials***
Project 2


Structured Data Objects (1˝)
Quiz 2 Review (1/2)
Project 3 Review (1/2)

Structured Data Object Questions
Structured Data Object Reference Update***
Structured Data Object Tutorial***
Mid-Term Evaluations
Get Next set of Lecture Slides: Searching and Sorting
Get Next set of Lecture Slides:
Linked Lists
Study, Study, Study!!!!


Searching and Sorting (1˝)
Linked Lists (1˝)

Searching and Sorting Questions
Searching and Sorting Reference Update***
Searching and Sorting Tutorials***
Project 3
Study, Study, Study!!!!


Spring Break!!

Relax, Relax, Relax!!!!


Linked Lists (2˝)
Project 4 Review (˝)

Linked list Questions
Linked list Reference Update***
Linked List Tutorials***
Study, Study, Study!!!!


Linked Lists (1˝)

Dynamic Memory Allocation (1˝)

Project 4
Get Next set of Lecture Slides: Dynamic Memory Allocation
Study, Study, Study!!!!


Dynamic Memory Allocation (˝)
Project 5 Review (˝)

Dynamic Memory Questions
Dynamic Memory Reference Update***
Dynamic Memory Allocation Tutorials***
Get Next set of Lecture Slides: Binary Trees
Study, Study, Study!!!!


Binary Trees  (2˝)
Catch-up and Review (?)

Binary Tree Questions
Binary Tree Tutorials***
Binary Tree Reference***


Quiz 3 (1˝)
Final Review (1˝)

Final Evaluations
Project 5


Final Exam (2˝)

Check The University's Final Exam Schedule !!!


Course Drop Deadline With An Automatic “W” : March 18th






60 %


8 %


8 %


8 %

On-Line Quizzes

1 %

Final Exam

15 %


100 %

Course Grading Scheme: 














UTEP Policy on Academic Integrity:


Academic Honesty. Academic integrity is at the core of the educational mission of the institution. Students are expected to conduct themselves with honesty and forthrightness in all academic and personal interactions within the University community. A student who enrolls at the University must conduct himself/herself in a manner compatible with the University’s function as an educational institution. Consequently, conduct that offends the core mission of education is strictly prohibited. Academic dishonesty is a general term for actions that are not representative of the student’s own work or in keeping with the directives of the faculty member assigning the course work. Some of the more common forms (not a comprehensive list) of academic dishonesty are: cheating, plagiarism, collusion, the substitution for credit of any work or materials that are attributable in whole or in part to another person, taking an examination for another person, any act designed to give unfair advantage to a student or the attempt to commit such acts.

Violations of University Policy: Official university policy states that all suspected cases of alleged academic dishonesty must be referred to the Dean of Students for investigation and appropriate disposition. Under the University of Texas System Reagents’ Rules, the Dean of Students has primary authority and responsibility for the administration of student discipline, including academic dishonesty. It is contrary to university policy for a faculty member to assign a disciplinary grade such as "F" or zero to an assignment, test, examination, or other course work as a sanction for admitted or suspected scholastic dishonesty in lieu of formally charging the student through the Dean of Students. Similarly, students are prohibited from proposing and/or entering into an arrangement with a faculty member to receive a grade of "F" or any other reduced grade in lieu of being charged with academic dishonesty. Disciplinary sanctions for proven academic dishonesty will range from disciplinary probation, to a failing grade on the test, paper, or course, to suspension or dismissal from the University, among other sanctions. All research papers, term papers, or other writing intensive assignments in this course must adhere to APA style. Students are expected to submit all papers with the appropriate citations, references, etc. If you are unsure of the parameters of this writing style, please contact the course instructor for further information. Style guides are available in the University Bookstore. Unless otherwise instructed, all assignments are to be done individually
Scholastic Dishonesty:
The University of Texas at El Paso prides itself on its standards of academic excellence. In all matters of intellectual pursuit, UTEP faculty and students must strive to achieve based on the quality of the work produced by the individual. In the classroom and in all other academic activities, students are expected to uphold the highest standards of academic integrity. Any form of scholastic dishonesty is an affront to the pursuit of knowledge and jeopardizes the quality of the degree awarded to all graduates of UTEP. Any student who commits an act of scholastic dishonesty is subject to discipline. Scholastic dishonesty includes, but is not limited to cheating, plagiarism, collusion, the submission for credit of any work or materials that are attributable in whole or in part to another person, talking an examination for another person, any act designed to give unfair advantage to a student or the attempt to commit such acts. Proven violations of the detailed regulations, as printed in the Handbook of Operating Procedures (HOP) and available in the Office of the Dean of Students, may result in sanctions ranging from disciplinary probation, to failing grades on the work in question, to failing grades in the course, to suspension or dismissal, among others. 


Course Prerequistes:  CIS 3235 Minimum Grade: D or CIS 2335 Minimum Grade: D


Course Objectives:




  To develop a Conceptual basis of Data Structures

  To understand Data Structure Usage in Business

  To understand the simplicity and complexity of Data Structures

  To conceptualize directions in technology for the future

  To synthesize material from a variety of sources



  To judge reliability, integrity, and accuracy of Strucures

  To determine the data types necessary to fulfill business requirements

  To design, analyze, and implement appropriate Data Structures

  To evaluate presentation of information



  Learn basics of C/C++

  Learn how to program the Data Structures Discussed

  Become familiar with a what Data Structures are most appropriate for a give situation

  Design and develop useful  Business Applications



  To translate ambiguity into operating Programs

  To translate complexity into simplicity

  To network electronically


Statement on Disability:


If you feel you may have a disability that requires accomodations, contact the Disabled Student Services Office at 747 – 5148, go to the Union Building, Room 106, or email