Santa Monica College

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Santa Monica College"

Transcription

1 Santa Monica College Course Outline For COMPUTER SCIENCE 20A, Data Structures With C Course Title: Data Structures With C Units: 3.00 Total Instructional Hours (usually 18 per unit): 54 Hours per week (full semester equivalent) in 3.00 In-Class Lab: 0 Arranged: Lecture: Date Submitted: May 2011 Date Updated: Transferability: Transfers to UC (pending review) IGETC Area: CSU GE Area: SMC GE Area: Degree Applicability: Prerequisite(s): CS 52 Pre/Corequisite(s): None Corequisite(s): None Skills Advisory(s): None I. Catalog Description This advanced programming course will use the C++ language to teach methods of representing and manipulating data within a computer. Topics include stacks, queues, trees, sorting, searching, modeling, and dynamically created storage spaces. Students will learn the problem solving skills necessary to write complex computer programs and to make important software design and maintainability decisions. Examples of Appropriate Text or Other Required Reading: (include all publication II. dates; for transferable courses at least one text should have been published within the last five years) 1. C++: Classes and Data Structures, Jeffrey S. Childs, Prentice-Hall 2007, ISBN: III. Course Objectives Upon completion of this course, the student will be able to: 1. Explain the essentials of abstract data types. 2. Develop C++ programs using the data structures presented in class. 3. Understand when to use and apply the different structures presented in class. 4. Analyze algorithms for efficiency and speed and suitability in diverse programming situations.

2 5. Practice software development techniques typically associate with large programming projects. IV. Methods of Presentation: Discussion, Lecture and Discussion, Other (Specify) Other Methods: PowerPoint demonstrations may be used to supplement lectures. Examples of problems and programming solutions will be provided with feedback when appropriate. Class discussions may be used to assess, clarify, and enhance student understanding. Lectures and discussions will focus on solving related problems from original statement to solution, demonstrate and analyze existing problem solutions through flowcharting and tracing, and discuss the strengths and weaknesses of different algorithms. Assignments and quizzes will be explained via presentation and clarified by and one-on-one discussion as needed. V. Course Content % of course 5% Topic Review Of C++ And Object-Oriented Programming Concepts 5% Templatized C++ Class Concepts And Ideas 5% Design of data structures, related software documentation and testing. 10% Algorithm Analysis, Asymptotic notation And Big-O and Big-Omega 10% Linked Lists, Iterators, Stacks And Queues 10% Binary Trees and Binary Tree Traversal 10% Binary Search Trees, AVL Trees, Red-Black Trees and Binary Search Tree Traversal 5% File Compression and Huffman Code Trees 5% Recursive Structures 5% Heaps and Priority Queues 10% Sorting 10% Hashing 5% Graphs and Graph-Path Problems 5% Dynamic Programming 100% Total

3 VI. Methods of Evaluation: (Actual point distribution will vary from instructor to instructor but approximate values are shown.) Percentage Evaluation Method 15 % Quizzes 15 % Midterm exams 30 % Final exam 40 % Other - 8 Assignments 100 % Total VII. Sample Assignments: CS 20 A Assignment 7 Linked List In this assignment you will develop an existing linked list further and use it to store objects of Employee class from assignment 1. Upgrade your Employee class from Assignment 1 as follows: 1. Add a virtual destructor. No code needed inside the body of the destructor. 2. Overload the extraction operator istream operator >> to read employee directly. 3. Overload the insertion operator ostream operator <<to print employee directly to console or file. The code inside this will be similar to the code you may have used in assignment1 to print the employee to file. 4. Add a member function getemployee. Model it similar to the getlist function of NameList class taught in chapter five on pointer applications. 5. Make sure that class Employee is in file Employee.h and function definitions are in Employee.cpp file. 6. Overload the following relational operators also for Employee class based on last name only: <, >, <=, >=, ==,!= 7. Provide following one additional member function: const string tostring( ) const ; This function would convert and return all employee data in string form. See at the end as how to conveniently convert from numeric to string in C++. (Java technique of just using + operator will not work here). 8. Test to make sure that all member functions and constructors work properly. Use of tostring function will help you in testing. Modify the code for addbefore functions for templated SinglyLinkedList class provided by me as follows: void SinglyLinkedList<Type>::addBefore(Type obj, Type target) if(contains(target) &&!contains(obj))

