Samples of Evidence to Satisfy the AP Computer Science AB Curricular Requirements
|
|
- Cathleen Stafford
- 6 years ago
- Views:
Transcription
1 Samples of Evidence to Satisfy the AP Computer Science AB Curricular Requirements What s here? This table presents samples of evidence that address the curricular requirements for AP Computer Science AB. For each curricular requirement, there are three separate samples of evidence provided. Each sample either fully or partially satisfies its requirement. The samples are taken from three distinct sample syllabi published in their entirety elsewhere on AP Central. The far-left column of the table presents each of the curricular requirements. In some cases, complex requirements have been broken down into their component parts. The columns to the right present the three evidence samples. How can I use this information? Use these samples to become familiar with both the nature of evidence and the variety of formats in which evidence can be presented. For any one curricular requirement, the ways in which evidence is both described and presented can vary considerably from course to course. No single format is preferred over any other. Narrative text, tables, bulleted lists, and other formats that clearly convey the content of your course are all acceptable. The most important consideration is that your syllabus (the evidence) clearly and explicitly satisfies the curricular requirements in their entirety. Curricular Requirements The course includes all of the topics listed in the Computer Science AB column of the Topic Outline in the AP Computer Science Course Description. Unit #1 Basic Programming Structures Students learn about the components of a computer system, networks and the Internet. We explore basic programming structures. Topics include conditionals (if, ifelse), repetition (for, while, do while), design and creation of objects, arrays and ArrayLists. III. Program Analysis A. Testing 1. Test classes and libraries Unit #1 in isolation. 2. Identify boundary cases Unit #1 and generate appropriate test data. 3. Perform integration Unit #1 testing. B. Debugging 1. Categorize errors: Unit #1 and 2 compile-time, run-time, logic. 2. Identify and correct errors. Unit #1 and 2 3. Employ techniques such Unit #1 and 2 as using a debugger, adding extra output statements, or hand-tracing code. 5 th Six s Topic: Java LinkedList class and iterators (1 week) Understand the List interface and the LinkedList implementation Perform basic operations on a LinkedList object: traversals, insertions, deletions, iterators Understand the difference between an iterator and a list iterator 1 2 Revisit Hardware System, Responsible use of computer systems (system reliability, privacy, legal issues and intellectual property, social and ethical ramifications of computer use). Review - Writing Classes Writing methods in classes; Using objects; Iteration. NOTE: Because each of the evidence samples above refer to only a portion of the topics to be taught as delineated in the Computer Science A Topic Outline in the AP Computer Science Course Description, these samples only partially satisfy the Requirement. Additional evidence for the other topics, elsewhere in the syllabus, would serve to completely satisfy the Requirement. In sample 1, the author chose to also show a correlation of the Computer Science AB Topic Outline to the Learning Units that would be used during the course. These samples vary in how they show time frames for each set of topics.
2 Curricular Requirements design and implement computer-based solutions to problems in a variety of application areas. Unit #2 Efficiency of Algorithms Students learn how to evaluate the efficiency of algorithms. They evaluate expressions using prefix, infix and postfix notation. Students will use Big-Oh to classify and compare algorithms. They will also implement recursion and various sorting (insertion sort, selection sort, merge sort, quick sort, heap sort, bubble sort, shaker sort and shell sort) and searching (linear and binary) algorithms. 3 rd Six s Topic: Linked Lists using ListNode class (4 weeks) Create a LList class using ListNode class Build a linked list like a stack, queue, or inorder using a recursive helper method Implement Operations on LList object to perform traversals, insertions, and deletions Reimplement Stack, Queue, and PriorityQueue interfaces using LList class s Java Collections Framework (JCF) Java Collections Framework interfaces and classes (Collection, List, ArrayList, LinkedList, Set, TreeSet, HashSet, Map, TreeMap, HashMap, Stack, Queue, PriorityQueue, Iterator, ListIterator); Choose appropriate advanced data structures and algorithms. Lists and Iterators Implementation (using ListNode) and use of linked lists (singly, doubly, and circular); Traversals, insertions, deletions, iterators Stacks and Queues Implementation and use of stacks and queues (traversals, insertions, deletions, iterators); Review of JCF Stack and Queue. Unit #2 Efficiency of Algorithms 5 th Six s Students learn how to evaluate the efficiency of algorithms. They evaluate expressions using prefix, infix and postfix notation. Topic: Sorting, Searching, and Big-Oh Perform complexity analysis of algorithms using Big-Oh notation Recognize typical Big-Oh functions and be able to order them in order of increasing growth rate: 9 Big-Oh Analysis of Algorithms Worst-case and average-case time and space analysis of algorithms using Big-Oh notation; Review of sorts (selection, insertion, mergesort, and quicksort). use and implement commonly used algorithms and data structures. c log N N NlogN N 2 N 3 2 N Understand the following Sorting Algorithms: Merge, Selection, Heap, Quick, and Insertion Understand the following Searching Algorithms: Sequential and Binary Understand the Big-Oh analysis for the above sorting and searching algorithms, worst-case, average-case time and space analysis
3 Curricular Requirements develop and select appropriate algorithms and data structures to solve problems. Unit #2 Efficiency of Algorithms Students will use Big-Oh to classify and compare algorithms. They will also implement recursion and various sorting (insertion sort, selection sort, merge sort, quick sort, heap sort, bubble sort, shaker sort and shell sort) and searching (linear and binary) algorithms. 1 st Six s Topic: Stacks Understand the behavior of a stack and identify situations where a stack is the appropriate data structure to use Operations on Stacks: traversals, insertions, deletions Recursion Understanding and implementing structural and procedural recursion. Binary Search Trees Implementation (using TreeNode) and use of Binary Search Trees (traversals, insertions, deletions, iterators); Review of JCF Set, Map, TreeSet, TreeMap Look-up Tables and Hashing Implementation and use of look-up tables and hash tables (traversals, insertions, deletions, iterators); hashcode method; Review of JCF Set, Map, HashSet, HashMap. code fluently in an objectoriented paradigm using the programming language Java. use standard Java library classes from the AP Java subset delineated in Appendices A and B of the AP Computer Science Course Description. (Note: Students who study a language other than Java in AP Computer Science must also be taught to use Java, as specified in the AP Java subset.) Unit #3 Abstract Data Students work with advanced Java data structures. Topics include trees, heaps, stacks, queues, sets, maps, hashing and linked lists. II. Program Implementation The overall goals of program implementation parallel those of program design. Classes that fill common needs should be built so that they can be reused easily in other programs. Object-oriented design is an important part of program implementation. C. Java library classes (included in the AB-level Java Subset) Unit #1 and 3 2 nd Six s Topic: GridWorld Case Study Parts 1 4 Review Testing Class modification Inheritance Reference/Readings: GridWorld Narrative, Parts 1-4 Programs: Write BlusterCritter and KingCrab classes that extend given GridWorld classes 5 Classes Hierarchies, Abstract Classes, and Interfaces Inheritance; Polymorphism using classes and interfaces; Specify the purpose and goals for a problem; Decompose a problem into classes, define relationships and responsibilities of those classes; Design and implement a set of interacting classes; Design an interface.
4 Curricular Requirements read and understand a large program consisting of several classes and interacting objects, and enables students to read and understand the current AP Computer Science Case Study posted on AP Central. Unit #4 GridWorld Case Study Students work on Parts One, Two, Three and Four of the GridWorld Case Study and study Part Five. 4 th Six s Topic: Grid World Case Study Parts 1-4 Understand the Grid Interface Consider alternate implementations of a BoundedGrid Consider and code at least one implementation of an UnboundedGrid GridWorld Case Study: Students visit the first four parts of the case study for review of Java and inheritance. Part 5 suggests several implementations for the UnboundedGrid. Students will code alternative UnboundedGrid implementations using lists, a sparse matrix, and a hash map or tree map. identify the major hardware and software components of a computer system, their relationship to one another, and the roles of these components within the system. Unit #1 Basic Programming Structures Students learn about the components of a computer system, networks and the Internet. We explore basic programming structures. Topics include conditionals (if, ifelse), repetition (for, while, do while), design and creation of objects, arrays and ArrayLists. Topic: Reintroduce Programming Interactions of hardware and software components in the lab User responsibility of computer systems and legality of district use of the network 1 2 Revisit Hardware System, Responsible use of computer systems (system reliability, privacy, legal issues and intellectual property, social and ethical ramifications of computer use). Review - Writing Classes Writing methods in classes; Using objects; Iteration. recognize the ethical and social implications of computer use. Unit #5 The Computer and Society Students explore how the computer has affected society through various assignments. They look at case studies and a variety of issues pertaining to environmental concerns, hardware and software, careers, computer crimes and miscellaneous items. Students will investigate and analyze careers created by the introduction of computers to society and examine the impact of rapid technology changes on local businesses. They will also have opportunities to reflect on whether they would choose a computer science related career and create a code of computing ethics. Topic: Reintroduce Programming Interactions of hardware and software components in the lab User responsibility of computer systems and legality of district use of the network 1 2 Revisit Hardware System, Responsible use of computer systems (system reliability, privacy, legal issues and intellectual property, social and ethical ramifications of computer use). Review - Writing Classes Writing methods in classes; Using objects; Iteration.
5 Samples of Evidence that Address Multiple Requirements What s here? This table presents samples of evidence that each address several Curricular Requirements for AP Computer Science AB. For each sample provided in the left column, the corresponding Curricular Requirements are provided to the right. Note that each sample may only partially satisfy one or another requirement, and additional evidence would need to be provided elsewhere in the syllabus to address the requirement(s) with complete satisfaction. These samples were taken from three distinct sample syllabi that are published elsewhere on AP Central in their entirety. How can I use this information? Use these samples to become familiar with ways in which numerous Curricular Requirements can be addressed (either partially or completely) within the description of one unit, lesson, or activity, or by describing a recurring theme or process in your course. Integrated Evidence from Selected Syllabi Requirements Addressed (Partially or Fully) by Integrated Evidence Bold text indicates the portion(s) of the requirement that are demonstrated. 1 st Six s Topic: Reintroduce Programming o o Interactions of hardware and software components in the lab User responsibility of computer systems and legality of district use of the network Make connections to previous knowledge and program techniques Develop and implement a set of interacting classes (Java) Readings: Big Java Chapters 2,3,5,6,7,9,11,13 Programs: Lottery: Write a set of classes that models a lottery machine similar to the lottery drawing seen on TV. Sieve of Eratosthenes: Write a class that will produce an array of prime numbers in a given range of 1 to n. Wordlist: Implement a set of classes that stores a searchable list of words code fluently in an object-oriented paradigm using the programming language Java. use standard Java library classes from the AP Java subset delineated in Appendices A and B of the AP Computer Science Course Description. (Note: Students who study a language other than Java in AP Computer Science must also be taught to use Java, as specified in the AP Java subset.) identify the major hardware and software components of a computer system, their relationship to one another, and the roles of these components within the system recognize the ethical and social implications of computer use. Unit #1 Basic Programming Structures Students learn about the components of a computer system, networks and the Internet. We explore basic programming structures. Topics include conditionals (if, if-else), repetition (for, while, do while), design and creation of objects, arrays and ArrayLists. use and implement commonly used algorithms and data structures identify the major hardware and software components of a computer system, their relationship to one another, and the roles of these components within the system.
6 Integrated Evidence from Selected Syllabi Unit 1 What Are Data Structures? What Are Algorithms? Review of Java and OOP o Language Features o Classes, Encapsulation, Abstract Data Types Decompose into classes o Inheritance, Polymorphism and Dynamic Binding o Interfaces o JavaDocs, Specifications, Pre-/Post-Conditions Arrays and ArrayLists Review of Linear Traversal Patterns Parts 1 4 of GridWorld Case Study Requirements Addressed (Partially or Fully) by Integrated Evidence Bold text indicates the portion(s) of the requirement that are demonstrated. use and implement commonly used algorithms and data structures code fluently in an object-oriented paradigm using the programming language Java. use standard Java library classes from the AP Java subset delineated in Appendices A and B of the AP Computer Science Course Description. (Note: Students who study a language other than Java in AP Computer Science must also be taught to use Java, as specified in the AP Java subset.) read and understand a large program consisting of several classes and interacting objects, and enables students to read and understand the current AP Computer Science Case Study posted on AP Central.
AP Computer Science AB
AP Computer Science AB Dr. Tyler Krebs Voice Mail: 431-8938 Classroom: B128 Office: TV Studio Characteristics We Value in This Classroom: 1. Respect. (Show respect for everyone and everything.) 2. Integrity.
More informationBoca Raton Community High School AP Computer Science A - Syllabus 2009/10
Boca Raton Community High School AP Computer Science A - Syllabus 2009/10 Instructor: Ronald C. Persin Course Resources Java Software Solutions for AP Computer Science, A. J. Lewis, W. Loftus, and C. Cocking,
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 informationJava Software Solutions for AP Computer Science 3rd Edition, Lewis et al. 2011
A Correlation of AP Computer Science 3rd Edition, Lewis et al. 2011 To the INTRODUCTION This document demonstrates how AP (Advanced Placement) Computer Science, 3rd Edition 2011, Lewis et al. meets the
More informationAP COMPUTER SCIENCE AB
AP COMPUTER SCIENCE AB SYLLABUS MR. BACU Course Overview AP Computer Science AB is taught over a period of one year, extending the concepts studied in the previous two courses. The first previous course,
More informationAP Computer Science AB
AP Computer Science AB Course Overview I teach AP Computer Science as a three year sequence and as a two year sequence. An introductory Computer Science course, which introduces many AP Computer Science
More informationAP Computer Science A Syllabus
AP Computer Science A Syllabus Course Overview The focus of this class is structured logic with an emphasis on developing simple, elegant algorithms and thinking in an object-oriented manner. The Java
More informationIMACS: AP Computer Science A
IMACS: AP Computer Science A OVERVIEW This course is a 34-week, 4 classroom hours per week course for students taking the College Board s Advanced Placement Computer Science A exam. It is an online course
More informationCompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards
CompuScholar, Inc. Alignment to Nevada "Computer Science" Course Standards Nevada Course Details: Course Name: Computer Science Primary Cluster: Information and Media Technologies Standards Course Code(s):
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 informationTeenCoder : Java Programming (ISBN )
TeenCoder : Java Programming (ISBN 978-0-9887070-2-3) and the AP * Computer Science A Exam Requirements (Alignment to Tennessee AP CS A course code 3635) Updated March, 2015 Contains the new 2014-2015+
More informationCompuScholar, Inc. 9th - 12th grades
CompuScholar, Inc. Alignment to the College Board AP Computer Science A Standards 9th - 12th grades AP Course Details: Course Title: Grade Level: Standards Link: AP Computer Science A 9th - 12th grades
More informationAP Computer Science A (Java) Scope and Sequence
AP Computer Science A (Java) Scope and Sequence The CodeHS AP Java course is a year-long course designed to help students master the basics of Java and equip them to successfully pass the AP Computer Science
More informationComputer. Course Description
Computer Science Computer Science A Computer Science AB Course Description May 2009 The College Board: Connecting Students to College Success The College Board is a not-for-profit membership association
More informationBloss, Adrienne and N. Jane Ingram. Lab Manual to Accompany Java Software Solutions. New York, New York: Pearson Education, Inc, 2003.
Course Overview AP Computer Science A emphasizes a study in object-oriented programming methodologies with a focus on problem solving and algorithm development. Data structures, design, and abstraction
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 informationAP COMPUTER SCIENCE A: SYLLABUS
Curricular Requirements CR1 The course teaches students to design and implement computer-based solutions to problems. Page(s) 2,3-4,5,6-7,8-9 CR2a The course teaches students to use and implement commonly
More informationWITH C+ + William Ford University of the Pacific. William Topp University of the Pacific. Prentice Hall, Englewood Cliffs, New Jersey 07632
DATA STRUCTURES WITH C+ + William Ford University of the Pacific William Topp University of the Pacific Prentice Hall, Englewood Cliffs, New Jersey 07632 CONTENTS Preface xvii CHAPTER 1 INTRODUCTION 1
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 informationB. Knowledge of basic algebra and experience in problem solving is beneficial. Students should also possess competence in written communication.
Course Title: AP Computer Science AB (DL) Meeting Times: This is a 36 week course. Students engage in the online class according to the same academic calendar of their schools. Additionally, they can expect
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 informationCourse materials Reges, Stuart, and Stepp, Martin. Building Java Programs: A Back to Basics Approach. 2d ed. (Boston: Addison-Wesley, 2011).
AP Computer Science A Advanced Placement Computer Science A is a fast-paced course equivalent to a college introductory programming class. Students will learn about the exciting kinds of problems tackled
More informationCourse: AP Computer Science A Description and Syllabus Description of Course:
Page 1 Course: AP Computer Science A 2007-2008 Description and Syllabus Description of Course: AP Computer Science A is designed to: Train students in programming methodology to produce quality computer-based
More informationCollege Board. AP CS A Labs Magpie, Elevens, and Picture Lab. New York: College Entrance Examination Board, 2013.
AP Computer Science August 2014 June 2015 Class Description AP Computer Science is the second class after Pre-AP Computer Science that together teach the fundamentals of object-oriented programming and
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 informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 COMPUTER SCIENCE AND ENGINEERING COURSE DESCRIPTION FORM Course Title Course Code Regulation Course Structure Course Coordinator
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 informationCurriculum Map Grade(s): Subject: AP Computer Science
Curriculum Map Grade(s): 11-12 Subject: AP Computer Science (Semester 1 - Weeks 1-18) Unit / Weeks Content Skills Assessments Standards Lesson 1 - Background Chapter 1 of Textbook (Weeks 1-3) - 1.1 History
More informationAP Computer Science A Course Syllabus
AP Computer Science A Course Syllabus Textbook: Litvin, Maria and Litvin, Gary. Java Methods: Object-Oriented Programming and Data Structures. Skylight Publishing, 2011 http://www.skylit.com Course Description:
More informationObject-Oriented Programming and Data Structures
Java Methods A & AB Object-Oriented Programming and Data Structures Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts
More informationR13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)
SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)
More informationTopics for CSCI 151 Final Exam Wednesday, May 10
Topics for CSCI 151 Final Exam Wednesday, May 10 Java and Programming Techniques Types Inheritance Generics Abstract classes and interfaces Exceptions Recursion Writing recursive methods Dynamic Programming
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 informationAP Computer Science A Skyline High School Mr. Coupland
AP Computer Science A Skyline High School Mr. Coupland AP Computer Science A covers the materials in a typical first-semester computer science course taught at major universities around the country. Java
More informationDYNAMIC MEMORY ALLOCATION AND DEALLOCATION
COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of
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 informationData Structures and Algorithms 1
CS Content Academy: Data Structures Outline 1. How Does Data Structures Fit into CS What Is CS? 2. What Are Data Structures and Algorithms? 3. The Structure of Data Structures and Algorithms 3.1 Part A:
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 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 information1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \
BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,
More informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
Code No: R21051 R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 DATA STRUCTURES (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 Answer any FIVE Questions All Questions carry
More informationAP Computer Science A
AP Computer Science A The AP Computer Science A course is an introductory computer science course. A large part of the course involves developing the skills to write programs or parts of programs that
More informationAP Computer Science Course Syllabus
AP Computer Science Course Syllabus The AP Computer Science course is a yearlong course designed to help students master the basics of Java and equip them to successfully pass the College Board AP Computer
More information1. Attempt any three of the following: 15
(Time: 2½ hours) Total Marks: 75 N. B.: (1) All questions are compulsory. (2) Make suitable assumptions wherever necessary and state the assumptions made. (3) Answers to the same question must be written
More informationWrite the code to create an enhanced for loop that will go through every member of an ArrayList <String> myarray and print it out to the console.
COSC 201 Review Questions Final Fall 2015 Write the code to create an enhanced for loop that will go through every member of an ArrayList myarray and print it out to the console. Give the code
More information182 review 1. Course Goals
Course Goals 182 review 1 More experience solving problems w/ algorithms and programs minimize static methods use: main( ) use and overload constructors multiple class designs and programming solutions
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 informationCollections Questions
Collections Questions https://www.journaldev.com/1330/java-collections-interview-questions-and-answers https://www.baeldung.com/java-collections-interview-questions https://www.javatpoint.com/java-collections-interview-questions
More informationS.E. (Computer) (First Semester) EXAMINATION, 2011 DATA STRUCTURES AND ALGORITHM (2008 PATTERN) Time : Three Hours Maximum Marks : 100
Total No. of Questions 12] [Total No. of Printed Pages 7 [4062]-204 S.E. (Computer) (First Semester) EXAMINATION, 2011 DATA STRUCTURES AND ALGORITHM (2008 PATTERN) Time : Three Hours Maximum Marks : 100
More informationDATA STRUCTURES AND PROBLEM SOLVING USING JAVA
DATA STRUCTURES AND PROBLEM SOLVING USING JAVA Second Edition MARK ALLEN WEISS Florida International University Addison Wesley Boston San Francisco New York London Toronto Sydney Tokyo Singapore Madrid
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 informationR10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May
www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the
More informationAP Computer Science A
AP Computer Science A Couse Information: Couse Title: AP Computer Science A Couse Number: 8317 Length of Course: Full year No. of Credits: 1.0 Instructor Information: Instructor: Michael George Email:
More informationAP Computer Science A Syllabus
This syllabus #1829769v1 was reviewed and approved by the College Board in Nov, 2016.. AP Computer Science A Syllabus Last updated November, 2016 Course Overview This AP Computer Science A class uses the
More informationAPJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)
D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.
More informationBuilding Java Programs
Building Java Programs A Back to Basics Approach Stuart Reges I Marty Stepp University ofwashington Preface 3 Chapter 1 Introduction to Java Programming 25 1.1 Basic Computing Concepts 26 Why Programming?
More informationCS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon
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)
More informationA6-R3: DATA STRUCTURE THROUGH C LANGUAGE
A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF
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 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 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 informationDraw a diagram of an empty circular queue and describe it to the reader.
1020_1030_testquestions.text Wed Sep 10 10:40:46 2014 1 1983/84 COSC1020/30 Tests >>> The following was given to students. >>> Students can have a good idea of test questions by examining and trying the
More informationCS 61B Summer 2005 (Porter) Midterm 2 July 21, SOLUTIONS. Do not open until told to begin
CS 61B Summer 2005 (Porter) Midterm 2 July 21, 2005 - SOLUTIONS Do not open until told to begin This exam is CLOSED BOOK, but you may use 1 letter-sized page of notes that you have created. Problem 0:
More informationOHIO ASSESSMENTS FOR EDUCATORS (OAE) FIELD 010: COMPUTER INFORMATION SCIENCE
OHIO ASSESSMENTS FOR EDUCATORS (OAE) FIELD 010: COMPUTER INFORMATION SCIENCE June 2013 Content Domain Range of Competencies Approximate Percentage of Assessment Score I. Computer Use in Educational Environments
More informationDATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA
DATA ABSTRACTION AND PROBLEM SOLVING WITH JAVA WALLS AND MIRRORS First Edition Frank M. Carrano University of Rhode Island Janet J. Prichard Bryant College Boston San Francisco New York London Toronto
More informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad -500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Name : DATA STRUCTURES Course Code : A30502 Class : II B.
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 informationSTRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR
STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.
More informationFORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE
TED (10)-3071 Reg. No.. (REVISION-2010) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours (Maximum marks: 100)
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 informationHomeschool Programming, Inc.
Online Course Overview Course Title: TeenCoder: Java Programming TeenCoder: Java Programming Online Course Syllabus and Planner Updated November, 2015 Online ISBN: 978-0-9887070-2-3, published 2015 by
More informationAP Computer Science in Java Course Syllabus
CodeHS AP Computer Science in Java Course Syllabus College Board Curriculum Requirements The CodeHS AP Java course is fully College Board aligned and covers all seven curriculum requirements extensively
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 informationEnd-Term Examination Second Semester [MCA] MAY-JUNE 2006
(Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.
More information3D Graphics Programming Mira Costa High School - Class Syllabus,
3D Graphics Programming Mira Costa High School - Class Syllabus, 2009-2010 INSTRUCTOR: Mr. M. Williams COURSE GOALS and OBJECTIVES: 1 Learn the fundamentals of the Java language including data types and
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 informationCS2013 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 informationSY nd Sem Syllabi-All Courses.xlsx - 2S-APCSA Page 1 of 5
Greenfoot Exercises - Learning Objects Basic Java Concepts s, Application & 1/8/18 Mon Teacher Training Introductions, Class Rules, Issue materials, 1 1/9/18 Tue discuss/demonstrate: course content and
More informationAP Computer Science A Sample Syllabus 4
Curricular Requirements CR1 The course teaches solutions to problems. Page(s) 3, 4, 5, 6, 7, 8, 10 CR2a The course teaches students to use and implement commonly used algorithms. 4, 9 CR2b The course teaches
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 informationEXAMINATIONS 2016 TRIMESTER 2
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2016 TRIMESTER 2 COMP103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
More informationAP Computer Science A Syllabus
AP Computer Science A Syllabus 2017-2018 School Year Instructor Information Instructor Email School/ Room Mr. Michael Karolewicz karolewiczm@tmore.org St Thomas More HS, Rm 355 Course Overview Our Class
More informationCurriculum Mapping for National Curriculum Statement Grades R-12 and Oracle Academy.
Curriculum Mapping for National Curriculum Statement Grades R-12 and Oracle Academy. Contents Executive Summary... 3 IT Curriculum Overview... 3 Aims... 3 Oracle Academy Introduction to Computer Science...
More informationSt. MARTIN s ENGINERING COLLEGE Dhulapally,Secunderabad
St. MARTIN s ENGINERING COLLEGE Dhulapally,Secunderabad-500014 INFORMATION TECHNOLOGY COURSE DESCRIPTION FORM Course Title Data Structures Course Code A30502 Regulation R13-JNTUH Course Structure Lectures
More informationCIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)
By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable
More informationDEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY
DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR
More informationSample Question Paper
Scheme - I Sample Question Paper Marks : 70 Time: 3 Hrs. Q.1) Attempt any FIVE of the following. 10 Marks a. Write any four applications of data structure. b. Sketch the diagram of circular queue. c. State
More informationComputer. Course Description. Computer Science AB. M a y , M a y
Computer Science Computer Science A Computer Science AB Course Description M a y 2 0 0 7, M a y 2 0 0 8 The College Board: Connecting Students to College Success The College Board is a not-for-profit membership
More informationAP COMPUTER SCIENCE GRADES 10 12
AP COMPUTER SCIENCE GRADES 10 12 THE EWING PUBLIC SCHOOLS 2099 Pennington Road Ewing, NJ 08618 BOE Approval Date: June 25, 2018 Michael Nitti Written by: College Board (Based) Superintendent 1 Contents
More informationTribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:
Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:
More informationSyllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II
Subject Code: 01CE0301 Subject Name: Data Structure B.Tech. Year - II Objective: Data structure has high importance in the field of Computer & IT. Organization of data is crucial for implementation and
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 informationDS ata Structures Aptitude
DS ata Structures Aptitude 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge
More informationLESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER
DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY
More informationEXAMINATIONS 2015 COMP103 INTRODUCTION TO DATA STRUCTURES AND ALGORITHMS
T E W H A R E W Ā N A N G A O T E Student ID:....................... Ū P O K O O T E I K A A M Ā U I VUW VICTORIA U N I V E R S I T Y O F W E L L I N G T O N EXAMINATIONS 2015 TRIMESTER 2 COMP103 INTRODUCTION
More informationSeth Jai Parkash Polytechnic, Damla
Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018
More informationCS 310: Maps and Sets and Trees
CS 310: Maps and Sets and Trees Chris Kauman Week 8-2 Logistics Oce hours Wednesday normal: 4:30-5:30pm Thursday 2-3pm special oce hours Reading Weiss Ch. 6 (Java Library Classes/Interfaces) 6.7 Sets,
More informationEXAMINATIONS 2011 Trimester 2, MID-TERM TEST. COMP103 Introduction to Data Structures and Algorithms SOLUTIONS
T E W H A R E W Ā N A N G A O T E Ū P O K O O T E I K A A M Ā U I VUW V I C T O R I A UNIVERSITY OF WELLINGTON Student ID:....................... EXAMINATIONS 2011 Trimester 2, MID-TERM TEST COMP103 Introduction
More informationAP Computer Science A Syllabus DRAFT 0.3 June 27th, 2015 Course Overview
AP Computer Science A Syllabus DRAFT 0.3 June 27th, 2015 Course Overview AP Computer Science A in Java is based on the syllabus developed by the College Board. Topics include program design and implementation,
More informationMSc(IT) Program. MSc(IT) Program Educational Objectives (PEO):
MSc(IT) Program Master of Science (Information Technology) is an intensive program designed for students who wish to pursue a professional career in Information Technology. The courses have been carefully
More information