CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon
|
|
- Monica Carpenter
- 5 years ago
- Views:
Transcription
1 CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon Instructor Course name Credits Contact hours Text book Course Information Course Goals Jungsoo (Sue) Lim, Reem Alqahtani Office hours: 1. Monday, Wednesday 9:00 AM 10:30 AM at E&T B10 2. Monday, Wednesday 4:00 PM 5:00 PM at E&T A By Appointment Programming with Data Structures 3 units 4 hours/week Required: Introduction to JAVA Programming, by: Daniel Liang, 10th Edition ISBN-13: a) Advanced programming techniques; elementary data structures such as dynamic arrays, linked lists, stacks, queues, and trees, sorting and searching algorithms. Laboratory activities on problem analysis and software development. b) Prerequisites: CS202 c) Recommended Prerequisite: Math 207, Math 248 d) This course is required in the BS program The Student Learning Outcomes that are addressed by the course are: SLO #2: Students will be able to demonstrate fluency in at least one programming language and acquaintance with at least three more. SLO #3: Students will have a strong foundation in the design, analysis, and application of many types of algorithms. SLO #5. Students will have the training to analyze problems and identify and define the computing requirements appropriate to their solutions. SLO #6. Students will have the training to design, implement, and evaluate large software systems working both individually and collaboratively. SLO #7. Students will be able to communicate effectively orally and in writing. Other outcomes of instruction: At the end of the course students are able to: Use recursion as a tool to solve some specific problems. Know the standard Abstract Data Types, and their implementations. Study and use different available JAVA Data Structures. Know the standard searching and sorting algorithms and their efficiency. Page 1 of 5
2 Brief list of topics to be covered Understand the complexity analysis for some simple software. Recursion Generics Java Collections Framework Algorithm Efficiency (brief) Sorting Lists, Stacks, Queues, and Priority Queues Binary Search Trees Graphs and Applications (Optional) Multithreading Laboratory Projects Out of class Assignments Quizzes Each week students will complete a 3-hour lab projects on selected topics, except the exam weeks. At the end of each lab students will turn in lab programming assignment. Each week students will have an assignment due on the following week, except the exam weeks. For these assignments students may required to complete an unfinished implementation, design/implement a system, produce system document (pseudo code, UML, etc), and prepare a user s manual. Each class will have in class quiz. Grading Policy Quizzes: 10% Laboratory assignments: 10 % Out of class assignments: 20% 2 Midterm: 30% Final: 30% A-, A B-, B, B C-,C,C D,F <65 Academic Integrity ADA Statement Cheating will not be tolerated. Cheating on any assignment or exam will be taken seriously. All parties involved will receive a grade of F for the course and are reported to the proper authorities. Reasonable accommodation will be provided to any student who is registered With the Office of Students with Disabilities and requests needed accommodation. Page 2 of 5
3 CS203 Course Weekly Schedule Week Lecture topics 1 Review of Polymorphism and Java FX 2 Recursion (Ch 18) 3 Generics (Ch 19) Encapsulation data protection Inheritance super class/sub class, constructor chaining, overriding vs. overloading Polymorphism dynamic binding, declared type, actual type, casting (implicit casting/explicit casting, up casting/down casting) Java FX creating application, inserting components, adding event handlers, and adding UI controls. Review what a recursion method is and its benefits Develop recursive methods Review how recursive methods calls are handled in call stack. Solve problem using recursion Solve the Tower of Hanoi problem using recursion Draw fractals using recursion Review tail-recursive methods Define generic classes and interfaces Define and use generic methods and bounded generic types Develop a generic sort method to sort an array of Comparable objects Design and implement generic matrix classes 4 Java Collection Framework (Ch 20) Overview of Lists Overview of Stacks Overview of Queues Overview of Priority Queues Sets and Maps (Ch 21) Overview of HashSet, LinkedHashSet, and TreeSet Overview of HashMap, LinkedHashMap, and TreeMap 5 Developing efficient algorithms (Ch 22) Estimate algorithm efficiency using the Big O notation Determine the complexity of various types of algorithms Analyze the binary search algorithm Analyze the selection sort algorithm Page 3 of 5
4 6 Developing efficient algorithms (Ch 22) Continued Analyze the Tower of Hanoi algorithm Design efficient algorithms using dynamic programming Backtracking Midterm 1 7 Sorting (Ch23) Analyze time complexity of various sorting algorithms Design, implement, and analyze insertion sort Design, implement, and analyze bubble sort Design, implement, and analyze merge sort 8 Sorting (Ch23) - Continued Design, implement, and analyze quick sort Design, implement, and analyze heap sort Design, implement, and analyze bucket sort Design, implement, and analyze radix sort 9 Implementing Lists, Stacks, Queues, and Priority Queues (Ch 24) Design common features of lists in an interface and provide skeleton implementation in an abstract class Design and implement an array list using an array Design and implement a linked list using a linked structure Design and implement a stack class using an array list and queue class using a linked list Design and implement a priority queue using a heap 10 Binary Search Trees (Ch 25) Design and implement a binary search tree Search an element in a binary search tree Insert/delete an element into a binary search tree Traverse/display elements in a binary tree (in-order, pre-order, post-order, breath first traversal) Implement Huffman coding for compressing data using a binary tree 11 AVL Trees (Ch 26) Overview of AVL tree Understand how to rebalance a tree using various techniques Design the AVLTree class by extending the BST Implementing tree rebalancing algorithms for AVL trees Insert/delete elements in/from AVL tree Analyze the complexity of search, insertion, and deletion operation in AVL Page 4 of 5
5 tree. Midterm 2 12 Hashing (Ch 27) Overview of hashing Design hash function Handle collisions Open addressing (linear probing, quadratic probing, and double hashing), separate chaining (Optional) Graphs and Applications (Ch 28) Describe the graph terminologies: vertices, edges, simple graphs, weighted/unweighted graphs, and directed/undirected graphs Model graphs using the Graph interface, the AbstractGraph calss, and the UnweightedGraph class Design and implement depth-first-search Design and implement breadth-first search 13 Multithreading and Parallel Programming (Ch30) Overview of multithreading Develop multithread program Overview of race condition and synchronization Use synchronized methods to synchronize threads to avoid race condition Overview of semaphore Control number of concurrent tasks that access a shared resource using semaphores 14 Multithreading and Parallel Programming (Ch30) Continued Overview of deadlock Avoid deadlock using the resource-ordering technique Overview of the life cycle of a thread Develop parallel programs using Fork/Join Framework 15 Review for final exam Page 5 of 5
CS2013 Course Syllabus Spring 2018 Lecture: Mon/Wed 2:00 P.M. 2:50 P.M. SH C259 Lab: Mon/Wed 2:50 P.M. 4:00 P.M. SH C259
CS2013 Course Syllabus Spring 2018 Lecture: Mon/Wed 2:00 P.M. 2:50 P.M. SH C259 Lab: Mon/Wed 2:50 P.M. 4:00 P.M. SH C259 Instructor Course name Credits Contact hours Text book Course Information Course
More informationCSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid
CSCE 20/220 Data Structures and Algorithms Prof. Amr Goneid Fall 208 / Spring 209 CSCE 20/220 DATA STRUCTURES AND ALGORITHMS Prof. Amr Goneid Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu Office:
More informationCSCE 210/2201 Data Structures and Algorithms. Prof. Amr Goneid. Fall 2018
CSCE 20/220 Data Structures and Algorithms Prof. Amr Goneid Fall 208 CSCE 20/220 DATA STRUCTURES AND ALGORITHMS Dr. Amr Goneid Course Goals To introduce concepts of Data Models, Data Abstraction and ADTs
More informationSchool of Computing and Information Sciences. Course Title: Data Structures Date: 3/30/2010 Course Number: COP 3530 Number of Credits: 3
Course Title: Date: 3/30/2010 Course Number: Number of Credits: 3 Subject Area: Programming Subject Area Coordinator: Tim Downey email: downeyt@cis.fiu.edu Catalog Description: Basic concepts of data organization,
More informationCISC 3130 Data Structures Fall 2018
CISC 3130 Data Structures Fall 2018 Instructor: Ari Mermelstein Email address for questions: mermelstein AT sci DOT brooklyn DOT cuny DOT edu Email address for homework submissions: mermelstein DOT homework
More informationCS 445: Data Structures Final Examination: Study Guide
CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing
More informationCS 210 Algorithms and Data Structures College of Information Technology and Engineering Weisberg Division of Engineering and Computer Science
CS 210 Algorithms and Data Structures College of Information Technology and Engineering Weisberg Division of Engineering and Computer Science Semester and Year: Fall 2008 Classroom Section, Meeting Times,
More informationAlgorithms and Data Structures Spring 2008
Algorithms and Data Structures Spring 2008 Instructors: Professor Joe Fuller Dr. Sarita Bassil Office: 205B Gullickson Hall 207 Gullickson Hall Phone: 696-6204 696-5444 Email: fullerj@marshall.edu bassil@marshall.edu
More informationCSC2100-Data Structures
CSC2100-Data Structures Final Remarks Department of Computer Science and Engineering The Chinese University of Hong Kong, Shatin, New Territories Interesting Topics More Graph Algorithms Finding cycles,
More informationAP Computer Science 4325
4325 Instructional Unit Algorithm Design Techniques -divide-and-conquer The students will be -Decide whether an algorithm -classroom discussion -backtracking able to classify uses divide-and-conquer, -worksheets
More informationIntroduction 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 informationModel 4.2 Faculty member + student Course syllabus for Advanced programming language - CS313D
Model 4.2 Faculty member + student Course syllabus for Advanced programming language - CS1D 1. Faculty member information: Name of faculty member responsible for the course Dr. Myriam Hadjouni Office Hours
More informationCS503 Advanced Programming I CS305 Computer Algorithms I
Syllabus: CS503 Advanced Programming I CS305 Computer Algorithms I Course Number: CS503-50/CS305-50 Course Title: Advanced Programming I/Computer Algorithms I Instructor: Richard Scherl Office: Howard
More informationCOLLEGE OF THE DESERT
COLLEGE OF THE DESERT Course Code CS-009 Course Outline of Record 1. Course Code: CS-009 2. a. Long Course Title: Data Structures and Algorithms b. Short Course Title: DATA STRUCTURES 3. a. Catalog Course
More informationJava 2. Course Outcome Summary. Western Technical College. Course Information. Course History. Course Competencies
Western Technical College 10152155 Java 2 Course Outcome Summary Course Information Description Career Cluster Instructional Level Total Credits 4.00 Total Hours 90.00 The goal as programmers, is to create
More informationCPSC 2380 Data Structures and Algorithms
CPSC 2380 Data Structures and Algorithms Spring 2014 Department of Computer Science University of Arkansas at Little Rock 2801 South University Avenue Little Rock, Arkansas 72204-1099 Class Hours: Tuesday
More informationQuantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2
Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2 COURSE DESCRIPTION This course assumes a student has prior programming language experience with C++. It
More informationComputer Programming II C++ (830)
DESCRIPTION This is an advanced course in computer programming/software engineering and applications. It reviews and builds on the concepts introduced in CP I. It introduces students to dynamic data structures,
More informationAlgorithms and programs, basic idea of pseudo-code.algorithm efficiency and analysis, time and space analysis of algorithms order notations.
B. P. Poddar Institute of Management & Technology Department of Information Technology Course Syllabus : Data Structure & Algorithm Academic Year:.18-19... Semester:...3rd... Module -I. [8L] Linear Data
More informationCISC 3130 Data Structures Spring 2018
CISC 3130 Data Structures Spring 2018 Instructor: Ari Mermelstein Email address for questions: mermelstein AT sci DOT brooklyn DOT cuny DOT edu Email address for homework submissions: mermelstein DOT homework
More informationECE Object-Oriented Programming using C++ and Java
1 ECE 30862 - Object-Oriented Programming using C++ and Java Instructor Information Name: Sam Midkiff Website: https://engineering.purdue.edu/~smidkiff Office: EE 310 Office hours: Tuesday, 2:30 to 4:00
More informationVirtual University of Pakistan
Virtual University of Pakistan Department of Computer Science Course Outline Course Instructor Dr. Sohail Aslam E mail Course Code Course Title Credit Hours 3 Prerequisites Objectives Learning Outcomes
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Topic 1 - Introductions University of Manitoba Picture is from the cover of the textbook CLRS. COMP 3170 - Analysis of Algorithms & Data
More informationCOMP Data Structures
COMP 2140 - Data Structures Shahin Kamali Topic 1 - Introductions University of Manitoba Based on notes by S. Durocher. COMP 2140 - Data Structures 1 / 35 Introduction COMP 2140 - Data Structures 1 / 35
More informationCS251-SE1. Midterm 2. Tuesday 11/1 8:00pm 9:00pm. There are 16 multiple-choice questions and 6 essay questions.
CS251-SE1 Midterm 2 Tuesday 11/1 8:00pm 9:00pm There are 16 multiple-choice questions and 6 essay questions. Answer the multiple choice questions on your bubble sheet. Answer the essay questions in the
More informationCOMP Data Structures
Shahin Kamali Topic 1 - Introductions University of Manitoba Based on notes by S. Durocher. 1 / 35 Introduction Introduction 1 / 35 Introduction In a Glance... Data structures are building blocks for designing
More informationCOMP 2150 CS 2: Object-Oriented Programming and Data Structure Fall 2018 Dr. James Yu
COMP 2150 CS 2: Object-Oriented Programming and Data Structure Fall 2018 Dr. James Yu Contact Information: Office: Dunn Hall 320 Department Office: Dunn Hall 375 Office Phone: 901.678.3712 Department Phone:
More informationIntroduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis
Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.
More informationCourse Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.
Course Name: B.Tech. 3 th Sem. Subject: Data Structures No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours Paper Code: ETCS-209 Topic Details No of Hours Planned
More informationCS 206 Introduction to Computer Science II
CS 206 Introduction to Computer Science II 01 / 21 / 2015 Instructor: Michael Eckmann Today s Topics Introduction of myself Review the syllabus List of Topics we'll cover Start Java review Who is your
More informationCSC 216 Data Structures Dr. Melissa Wiggins MCC 306 (601)
CSC 216 Data Structures Dr. Melissa Wiggins MCC 306 (601) 925-3874 http://www.mc.edu/~mwiggins mwiggins@mc.edu COURSE CREDIT: 4 hrs. credit PREREQUISITES: CSC 116, with a C or better OFFICE HOURS: TEXT:
More informationDATA STRUCTURES THROUGH C++
II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts
More informationDepartment of Information Technology. II B.Tech I Sem. DATA STRUCTURES THROUGH C++ (Subject code# 53023) Dept of IT
Department of Information Technology II B.Tech I Sem DATA STRUCTURES THROUGH C++ (Subject code# 53023) Mrs.D.Sravanthi Asst. Professor J.B.Institute of Engg & Technology Yenkapally, Moinabad(Mandal) Himathnagar(post),Hydreabad
More informationCOMP251: Algorithms and Data Structures. Jérôme Waldispühl School of Computer Science McGill University
COMP251: Algorithms and Data Structures Jérôme Waldispühl School of Computer Science McGill University About Me Jérôme Waldispühl Associate Professor of Computer Science I am conducting research in Bioinformatics
More informationCSC 210 COMPUTER SCIENCE II
CSC 210 COMPUTER SCIENCE II PRESENTED AND APPROVED: NOVEMBER 2, 2012 EFFECTIVE: FALL 2013-14 Prefix & Number CSC 210 Course : Computer Science II Purpose of this submission: New Course New Change/Updated
More informationSan Jose State University College of Science Department of Computer Science CS151, Object-Oriented Design, Sections 1, 2, and 3, Spring 2018
San Jose State University College of Science Department of Computer Science CS151, Object-Oriented Design, Sections 1, 2, and 3, Spring 2018 Course and Contact Information Instructor: Suneuy Kim Office
More informationCpt S 223 Fall Cpt S 223. School of EECS, WSU
Course Review Cpt S 223 Fall 2012 1 Final Exam When: Monday (December 10) 8 10 AM Where: in class (Sloan 150) Closed book, closed notes Comprehensive Material for preparation: Lecture slides & class notes
More informationBig Java Late Objects
Big Java Late Objects Horstmann, Cay S. ISBN-13: 9781118087886 Table of Contents 1. Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar
More informationCMPE/SE 135 Object-Oriented Analysis and Design
Course and Contact Information San José State University Department of Computer Engineering CMPE/SE 135 Object-Oriented Analysis and Design Instructor: Ron Mak Office Location: ENG 250 Email: ron.mak@sjsu.edu
More informationCourse Review. Cpt S 223 Fall 2009
Course Review Cpt S 223 Fall 2009 1 Final Exam When: Tuesday (12/15) 8-10am Where: in class Closed book, closed notes Comprehensive Material for preparation: Lecture slides & class notes Homeworks & program
More informationCSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationSan José State University Computer Science Department CS49J, Section 3, Programming in Java, Fall 2015
Course and Contact Information San José State University Computer Science Department CS49J, Section 3, Programming in Java, Fall 2015 Instructor: Aikaterini Potika Office Location: MacQuarrie Hall 215
More informationCSE373: Data Structures & Algorithms Lecture 28: Final review and class wrap-up. Nicki Dell Spring 2014
CSE373: Data Structures & Algorithms Lecture 28: Final review and class wrap-up Nicki Dell Spring 2014 Final Exam As also indicated on the web page: Next Tuesday, 2:30-4:20 in this room Cumulative but
More informationSan José State University Department of Computer Science CS-144, Advanced C++ Programming, Section 1, Spring 2018
San José State University Department of Computer Science CS-144, Advanced C++ Programming, Section 1, Spring 2018 Course and Contact Information Instructor: Office Location: Telephone: Email: Office Hours:
More informationI. PREREQUISITE For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
CSCI 611 Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase
More informationCS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces
More informationCSE 114, Computer Science 1 Course Information. Spring 2017 Stony Brook University Instructor: Dr. Paul Fodor
CSE 114, Computer Science 1 Course Information Spring 2017 Stony Brook University Instructor: Dr. Paul Fodor http://www.cs.stonybrook.edu/~cse114 Course Description Procedural and object-oriented programming
More informationSpring 2003 Instructor: Dr. Shahadat Hossain. Administrative Matters Course Information Introduction to Programming Techniques
1 CPSC2620 Advanced Programming Spring 2003 Instructor: Dr. Shahadat Hossain 2 Today s Agenda Administrative Matters Course Information Introduction to Programming Techniques 3 Course Assessment Lectures:
More informationBachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24
Prepared By ASCOL CSIT 2070 Batch Institute of Science and Technology 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass
More informationCSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationCS 200, Section 1, Programming I, Fall 2017 College of Arts & Sciences Syllabus
Northeastern Illinois University CS 200, Section 1, Programming I, Fall 2017 Syllabus, Page 1 of 7 CS 200, Section 1, Programming I, Fall 2017 College of Arts & Sciences Syllabus COURSE INFORMATION: Credit
More informationCourse Review for Finals. Cpt S 223 Fall 2008
Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,
More informationComputer Programming II Python
EXAM INFORMATION Items 32 Points 33 Prerequisites SECONDARY MATH I COMPUTER PROGRAMMING I Grade Level 10-12 Course Length ONE YEAR DESCRIPTION This is an advanced course in computer programming/software
More informationHash table basics mod 83 ate. ate. hashcode()
Hash table basics ate hashcode() 82 83 84 48594983 mod 83 ate Reminder from syllabus: EditorTrees worth 10% of term grade See schedule page Exam 2 moved to Friday after break. Short pop quiz over AVL rotations
More informationHome Works and Assignments
Course Title: Course Code: Credit Hours Theory: Credit Hours Lab (If Applicable): Instructor Name with Qualification: Course Objectives: Course Learning Outcomes: Contents (Catalog Description): Recommended
More informationINFSCI 1017 Implementation of Information Systems Spring 2017
INFSCI 1017 Implementation of Information Systems Spring 2017 Time: Thursdays 6:00 8:30 Location: Information Science Building, Room 406 Instructor: Alexander Nolte Office Hours: Monday, 1-2PM Thursdays,
More informationTable of Contents. Chapter 1: Introduction to Data Structures... 1
Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction
More informationCourse Review. Cpt S 223 Fall 2010
Course Review Cpt S 223 Fall 2010 1 Final Exam When: Thursday (12/16) 8-10am Where: in class Closed book, closed notes Comprehensive Material for preparation: Lecture slides & class notes Homeworks & program
More informationCOMP 250. Lecture 36 MISC. - beyond COMP final exam comments
COMP 250 Lecture 36 MISC - beyond COMP 250 - final exam comments Dec 5, 2016 1 202 Intro Program MATH (prereqs for many upper level COMP courses) 206 Software Systems 273 Computer Systems 250 Intro Comp
More informationCSC 111 Introduction to Computer Science (Section C)
CSC 111 Introduction to Computer Science (Section C) Course Description: (4h) Lecture and laboratory. Rigorous introduction to the process of algorithmic problem solving and programming in a modern programming
More informationPROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)
B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a
More informationCMSC132, Practice Questions
CMSC132, Practice Questions Notice the final exam can include material not covered by the practice questions. You should practice beyond what is covered in this document. Although solutions will not be
More informationCoSci 440 SYLLABUS Programming in C++ INSTRUCTOR Mari Rettke cell SECTION : and 13345
CoSci 440 SYLLABUS Programming in C++ INSTRUCTOR Mari Rettke samusher@aol.com 818.470.8419 - cell SECTION : 13327 and 13345 Course Description Covers C++ language and object-oriented programming paradigm.
More informationOBJECT ORIENTED DATA STRUCTURE & ALGORITHMS
OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers
More informationCOLLEGE OF DUPAGE CIS 2542 Advanced C++ with Data Structure Applications Course Syllabus
Carolyn England COD Main #: 942-4125 Voicemail Ext. 4125 Office: BIC1544B (Division Office TEC1034) Mailbox: BIC1E01 Office Hours: M 12:05 pm 1:45 pm Tu 12:05 pm 1:45 pm W 12:05 pm 1:45 pm Th 9:00 am 10:40
More informationCSCE 206: Structured Programming in C
CSCE 206: Structured Programming in C Instructor: Vijay Rajanna Office: E-mail: Office Hours: Teague Bld. Room 330H vijayrajanna@tamu.edu M-W: 1:30 pm to 3:30 pm and by appointment. Teaching Assistant:
More informationSan José State University Department of Computer Science CS049J, Programming in Java, Section 2, Fall, 2016
Course and Contact Information San José State University Department of Computer Science CS049J, Programming in Java, Section 2, Fall, 2016 Instructor: Office Location: Fabio Di Troia DH282 Telephone: Email:
More informationI. PREREQUISITE For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
CSIS 100 Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase
More informationITT Technical Institute. SD1420 Introduction to Java Programming Onsite and Online Course SYLLABUS
ITT Technical Institute SD1420 Onsite and Online Course SYLLABUS Credit hours: 4.5 Contact/Instructional hours: 56 (34 Theory Hours, 22 Lab Hours Prerequisite(s and/or Corequisite(s: Prerequisite: PT1420
More informationCleveland State University
Cleveland State University CIS 265/506 Data Structures & Algorithms (4 credits). Fall 2014 Section 1 Class Nbrs. 2108 & 2192. Mon & Wed. 4:00 5:50 PM Prerequisites: CIS260/CIS500 Instructor: Dr. Victor
More informationASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))
ASSIGNMENTS Chapter Q. No. Questions Course Outcom e (CO) Progra m Outcom e I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) 2 3. What is the time complexity of the algorithm? 4
More informationI. PREREQUISITE For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase course
More informationI. PREREQUISITE For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase course
More informationWe don t have much time, so we don t teach them [students]; we acquaint them with things that they can learn. Charles E. Leiserson
Homework 3 CS 321 - Data Structures Fall 2018 Dec 6, 2018 Name: Collaborators: We don t have much time, so we don t teach them [students]; we acquaint them with things that they can learn. Charles E. Leiserson
More informationData Structures and Abstractions with Java
Global edition Data Structures and Abstractions with Java Fourth edition Frank M. Carrano Timothy M. Henry Data Structures and Abstractions with Java TM Fourth Edition Global Edition Frank M. Carrano University
More information5/23/2015. Core Java Syllabus. VikRam ShaRma
5/23/2015 Core Java Syllabus VikRam ShaRma Basic Concepts of Core Java 1 Introduction to Java 1.1 Need of java i.e. History 1.2 What is java? 1.3 Java Buzzwords 1.4 JDK JRE JVM JIT - Java Compiler 1.5
More informationSan José State University Department of Computer Science CS-144, Advanced C++ Programming, Section 1, Fall 2017
San José State University Department of Computer Science CS-144, Advanced C++ Programming, Section 1, Fall 2017 Course and Contact Information Instructor: Office Location: Fabio Di Troia DH282 Telephone:
More informationSyllabus CSCI 405 Operating Systems Fall 2018
Syllabus CSCI 405 Operating Systems Fall 2018 1.0 General Information Class Time: Monday/Wednesday/Friday 11:00 AM - 11:50 AM Class Location: 317 Thompson Instructor: Dr. Deepti Joshi; Office: 224 Thompson;
More informationCSCE 321/3201 Analysis and Design of Algorithms. Prof. Amr Goneid. Fall 2016
CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Fall 2016 CSCE 321/3201 Analysis and Design of Algorithms Prof. Amr Goneid Course Resources Instructor: Prof. Amr Goneid E-mail: goneid@aucegypt.edu
More informationECE250: Algorithms and Data Structures Midterm Review
ECE250: Algorithms and Data Structures Midterm Review Ladan Tahvildari, PEng, SMIEEE Associate Professor Software Technologies Applied Research (STAR) Group Dept. of Elect. & Comp. Eng. University of Waterloo
More informationCSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators)
Name: Email address: Quiz Section: CSE 332 Autumn 2013: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will
More informationCGS 2405 Advanced Programming with C++ Course Justification
Course Justification This course is the second C++ computer programming course in the Computer Science Associate in Arts degree program. This course is required for an Associate in Arts Computer Science
More informationCpt S 223 Course Overview. Cpt S 223, Fall 2007 Copyright: Washington State University
Cpt S 223 Course Overview 1 Course Goals Learn about new/advanced data structures Be able to make design choices on the suitable data structure for different application/problem needs Analyze (objectively)
More informationCOURSE SYLLABUS BMIS 662 TELECOMMUNICATIONS AND NETWORK SECURITY
BMIS 662 Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase
More informationCMPT 126: Introduction to Computing Science and Programming Fall 2007, Harbour Centre
CMPT 126: Introduction to Computing Science and Programming Fall 2007, Harbour Centre Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University July 27, 2011 Meeting Time and
More informationInstructor. Course Description. Learning Outcomes
CS 262 Object-Oriented Design and Programming II Course Syllabus Term: Fall 2016 Credits: 4 Meets: 9:10 10:10 AM, MWR in HS 237), F in HS 101C Prerequisites: Math-108 or equivalent with a grade of C of
More informationCSCI 201L Syllabus Principles of Software Development Spring 2018
L Syllabus Principles of Software Development Spring 2018 Instructor: Jeffrey Miller, Ph.D. Email: jeffrey.miller@usc.edu Web Page: http://www-scf.usc.edu/~csci201 Office: SAL 342 Phone: 213-740-7129 Lectures:
More informationBOSTON UNIVERSITY Metropolitan College MET CS342 Data Structures with Java Dr. V.Shtern (Fall 2011) Course Syllabus
BOSTON UNIVERSITY Metropolitan College MET CS342 Data Structures with Java Dr. V.Shtern (Fall 2011) Course Syllabus 1. Course Objectives Welcome to MET CS342 Data Structures with Java. The intent of this
More informationIn this course, you need to use Pearson etext. Go to "Pearson etext and Video Notes".
**Disclaimer** This syllabus is to be used as a guideline only. The information provided is a summary of topics to be covered in the class. Information contained in this document such as assignments, grading
More informationSYLLABUS Type of evaluation
SYLLABUS 1. Information regarding the programme 1.1 Higher education Babeș-Bolyai University, Cluj-Napoca institution 1.2 Faculty Faculty of Mathematics and Computer Science 1.3 Department Department of
More informationCourse Syllabus for CS3358 (Data Structures and Algorithms) by Lee S. Koh
Course Syllabus for CS3358 (Data Structures and Algorithms) by Lee S. Koh Goal and Learning Objectives: Most computer based solutions to nontrivial problems involve the manipulation of collections of data.
More informationOperating Systems, Spring 2015 Course Syllabus
Operating Systems, Spring 2015 Course Syllabus Instructor: Dr. Rafael Ubal Email: ubal@ece.neu.edu Office: 140 The Fenway, 3rd floor (see detailed directions below) Phone: 617-373-3895 Office hours: Wednesday
More informationIntroduction to Data Structures
15-121 Introduction to Data Structures Lecture #1 Introduction 28 August 2019 Margaret Reid-Miller Today Course Administration Overview of Course A (very basic) Java introduction Course website: www.cs.cmu.edu/~mrmiller/15-121
More informationSelection, Bubble, Insertion, Merge, Heap, Quick Bucket, Radix
Spring 2010 Review Topics Big O Notation Heaps Sorting Selection, Bubble, Insertion, Merge, Heap, Quick Bucket, Radix Hashtables Tree Balancing: AVL trees and DSW algorithm Graphs: Basic terminology and
More informationTotal No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C
CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question
More informationCS61BL. Lecture 5: Graphs Sorting
CS61BL Lecture 5: Graphs Sorting Graphs Graphs Edge Vertex Graphs (Undirected) Graphs (Directed) Graphs (Multigraph) Graphs (Acyclic) Graphs (Cyclic) Graphs (Connected) Graphs (Disconnected) Graphs (Unweighted)
More informationESET 369 Embedded Systems Software, Fall 2017
ESET 369 Embedded Systems Software, Fall 2017 Syllabus Contact Information: Professor: Dr. Byul Hur Office: Fermier 008A Telephone: (979) 845-5195 FAX: E-mail: byulmail@tamu.edu Web: rftestgroup.tamu.edu
More informationSan Jose State University - Department of Computer Science
San Jose State University - Department of Computer Science CS 151, Section 4 - Object-Oriented Design Instructor:Cay S. Horstmann Email: cay.horstmann@sjsu.edu Telephone: +1-408-924-5060 Office Hours:
More informationI. PREREQUISITE For information regarding prerequisites for this course, please refer to the Academic Course Catalog.
INFT 241 Note: Course content may be changed, term to term, without notice. The information below is provided as a guide for course selection and is not binding in any form, and should not be used to purchase
More informationAbout this exam review
Final Exam Review About this exam review I ve prepared an outline of the material covered in class May not be totally complete! Exam may ask about things that were covered in class but not in this review
More information