4 const Node<Type> * itemnode1 = getnode(target); Node<Type> * itemnode = const_cast<node<type> * >(itemnode1); Node<Type> * newnode = new Node<Type>(obj, itemnode); counter++; if(head == itemnode) Head = newnode; else const Node<Type> * beforenode1 = nodebefore(itemnode); Node<Type> * beforenode = const_cast<node<type> * >(beforenode1); beforenode->next = newnode; num_elements++; Notice that compared to previous code a const_cast is required to remove compile error, which will show up in some cases and not in the other cases. Add a member function addinorder to SinglyLinkedList class whose description and details are as follows: Adds item to the list in a lexicographical order. The following operators must be overloaded for the template parameter Item: ==, <, >, <=, >=,!= Allows duplicates to be added to the list. void SinglyLinkedList<Type>::addInOrder(Type Item) If user only uses addinorder to add nodes to the SinglyLinkedList then all list items are in sorted order based on lexicographical order defined by its overloaded relational operators. Complete implementation of following missing member functions from SinglyLinkedList class (See the header file for description of each): ///////////////////////////////////////////////////////////////// //Compelete below as part of Lab7 ///////////////////////////////////////////////////////////////// const SinglyLinkedList<Type> operator + (const SinglyLinkedList<Type> & List1, const SinglyLinkedList<Type>& List2) SinglyLinkedList<Type> temp; *Fill data from List1 and List2 into temp. Use addfront method to add to

5 *temp. return temp; //////////////////////////////////////////////////////////////////////// void SinglyLinkedList<Type>::removeAfter(Type target) //Complete ////////////////////////////////////////////////////////////////// void SinglyLinkedList<Type>::removeBefore(Type target) //Complete ////////////////////////////////////////////////////////////////// void SinglyLinkedList<Type>::copy(const SinglyLinkedList<Type>& Other) //Complete ////////////////////////////////////////////////////////////////// Then build a linked list of your Employee objects and print the list to console and file the way you did in assignment 1. Include code or stand alone helper functions to add employees to list or delete employees from the list. In addition the main function should do followimgs: 1. Ask user the employee list file name. 2. Store employees in the linked list. (use addinorder function only). 3. While reading the file, determine employee with illegal code and ask user to provide for the correct code then calculate correct salary. 4. Print the List to an output file as well as to console. ////////////////////////////////////////////////////////////////////////////////// C++ code for converting numerics to string and vice versa; #include <iostream> #include <string> #include <sstream> using namespace std; int main() int age = 30; ostringstream os;

6 os<<age; string ag = os.str(); string data = "Your age is " + ag +'\n'; cout<<data; //Parsing string back to numeric type //You must know what type it was to begin with //step 1. Call the constructor of istringstream class istringstream is(ag); int age2; //step 2. Read into age2 the value stored in object is is>>age2; cout<<age2<<endl;//output to console return 0; /*output from this program is Your age is CS20A : Assignment 8 The purpose of this program is to read a text file and store words and the line numbers on which they occur, to be printed to another text file and screen. You must use a Binary search tree as well as any other data structure needed. Proceed as follows: 1. Design a class called WordList, which is given below partially. You will need to add to it as per need of the program. Class WordList private: *Stores the word from text file string Word; *Stores the line numbers (as integers) on which the Word is found SinglyLinkedList LineNumList; //Add any other data members as per your need. public: *Reads data from the file or keyboard to fill the WordList object friend istream & operator >>(istream & in, WordList& WL); *Writes data to the file or to screen to print the WordList object

7 friend ostream & operator <<(ostream & out, const WordList& WL); *Virtual destructor //Add any other member functions, as you need. For example, you //will need to overload the following operators, so that WordList //can be placed in a binary search tree: operators >, <, and ==. ; Insert WordList objects into the Binary search tree such that when printing the tree, using an In-order iterator, the words are printed alphabetically and right after the word, the line numbers on which they occur in the text file are also printed. The user should be allowed to search the binary search tree for the words in there and print the words and its line numbers if it exists. Feel free to add any new member functions or write stand-alone functions to the data structure classes you use. Only restriction is that you cannot remove any data members or existing member functions from the data structure classes you use and you cannot alter the access restrictions already placed. (For example, you cannot make the private members public). Use the string Word as the comparison key to build binary search tree. I give you freedom to organize the files as you wish. Only restriction is that the driver program file should have no classes defined in it. Planning is very important for this project, therefore ask yourself the following questions and get answers to them. 1. Which classes would I need and how would I organize them in different files. 2. How would I test the member functions of my WordList class as I write them? 3. What stand-alone member functions would I need to write and how would I test them? 4. What strategy would I use to filter out the non-words from the file (such as comma, period, and other symbols) so that they are not read as words? 5. What strategy would I use so that once a word is read and first line number in which it occurs is recorded; for later occurrences, only its line number is entered in the linked list? 6. How would I modularize my class member functions and stand-alone functions the best? 7. What program bugs am I most prone to, and how would I avoid them? Allocate time for each step so that you get done before the due date. Member and other functions needed VIII. - Student Learning Outcomes 1. Understand the impact and influence that various design decisions have in the

