UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming


 Willa Watts
 5 years ago
 Views:
Transcription
1 UIL Computer Science for Dummies by Jake Warren and works from Mr. Fleming 1
2 2 Foreword First of all, this book isn t really for dummies. I wrote it for myself and other kids who are on the team. Everything here is stuff that either nabbed me on tests or is very obscure information. Hopefully this book will help you in your studies. Jake Warren P.S. Don t forget to send you feedback to either or
3 Table of Contents 3
4 4 Binary Search Trees A value that is less than the value in the parent node goes to the left. The following values are inserted into the tree:
5 5 Inorder Traversal Returns values in ascending order
6 6 PreOrder Traversal Process the left subtree first Process the right subtree next Start at the top Work your way down
7 7 PostOrder Traversal Start with the children from the bottom up. Process the left nodes first Parent node last!!! Binary Search Tree Notes If a duplicate value is inserted, it will be discarded. BigO Notation Extremely Fast Common: log 2 n Worstcase: log 2 n
8 8 Insertion Sort Here is how the insertion sort works graphically: You have a collection of CDs; each CD has an ID#, and you want to sort them in ascending order. 1. Add the new CD Compare the new CD(CD5) with the rightmost CD(CD9). Since 5 is less than 10, swap them
9 9 3. Repeat Step 2 until the new CD is greater than the CD to the left
10 10 Here is the recursive function that does the sort: int[5] mlist = new int [] 1,2,4,5,3; public void insertitem(int ItemToInsert) *swap( itemtoinsert,itemtoinsert 1 ); itemtoinsert; If( (itemtoinsert >= 1 ) && ( mlist[ itemtoinsert ] <= mlist[ itemtoinsert 1] ) ) insertitem( itemtoinsert ); //recurse Here s a breakdown of the code: public void insertitem(int ItemToInsert) swap( itemtoinsert,itemtoinsert 1 ); 1. This method takes an integer(itemtoinsert) representing the offset of the item to insert. Then the function swaps it immediately to the left. itemtoinsert; 2. For example, if the itemtoinsert variable has the value 5, you will need to swap the items at the offset 5 and 4. Having made that swap you now want to examine item 4 to see if it is bigger or smaller than item 3. To do so, you must decrement the itemtoinsert variable. If( (itemtoinsert >= 1 ) && ( mlist[ itemtoinsert ] <= mlist[ itemtoinsert 1] ) ) insertitem( itemtoinsert ); //recurse 3. Now you must compare again, if you find that item 3 is smaller, you must recurse the method. * The swap function is not included here, assuming that you understand the logic of a swap function.
11 11 4. You continue to recurse until you find the right spot or the list runs out. Insertion Sort Performance BigO Notation: N 2 /4
12 12 Selection Sort The Selection Sort compares the first index j through the list and if it finds a smaller value than minimum it swaps it. The j is incremented and the process starts all over again. public void SelectionSort() int minimum; int nitems = mlist.length()1; for( int j = 0; j < nitems1; ++j) minimum = j; for( int w = j + 1; w < nitems; ++w) if( mlist[w] < minimum) minimum = j; if( minimum!= j) swap( minimum, j); Here s a breakdown of the code: This method works by using an outer loop to iterate through the list; and an inner loop to compare the items. The outer loop: for( int j = 0; j < nitems1; ++j) Then you make an inner loop: for( int w = j + 1; w < nitems; ++w)
13 13 If the loop finds a smaller value, then minimum is reset. if( mlist[w] < minimum) minimum = j; Then if minimum doesn t equal the value of j, the two values are swapped: if( minimum!= j) swap( minimum, j); Selection Sort Performance BigO Notation: Average: ( N * ( N 1 ) ) / 2 Worstcase: N 1
14 14 Bubble Sort Bad choice for a sort, but shows up on a few tests. The bubble sort works by comparing the first two elements in the list. If the second element is larger, then they are swapped. Then it compares the second and third item, and so on. Here is the Bubble Sort code: Public void BubbleSort() For(int j = nitems 1; j >= 1; j++) For(int w =1; w <= j; w++) If(mList[w] < mlist[w1]) Swap( j, j1); Bubble Sort Performance BigO Notation: N 2 / 2
15 15 System.out.println() Tip: Memorize these! \n  new line \t  horizontal tab \r  carriage return; moves cursor back to start.(not a new Line!!!) All characters will be overwritten!!! \\  backslash \  used to print a double quote If a println() statement starts out with a ( ) character, then all output becomes strings. Int x = 3, y = 4; String s = UIL ; System.out.println( + x + y + s); Displays: 34UIL However: Int x = 3, y = 4; String s = UIL ; System.out.println(x + y + s); Displays: 7UIL
16 16?:?: is a unary operator that is a condensed version of an if statement. 1 3 (statement)? true : false 2 1. The statement that is evaluated to either true or false. 2. If the statement evaluates to true, then this value is returned. 3. If the statement evaluates to false, then this value is returned. System.out.println( StudentGrade >= 60? Passed : Failed ); If the student has an 80 average, then Passed is printed. If he has a 50 average, then Failed is printed.
17 17 Switch Can ONLY accept: byte, char, short, int values Exits immediately if it hits a break statement. Continues if it doesn t; or falls through, executing every statement below. Uses the default only if a case is not met. Characters must be in single quotes,. Int x = 1; Switch(x) Case 0: x=2; Break; Case 1: x=3; Break; Default: x=1; X = 2 Int x = 0; Switch(x) Case 0: x=1; Case 1: x=32767; Default: x=1; X = 32767!!!! char ch = x ; Switch(ch) Case 0: ch= j ; break; Case 1: ch= w ; break; Ch still equals x!!!!
18 18 BASE ARITHMETIC Converting decimal to binary To convert decimal to binary is also very simple, you simply divide the decimal value by 2 and then write down the remainder, repeat this process until you cannot divide by 2 anymore, for example let's take the decimal value 157: = = = = = = = = 0 with a remainder of 1 with a remainder of 0 with a remainder of 1 with a remainder of 1 with a remainder of 1 with a remainder of 0 with a remainder of 0 with a remainder of 1 < to convert write this remainder first. Next write down the value of the remainders from bottom to top (in other words write down the bottom remainder first and work your way up the list) which gives: = 157 To Convert Hexadecimal to Binary Take the number A7 16 as an example (Hexadecimal numbering runs from (0F) ) Separate it into individual digits A is the tenth value in the hexadecimal numbering system. Write ten in binary A becomes 1010 Now write 7 in binary 7 becomes 0111 A + 7 = So A7 16 = To Convert Binary to Hexadecimal Break Binary number into blocks of 4 digits Example broken in two becomes 1011 and 1101 Convert 1011 to decimal Hexadecimal = B Convert 1101 to decimal Hexadecimal = D (1*8 + 0*4 + 1*2 + 1*1) =11 Convert 11 to (1*8 + 1*4 + 0*2 + 1*1) =13 Convert 13 to That means that is equal to BD 16
19 19 To Convert Decimal numbers to Hexadecimal Method 1 2 Step Process Convert Decimal to Binary then Convert Binary to Hexadecimal Method 2 Determine largest possible power of 16 that is less than the decimal number. Examples 3899 Largest power of 16 less than 3899 is 256 (next power of 16 is 4096) Divide 3899 by 256 Quotient is 15 Remainder is 59 Divide 59 by 16 Quotient is 3 Remainder is 11 Convert each quotient to hexadecimal 15 = F 11 = B Results F3B 16 Obviously method one is preferred To Convert Octal numbers to Binary numbers Example Separate into individual numbers and convert to binary (3 places only) 3 = = = 001 So = Example = = = 101 So =
20 20 To Convert Binary numbers to Octal numbers Example (special note will be breaking into groups of three so you may need to add a zero in front) Adding a zero in front of making it Breaking into groups of three Convert each group to decimal 001 = = = 5 So = Example = = = 5 So = 705 8
21 21 To find the sum of numbers in mixed format 3 Step Process 1. Convert all values to Binary 2. Line up and do binary arithmetic 3. Convert Binary answer to Octal and Hexadecimal values Example 6A Convert 6 = 0110 A = 1010 = = = 100 = Line them up and do arithmetic RULES FOR BINARY ARITHMETIC 1. Only 1 and 0 are allowed 2. When summing each column: Sum of 2 put down a 0 and carry a 1 Sum of 3 put down a 1 and carry a 1 Sum of 4 put down zero and carry a 2 3. Work as far to the left as needed Original Number A (base 16) (base 8) So 6A = IF THAT ISNT AN ANSWER CHOICE THEN YOU MUST CONVERT IT Convert to Octal 101 = 5 011= 3 100=4 so answer = Convert to Hexadecimal (must use groups of 4 so need to add 000 to front of = = = 12 so it equals 15C 16
22 22 Bitwise Operators 1. Analyze the problem. 2. Breakdown into binary. 3. Line up the binary. 4. Solve. 5. Translate back into decimal. &  Bitwise AND: The resulting bits are set to 1 if both bits are 1. 6 & 4 //Statement //Broken into binary = 100 //The resulting binary number 4 // Translated back into decimal  Bitwise Inclusive OR: The resulting bits are set to 1 if either bit is //Statement //Broken into binary = //The resulting binary number 31 // Translated back into decimal  Bitwise Exclusive OR: The resulting bits are set to 1 if only one bit is ^ 7 //Statement //Broken into binary = //The resulting binary number 6 // Translated back into decimal
23 23 <<  Left Shift: Shift the bits of the first operand to the left by the number specified by the second operand; fill from right with 0s 6 << 2 //Statement //Broken into binary = //The resulting binary number 24 // Translated back into decimal >>  Signed Right Shift: Shift the bits of the first operand to the right by the number specified by the second operand; if the operand is negative, fill from left with 1s, otherwise fill in with 0s. 6 >> 2 //Statement 110 //Broken into binary = 001 //The resulting binary number 1 // Translated back into decimal 6 >> 2 //Statement 110 //Broken into binary = //The resulting binary number 30 // Translated back into decimal >>>  Unsigned Right Shift: Shift the bits of the first operand to the left by the number specified by the second operand; fill from left with 0s 6 >>> 2 //Statement 110 //Broken into binary = 001 //The resulting binary number 1 // Translated back into decimal ~  Bitwise Complement: All 0s are set to 1, all 1 bits are set to 0. ~25 //Statement //Broken into binary //The resulting binary number 6 //Translated back into decimal
24 24 String Tokenizer StringTokenizer is used to parse sentences into strings It removes all punctuation marks and white space.nexttoken() : Returns the next token.hasmoretokens() : Returns true or false depending upon whether you have used up your tokens StringTokenizer tk = new StringTokenizer( Hello Everyone ); System.out.println(tk.nextToken()); System.out.println(tk.hasMoreTokens()); System.out.println(tk.nextToken()); Displays: Hello true Everyone
25 25 Exceptions Exceptions are used to capture errors. Try // code goes here Catch( Exception e) // if an exception is thrown, this code is executed Finally // runs whether or not an exception is thrown
26 26 Stacks A stack operates like a stack of cups. Operates in LIFO order push() puts a new cup on top of the stack pop() pops a cup off of the top of the stack peek() looks at the bottom of the stack push(5)
27 27 pop()
28 28 peek() Stack s = new Stack(); Object obj; s.push( a ); s.push( b ); s.push( c ); obj = s.peek(); s.push(obj + d ); s.push(obj + x + obj); while(!isempty()) System.out.print(s.pop() + ); Queue Displays: cxc cd c b a Think of a queue as a line for a movie. As a person come up (enqueue) the line (queue) increases. As a person is let into the movie (dequeue) the line gets shorter.
29 29 Appendix A: Java Keywords Java has fortyeight keywords. You cannot declare the name of a variable, method, or class to be one of these keywords. If you try to do so, the compiler may give a rather puzzling error message. The keywords come in the several categories, listed below. Where the keywords are listed on two lines, the second line consists of keywords defined in the text in one place and never used anywhere else in the text (thus you do not need to remember them). 8 primitive types of values: boolean char int double long byte short float 3 constant values (technically these are two boolean literals and one null literal instead of keywords): true false null 14 statement indicators (the first word in the statement except for else and catch): if else while do for return try catch throw switch case default continue break 11 modifiers (can appear before the return type of a method): public private static final abstract protected synchronized native volatile transient strictfp 6 global (can be used outside of a class body): class interface extends implements import package 7 miscellaneous: void new this super throws instanceof finally 2 with no meaning, reserved so that people who accidentally put these C++ words in their programs will receive useful error messages: const goto
Pemrograman Dasar. Basic Elements Of Java
Pemrograman Dasar Basic Elements Of Java Compiling and Running a Java Application 2 Portable Java Application 3 Java Platform Platform: hardware or software environment in which a program runs. Oracle
More informationJAVA  QUICK GUIDE. Java SE is freely available from the link Download Java. So you download a version based on your operating system.
http://www.tutorialspoint.com/java/java_quick_guide.htm JAVA  QUICK GUIDE Copyright tutorialspoint.com What is Java? Java is: Object Oriented Platform independent: Simple Secure Architectural neutral
More informationFirst Java Programs. V. Paúl Pauca. CSC 111D Fall, 2015. Department of Computer Science Wake Forest University. Introduction to Computer Science
First Java Programs V. Paúl Pauca Department of Computer Science Wake Forest University CSC 111D Fall, 2015 Hello World revisited / 8/23/15 The f i r s t o b l i g a t o r y Java program @author Paul Pauca
More informationKeywords are identifiers having predefined meanings in C programming language. The list of keywords used in standard C are : unsigned void
1. Explain C tokens Tokens are basic building blocks of a C program. A token is the smallest element of a C program that is meaningful to the compiler. The C compiler recognizes the following kinds of
More informationChapter 2 Introduction to Java programming
Chapter 2 Introduction to Java programming 1 Keywords boolean if interface class true char else package volatile false byte final switch while throws float private case return native void protected break
More informationJava Interview Questions and Answers
1. What is the most important feature of Java? Java is a platform independent language. 2. What do you mean by platform independence? Platform independence means that we can write and compile the java
More informationObject Oriented Software Design
Object Oriented Software Design Introduction to Java  II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa September 14, 2011 G. Lipari (Scuola Superiore Sant Anna) Introduction
More informationInformatica e Sistemi in Tempo Reale
Informatica e Sistemi in Tempo Reale Introduction to C programming Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 25, 2010 G. Lipari (Scuola Superiore Sant Anna)
More informationECE 122. Engineering Problem Solving with Java
ECE 122 Engineering Problem Solving with Java Introduction to Electrical and Computer Engineering II Lecture 1 Course Overview Welcome! What is this class about? Java programming somewhat software somewhat
More informationBasic Programming and PC Skills: Basic Programming and PC Skills:
Texas University Interscholastic League Contest Event: Computer Science The contest challenges high school students to gain an understanding of the significance of computation as well as the details of
More informationTopics. Parts of a Java Program. Topics (2) CS 146. Introduction To Computers And Java Chapter Objectives To understand:
Introduction to Programming and Algorithms Module 2 CS 146 Sam Houston State University Dr. Tim McGuire Introduction To Computers And Java Chapter Objectives To understand: the meaning and placement of
More informationAP Computer Science Java Subset
APPENDIX A AP Computer Science Java Subset The AP Java subset is intended to outline the features of Java that may appear on the AP Computer Science A Exam. The AP Java subset is NOT intended as an overall
More informationJ a v a Quiz (Unit 3, Test 0 Practice)
Computer Science S111a: Intensive Introduction to Computer Science Using Java Handout #11 Your Name Teaching Fellow J a v a Quiz (Unit 3, Test 0 Practice) Multiplechoice questions are worth 2 points
More informationJavaScript: Control Statements I
1 7 JavaScript: Control Statements I 7.1 Introduction 2 The techniques you will learn here are applicable to most highlevel languages, including JavaScript 1 7.2 Algorithms 3 Any computable problem can
More informationHandout 1. Introduction to Java programming language. Java primitive types and operations. Reading keyboard Input using class Scanner.
Handout 1 CS603 ObjectOriented Programming Fall 15 Page 1 of 11 Handout 1 Introduction to Java programming language. Java primitive types and operations. Reading keyboard Input using class Scanner. Java
More informationNumeral Systems. The number twentyfive can be represented in many ways: Decimal system (base 10): 25 Roman numerals:
Numeral Systems Which number is larger? 25 8 We need to distinguish between numbers and the symbols that represent them, called numerals. The number 25 is larger than 8, but the numeral 8 above is larger
More informationCS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013
Oct 4, 2013, p 1 Name: CS 141: Introduction to (Java) Programming: Exam 1 Jenny Orr Willamette University Fall 2013 1. (max 18) 4. (max 16) 2. (max 12) 5. (max 12) 3. (max 24) 6. (max 18) Total: (max 100)
More informationA TOOL FOR DATA STRUCTURE VISUALIZATION AND USERDEFINED ALGORITHM ANIMATION
A TOOL FOR DATA STRUCTURE VISUALIZATION AND USERDEFINED ALGORITHM ANIMATION Tao Chen 1, Tarek Sobh 2 Abstract  In this paper, a software application that features the visualization of commonly used
More information1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++
Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The
More informationIntroduction to Data Structures
Introduction to Data Structures Albert Gural October 28, 2011 1 Introduction When trying to convert from an algorithm to the actual code, one important aspect to consider is how to store and manipulate
More informationDATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
More informationPseudo code Tutorial and Exercises Teacher s Version
Pseudo code Tutorial and Exercises Teacher s Version Pseudocode is an informal way to express the design of a computer program or an algorithm in 1.45. The aim is to get the idea quickly and also easy
More informationUseful Number Systems
Useful Number Systems Decimal Base = 10 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9} Binary Base = 2 Digit Set = {0, 1} Octal Base = 8 = 2 3 Digit Set = {0, 1, 2, 3, 4, 5, 6, 7} Hexadecimal Base = 16 = 2
More informationIntroduction to Java
Introduction to Java The HelloWorld program Primitive data types Assignment and arithmetic operations User input Conditional statements Looping Arrays CSA0011 Matthew Xuereb 2008 1 Java Overview A high
More informationNUMBER SYSTEMS APPENDIX D. You will learn about the following in this appendix:
APPENDIX D NUMBER SYSTEMS You will learn about the following in this appendix: The four important number systems in computing binary, octal, decimal, and hexadecimal. A number system converter program
More informationVariables, Constants, and Data Types
Variables, Constants, and Data Types Primitive Data Types Variables, Initialization, and Assignment Constants Characters Strings Reading for this class: L&L, 2.12.3, App C 1 Primitive Data There are eight
More informationName: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.
Name: Class: Date: Exam #1  Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to
More informationComputer Science 281 Binary and Hexadecimal Review
Computer Science 281 Binary and Hexadecimal Review 1 The Binary Number System Computers store everything, both instructions and data, by using many, many transistors, each of which can be in one of two
More informationCOMPUTER SCIENCE. Paper 1 (THEORY)
COMPUTER SCIENCE Paper 1 (THEORY) (Three hours) Maximum Marks: 70 (Candidates are allowed additional 15 minutes for only reading the paper. They must NOT start writing during this time) 
More informationChapter 2: Elements of Java
Chapter 2: Elements of Java Basic components of a Java program Primitive data types Arithmetic expressions Type casting. The String type (introduction) Basic I/O statements Importing packages. 1 Introduction
More informationCommon Data Structures
Data Structures 1 Common Data Structures Arrays (single and multiple dimensional) Linked Lists Stacks Queues Trees Graphs You should already be familiar with arrays, so they will not be discussed. Trees
More informationCmpSci 187: Programming with Data Structures Spring 2015
CmpSci 187: Programming with Data Structures Spring 2015 Lecture #12 John Ridgway March 10, 2015 1 Implementations of Queues 1.1 Linked Queues A Linked Queue Implementing a queue with a linked list is
More informationSources: On the Web: Slides will be available on:
C programming Introduction The basics of algorithms Structure of a C code, compilation step Constant, variable type, variable scope Expression and operators: assignment, arithmetic operators, comparison,
More informationJava Basics: Data Types, Variables, and Loops
Java Basics: Data Types, Variables, and Loops If debugging is the process of removing software bugs, then programming must be the process of putting them in.  Edsger Dijkstra Plan for the Day Variables
More informationCSI 333 Lecture 1 Number Systems
CSI 333 Lecture 1 Number Systems 1 1 / 23 Basics of Number Systems Ref: Appendix C of Deitel & Deitel. Weighted Positional Notation: 192 = 2 10 0 + 9 10 1 + 1 10 2 General: Digit sequence : d n 1 d n 2...
More informationExample of a Java program
Example of a Java program class SomeNumbers static int square (int x) return x*x; public static void main (String[] args) int n=20; if (args.length > 0) // change default n = Integer.parseInt(args[0]);
More informationMAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push) 
=============================================================================================================================== DATA STRUCTURE PSEUDOCODE EXAMPLES (c) Mubashir N. Mir  www.mubashirnabi.com
More informationObjectOriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007
ObjectOriented Design Lecture 4 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 18, 2007 The Java Type System By now, you have seen a fair amount of Java. Time to study in more depth the foundations of the language,
More information10CS35: Data Structures Using C
CS35: Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C OBJECTIVE: Learn : Usage of structures, unions  a conventional tool for handling a
More informationObject Oriented Software Design
Object Oriented Software Design Introduction to Java  II Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 28, 2010 G. Lipari (Scuola Superiore Sant Anna) Introduction
More informationChapter 7D The Java Virtual Machine
This sub chapter discusses another architecture, that of the JVM (Java Virtual Machine). In general, a VM (Virtual Machine) is a hypothetical machine (implemented in either hardware or software) that directly
More informationTranslating to Java. Translation. Input. Many Level Translations. read, get, input, ask, request. Requirements Design Algorithm Java Machine Language
Translation Translating to Java Introduction to Computer Programming The job of a programmer is to translate a problem description into a computer language. You need to be able to convert a problem description
More informationOct: 50 8 = 6 (r = 2) 6 8 = 0 (r = 6) Writing the remainders in reverse order we get: (50) 10 = (62) 8
ECE Department Summer LECTURE #5: Number Systems EEL : Digital Logic and Computer Systems Based on lecture notes by Dr. Eric M. Schwartz Decimal Number System: Our standard number system is base, also
More informationAlgorithms and Data Structures
Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. RalfPeter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2
More informationIntroduction to Java Applications. 2005 Pearson Education, Inc. All rights reserved.
1 2 Introduction to Java Applications 2.2 First Program in Java: Printing a Line of Text 2 Application Executes when you use the java command to launch the Java Virtual Machine (JVM) Sample program Displays
More informationMoving from CS 61A Scheme to CS 61B Java
Moving from CS 61A Scheme to CS 61B Java Introduction Java is an objectoriented language. This document describes some of the differences between objectoriented programming in Scheme (which we hope you
More informationC++ Language Tutorial
cplusplus.com C++ Language Tutorial Written by: Juan Soulié Last revision: June, 2007 Available online at: http://www.cplusplus.com/doc/tutorial/ The online version is constantly revised and may contain
More informationStacks. Stacks (and Queues) Stacks. q Stack: what is it? q ADT. q Applications. q Implementation(s) CSCU9A3 1
Stacks (and Queues) 1 Stacks Stack: what is it? ADT Applications Implementation(s) 2 CSCU9A3 1 Stacks and ueues A stack is a very important data structure in computing science. A stack is a seuence of
More informationEE 261 Introduction to Logic Circuits. Module #2 Number Systems
EE 261 Introduction to Logic Circuits Module #2 Number Systems Topics A. Number System Formation B. Base Conversions C. Binary Arithmetic D. Signed Numbers E. Signed Arithmetic F. Binary Codes Textbook
More informationStorage Classes CS 110B  Rule Storage Classes Page 181 \handouts\storclas
CS 110B  Rule Storage Classes Page 181 Attributes are distinctive features of a variable. Data type, int or double for example, is an attribute. Storage class is another attribute. There are four storage
More informationData Structure [Question Bank]
Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:
More informationJDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4
JDK 1.5 Updates for Introduction to Java Programming with SUN ONE Studio 4 NOTE: SUN ONE Studio is almost identical with NetBeans. NetBeans is open source and can be downloaded from www.netbeans.org. I
More informationVisual Logic Instructions and Assignments
Visual Logic Instructions and Assignments Visual Logic can be installed from the CD that accompanies our textbook. It is a nifty tool for creating program flowcharts, but that is only half of the story.
More informationBoolean Expressions, Conditions, Loops, and Enumerations. Precedence Rules (from highest to lowest priority)
Boolean Expressions, Conditions, Loops, and Enumerations Relational Operators == // true if two values are equivalent!= // true if two values are not equivalent < // true if left value is less than the
More informationChapter 3: Restricted Structures Page 1
Chapter 3: Restricted Structures Page 1 1 2 3 4 5 6 7 8 9 10 Restricted Structures Chapter 3 Overview Of Restricted Structures The two most commonly used restricted structures are Stack and Queue Both
More informationBinary Search Trees (BST)
Binary Search Trees (BST) 1. Hierarchical data structure with a single reference to node 2. Each node has at most two child nodes (a left and a right child) 3. Nodes are organized by the Binary Search
More informationChapter 1 Java Program Design and Development
presentation slides for JAVA, JAVA, JAVA ObjectOriented Problem Solving Third Edition Ralph Morelli Ralph Walde Trinity College Hartford, CT published by Prentice Hall Java, Java, Java Object Oriented
More informationModule 2 Stacks and Queues: Abstract Data Types
Module 2 Stacks and Queues: Abstract Data Types A stack is one of the most important and useful nonprimitive linear data structure in computer science. It is an ordered collection of items into which
More informationEmbedded Systems. Review of ANSI C Topics. A Review of ANSI C and Considerations for Embedded C Programming. Basic features of C
Embedded Systems A Review of ANSI C and Considerations for Embedded C Programming Dr. Jeff Jackson Lecture 21 Review of ANSI C Topics Basic features of C C fundamentals Basic data types Expressions Selection
More informationWhat is a Loop? Pretest Loops in C++ Types of Loop Testing. Countcontrolled loops. Loops can be...
What is a Loop? CSC Intermediate Programming Looping A loop is a repetition control structure It causes a single statement or a group of statements to be executed repeatedly It uses a condition to control
More informationLecture 2 Notes: Flow of Control
6.096 Introduction to C++ January, 2011 Massachusetts Institute of Technology John Marrero Lecture 2 Notes: Flow of Control 1 Motivation Normally, a program executes statements from first to last. The
More information6.087 Lecture 2 January 12, 2010
6.087 Lecture 2 January 12, 2010 Review Variables and data types Operators Epilogue 1 Review: C Programming language C is a fast, small,generalpurpose,platform independent programming language. C is used
More informationChapter 7: Sequential Data Structures
Java by Definition Chapter 7: Sequential Data Structures Page 1 of 112 Chapter 7: Sequential Data Structures We have so far explored the basic features of the Java language, including an overview of objectoriented
More informationC++ INTERVIEW QUESTIONS
C++ INTERVIEW QUESTIONS http://www.tutorialspoint.com/cplusplus/cpp_interview_questions.htm Copyright tutorialspoint.com Dear readers, these C++ Interview Questions have been designed specially to get
More informationCSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis. Linda Shapiro Winter 2015
CSE373: Data Structures and Algorithms Lecture 3: Math Review; Algorithm Analysis Linda Shapiro Today Registration should be done. Homework 1 due 11:59 pm next Wednesday, January 14 Review math essential
More informationCS 106 Introduction to Computer Science I
CS 106 Introduction to Computer Science I 01 / 21 / 2014 Instructor: Michael Eckmann Today s Topics Introduction Homework assignment Review the syllabus Review the policies on academic dishonesty and improper
More informationExplain the relationship between a class and an object. Which is general and which is specific?
A.1.1 What is the Java Virtual Machine? Is it hardware or software? How does its role differ from that of the Java compiler? The Java Virtual Machine (JVM) is software that simulates the execution of a
More informationAP Computer Science Java Mr. Clausen Program 9A, 9B
AP Computer Science Java Mr. Clausen Program 9A, 9B PROGRAM 9A I m_sort_of_searching (20 points now, 60 points when all parts are finished) The purpose of this project is to set up a program that will
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Exam Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. 1) The JDK command to compile a class in the file Test.java is A) java Test.java B) java
More informationCS 111 Classes I 1. Software Organization View to this point:
CS 111 Classes I 1 Software Organization View to this point: Data Objects and primitive types Primitive types operators (+, /,,*, %). int, float, double, char, boolean Memory location holds the data Objects
More informationData Structure with C
Subject: Data Structure with C Topic : Tree Tree A tree is a set of nodes that either:is empty or has a designated node, called the root, from which hierarchically descend zero or more subtrees, which
More informationI PUC  Computer Science. Practical s Syllabus. Contents
I PUC  Computer Science Practical s Syllabus Contents Topics 1 Overview Of a Computer 1.1 Introduction 1.2 Functional Components of a computer (Working of each unit) 1.3 Evolution Of Computers 1.4 Generations
More informationNumbering Systems. InThisAppendix...
G InThisAppendix... Introduction Binary Numbering System Hexadecimal Numbering System Octal Numbering System Binary Coded Decimal (BCD) Numbering System Real (Floating Point) Numbering System BCD/Binary/Decimal/Hex/Octal
More informationStacks. Linear data structures
Stacks Linear data structures Collection of components that can be arranged as a straight line Data structure grows or shrinks as we add or remove objects ADTs provide an abstract layer for various operations
More informationIteration CHAPTER 6. Topic Summary
CHAPTER 6 Iteration TOPIC OUTLINE 6.1 while Loops 6.2 for Loops 6.3 Nested Loops 6.4 Offby1 Errors 6.5 Random Numbers and Simulations 6.6 Loop Invariants (AB only) Topic Summary 6.1 while Loops Many
More information9 Control Statements. 9.1 Introduction. 9.2 Objectives. 9.3 Statements
9 Control Statements 9.1 Introduction The normal flow of execution in a high level language is sequential, i.e., each statement is executed in the order of its appearance in the program. However, depending
More informationComp 255Q  1M: Computer Organization Lab #3  Machine Language Programs for the PDP8
Comp 255Q  1M: Computer Organization Lab #3  Machine Language Programs for the PDP8 January 22, 2013 Name: Grade /10 Introduction: In this lab you will write, test, and execute a number of simple PDP8
More informationBachelors of Computer Application Programming Principle & Algorithm (BCAS102T)
Unit I Introduction to c Language: C is a generalpurpose computer programming language developed between 1969 and 1973 by Dennis Ritchie at the Bell Telephone Laboratories for use with the Unix operating
More informationJava Programming Fundamentals
Lecture 1 Part I Java Programming Fundamentals Topics in Quantitative Finance: Numerical Solutions of Partial Differential Equations Instructor: Iraj Kani Introduction to Java We start by making a few
More informationFirst Bytes Programming Lab 2
First Bytes Programming Lab 2 This lab is available online at www.cs.utexas.edu/users/scottm/firstbytes. Introduction: In this lab you will investigate the properties of colors and how they are displayed
More informationPARTA Questions. 2. How does an enumerated statement differ from a typedef statement?
1. Distinguish & and && operators. PARTA Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members
More informationQuestions 1 through 25 are worth 2 points each. Choose one best answer for each.
Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in
More informationA binary search tree or BST is a binary tree that is either empty or in which the data element of each node has a key, and:
Binary Search Trees 1 The general binary tree shown in the previous chapter is not terribly useful in practice. The chief use of binary trees is for providing rapid access to data (indexing, if you will)
More informationPhys4051: C Lecture 2 & 3. Comment Statements. C Data Types. Functions (Review) Comment Statements Variables & Operators Branching Instructions
Phys4051: C Lecture 2 & 3 Functions (Review) Comment Statements Variables & Operators Branching Instructions Comment Statements! Method 1: /* */! Method 2: // /* Single Line */ //Single Line /* This comment
More informationCompiler Construction
Compiler Construction Lecture 1  An Overview 2003 Robert M. Siegfried All rights reserved A few basic definitions Translate  v, a.to turn into one s own language or another. b. to transform or turn from
More informationCDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012
CDA 3200 Digital Systems Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012 Outline Data Representation Binary Codes Why 6311 and Excess3? Data Representation (1/2) Each numbering
More informationCSE 1223: Introduction to Computer Programming in Java Chapter 2 Java Fundamentals
CSE 1223: Introduction to Computer Programming in Java Chapter 2 Java Fundamentals 1 Recall From Last Time: Java Program import java.util.scanner; public class EggBasket { public static void main(string[]
More informationCopyright. Restricted Rights Legend. Trademarks or Service Marks. Copyright 2003 BEA Systems, Inc. All Rights Reserved.
Version 8.1 SP4 December 2004 Copyright Copyright 2003 BEA Systems, Inc. All Rights Reserved. Restricted Rights Legend This software and documentation is subject to and made available only pursuant to
More informationObject Oriented Software Design
Object Oriented Software Design Inner classes, RTTI, Tree implementation Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa October 29, 2010 G. Lipari (Scuola Superiore Sant
More informationCS104: Data Structures and ObjectOriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team
CS104: Data Structures and ObjectOriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team Lecture Summary In this lecture, we learned about the ADT Priority Queue. A
More information13 File Output and Input
SCIENTIFIC PROGRAMMING 1 13 File Output and Input 13.1 Introduction To make programs really useful we have to be able to input and output data in large machinereadable amounts, in particular we have to
More informationELEG3924 Microprocessor Ch.7 Programming In C
Department of Electrical Engineering University of Arkansas ELEG3924 Microprocessor Ch.7 Programming In C Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Data types and time delay I/O programming and Logic operations
More informationWe will learn the Python programming language. Why? Because it is easy to learn and many people write programs in Python so we can share.
LING115 Lecture Note Session #4 Python (1) 1. Introduction As we have seen in previous sessions, we can use Linux shell commands to do simple text processing. We now know, for example, how to count words.
More informationSection 1.4 Place Value Systems of Numeration in Other Bases
Section.4 Place Value Systems of Numeration in Other Bases Other Bases The HinduArabic system that is used in most of the world today is a positional value system with a base of ten. The simplest reason
More information1.00 Lecture 1. Course information Course staff (TA, instructor names on syllabus/faq): 2 instructors, 4 TAs, 2 Lab TAs, graders
1.00 Lecture 1 Course Overview Introduction to Java Reading for next time: Big Java: 1.11.7 Course information Course staff (TA, instructor names on syllabus/faq): 2 instructors, 4 TAs, 2 Lab TAs, graders
More informationAlgorithms and Data Structures Written Exam Proposed SOLUTION
Algorithms and Data Structures Written Exam Proposed SOLUTION 20050107 from 09:00 to 13:00 Allowed tools: A standard calculator. Grading criteria: You can get at most 30 points. For an E, 15 points are
More informationBinary Representation. Number Systems. Base 10, Base 2, Base 16. Positional Notation. Conversion of Any Base to Decimal.
Binary Representation The basis of all digital data is binary representation. Binary  means two 1, 0 True, False Hot, Cold On, Off We must be able to handle more than just values for real world problems
More informationCHAPTER 4 ESSENTIAL DATA STRUCTRURES
CHAPTER 4 ESSENTIAL DATA STRUCTURES 72 CHAPTER 4 ESSENTIAL DATA STRUCTRURES In every algorithm, there is a need to store data. Ranging from storing a single value in a single variable, to more complex
More informationBINARY CODED DECIMAL: B.C.D.
BINARY CODED DECIMAL: B.C.D. ANOTHER METHOD TO REPRESENT DECIMAL NUMBERS USEFUL BECAUSE MANY DIGITAL DEVICES PROCESS + DISPLAY NUMBERS IN TENS IN BCD EACH NUMBER IS DEFINED BY A BINARY CODE OF 4 BITS.
More information