# Data Structures and Programming

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Data Structures and Programming

2 John Edgar 2

3 Assignments and labs 30% Midterm exam in class 25% Final exam 45% John Edgar 3

4 Data Structures Algorithms Software Development Programming John Edgar 4

5 Data Structures and Abstract Data Types Stacks Queues Priority Queues Trees Graphs Hash Tables Algorithms Software Development Programming John Edgar 5

6 Data Structures Algorithms Tools Recursion Efficiency O Notation Algorithms to support data structures Sorting Software Development Programming John Edgar 6

7 Data Structures Algorithms Software Development Specification Design OOP design Implementation Testing Programming John Edgar 7

8 Data Structures Algorithms Software Development Programming Implementing data structures and algorithms Understanding stack and heap memory use Recursion Writing robust re-usable programs John Edgar 8

9 At the end of this course you should, for each of the data structures we cover, be able to Describe the operations Explain common implementations Implement in a programming language (C++) Compare with other data structures Recommend which data structure to use for a given problem John Edgar 9

10 At the end of this course you should, for each of the algorithms we cover, be able to Implement in a programming language (C++) Analyze running time and space requirements Compare with other algorithms of a similar nature John Edgar 10

11 At the end of this course you should be able to Write algorithms using recursion Understand the advantages of disadvantages of using recursive algorithms Implement data structures using both arrays and reference structures as the underlying structure Compare array and reference structure implementations Use features of the C++ language to write wellstructured programs John Edgar 11

12 At the end of this course you should be able to Understand and describe the mathematical basis of O notation Compute the O notation running time of algorithms Understand the limitations of O notation John Edgar 12

13 Develop problem solving techniques To take a problem statement And develop a computer program to solve the problem A solution consists of two components Algorithms Data storage John Edgar 13

14 Problem solving Use abstraction to design solutions Design modular programs Use recursion as a problem-solving strategy Provide tools for the management of data Identify abstract data types (ADTs) Examine applications that use the ADTs Construct implementations of the ADTs John Edgar 14

15 A good solution is cost effective We should minimize the cost of the software Running costs Resources (computing time and memory) Interaction costs (e.g. poor GUI may result in the loss of business) Costs related to errors (e.g. loss of customer information, storing incorrect data, etc.) Development and maintenance costs i.e. costs related to the software life cycle John Edgar 15

16 Well structured Modular Modifiable Written with good style Well documented Easy to use Efficient Able to degrade gracefully (fail-safe) Debugged John Edgar 16

17 Maintenance Specification Production Design Refinement Documentation Risk Analysis Testing Coding Verification John Edgar 17

18 Specification Understand the client s problem and requirements Ensure that the requirements are clear and complete and understood by all stakeholders Design Plan the implementation of the application s data and operations Plan the testing Risk Analysis Verification Ensure that algorithms are correct Ensure that the design satisfies the requirements (validation) Implementation John Edgar 18

19 Testing Verify that the code works and meets the client s requirements There are various types of testing, unit testing, integration testing, system testing, user acceptance testing Refining Production Package, distribute and install application and train users Maintenance Add features, and Fix bugs Documentation, which includes the user manual Common to all the phases of the life cycle John Edgar 19

20 We are primarily concerned with three phases of the life cycle Design Implementation Testing John Edgar 20

### 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

### 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

### University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011

University of Dayton Department of Computer Science Undergraduate Programs Assessment Plan DRAFT September 14, 2011 Department Mission The Department of Computer Science in the College of Arts and Sciences

### CSE373: Data Structures and Algorithms Lecture 1: Introduction; ADTs; Stacks/Queues. Linda Shapiro Spring 2016

CSE373: Data Structures and Algorithms Lecture 1: Introduction; ADTs; Stacks/Queues Linda Shapiro Registration We have 180 students registered and others who want to get in. If you re thinking of dropping

### Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent

### 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

### CSE373: Data Structures and Algorithms Lecture 1: Introduction; ADTs; Stacks/Queues. Nicki Dell Spring 2014