8 run-time cost of different computer programs. As assessed by: projects, midterm and final exams 2. Use and apply the different data structures presented in class by practicing the software techniques associated with large programming projects. As assessed by: projects, midterm and final exams.

El Dorado Union High School District Educational Services

El Dorado Union High School District Educational Services El Dorado Union High School District Course of Study Information Page Course Title: ACE Computer Programming II (#495) Rationale: A continuum of courses, including advanced classes in technology is needed.

More information

Santa Monica College

Santa Monica College Santa Monica College Course Outline For BUSINESS 1, Introduction To Business Course Title: Introduction To Business Units: 3.00 Total Instructional Hours (usually 18 per unit): 54 Hours per week (full

More information

PES Institute of Technology-BSC QUESTION BANK

PES Institute of Technology-BSC QUESTION BANK PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions

More information

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Questions 1 through 25 are worth 2 points each. Choose one best answer for each. Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in

More information

Introduction to Programming System Design. CSCI 455x (4 Units)

Introduction to Programming System Design. CSCI 455x (4 Units) Introduction to Programming System Design CSCI 455x (4 Units) Description This course covers programming in Java and C++. Topics include review of basic programming concepts such as control structures,

More information

UTSA Department of Electrical and Computer Engineering EE 3223 - C++ Data Structures Syllabus Fall 2015 Part A - Course Outline

UTSA Department of Electrical and Computer Engineering EE 3223 - C++ Data Structures Syllabus Fall 2015 Part A - Course Outline UTSA EE 3223 - C++ Data Structures Syllabus Fall 2015 Part A - Course Outline Catalog Description: 3 hours credit. Review of C/C++ non-object oriented programming concepts. Object-oriented programming

More information

KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

KITES TECHNOLOGY COURSE MODULE (C, C++, DS) KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL

More information

DATA STRUCTURES USING C

DATA STRUCTURES USING C DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give

More information

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate

More information

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we learned about the ADT Priority Queue. A

More information

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 233 INTRODUCTION TO PHP

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 233 INTRODUCTION TO PHP RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 233 INTRODUCTION TO PHP I. Basic Course Information A. Course Number and Title: CISY 233 Introduction to PHP B. New or Modified Course: Modified

More information

CpSc212 Goddard Notes Chapter 6. Yet More on Classes. We discuss the problems of comparing, copying, passing, outputting, and destructing

CpSc212 Goddard Notes Chapter 6. Yet More on Classes. We discuss the problems of comparing, copying, passing, outputting, and destructing CpSc212 Goddard Notes Chapter 6 Yet More on Classes We discuss the problems of comparing, copying, passing, outputting, and destructing objects. 6.1 Object Storage, Allocation and Destructors Some objects

More information

Using Web-based Tools to Enhance Student Learning and Practice in Data Structures Course

Using Web-based Tools to Enhance Student Learning and Practice in Data Structures Course Using Web-based Tools to Enhance Student Learning and Practice in Data Structures Course 1. Introduction Chao Chen January 2014 The purpose of this project is to enhance student learning and practice in

More information

1 2-3 Trees: The Basics

1 2-3 Trees: The Basics CS10: Data Structures and Object-Oriented Design (Fall 2013) November 1, 2013: 2-3 Trees: Inserting and Deleting Scribes: CS 10 Teaching Team Lecture Summary In this class, we investigated 2-3 Trees in

More information

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION Tao Chen 1, Tarek Sobh 2 Abstract -- In this paper, a software application that features the visualization of commonly used

More information

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science

RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE. CISY 105 Foundations of Computer Science I. Basic Course Information RARITAN VALLEY COMMUNITY COLLEGE ACADEMIC COURSE OUTLINE CISY 105 Foundations of Computer Science A. Course Number and Title: CISY-105, Foundations of Computer Science B. New

More information

Chapter 14 The Binary Search Tree

Chapter 14 The Binary Search Tree Chapter 14 The Binary Search Tree In Chapter 5 we discussed the binary search algorithm, which depends on a sorted vector. Although the binary search, being in O(lg(n)), is very efficient, inserting a

More information

Sample Syllabus (C++) CSCI 1301 Introduction to Programming Principles

Sample Syllabus (C++) CSCI 1301 Introduction to Programming Principles Sample Syllabus (C++) CSCI 1301 Introduction to Programming Principles Knowledge Areas that contain topics and learning outcomes covered in the course Knowledge Areas Total Hours of Coverage Software Development

More information

Curriculum Map. Discipline: Computer Science Course: C++

Curriculum Map. Discipline: Computer Science Course: C++ Curriculum Map Discipline: Computer Science Course: C++ August/September: How can computer programs make problem solving easier and more efficient? In what order does a computer execute the lines of code

More information

Bhakta Kavi Narsinh Mehta University, Junagadh

Bhakta Kavi Narsinh Mehta University, Junagadh Bhakta Kavi Narsinh Mehta University, Junagadh Draft Syllabus for B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1) Effective From June - 2016 B.Sc. (C.S.) (Semester - 1) CS-101:

More information

CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards

CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards Course Title: TeenCoder: Java Programming Course ISBN: 978 0 9887070 2 3 Course Year: 2015 Note: Citation(s) listed may represent

More information

Lecture 9. Semantic Analysis Scoping and Symbol Table

Lecture 9. Semantic Analysis Scoping and Symbol Table Lecture 9. Semantic Analysis Scoping and Symbol Table Wei Le 2015.10 Outline Semantic analysis Scoping The Role of Symbol Table Implementing a Symbol Table Semantic Analysis Parser builds abstract syntax

More information

12 Abstract Data Types

12 Abstract Data Types 12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).

