CS331Week4
3 Pages

CS331Week4

Course Number: CS 560, Fall 2009

College/University: Illinois Tech

Word Count: 420

Rating:

Document Preview

CS 331 Week 4 Reading: Algorithms and Data Structures by Alan Parker, Section 3.4 Objectives: 1. Understanding linked list data structures 2. To implement linked list in programming Concepts: 1. Introduction to linked list 2. Linked list types and operations 3. Implementing linked list in programming Outline: 1. Introduction to Linked list i. What is linked list ii. Differences between linked list and other data...

Unformatted Document Excerpt
Coursehero >> Illinois >> Illinois Tech >> CS 560

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

CS 331 Week 4 Reading: Algorithms and Data Structures by Alan Parker, Section 3.4 Objectives: 1. Understanding linked list data structures 2. To implement linked list in programming Concepts: 1. Introduction to linked list 2. Linked list types and operations 3. Implementing linked list in programming Outline: 1. Introduction to Linked list i. What is linked list ii. Differences between linked list and other data structures iii. Advantages and limitations of linked list 2. Linked list types and operations i. Singly linked list ii. Doubly linked list iii. Circular linked list 3. Lab Exercise: Implementing linked list in programming Reference: 1. http://library.books24x7.com.ezproxy.gl.iit.edu/book/id_14841/viewer.asp?bookid=1484 1&chunkid=0994537176 2. http://en.wikipedia.org/wiki/Linked_list CS 331 Week 4- Page 1 CS 331- Week4- Lecture notes 1. Introduction to Linked list i. What is linked list i. A data structure in which each data item points to the next data item. ii. An address variable along with each data item which stores the address of next data item iii. Node, data and next address ii. Differences between linked list and other data structures i. Comparison with stacks ii. Comparison with queues iii. Comparison with arrays iii. Advantages and limitations of linked list i. Advantages 1. Takes limited space 2. Number of operations ii. Limitations 1. Searching elements 2. Time 2. Linked list types and operations i. Singly linked list i. Definition: A singly linked list is like a queue, except you can look at the nodes in the list without destroying the lists. ii. Creating singly linked list iii. Operations on Nodes 1. Add: from beginning, end, and middle 2. Delete: form beginning, end and middle iv. Traversing a list v. Deleting singly linked list ii. Doubly linked list i. Definition: A type of Linked List in which each data item points to the next and also to the previous data item. ii. Creating doubly linked list iii. Operations on Nodes 1. Add: from beginning, end, and middle 2. Delete: from beginning, end, and middle iv. Traversing a list v. Deleting doubly linked list iii. Circular linked list i. Definitio...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Illinois Tech - CS - 560
CS 331 Week 5Reading: 1. Algorithms and Data Structures in C+ by Alan Parker. Objectives: 1. To learn about Graphs as a Data Structure. 2. To get good understanding about uses and operations on Graphs. Concepts: 1. 2. 3. 4. Introduction Types of Gr
Illinois Tech - CS - 560
CS 331 Week 10Reading: 1. C+ Plus Data Structures by Dale and Teague, Chapter 10 Section 10.1 Objectives: 1. To familiarize with divide and conquer algorithm design paradigm. 2. To learn about a sorting algorithm called Merge Sort. Concepts: 1. 2.
Illinois Tech - CS - 560
_ CS 331 Week 11 _ Reading: 1. Algorithms and Data Structures by Allan Parker, Chapter 3 (Section 3.8) Objectives: 1. Good understanding on quick sort. 2. To Implement and apply quick sort. Concepts: 1. Introduction to quick sort 2. Quick sort workin
Illinois Tech - CS - 560
CS 331 Week 13Reading: 1. Richard Neapolitan and Kumarss Naimipour, Foundations of Algorithms Using C+ Pseudocode, Third Edition, Chapter 3 Objectives: 1. Learn the fundamentals of dynamic programming 2. Understand the steps involved in the develop
Illinois Tech - CS - 560
CS 331 Week 14Reading: Introduction To Algorithms, second edition, by Cormen, Rivest and Stein, chapter 16Objective: 1. Understand the greedy algorithm strategy 2. Understand various approaches of greedy algorithms 3. Implement the approaches in
Illinois Tech - CS - 560
CS440 Programming Languages and Translators Week 2Reading: 1) Prepared Online SlidesObjectives: 1) To learn what is Ocaml and how to apply it. 2) To learn the concept of recursive programming with suitable examples and applications.Concepts: 1)
Illinois Tech - CS - 560
CS440 Programming Languages and translators Week 3Reading: Prepared online slidesObjective: 1. Recursive programming continued. 2. Detailed discussion on disjoint types. 3. Introduction to higher order functions.Concepts: 1. Recursion in progra
Illinois Tech - CS - 560
CS440 Programming Languages and Translators Week 9 Reading:"Semantics of Programming language" by Gunter, Carl a. Gunter. Chapter 1.Objectives:1) To recap about the type systems and type derivations 2) To learn in detail about semantic analysis
Illinois Tech - CS - 560
_ CS 201 Week 1 _ Reading: 1. Deidel & Deidel, Chapter 2 Objectives: 1. Class overview and Introduction 2. Introduce the Java programming environment 3. Compiling and Executing Java programs Concepts: 1. Discuss Java programming basics 2. Overview of
Illinois Tech - CS - 560
CS 201 Week 4 Reading: 1. Deitel & Deitel, Chapter 7 Objectives: 1. To learn how to declare and initiate Arrays 2. To be able to search arrays 3. To be able to sort arrays using Bubble, binary, or linear sort 4. To be able to perform operations on a
Illinois Tech - CS - 560
CS 201 Week 6 Reading: 1. Deitel & Deitel, Chapter 6 Objectives: 1. To learn from mistakes made on the midterm. 2. To learn how to use, create, and customize Java methods Concepts: 1. Midterm Solutions 2. Java Methods 3. Overview of Lab 2 Outline: 1.
Illinois Tech - CS - 560
CS 201 Week 9Reading: 1. Deitel & Deitel, Chapter Objectives: 1. To learn how to use and manipulate strings.Concepts: 1. Java Strings 2. Concatenation 3. Substrings 4. String Editing 5. String ComparisonReference: 1. http:/www.prenhall.com/deit
Illinois Tech - CS - 560
CS 201 Week 10 Reading: 1. Deitel & Deitel, Chapter 9 & 10 Objectives: 1. Begin discussing Basics of Object Oriented Programming. 2. Second Midterm. 3. Assign coding part of project to students. Concepts: 1. Inheritance 2. Second Midterm 3. Project A
Illinois Tech - CS - 560
CS 201 Week 12 Reading: 1. Deitel & Deitel, Chapter 11 Objectives: 1. Continue discussing Object Oriented Programming. Concepts: 1. Polymorphism 2. Encapsulating 3. Packaging References: 1. http:/www.prenhall.com/deitel/ 2. http:/java.sun.com/j2se/1.
Illinois Tech - CS - 560
_ CS 201 - Week 13 Accelerated Intro to Computer Science (Java) _ Reading: 1. Deitel & Deitel, Chapters 10, 14 Objectives: 1. Continue discussing Object Oriented Programming 2. Learn more about Files and Streams Concepts: 1. Encapsulation 2. Files &
Illinois Tech - CS - 560
_ CS 201 - Week 14 Accelerated Intro to Computer Science (Java) _ Reading: 1. Deitel & Deitel, Chapters 10, 14 Objectives: 1. Continue discussing Object Oriented Programming 2. Learn more about Files and Streams Concepts: 1. Polymorphism 2. Files & S
Illinois Tech - CS - 560
CS 201 Final Examination December 15, 2004 Total points possible- 75Student ID number: Student Name: 10 am 12 pm Obtained Score:Instructions: This exam is a closed book, no notes, no calculator exam. There are 10 questions total. For all questio
Illinois Tech - CS - 560
CS 450-001 OPERATING SYSTEMS (Fall 2006)INSTRUCTOR: Group 4 Phone: 773.555.5555 Fax: 773.555.5556 Group4@iit.edu Office Hours: Monday 12:30 pm 3:30 pm (Room 555B SB) WEBMASTER: Group4@cs.iit.edu PREREQUISITES: In order to be eligible to take this c
Illinois Tech - CS - 560
CS 450 Operating System Week 12 Lecture NotesReading: Operating System Concepts (7th Edition) - Silberschatz, Galvin, Gagne o Chapter 12 Objectives: 1. Describes the physical structure of secondary and tertiary storage devices 2. Explain the perform
Illinois Tech - CS - 560
CS 116 Week 1: Outline Reading: 1. Dale, Chapter 6 Objectives: 1. Distribute a review handout 2. Discuss course syllabus, handouts and lab format 3. Discuss object-oriented design 4. Introduce Unified Modeling Language Concepts: 1. Discuss the basics
Illinois Tech - CS - 560
CS 116 Week 5: Outline Reading: 1. Dale, Chapter 9 2. Dale, Lab 9 Objectives: 1. Discuss exceptions and exception handling Concepts: 1. Exceptions 2. Exception handlingCS 116 Week 5 Page 1CS 116 Week 5: Lecture Outline 1. Discuss exceptions and
Illinois Tech - CS - 560
CS 116 Week 13: Outline Reading: 1. Dale, Chapter 13 (Section 1) Objectives: 1. Introduce recursion 2. Discuss any project issues or problems Concepts: 1. RecursionCS 116 Week 13 Page 1CS 116 Week 13: Lecture Outline 1. Introduce recursion Wha
Illinois Tech - CS - 560
CS 116 Week 15: Outline Reading: 1. Dale, Chapter 13 (Section 5) Objectives: 1. Finish recursion discussion 2. Final exam review 3. Lab make-up 4. Project demonstration Concepts: 1. RecursionCS 116 Week 15 Page 1CS 116 Week 15: Lecture Outline
Illinois Tech - CS - 560
CS 429 - INFORMATION RETRIEVAL Week 6Reading:Grossman & Frieder: Chapter 5Objectives: To understand the implementation of relevance feedback. To understand the concept of probabilistic model.Concepts:1. IR utilities: Relevance feedback 2. Pr
Illinois Tech - CS - 560
CS 429 - INFORMATION RETRIEVAL Week 8Reading:Grossman & Frieder: Chapter 4.Objectives: To understand the Index pruning and Efficient Query Processing techniques.Concepts:Other Efficiency TechniquesOutline:Efficiency Techniques o Index Pr
Illinois Tech - CS - 560
CS 115Week 1: Lecture Outline Objectives: 1. To introduce student's basic concepts of object oriented language. 2. To become familiar with the three phases of the software life cycle. 3. To understand compilation, execution, and interpretation of Ja
Illinois Tech - CS - 560
CS 115Week 3: Lecture Outline Objectives: 1. To understand the relationship between primitive and reference types. 2. To be able to recognize and understand other Java operators such as Increment, Decrement, Assignment, Logical and Rational Operator
Illinois Tech - CS - 560
CS 115Week 11: Lecture OutlineObjectives: 1. To understand the basic List Operations. 2. To know how to use a key to establish the order of a sorted list. 3. To recognize the difference between an array and a list. 4. To know how to search for an
Illinois Tech - CS - 560
CS 115 Week 14: Lecture Outline Objectives:1. 2. 3. 4. 5.To know how to read from a text file To know how to write to a text file To know how to read a numeric value from a file To understand what is and is not an exception To begin to understand
Illinois Tech - CS - 560
CS 4 8 7 Soft w a r e Engine e r ingTe x t : 1. Soft ware Engineering: A Pract it ioner's Approach, fourt h edit ion by Roger Pressm an ( required) Obj e ct ive s: St udent s will 1. Be int roduced t o t he principles of Soft ware Engineering. 2. De
Illinois Tech - CS - 560
CS 4 8 7 Soft w a r e Engine e r ing: Sylla busCont a ct I n for m a t ion : Em ail: abc@abc.edu Office: SB 222 Office hours: Mon and Wed 3pm t o 4: 30pm . Te x t : Soft ware Engineering: A Pract it ioner's Appr oach, fourt h edit ion by Roger
Illinois Tech - CS - 560
CS 4 8 7 W e e k 1 : Le ct ur eObj e ct ive s: St udent s will be int roduced t o t he hist ory and t he principles of soft ware engineering. They will also be int roduced t o t he t eam concept s and it s organizat ion. Re a din g Assign m e n t :
Illinois Tech - CS - 560
CS 4 8 7 W e e k 2 : Le ct u r e Obj e ct ive s: St udent s will be int roduced t o t he different process m odels in t he field of soft ware engineering. Re a din g Assign m e n t : Pressm an: Chapt ers 2 Con t e n t s: 1. 2. 3. 4. Wat erfall Lifecy
Illinois Tech - CS - 560
CS 4 8 7 W e e k 3 : Le ct u r e Obj e ct ive s: St udent s will be given t he problem st at em ent and will be int roduced t o t he soft ware deliverables, which t hey are supposed t o produce during t he sem est er. There will be a session for int
Illinois Tech - CS - 560
CS 4 8 7 W e e k 6 : Le ct u r e Obj e ct ive s: St udent s will learn t o develop a specificat ions docum ent . Re a din g Assign m e n t : Pressm an: Chapt ers 13,14 Con t e n t s: 1. 2. 3. 4. 5. 6. I nt roduct ion. ( 0.25 hour) User I nt erface Di
Illinois Tech - CS - 560
CS 4 8 7 W e e k 9 : Le ct u r e Obj e ct ive s: St udent s will learn Soft ware I m plem ent at ion and it s I ssues. Re a din g Assign m e n t : None Con t e n t s: 1. I m plem ent at ion. ( 1 hour) 2. I ssues. ( 2 hour)CS 487 - Week 9 Page 1C
Illinois Tech - CS - 560
CS 4 8 7 W e e k 1 1 : Le ct u r e Obj e ct ive s: St udent s will learn how t o t est t he soft ware. Re a din g Assign m e n t : Pressm an: Chapt ers 16 Con t e n t s: 1. Soft ware Test ing. ( 1 hour) 2. Whit e Box Test ing. ( 1 hour) 3. Black Box
Illinois Tech - CS - 560
CS 4 8 7 W e e k 1 5 : Pr oj e ct Pr e se n t a t ion s Obj e ct ive s: St udent t eam s will be present ing t heir group proj ect s. Each group will have m axim um 15 m inut es t o present t heir proj ect and 10 m inut es will be reserved for quest
Illinois Tech - CS - 560
CS445 - Object Oriented Design and Analysis Syllabus Instructor: Pratik Sonawala Email: sonapra@iit.edu Office: SB232 Hours: Monday 5pm - 7pm Webpage: http:/www.iit.edu/~cs445 Pre-requisites: CS331 (or equivalent) Contents: Students will familiarize
Illinois Tech - CS - 560
CS 351 Week 15 Course ReviewObjectives: 1. To review the contents from different weeks. 2. To have a complete understanding of important concepts from different weeks.Concepts: 1. Important Concepts from Different weeks Outline: 1. Final Exam Ins
Illinois Tech - CS - 560
CS4YY ASPECT ORIENTED PROGRAMMING LANGUAGES WEEK 5Reading: Chapter 5 from Mastering AspectJ, Aspect Oriented Programming in JAVA by Joseph D. Gradecki and Nicholas Lesiecki. Objectives: 1. To illustrate what join points are and how they are used in
Illinois Tech - CS - 560
CS4YY Aspect Oriented Programming Languages Week 13 Reading:Chapter 3 from Virtual Machine Support for Aspect-Oriented Programming Languages by Michael Haupt Chapter 12 from Mastering AspectJ, Aspect Oriented Programming in JAVA by Joseph D. Gradec
Illinois Tech - CS - 560
Team 3 CS330 Discrete Structures Week 3: Lecture Objectives: To finish off sets and introduce the basics of boolean algebra Reading Assignment: Chapter 10.1-10.4 Contents: Sets - Set operations Boolean Algebra - Laws of Boolean Algrebra Boolean Alge
Illinois Tech - CS - 560
CS4XX INTRODUTION TO COMPILER THEORY WEEK 1 Reading: Chapter 1 & 2 from Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman Objectives: 1. To provide walkthrough on course syllabus 2. To introduce in general about compiler theory
Illinois Tech - CS - 560
CS4XX INTRODUTION TO COMPILER THEORY WEEK 2 Reading: Chapter 3 from Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman Objectives: 1. To finish the study about onepass compiler 2. To introduce about the first phase of compiler:
Illinois Tech - CS - 560
CS4XX INTRODUTION TO COMPILER THEORY WEEK 9 Reading: Chapter 7 from Principles of Compiler Design, Alfred V. Aho & Jeffrey D. Ullman Objectives: 1. To understand the concepts of Run-Time environments 2. To understand Runtime storage conventions 3. To
Illinois Tech - CS - 560
CS 350 - Computer Organization and Assembly Language ProgrammingWeek 7 Readings: 1. Data Structures - Arrays, Stacks, Queues. 2. Control Statements. 3. Chapter 4: Arithmetic for Computers Pg. no 208 - 275 from "Computer Organization & Design",David
Illinois Tech - CS - 560
CS 350 COMPUTER ORGA IZATIO A D ASSEMBLY LA GUAGE PROGRAMMI G Week 13Reading: Register file organization, program counter, instruction register design, decoder design and instruction register design. . Objectives: Concepts: 1. 2. 3. 4. 5. Outli
Michigan Flint - CSC - 275
Chapter 19Standard Template LibraryCopyright 2008 Pearson Addison Wesley. All rights reservedLearning Objectives Iterators Constant and mutable iterators Reverse iterators Sequential containers Container adapters stack and queue Associat
Wells - CS - 225
CS225 Final p. 1CS 225, Fall 2004 Final exam. Due under my door on or before Thursday, Dec. 16, 1p.m.Name_Circle the ones I should grade: Put E next to Extra credit programs.Open book, notes (including TicTacToe program). No consultation with
Purdue - ECE - 362
DISTRIBUTION FOR PRIMARY ASSESSMENT OF ECE 362 COURSE OUTCOME CN-3 Spr 2009 100% ( 0) 90-99% ( 1) * 80-89% ( 5) * 70-79% ( 12) * 60-69% ( 23) * 50-59% ( 23) ** 40-49% ( 11) * 30-39% ( 3) * 20-29%
Michigan Flint - CSC - 275
Here, you are provided with most of the solution to in-class exercise 2.The goal here is mainly to follow instructions during lecture.
Michigan Flint - CSC - 275
In-class exercise 07. Monday December 1, 2008Points: 5 (participation, i.e. *TRYING TO DO IT*) + 5 extra-credit(completion)This exercise involves templating and use of the "has-a" relationship. Italso has something to do with inherita
Glasgow Caledonian University - CD - 173
CD-173 Class Observations: Activities on Seeing and HearingMichael HornDecember 9, 2003Our senses are our most fundamental learning tools. Through our earliest experiences hearing, seeing, tasting, smelling, and touching, we begin to construct
Purdue - AGEC - 424
AGEC $424$ EXAM 1 (146 points) September 25/26, 2008 Name_ Show your work for all questions (even if I forgot to put a reminder on the question). Logically correct work must be shown to receive credit for your answers. I. Computron Industries: Balanc
Iowa State - PUBLIC - 1026
Des Moines Register 10-25-07 Harkin remarks on Maytag closing Tom Harkin, D-Ia., plans to address the closing of the former Maytag plant in Newton on the floor of the Senate Thursday. Here are a copy of his remarks: "Mr. President, tomorrow, with the
Purdue - ECE - 477
ECE 477 Digital Systems Senior Design Project - Spring 2006 The J-Team / RFID Xpr3ssComplete Design Processfrom a block diagram . . . to PCB layout & fabrication . . . to a finished product!Rx016-key keypad 8240 x 128 graphical LCDw/ built-i
Michigan Flint - CH - 275
ifstream is; is.open("C:\temp\275\indata.txt"); / on windows is.open("/home/faculty/swturner/indata.txt"); / on unix is.open("indata.txt"); / on both is.open(argv[0]); / A variable name - a C-string string name = "indata.txt";
Michigan Flint - CSC - 275
23 * 22 * 21 * 20 * 19 * 18 * 17 * 16 * 15 * 14 * 13 * 12 * 11 * 10 * 9 * 8 * 7 * 6 * 5 * 4 * 3 * 2 * 1 * 0 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-
Michigan Flint - CSC - 275
988 * 984 * 967 * 965 * 935 * 926 * 916 ** 915 * 893 * 880 * 862 * 830 * 797 * 777 * 713 * 711 * 687 * 580 * 567 * 540 * 539 * 503 * 490 ** 438 * 436 * 386 * 313 * 30
Michigan Flint - CSC - 275
994 * 979 * 960 * 955 * 942 * 926 * 925 ** 920 * 918 * 893 * 882 * 865 * 834 * 765 * 757 * 736 * 667 * 627 ** 622 * 614 * 590 * 570 * 569 * 531 * 522 * 508 * 487 * 48