CSE373: Data Structures and Algorithms Lecture 1: Introduction; ADTs; Stacks/Queues Nicki Dell Spring 2014 Registration We have 140 students registered and 140+ on the wait list! If you re thinking of

### Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent

### 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

### MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES FIELD 050: COMPUTER SCIENCE

MICHIGAN TEST FOR TEACHER CERTIFICATION (MTTC) TEST OBJECTIVES Subarea Educational Computing and Technology Literacy Computer Systems, Data, and Algorithms Program Design and Verification Programming Language

### Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

EECS 281: Data Structures and Algorithms The Foundation: Data Structures and Abstract Data Types Computer science is the science of abstraction. Abstract Data Type Abstraction of a data structure on that

### 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:

### COMPUTER SCIENCE (5651) Test at a Glance

COMPUTER SCIENCE (5651) Test at a Glance Test Name Computer Science Test Code 5651 Time Number of Questions Test Delivery 3 hours 100 selected-response questions Computer delivered Content Categories Approximate

### 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

### 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

### 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,

### 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

### Course Descriptions. CS 101 Intro to Computer Science

Course Descriptions CS 101 Intro to Computer Science An introduction to computer science concepts and the role of computers in society. Topics include the history of computing, computer hardware, operating

### Texas Essential Knowledge and Skills Correlation to Video Game Design Foundations 2011 N130.0993. Video Game Design

Texas Essential Knowledge and Skills Correlation to Video Game Design Foundations 2011 N130.0993. Video Game Design STANDARD CORRELATING PAGES Standard (1) The student demonstrates knowledge and appropriate

### 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

### Computer Science 210: Data Structures. Introduction

Computer Science 210: Data Structures Introduction Welcome to Data Structures! Data structures are fundamental building blocks of algorithms and programs Csci 210 is a study of data structures abstract

### 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:

### Computer Science/Software Engineering

292 School of Science and Engineering Computer Science/Software Engineering Everald E. Mills, PhD, Chair Objectives The computer science program seeks to prepare students for careers that require sophisticated

### 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

### Eastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students

Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent

### 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,

### 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,

### 50 Computer Science MI-SG-FLD050-02

50 Computer Science MI-SG-FLD050-02 TABLE OF CONTENTS PART 1: General Information About the MTTC Program and Test Preparation OVERVIEW OF THE TESTING PROGRAM... 1-1 Contact Information Test Development

### 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

### Software Development: The Waterfall Model

Steven Zeil June 7, 2013 Contents 1 Software Development Process Models 2 1.1 Components of the Waterfall Model................................. 2 1.1.1 What is a requirement?. 2 1.1.2 Testing..........

### COURSE TITLE COURSE DESCRIPTION

COURSE TITLE COURSE DESCRIPTION CS-00X COMPUTING EXIT INTERVIEW All graduating students are required to meet with their department chairperson/program director to finalize requirements for degree completion.

### 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

### 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,

### 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

### Course Code Course Title No. of credits COMP4804 Computing and data analytics project 6 Total for Capstone Experience 6

Computing & Data Analytics Faculty General Engineering Courses (18 credits) COMP2121 Discrete Mathematics 6 ENGG1111 Computer Programming and Applications 6 MATH1013 University mathematics II* 6 Total

### 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

### Course Descriptions. preparation.

Course Descriptions CS 101 Intro to Computer Science An introduction to computer science concepts and the role of computers in society. Topics include the history of computing, computer hardware, operating

### 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

### 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

### 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

### COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.)

VCU 1 COMPUTER SCIENCE, BACHELOR OF SCIENCE (B.S.) The Bachelor of Science in Computer Science is built on a rigorous, highly concentrated, accredited curriculum of computer science courses. The program

### Release: 1. ICTPRG503 Debug and monitor applications

Release: 1 ICTPRG503 Debug and monitor ICTPRG503 Debug and monitor Modification History Release Release 1 Comments This version first released with ICT Information and Communications Technology Training

### 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

### CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.

Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure

### COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM

COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM Course Code 2505100 Computing Fundamentals Pass/ Fail Prerequisite None This course includes an introduction to the use of the computer

### Chapter 13: Program Development and Programming Languages