More information

Fundamentals of Computer Programming CS 101 (3 Units)

Fundamentals of Computer Programming CS 101 (3 Units) Fundamentals of Computer Programming CS 101 (3 Units) Overview This course introduces students to the field of computer science and engineering. An overview of the disciplines within computer science such

More information

CS 2302 Data Structures Spring 2015

CS 2302 Data Structures Spring 2015 1. General Information Instructor: CS 2302 Data Structures Spring 2015 Olac Fuentes Email: ofuentes@utep.edu Web: www.cs.utep.edu/ofuentes Office hours: Tuesdays and Thursdays 2:00-3:30, or by appointment,

More information

Data Structures Using Java

Data Structures Using Java Data Structures Using Java D. S. Malik P. S. Nair THOMSON COURSE TECHNOLOGY Australia Canada Mexico Singapore Spain United Kingdom United States TABLE OF Contents PREFACE XXV 1.Software Engineering Principles

More information

Data Structures and Algorithms Written Examination

Data Structures and Algorithms Written Examination Data Structures and Algorithms Written Examination 22 February 2013 FIRST NAME STUDENT NUMBER LAST NAME SIGNATURE Instructions for students: Write First Name, Last Name, Student Number and Signature where

More information

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and: Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)

More information

BCS2B02: OOP Concepts and Data Structures Using C++

BCS2B02: OOP Concepts and Data Structures Using C++ SECOND SEMESTER BCS2B02: OOP Concepts and Data Structures Using C++ Course Number: 10 Contact Hours per Week: 4 (2T + 2P) Number of Credits: 2 Number of Contact Hours: 30 Hrs. Course Evaluation: Internal

More information

PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?

PART-A Questions. 2. How does an enumerated statement differ from a typedef statement? 1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members

More information

LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013. Syllabus

LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013. Syllabus LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013 Instructor: Valerie Chu, Ph.D. Office Room: GOH 400D Office Phone: (901) 435-1378 Office Hours:

More information

Binary Search Trees CMPSC 122

Binary Search Trees CMPSC 122 Binary Search Trees CMPSC 122 Note: This notes packet has significant overlap with the first set of trees notes I do in CMPSC 360, but goes into much greater depth on turning BSTs into pseudocode than

More information

Symbol Tables. Introduction

Symbol Tables. Introduction Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The

More information

OBJECT ORIENTED PROGRAMMING IN C++

OBJECT ORIENTED PROGRAMMING IN C++ OBJECT ORIENTED PROGRAMMING IN C++ For Off Campus BSc Computer Science Programme UNIT 1 1. The goal of programmers is to develop software that are. A. Correct B. Reliable and maintainable C. Satisfy all

More information

Santa Monica College

Santa Monica College Santa Monica College Course Outline For FILM STUDIES 50, Production Sound Course Title: Production Sound Units: 3.00 Total Instructional Hours (usually 18 per unit): 90 Hours per week (full semester equivalent)

More information

Binary Trees and Huffman Encoding Binary Search Trees

Binary Trees and Huffman Encoding Binary Search Trees Binary Trees and Huffman Encoding Binary Search Trees Computer Science E119 Harvard Extension School Fall 2012 David G. Sullivan, Ph.D. Motivation: Maintaining a Sorted Collection of Data A data dictionary

More information

School of Computing and Information Sciences. Course Title: Computer Programming III Date: April 9, 2014

School of Computing and Information Sciences. Course Title: Computer Programming III Date: April 9, 2014 Course Title: Computer Date: April 9, 2014 Course Number: Number of Credits: 3 Subject Area: Programming Subject Area Coordinator: Tim Downey email: downeyt@cis.fiu.edu Catalog Description: Programming

More information

AP Computer Science AB Syllabus 1

AP Computer Science AB Syllabus 1 AP Computer Science AB Syllabus 1 Course Resources Java Software Solutions for AP Computer Science, J. Lewis, W. Loftus, and C. Cocking, First Edition, 2004, Prentice Hall. Video: Sorting Out Sorting,

More information

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The

More information

Programming Fundamental. Instructor Name: Lecture-2

Programming Fundamental. Instructor Name: Lecture-2 Programming Fundamental Instructor Name: Lecture-2 Today s Lecture What is Programming? First C++ Program Programming Errors Variables in C++ Primitive Data Types in C++ Operators in C++ Operators Precedence

More information

02-201: Programming for Scientists

02-201: Programming for Scientists 1. Course Information 1.1 Course description 02-201: Programming for Scientists Carl Kingsford Fall 2015 Provides a practical introduction to programming for students with little or no prior programming

More information

An Incomplete C++ Primer. University of Wyoming MA 5310

An Incomplete C++ Primer. University of Wyoming MA 5310 An Incomplete C++ Primer University of Wyoming MA 5310 Professor Craig C. Douglas http://www.mgnet.org/~douglas/classes/na-sc/notes/c++primer.pdf C++ is a legacy programming language, as is other languages

More information

CS 300 Data Structures Syllabus - Fall 2014

CS 300 Data Structures Syllabus - Fall 2014 CS 300 Data Structures Syllabus - Fall 2014 Catalog Description Data structures are fundamental to advanced, efficient programming. Topics including asymptotic analysis, stacks, queues, linked lists, trees,

More information

CSE 303 Concepts and Tools for Software Development. Magdalena Balazinska Winter 2010 Lecture 19 Inheritance (virtual functions and abstract classes)

CSE 303 Concepts and Tools for Software Development. Magdalena Balazinska Winter 2010 Lecture 19 Inheritance (virtual functions and abstract classes) CSE 303 Concepts and Tools for Software Development Magdalena Balazinska Winter 2010 Lecture 19 Inheritance (virtual functions and abstract classes) Where We Are We have already covered the introduction

More information

Lecture 11 Doubly Linked Lists & Array of Linked Lists. Doubly Linked Lists

Lecture 11 Doubly Linked Lists & Array of Linked Lists. Doubly Linked Lists Lecture 11 Doubly Linked Lists & Array of Linked Lists In this lecture Doubly linked lists Array of Linked Lists Creating an Array of Linked Lists Representing a Sparse Matrix Defining a Node for a Sparse

More information

DIABLO VALLEY COLLEGE CATALOG 2014-2015

DIABLO VALLEY COLLEGE CATALOG 2014-2015 COMPUTER SCIENCE COMSC The computer science department offers courses in three general areas, each targeted to serve students with specific needs: 1. General education students seeking a computer literacy

More information

PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON

PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON PROBLEM SOLVING WITH SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON Addison Wesley Boston San Francisco New York London

More information

CS A250 (CRN 20690-25399) C++ Programming Language 2. Syllabus Fall 2015

CS A250 (CRN 20690-25399) C++ Programming Language 2. Syllabus Fall 2015 CS A250 (CRN 20690-25399) C++ Programming Language 2 Syllabus Fall 2015 Instructor: Gabriela Ernsberger E-mail: gernsberger@occ.cccd.edu Course Web site: www.thisclass.info Office: MB Computing Center

More information

Inheritance and Virtual Functions. Linked lists.

Inheritance and Virtual Functions. Linked lists. Inheritance and Virtual Functions. Linked lists. 26th CS427 Lecture 12.2, 11am, 22nd March 2012 CS427 Inheritance and Virtual Functions. Linked lists. 1/27 In today s class 1 Recall... Inheritance 2 Replacing

More information

Java Application Developer Certificate Program Competencies