Understanding Computers Today and Tomorrow 12 th Edition Chapter 13: Program Development and Programming Languages Learning Objectives Understand the differences between structured programming, object-oriented

### Some programming experience in a high-level structured programming language is recommended.

Python Programming Course Description This course is an introduction to the Python programming language. Programming techniques covered by this course include modularity, abstraction, top-down design,

### recursion, O(n), linked lists 6/14

recursion, O(n), linked lists 6/14 recursion reducing the amount of data to process and processing a smaller amount of data example: process one item in a list, recursively process the rest of the list

### Modeling, Computers, and Error Analysis Mathematical Modeling and Engineering Problem-Solving

Next: Roots of Equations Up: Numerical Analysis for Chemical Previous: Contents Subsections Mathematical Modeling and Engineering Problem-Solving A Simple Mathematical Model Computers and Software The

### Course Syllabus. COSC 1437 Programming Fundamentals II. Revision Date: August 21, 2013

Course Syllabus COSC 1437 Programming Fundamentals II Revision Date: August 21, 2013 Catalog Description: This course contains further applications of programming techniques in the C++ programming language.

### Course Design Document. IS103 Computational Thinking (CT)

Course Design Document IS103 Computational Thinking (CT) Version 1.0 10 October 2011 Computational thinking confronts the riddle of machine intelligence: What can humans do better than computers? What

### Chapter 8: Bags and Sets

Chapter 8: Bags and Sets In the stack and the queue abstractions, the order that elements are placed into the container is important, because the order elements are removed is related to the order in which

### 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

### Lecture Notes on Linear Search

Lecture Notes on Linear Search 15-122: Principles of Imperative Computation Frank Pfenning Lecture 5 January 29, 2013 1 Introduction One of the fundamental and recurring problems in computer science is

### 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

### Voice: (276) 619-4352 and (813) 507-9956 E-mail: bnorton@hgs.k12.va.us Office Hours: by appointment

A. Linwood Holton Governor s School INTRODUCTION TO ENGINEERING METHODS and COMPUTER PROGRAMMING Course Syllabus Instructor: Dr. Bruce C. Norton Voice: (276) 619-4352 and (813) 507-9956 E-mail: bnorton@hgs.k12.va.us

### Sorting revisited. Build the binary search tree: O(n^2) Traverse the binary tree: O(n) Total: O(n^2) + O(n) = O(n^2)

Sorting revisited How did we use a binary search tree to sort an array of elements? Tree Sort Algorithm Given: An array of elements to sort 1. Build a binary search tree out of the elements 2. Traverse

### 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).

### Linked Lists, Stacks, Queues, Deques. It s time for a chainge!

Linked Lists, Stacks, Queues, Deques It s time for a chainge! Learning Goals After this unit, you should be able to... Differentiate an abstraction from an implementation. Define and give examples of problems

### 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

### 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

### Professional Organization Checklist for the Computer Science Curriculum Updates. Association of Computing Machinery Computing Curricula 2008

Professional Organization Checklist for the Computer Science Curriculum Updates Association of Computing Machinery Computing Curricula 2008 The curriculum guidelines can be found in Appendix C of the report

### Computer Science Course Descriptions Page 1

CS 101 Intro to Computer Science An introduction to computer science concepts and the role of computers in society. Topics include the history of computing, computer hardware, operating systems, the Internet,

### Lesson 8: DESIGN PROCESSES AND DESIGN METRIC FOR AN EMBEDDED-SYSTEM DESIGN

Lesson 8: DESIGN PROCESSES AND DESIGN METRIC FOR AN EMBEDDED-SYSTEM DESIGN 1 Abstraction Each problem component first abstracted. For example, Display picture and text as an abstract class Robotic system

PARENT/STUDENT COURSE INFORMATION BUSINESS AND INFORMATION TECHNOLOGY ADVANCED SOFTWARE AND GAME DEVELOPMENT GRADES 11-12 Counselors are available to assist parents and students with course selections

### 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

### COURSE OUTLINE. Prerequisites: Course Description:

Lab/Recitation Revised Fall 2015 36TITP220 21TJava Programming II COURSE OUTLINE Prerequisites: ITP120 wi ITD130 as a co-requisite or instructor s permission Course Description: Imparts instruction in

### 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)

### Data Structures. Level 6 C30151. www.fetac.ie. Module Descriptor

The Further Education and Training Awards Council (FETAC) was set up as a statutory body on 11 June 2001 by the Minister for Education and Science. Under the Qualifications (Education & Training) Act,

### Division of Mathematical Sciences

Division of Mathematical Sciences Chair: Mohammad Ladan, Ph.D. The Division of Mathematical Sciences at Haigazian University includes Computer Science and Mathematics. The Bachelor of Science (B.S.) degree

### Data Structures. Chapter 8

Chapter 8 Data Structures Computer has to process lots and lots of data. To systematically process those data efficiently, those data are organized as a whole, appropriate for the application, called a

### www.iacpe.com Knowledge, Certification, Networking

www.iacpe.com Knowledge, Certification, Networking Page : 1 of 95 Rev. 01- Feb 2016 IACPE No 19, Jalan Bilal Mahmood 80100 Johor Bahru Malaysia Introduction to Software Engineering The International of

### programs in one of these languages programming techniques in C++ or Design structured programs using Design and use object oriented

CERTIFICATE/PROGRAM: Computer Programming NAS728/NCE728 COURSE: CIS -1A: Introduction to Computer Information Systems Identify the fundamental computer concepts and terminology used for input, processing,

### 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

### OKLAHOMA SUBJECT AREA TESTS (OSAT )

CERTIFICATION EXAMINATIONS FOR OKLAHOMA EDUCATORS (CEOE ) OKLAHOMA SUBJECT AREA TESTS (OSAT ) FIELD 081: COMPUTER SCIENCE September 2008 Subarea Range of Competencies I. Computer Use in Educational Environments

### Number of hours in the semester L Ex. Lab. Projects SEMESTER I 1. Economy 45 18 27. 2. Philosophy 18 18. 4. Mathematical Analysis 45 18 27 Exam

Year 1 Lp. Course name Number of hours in the semester L Ex. Lab. Projects SEMESTER I 1. Economy 45 18 7. Philosophy 18 18 3. Linear Algebra 45 18 7 Exam 4. Mathematical Analysis 45 18 7 Exam 5. Economical

### HARDWARE AND SOFTWARE COMPONENTS Students will demonstrate an understanding of the relationship between hardware and software in program execution.

1 PROGRAM CONCENTRATION: Business & Computer Science CAREER PATHWAY: Computing COURSE TITLE: Beginning Programming The major goal of this course is for students to develop the computer science skills of

### 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

### Computer Science. Computer Science 213. Faculty and Offices. Degrees and Certificates Awarded. AS Computer Science Degree Requirements

Computer Science 213 Computer Science (See Computer Information Systems section for additional computer courses.) Degrees and Certificates Awarded Associate in Science Degree, Computer Science Certificate

### Education: P.h.D. Candidate (Santa Clara University, California) M.S. in Computer Engineering (Santa Clara University, California)