Java Application Developer Certificate Program Competencies Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle

More information

Data Structures Using C++ 2E. Chapter 5 Linked Lists

Data Structures Using C++ 2E. Chapter 5 Linked Lists Data Structures Using C++ 2E Chapter 5 Linked Lists Test #1 Next Thursday During Class Cover through (near?) end of Chapter 5 Objectives Learn about linked lists Become aware of the basic properties of

More information

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. 1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D. base address 2. The memory address of fifth element of an array can be calculated

More information

GET 114 Computer Programming Course Outline. Contact: craig.west@rdc.ab.ca Office Hours: TBD 403.342.3415 (or by appointment)

GET 114 Computer Programming Course Outline. Contact: craig.west@rdc.ab.ca Office Hours: TBD 403.342.3415 (or by appointment) GET 114 Computer Programming Course Outline Electrical Engineering Technology Fall 2015 Instructor: Craig West Office: 2915-11 Contact: craig.west@rdc.ab.ca Office Hours: TBD 403.342.3415 (or by appointment)

More information

Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s Quiz 4 Solutions Q1: What value does function mystery return when called with a value of 4? int mystery ( int number ) { if ( number

More information

10CS35: Data Structures Using C

10CS35: Data Structures Using C CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions - a conventional tool for handling a

More information

Glossary of Object Oriented Terms

Glossary of Object Oriented Terms Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction

More information

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) -----------------------------------------

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) ----------------------------------------- =============================================================================================================================== DATA STRUCTURE PSEUDO-CODE EXAMPLES (c) Mubashir N. Mir - www.mubashirnabi.com

More information

Object-Oriented Programming. Lecture 8 Dr Piotr Cybula

Object-Oriented Programming. Lecture 8 Dr Piotr Cybula Object-Oriented Programming Lecture 8 Dr Piotr Cybula Standard Template Library (STL) input/output streams: iostream, fstream, sstream, iomanip string management: string standard

More information

Data Structure [Question Bank]

Data Structure [Question Bank] Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:

More information

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION 2008-10-23/5:15-6:45 REC-200, EVI-350, RCH-106, HH-139 Instructions: No aides. Turn off all electronic media and store them under your desk. If

More information

Binary Heap Algorithms

Binary Heap Algorithms CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell

More information

Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.

Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program. Name: Class: Date: Exam #1 - Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to

More information

An Introduction to Programming and Computer Science

An Introduction to Programming and Computer Science An Introduction to Programming and Computer Science Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts Copyright 1998 by

More information

Basic Programming and PC Skills: Basic Programming and PC Skills:

Basic Programming and PC Skills: Basic Programming and PC Skills: Texas University Interscholastic League Contest Event: Computer Science The contest challenges high school students to gain an understanding of the significance of computation as well as the details of

More information

Class Notes for CSCI 104: Data Structures and Object-Oriented Design

Class Notes for CSCI 104: Data Structures and Object-Oriented Design Class Notes for CSCI 104: Data Structures and Object-Oriented Design David Kempe and the awesome Fall 2013 sherpas August 12, 2016 2 Preface These lecture notes grew out of class notes provided for the

More information

TAMALPAIS UNION HIGH SCHOOL DISTRICT Larkspur, California. Course of Study COMPUTER PROGRAMMING 1-6

TAMALPAIS UNION HIGH SCHOOL DISTRICT Larkspur, California. Course of Study COMPUTER PROGRAMMING 1-6 TAMALPAIS UNION HIGH SCHOOL DISTRICT Larkspur, California Course of Study COMPUTER PROGRAMMING 1-6 I. INTRODUCTION Computer Programming 1-6 is a sequence of one semester elective courses. The format allows

More information

Integrating the C++ Standard Template Library Into the Undergraduate Computer Science Curriculum

Integrating the C++ Standard Template Library Into the Undergraduate Computer Science Curriculum Integrating the C++ Standard Template Library Into the Undergraduate Computer Science Curriculum James P. Kelsh James.Kelsh@cmich.edu Roger Y. Lee lee@cps.cmich.edu Department of Computer Science Central

More information

Structural Design Patterns Used in Data Structures Implementation

Structural Design Patterns Used in Data Structures Implementation Structural Design Patterns Used in Data Structures Implementation Niculescu Virginia Department of Computer Science Babeş-Bolyai University, Cluj-Napoca email address: vniculescu@cs.ubbcluj.ro November,

More information

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:

A binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and: 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will) and the general binary

More information

Ordered Lists and Binary Trees

Ordered Lists and Binary Trees Data Structures and Algorithms Ordered Lists and Binary Trees Chris Brooks Department of Computer Science University of San Francisco Department of Computer Science University of San Francisco p.1/62 6-0:

More information

The C Programming Language course syllabus associate level

The C Programming Language course syllabus associate level TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming

More information

RARITAN VALLEY COMMUNITY COLLEGE COURSE OUTLINE. CISY 103 Computer Concepts and Programming

RARITAN VALLEY COMMUNITY COLLEGE COURSE OUTLINE. CISY 103 Computer Concepts and Programming RARITAN VALLEY COMMUNITY COLLEGE COURSE OUTLINE CISY 103 Computer Concepts and Programming I. Basic Course Information A. Course Number and Title: CISY-103, Computer Concepts and Programming B. New or

More information

Object-Oriented Programming, Iouliia Skliarova

Object-Oriented Programming, Iouliia Skliarova Object-Oriented Programming, Iouliia Skliarova Data types define the way you use the storage (memory) in the programs. By specifying a data type, you tell the sompiler how to create a particular piece

More information

Domains and Competencies

Domains and Competencies Domains and Competencies DOMAIN I TECHNOLOGY APPLICATIONS CORE Standards Assessed: Computer Science 8 12 I VII Competency 001: The computer science teacher knows technology terminology and concepts; the

More information

Binary Search Trees (BST)

Binary Search Trees (BST) Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search

More information

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: 3330704)

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: 3330704) GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT Course Curriculum DATA STRUCTURES (Code: 3330704) Diploma Programme in which this course is offered Semester in which offered Computer Engineering,

More information

Introduction to Data Structures

Introduction to Data Structures Introduction to Data Structures Albert Gural October 28, 2011 1 Introduction When trying to convert from an algorithm to the actual code, one important aspect to consider is how to store and manipulate

More information

Chapter 3: Restricted Structures Page 1

Chapter 3: Restricted Structures Page 1 Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both

More information

WORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER

WORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER WORKSPACE WEB DEVELOPMENT & OUTSOURCING TRAINING CENTER Course Outline (2015) Basic Programming With Procedural & Object Oriented Concepts (C, C++) Training Office# Road: 11, House: 1 A, Nikunja 2, Khilkhet,

More information

Online Course Syllabus CS320: C Programming

Online Course Syllabus CS320: C Programming Online Course Syllabus CS320: C Programming Important Notes: This document provides an overview of expectations for this online course and is subject to change prior to the term start. Changes may also

More information

Pseudo code Tutorial and Exercises Teacher s Version

Pseudo code Tutorial and Exercises Teacher s Version Pseudo code Tutorial and Exercises Teacher s Version Pseudo-code is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy

More information

The Online Grade Book A Case Study in Learning about Object-Oriented Database Technology

The Online Grade Book A Case Study in Learning about Object-Oriented Database Technology The Online Grade Book A Case Study in Learning about Object-Oriented Database Technology Charles R. Moen, M.S. University of Houston - Clear Lake crmoen@juno.com Morris M. Liaw, Ph.D. University of Houston

More information

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 603 203 DEPARTMENT OF COMPUTER APPLICATIONS QUESTION BANK IN REVISED BLOOM S TAXONOMY

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 603 203 DEPARTMENT OF COMPUTER APPLICATIONS QUESTION BANK IN REVISED BLOOM S TAXONOMY ACADEMIC YEAR: 0 7 VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANKULATHUR 0 0 SEMESTER: ODD BRANCH: MCA YEAR: I SEMESTER: I SUBJECT CODE AND NAME: MC70 Problem Solving and Programming NAME OF THE FACULTY

More information

Algorithms and Data Structures Written Exam Proposed SOLUTION

Algorithms and Data Structures Written Exam Proposed SOLUTION Algorithms and Data Structures Written Exam Proposed SOLUTION 2005-01-07 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are

More information

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation

Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm

More information

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes. 1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The

More information

Converting a Number from Decimal to Binary

Converting a Number from Decimal to Binary Converting a Number from Decimal to Binary Convert nonnegative integer in decimal format (base 10) into equivalent binary number (base 2) Rightmost bit of x Remainder of x after division by two Recursive

More information

RARITAN VALLEY COMMUNITY COLLEGE COMPUTER SCIENCE (CS) DEPARTMENT. CISY 102 - Computer Literacy