Instructor: Professor Neena Kaushik Education: P.h.D. Candidate (Santa Clara University, California) M.S. in Computer Engineering (Santa Clara University, California) M.S. in Biomedical Engineering (Northwestern

### CMSC 152: Introduction to Computer Science II

CMSC 152: Introduction to Computer Science II The University of Chicago, Winter 2015 Adam Shaw and Matthew Wachs http://www.classes.cs.uchicago.edu/archive/2014/winter/15200-1 Welcome! In CS152, we introduce

### 2667A - Introduction to Programming

2667A - Introduction to Programming Table of Contents Introduction Audience At Course Completion Prerequisites Microsoft Certified Professional Exams Student Materials Course Outline Introduction Elements

### Course Outcomes. 2. Able to write, compile and debug programs in

Course Outcomes Course Code Course Name Course Outcomes CS-201/101 CS-191/291 CS-301 Computer System Programming Computer Programming Lab Data Structures & Algorithms 1. Able to have fundamental knowledge

### Good Software. Lecture 6 GSL Peru 2014

Good Software Lecture 6 GSL Peru 2014 What is Good Software? Low cost Good performance Bug-free, efficient, meets its purpose Easy to code Easy to understand, modular Easy to use Clients are satisfied

### Describe the process of parallelization as it relates to problem solving.

Level 2 (recommended for grades 6 9) Computer Science and Community Middle school/junior high school students begin using computational thinking as a problem-solving tool. They begin to appreciate the

### Sample Questions Csci 1112 A. Bellaachia

Sample Questions Csci 1112 A. Bellaachia Important Series : o S( N) 1 2 N N i N(1 N) / 2 i 1 o Sum of squares: N 2 N( N 1)(2N 1) N i for large N i 1 6 o Sum of exponents: N k 1 k N i for large N and k

### 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

### Computer Science. Computer Science 207. Degrees and Certificates Awarded. A.S. Computer Science Degree Requirements. Program Student Outcomes

Computer Science 207 Computer Science (See Computer Information Systems section for additional computer courses.) We are in the Computer Age. Virtually every occupation in the world today has an interface

### Chapter 7. Ch.7 Problem Solving and Algorithms

Chapter 7 Ch.7 Problem Solving and Algorithms QUIZ: Match the steps in Polya s method to the ones in the computer method for problem solving Devise a plan Look back Understand Carry out the plan Analysis

### Software Engineering Transfer Degree

www.capspace.org (01/17/2015) Software Engineering Transfer Degree This program of study is designed for associate-degree students intending to transfer into baccalaureate programs awarding software engineering

### Algorithms and Data Structures

Algorithms and Data Structures CMPSC 465 LECTURES 20-21 Priority Queues and Binary Heaps Adam Smith S. Raskhodnikova and A. Smith. Based on slides by C. Leiserson and E. Demaine. 1 Trees Rooted Tree: collection

### Computer Science 1-3 (AP) Syllabus/Online Course Plan

Computer Science 1-3 (AP) Syllabus/Online Course Plan Certificated Teacher: Date: 2015-2016 Stage One Desired Results Course Title/Grade Level: Computer Science (AP) Credit: one semester (.5) _X_ two semesters

### PCCC PCCC Course Description

Course Description CIS 101 Computer Concepts and Applications 3 credits (formerly Introduction to Computers and Information Processing) Introduces a variety of topics in computers and computing including

### Java 6 'th. Concepts INTERNATIONAL STUDENT VERSION. edition

Java 6 'th edition Concepts INTERNATIONAL STUDENT VERSION CONTENTS PREFACE vii SPECIAL FEATURES xxviii chapter i INTRODUCTION 1 1.1 What Is Programming? 2 J.2 The Anatomy of a Computer 3 1.3 Translating

### BCS Higher Education Qualifications. Software Development Syllabus

BCS Higher Education Qualifications Certificate in IT Software Development Syllabus Version: 200216 Contents 1. Change History 3 2. Rationale 3 3. Aims 3 4. Objectives 3 5. Prior Knowledge Expected 4 6.

### Principles of Software Construction: Objects, Design, and Concurrency. Course Introduction. toad. toad 15-214. Fall 2012. School of Computer Science

Principles of Software Construction: Objects, Design, and Concurrency Course Introduction Fall 2012 Charlie Garrod Christian Kästner School of Computer Science and J Aldrich 2012 W Scherlis 1 Construction

### COURSE DESCRIPTION. Course Title Survey of Computer Science Total Credits 3.0

COURSE DESCRIPTION Department and Course Number CS 112 Course Coordinator Gyorgy Petruska Course Title Survey of Computer Science Total Credits 3.0 Current Catalog Description This course is designed to

### MEng, BSc Computer Science with Artificial Intelligence

School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give

### Computer Science. General Education Students must complete the requirements shown in the General Education Requirements section of this catalog.

Computer Science Dr. Ilhyun Lee Professor Dr. Ilhyun Lee is a Professor of Computer Science. He received his Ph.D. degree from Illinois Institute of Technology, Chicago, Illinois (1996). He was selected

### 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,