RARITAN VALLEY COMMUNITY COLLEGE COMPUTER SCIENCE (CS) DEPARTMENT. CISY 102 - Computer Literacy I. Basic Course Information RARITAN VALLEY COMMUNITY COLLEGE COMPUTER SCIENCE (CS) DEPARTMENT CISY 102 - Computer Literacy A. Course Number and Title: CISY-102, Computer Literacy B. Date of Proposal or

More information

NEW YORK CITY COLLEGE OF TECHNOLOGY/CUNY Computer Systems Technology Department

NEW YORK CITY COLLEGE OF TECHNOLOGY/CUNY Computer Systems Technology Department NEW YORK CITY COLLEGE OF TECHNOLOGY/CUNY Computer Systems Technology Department COURSE: CST1201 Programming Fundamentals (2 class hours, 2 lab hours, 3 credits) Course Description: This course is an intensive

More information

L - Standard Letter Grade P - Pass/No Pass Repeatability: N - Course may not be repeated

L - Standard Letter Grade P - Pass/No Pass Repeatability: N - Course may not be repeated Course: MATH 26 Division: 10 Also Listed As: 200930, INACTIVE COURSE Short Title: Full Title: DISCRETE MATHEMATIC Discrete Mathematics Contact Hours/Week Lecture: 4 Lab: 0 Other: 0 Total: 4 4 Number of

More information

Linked List as an ADT (cont d.)

Linked List as an ADT (cont d.) Linked List as an ADT (cont d.) Default constructor Initializes list to an empty state Destroy the list Deallocates memory occupied by each node Initialize the list Reinitializes list to an empty state

More information

UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE

UNIVERSITI MALAYSIA SARAWAK KOTA SAMARAHAN SARAWAK PSD2023 ALGORITHM & DATA STRUCTURE STUDENT IDENTIFICATION NO UNIVERSITI MALAYSIA SARAWAK 94300 KOTA SAMARAHAN SARAWAK FAKULTI SAINS KOMPUTER & TEKNOLOGI MAKLUMAT (Faculty of Computer Science & Information Technology) Diploma in Multimedia

More information

Do not open this examination paper until instructed to do so. Section A: answer all the questions. Section B: answer all the questions.

Do not open this examination paper until instructed to do so. Section A: answer all the questions. Section B: answer all the questions. N10/5/COMSC/HP1/ENG/TZ0/XX 88107011 Computer science HIGHER level Paper 1 Tuesday 16 November 2010 (afternoon) 2 hours 15 minutes INSTRUCTIONS TO CANDIDATES Do not open this examination paper until instructed

More information

To My Parents -Laxmi and Modaiah. To My Family Members. To My Friends. To IIT Bombay. To All Hard Workers

To My Parents -Laxmi and Modaiah. To My Family Members. To My Friends. To IIT Bombay. To All Hard Workers To My Parents -Laxmi and Modaiah To My Family Members To My Friends To IIT Bombay To All Hard Workers Copyright 2010 by CareerMonk.com All rights reserved. Designed by Narasimha Karumanchi Printed in

More information

AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm

AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm AS-2261 M.Sc.(First Semester) Examination-2013 Paper -fourth Subject-Data structure with algorithm Time: Three Hours] [Maximum Marks: 60 Note Attempts all the questions. All carry equal marks Section A

More information

Persistent Binary Search Trees

Persistent Binary Search Trees Persistent Binary Search Trees Datastructures, UvA. May 30, 2008 0440949, Andreas van Cranenburgh Abstract A persistent binary tree allows access to all previous versions of the tree. This paper presents

More information

Canisius College Computer Science Department Computer Programming for Science CSC107 & CSC107L Fall 2014

Canisius College Computer Science Department Computer Programming for Science CSC107 & CSC107L Fall 2014 Canisius College Computer Science Department Computer Programming for Science CSC107 & CSC107L Fall 2014 Class: Tuesdays and Thursdays, 10:00-11:15 in Science Hall 005 Lab: Tuesdays, 9:00-9:50 in Science

More information

CompSci-61B, Data Structures Final Exam

CompSci-61B, Data Structures Final Exam Your Name: CompSci-61B, Data Structures Final Exam Your 8-digit Student ID: Your CS61B Class Account Login: This is a final test for mastery of the material covered in our labs, lectures, and readings.

More information

Java Software Structures

Java Software Structures INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition

More information

Introduction to Data Structures and Algorithms

Introduction to Data Structures and Algorithms Introduction to Data Structures and Algorithms Chapter: Elementary Data Structures(1) Lehrstuhl Informatik 7 (Prof. Dr.-Ing. Reinhard German) Martensstraße 3, 91058 Erlangen Overview on simple data structures

More information