Topics (Non-exhaustive) Hash Tables Tries Trees Stacks Queues. HTTP CSS PHP MVC SQL Javascript TCP/IP

Size: px
Start display at page:

Download "Topics (Non-exhaustive) Hash Tables Tries Trees Stacks Queues. HTTP CSS PHP MVC SQL Javascript TCP/IP"

Transcription

1 Topics (Non-exhaustive) Hash Tables Tries Trees Stacks Queues HTTP CSS PHP MVC SQL Javascript TCP/IP

2 Linked Lists head 2 3 9

3 Nodes n next typedef struct node { int n; struct node* next; } node;

4 Search head 2 3 9

5 bool search(node* list, int n) { node* ptr = list; } while (ptr!= NULL) { if (ptr- >n == n) { return true; } ptr = ptr- >next; } return false;

6 Insertion head

7 Insertion head

8 Insertion head

9 Insertion head

10 void insert(int n) { // create new node node* new = malloc(sizeof(node)); // check for NULL if (new == NULL) { exit(1); } // initialize new node new- >n = n; new- >next = NULL; } // insert new node at head new- >next = head; head = new;

11 Doubly Linked Lists head 2 3 9

12 DLL Nodes n next prev typedef struct node { int n; struct node* next; struct node* prev; } node;

13 Hash Tables banana apple kiwi mango Hash Function apple banana cantaloupe kiwi pear cantaloupe mango pear

14 Hash Function banana Hash Function apple cantaloupe kiwi mango pear

15 Hash Function Example int hash_function(char* key) { // hash on first letter of string int hash = toupper(key[0]) - 'A'; } return hash % SIZE;

16 Collisions berry Hash Function apple banana cantaloupe kiwi mango pear

17 Linear Probing berry Hash Function apple banana cantaloupe berry 10 kiwi mango 15 pear

18 Separate Chaining avocado berry cantaloupe apple banana...

19 Tries

20 typedef struct node { // marker for end of word bool is_word; // pointers to other nodes struct node* children[27]; } node;

21 is_word struct node { /* data b */ children z a nodes // pointers to other struct t node* children[26]; }; o o m

22 struct node { /* data b */ z a nodes // pointers to other struct t node* children[26]; }; o o m

23 struct node { /* data b */ z a nodes // pointers to other struct t node* children[26]; }; o o m

24 struct node { /* data b */ z a nodes // pointers to other struct t node* children[26]; }; o o m

25 struct node { /* data b */ z a nodes // pointers to other struct t node* children[26]; }; o o m

26 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

27 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

28 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

29 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

30 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

31 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

32 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

33 struct node { /* data */ b z a nodes // pointers to other struct t node* children[26]; }; o o m

34 struct node { /* data */ b z a // pointers to other nodes struct t node* children[26]; }; h o o m

35 struct node { /* data */ b z a // pointers to other nodes struct t node* children[26]; }; h o o m

36 Tree

37 Root Leaves

38 Binary Tree

39 55 typedef struct node { int n; struct node* left; struct node* right; } node;

40 Binary Search Tree

41 bool search(node* root, int val) { if root is NULL return false. if root- >n is val return true. if val is less than root- >n search left child } if val is greater than root- >n search right child

42 Stacks

43 push pop LIFO

44 typedef struct { char* strings[capacity]; int size; } stack; {

45 push TODOs: size < CAPACITY? store element at [size] size++ [5] [4] [3] [2] [1] [0]

46 [5] pop TODOs: [4] [3] [2] size > 0? size-- return [size] [1] [0]

47 Queues

48 FIFO enqueue dequeue

49 typedef struct { int head; char* strings[capacity]; int size; } queue; {

50 Enqueue TODOs: { size < CAPACITY? store at tail size++ head [5] [4] [3] [2] [1] [0]

51 Dequeue TODOs: { head size > 0? move head size-- return element [5] [4] [3] [2] [1] [0]

52 chmod Unix system call to change file permissions ls - l : see file permissions chmod (each is from 0-7) r : readable : 4 w : writeable : 2 x : executable : 1

53

54 chmod group+permissions + adds permissions - takes away permissions u: user or owner g: group o: others

55 Example rwx can also be represented as 700 chmod 444 file would give what permissions? What s another way we could write this?

56 Example rwx can also be represented as 700 chmod 444 file would give what permissions? Readable to everyone! Could also do chmod a+r file

57 chmod 555 chmod u+x chmod 640 Translations

58 Translations chmod 555 Chmod a+rx Gives everyone read and execute access chmod u+x Chmod 100 Gives the owner execute access chmod 640 Chmod u+rw, chmod g+r Gives owner read and write permissions Gives group read permission

59 Common cases chmod 711 directory: Use for any directory chmod 644 file.txt: Use for any non-php file you create chmod 600 file.php: Use for PHP files

60 TCP/IP Transmission Control Protocol/Internet Protocol Gives a set of standards that govern how data should be packetized, transmitted, routed and received Increases chances the data will get where you want it to!

61 Ports Need to tell our end destination what type of data is in the packet; packets might be routed in various ways/paths 21: FTP: File transfer protocol 25: SMTP: 53: DNS: Domain Name System What is the IP address of a domain name? 80: HTTP: Webpage 443: HTTPS: Secure webpage

62 HTML & CSS HyperText Markup Language Practice and experiment! Best practices: Close all your tags! Validate your page with W3 Validator Separate markup (HTML) and style (CSS) MVC paradigm to come!

63 CSS Instead of tags, CSS uses selectors Match tags with asributes Selectors can be id : unique #id in a CSS file class: can refer to mulvple blocks.class in a CSS file

64 HTTP HyperText Transfer Protocol

65 HyperText Check out <a href=" really cool website!

66 Transfer Protocol Introduction to the HTTP specification, from

67 An Example Request GET / HTTP/1.1 User- Agent: curl/ Host: <name>: <value> Key: MethodRequest URI Protocol Version field name field value

68 An Example Response HTTP/ OK Server: Apache Content- Type: text/html; charset=utf- 8 Server: Apache Content- Length: Connection: keep- alive Key: Status Code Protocol Version field name field value

69 PHP Think back to pset6 and hello.html!

70 So what is PHP? PHP Hypertext Preprocessor Server side scripvng language Programming language because it has logic (loops, condivon, etc) Can combine with HTML Allows us to create dynamic webpages! Can incorporate HTML and PHP in the same file or pass informavon from separate files

71 Crash Course! Declaring variables No need to specify type! Loosely or dynamically typed -> determined at runtime $var = 3; Arrays can be associative! $array = [key1 => value1, key2 => value2] However, keys are optional! $array = [10, 20, 30] Index would be just like in C! $array[1] = 20;

72 Crash Course! == versus === == checks for equality after type juggling === checks if they are equal and of the same type foreach loop Way to iterate over arrays If there are no keys foreach ($array as $value) { //do this } If there are keys foreach ($array as $key => $value) { //do this }

73 Two ways to pass info GET Information passed via URL POST Passes data in the HTTP message body Consider the data to be hidden compared to GET requests

74

75 SQL UPDATE Update data in a database table INSERT INTO Insert certain values into a table SELECT Select values to view DELETE Delete from table

76 JavaScript "JavaScript is the best programming language currently in existence. Other people will try to tell you otherwise. They are wrong." Thomas MacWilliam Head Teaching Fellow, 2012

77 index.html: Hello World <!DOCTYPE html> <html> <head> <script type="text/javascript" src="hello.js"> </script> <title>hello, world!</title> </head> <body> Body HTML here </body> </html> hello.js: alert("hello, world!");

78 Hello World

79 Variable Declarations var s = "CS50"; var n = 3.14; var b = true;... alert("type of b: " + typeof(b)); b = "make b a string"; alert("type of b: " + typeof(b));

80 Loops for(/* init */; /* condition*/; /* update */) { /* code */ } while(/* condition */) { /* code */ } do { /* code */ } while(/* condition */);

81 Function Declarations function sum(x, y) { return x + y; } /* or */ var sum = function(x, y) { return x + y; } var sum = sum(3, 5); alert("3 + 5 = " + sum);

82 Arrays in JavaScript var arr = []; var arr2 = ["Arrays", "in", "JS"]; var thirdelement = arr2[2]; var arr2len = arr2.length; var arr3 = [2.3, true, 5]; arr3[2] = "not a number"; arr3[100] = "legit";

83 Objects in JavaScript (1) var emptyobject = {}; emptyobject["newproperty"] = "newvalue"; emptyobject.othernewproperty = "othernewvalue"; alert(emptyobject.othernewproperty); alert(emptyobject["othernewproperty"]);

84 Objects in JavaScript (2) var CS50 = { "course": "CS50", "instructor": "David J. Malan '99", "tfs": ["R.J.", "Ben", "Pat", "Chris"], "psets": 8, "taped": true };

85 Objects in JavaScript (3) var cottage = [ {name: "James", house: "Winthrop"}, {name: "Molly", house: "Cabot"}, {name: "Carl", house: "Kirkland"} ]; for(var i = 0; i < cottage.length; i++) { alert(cottage[i].name); }

86 DOM: Document-Object Model <!DOCTYPE html> <html> <head> <title>hello, world</ title> </head> <body> hello, world </body> </html>

87 DOM: Document-Object Model (2) Examples document.title document.body document.body.innerhtml Useful Functions document.getelementbyid(string) document.getelementsbyclassname(string) document.getelementsbytagname(string)

88 JavaScript Events window.onload = function() { var searchbutton = document.getelementbyid("search_button"); searchbutton.onclick = function() { alert("you clicked the search button"); } } When Document is Ready Find Search Button When Search Button Clicked Alert Message to User

89 MVC Controller Model Database View Presentation Templates Layout Model-View-Controller

90 MVC COMPONENT FUNCTION EXAMPLE Model View Controller - Persistent storage of information - Managing and organizing data - Presentation of information to user - User interface - Handles user requests, gets information from the - MySQL database - Data files - HTML - Minimal PHP (e.g., for iterating over data to print it out) - Min - PHP

91 C$50 Finance: Model

92 C$50 Finance: Controller $result = query("select * FROM some_table"); if ($result!== false) { foreach ($result as &$row) { /* process row of result */ } render("some_template", array("data" => $result)); } else { apologize("error communicating with database."); }

93 some_template.php: C$50 Finance: View <ul> <?php foreach($data as $row):?> <li><?= $row["name"]?></li> <?php endforeach?> </ul>

94 Tips Take practice tests under time constraints Get sleep and rest! Relax Remember to breathe! Put time into your cheat sheet You got this!

95 This was section.

Quiz 1 Review Session. November 17th, 2014

Quiz 1 Review Session. November 17th, 2014 Quiz 1 Review Session November 17th, 2014 Topics (non-exhaustive) pointers linked lists hash tables trees tries stacks queues TCP/IP HTTP HTML CSS PHP MVC SQL HTTP statuses DOM JavaScript jquery Ajax security...

More information

speller.c dictionary contains valid words, one per line 1. calls load on the dictionary file

speller.c dictionary contains valid words, one per line 1. calls load on the dictionary file mispellings speller.c 1. calls load on the dictionary file dictionary contains valid words, one per line 2. calls check on each word in the text file and prints all misspelled words 3. calls size to determine

More information

quiz 1 details wed nov 17, 1pm see handout for locations covers weeks 0 through 10, emphasis on 7 onward closed book bring a , 2-sided cheat she

quiz 1 details wed nov 17, 1pm see handout for locations covers weeks 0 through 10, emphasis on 7 onward closed book bring a , 2-sided cheat she quiz 1 details wed nov 17, 1pm see handout for locations covers weeks 0 through 10, emphasis on 7 onward closed book bring a 8.5 11, 2-sided cheat sheet 75 minutes 15% of final grade resources old quizzes

More information

week8 Tommy MacWilliam week8 October 31, 2011

week8 Tommy MacWilliam week8 October 31, 2011 tmacwilliam@cs50.net October 31, 2011 Announcements pset5: returned final project pre-proposals due Monday 11/7 http://cs50.net/projects/project.pdf CS50 seminars: http://wiki.cs50.net/seminars Today common

More information

welcome to BOILERCAMP HOW TO WEB DEV

welcome to BOILERCAMP HOW TO WEB DEV welcome to BOILERCAMP HOW TO WEB DEV Introduction / Project Overview The Plan Personal Website/Blog Schedule Introduction / Project Overview HTML / CSS Client-side JavaScript Lunch Node.js / Express.js

More information

Algorithms, Data Structures, and Problem Solving

Algorithms, Data Structures, and Problem Solving Algorithms, Data Structures, and Problem Solving Masoumeh Taromirad Hamlstad University DT4002, Fall 2016 Container Concepts containers store data container operations: insertion retrieval removal iteration

More information

CSCE 2014 Final Exam Spring Version A

CSCE 2014 Final Exam Spring Version A CSCE 2014 Final Exam Spring 2017 Version A Student Name: Student UAID: Instructions: This is a two-hour exam. Students are allowed one 8.5 by 11 page of study notes. Calculators, cell phones and computers

More information

Web Site Design and Development. CS 0134 Fall 2018 Tues and Thurs 1:00 2:15PM

Web Site Design and Development. CS 0134 Fall 2018 Tues and Thurs 1:00 2:15PM Web Site Design and Development CS 0134 Fall 2018 Tues and Thurs 1:00 2:15PM By the end of this course you will be able to Design a static website from scratch Use HTML5 and CSS3 to build the site you

More information

Lecture 7: Data Structures. EE3490E: Programming S1 2017/2018 Dr. Đào Trung Kiên Hanoi Univ. of Science and Technology

Lecture 7: Data Structures. EE3490E: Programming S1 2017/2018 Dr. Đào Trung Kiên Hanoi Univ. of Science and Technology Lecture 7: Data Structures 1 Introduction: dynamic array Conventional array in C has fix number of elements Dynamic array is array with variable number of elements: actually a pointer and a variable indicating

More information

COMP519 Practical 5 JavaScript (1)

COMP519 Practical 5 JavaScript (1) COMP519 Practical 5 JavaScript (1) Introduction This worksheet contains exercises that are intended to familiarise you with JavaScript Programming. While you work through the tasks below compare your results

More information

speller.c dictionary contains valid words, one per line 1. calls load on the dictionary file

speller.c dictionary contains valid words, one per line 1. calls load on the dictionary file mispellings speller.c 1. calls load on the dictionary file dictionary contains valid words, one per line 2. calls check on each word in the text file and prints all misspelled words 3. calls size to determine

More information

Linked List. April 2, 2007 Programming and Data Structure 1

Linked List. April 2, 2007 Programming and Data Structure 1 Linked List April 2, 2007 Programming and Data Structure 1 Introduction head A linked list is a data structure which can change during execution. Successive elements are connected by pointers. Last element

More information

Web development using PHP & MySQL with HTML5, CSS, JavaScript

Web development using PHP & MySQL with HTML5, CSS, JavaScript Web development using PHP & MySQL with HTML5, CSS, JavaScript Static Webpage Development Introduction to web Browser Website Webpage Content of webpage Static vs dynamic webpage Technologies to create

More information

This is CS50. Harvard College Fall Quiz 1 Answer Key

This is CS50. Harvard College Fall Quiz 1 Answer Key Quiz 1 Answer Key Answers other than the below may be possible. Know Your Meme. 0. True or False. 1. T 2. F 3. F 4. F 5. T Attack. 6. By never making assumptions as to the length of users input and always

More information

Fachgebiet Technische Informatik, Joachim Zumbrägel

Fachgebiet Technische Informatik, Joachim Zumbrägel Computer Network Lab 2017 Fachgebiet Technische Informatik, Joachim Zumbrägel Overview Internet Internet Protocols Fundamentals about HTTP Communication HTTP-Server, mode of operation Static/Dynamic Webpages

More information

COP 3502 (Computer Science I) Test #3: Data Structures Date: 11/1/2013 VERSION A

COP 3502 (Computer Science I) Test #3: Data Structures Date: 11/1/2013 VERSION A COP 3502 (Computer Science I) Test #3: Data Structures Date: 11/1/2013 VERSION A Directions: This is a multiple choice test. Each question is worth 5 points. Please choose the most accurate answer listed.

More information

Let's Look Back. We talked about how to create a form in HTML. Forms are one way to interact with users

Let's Look Back. We talked about how to create a form in HTML. Forms are one way to interact with users Introduction to PHP Let's Look Back We talked about how to create a form in HTML Forms are one way to interact with users Users can enter information into forms which can be used by you (programmer) We

More information

Introduction to Web Technologies

Introduction to Web Technologies Introduction to Web Technologies James Curran and Tara Murphy 16th April, 2009 The Internet CGI Web services HTML and CSS 2 The Internet is a network of networks ˆ The Internet is the descendant of ARPANET

More information

Chapter 9 STACK, QUEUE

Chapter 9 STACK, QUEUE Chapter 9 STACK, QUEUE 1 LIFO: Last In, First Out. Stacks Restricted form of list: Insert and remove only at front of list. Notation: Insert: PUSH Remove: POP The accessible element is called TOP. Stack

More information

Week 7 Rob Bowden Topics Bitwise operators Buffer overflow attack CS50 Library HTML HTTP CSS Bitwise Operators & >>

More information

Programming Abstractions

Programming Abstractions Programming Abstractions C S 1 0 6 B Cynthia Lee Topics: Priority Queue Linked List implementation Sorted Unsorted Heap structure implementation TODAY S TOPICS NOT ON THE MIDTERM 2 Some priority queue

More information

PHP Reference. To access MySQL manually, run the following command on the machine, called Sources, where MySQL and PhP have been installed:

PHP Reference. To access MySQL manually, run the following command on the machine, called Sources, where MySQL and PhP have been installed: PHP Reference 1 Preface This tutorial is designed to teach you all the PHP commands and constructs you need to complete your PHP project assignment. It is assumed that you have never programmed in PHP

More information

CS61, Fall 2012 Section 2 Notes

CS61, Fall 2012 Section 2 Notes CS61, Fall 2012 Section 2 Notes (Week of 9/24-9/28) 0. Get source code for section [optional] 1: Variable Duration 2: Memory Errors Common Errors with memory and pointers Valgrind + GDB Common Memory Errors

More information

Web Programming and Design. MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh

Web Programming and Design. MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh Web Programming and Design MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh Plan for the next 5 weeks: Introduction to HTML tags, creating our template file Introduction to CSS and style

More information

CREATING WEBSITES. What you need to build a website Part One The Basics. Chas Large. Welcome one and all

CREATING WEBSITES. What you need to build a website Part One The Basics. Chas Large. Welcome one and all Slide 1 CREATING WEBSITES What you need to build a website Part One The Basics Chas Large Welcome one and all Short intro about Chas large TV engineer, computer geek, self taught, became IT manager in

More information

Discussion 2C Notes (Week 3, January 21) TA: Brian Choi Section Webpage:

Discussion 2C Notes (Week 3, January 21) TA: Brian Choi Section Webpage: Discussion 2C Notes (Week 3, January 21) TA: Brian Choi (schoi@cs.ucla.edu) Section Webpage: http://www.cs.ucla.edu/~schoi/cs32 Abstraction In Homework 1, you were asked to build a class called Bag. Let

More information

Data Structures. Outline. Introduction Linked Lists Stacks Queues Trees Deitel & Associates, Inc. All rights reserved.

Data Structures. Outline. Introduction Linked Lists Stacks Queues Trees Deitel & Associates, Inc. All rights reserved. Data Structures Outline Introduction Linked Lists Stacks Queues Trees Introduction dynamic data structures - grow and shrink during execution Linked lists - insertions and removals made anywhere Stacks

More information

Computer Science Foundation Exam

Computer Science Foundation Exam Computer Science Foundation Exam August 26, 2017 Section I A DATA STRUCTURES NO books, notes, or calculators may be used, and you must work entirely on your own. Name: UCFID: NID: Question # Max Pts Category

More information

CS201- Introduction to Programming Current Quizzes

CS201- Introduction to Programming Current Quizzes CS201- Introduction to Programming Current Quizzes Q.1 char name [] = Hello World ; In the above statement, a memory of characters will be allocated 13 11 12 (Ans) Q.2 A function is a block of statements

More information

Solution for Data Structure

Solution for Data Structure Solution for Data Structure May 2016 INDEX Q1 a 2-3 b 4 c. 4-6 d 7 Q2- a 8-12 b 12-14 Q3 a 15-18 b 18-22 Q4- a 22-35 B..N.A Q5 a 36-38 b N.A Q6- a 39-42 b 43 1 www.brainheaters.in Q1) Ans: (a) Define ADT

More information

Static Webpage Development

Static Webpage Development Dear Student, Based upon your enquiry we are pleased to send you the course curriculum for PHP Given below is the brief description for the course you are looking for: - Static Webpage Development Introduction

More information

COMS W3101: SCRIPTING LANGUAGES: JAVASCRIPT (FALL 2018)

COMS W3101: SCRIPTING LANGUAGES: JAVASCRIPT (FALL 2018) COMS W3101: SCRIPTING LANGUAGES: JAVASCRIPT (FALL 2018) RAMANA ISUKAPALLI RAMANA@CS.COLUMBIA.EDU 1 LECTURE-1 Course overview See http://www.cs.columbia.edu/~ramana Overview of HTML Formatting, headings,

More information

CERTIFICATE IN WEB PROGRAMMING

CERTIFICATE IN WEB PROGRAMMING COURSE DURATION: 6 MONTHS CONTENTS : CERTIFICATE IN WEB PROGRAMMING 1. PROGRAMMING IN C and C++ Language 2. HTML/CSS and JavaScript 3. PHP and MySQL 4. Project on Development of Web Application 1. PROGRAMMING

More information

How A Website Works. - Shobha

How A Website Works. - Shobha How A Website Works - Shobha Synopsis 1. 2. 3. 4. 5. 6. 7. 8. 9. What is World Wide Web? What makes web work? HTTP and Internet Protocols. URL s Client-Server model. Domain Name System. Web Browser, Web

More information

What is PHP? [1] Figure 1 [1]

What is PHP? [1] Figure 1 [1] PHP What is PHP? [1] PHP is an acronym for "PHP: Hypertext Preprocessor" PHP is a widely-used, open source scripting language PHP scripts are executed on the server PHP is free to download and use Figure

More information

Queues. A queue is a special type of structure that can be used to maintain data in an organized way.

Queues. A queue is a special type of structure that can be used to maintain data in an organized way. A queue is a special type of structure that can be used to maintain data in an organized way. This data structure is commonly implemented in one of two ways: as an array or as a linked list. In either

More information

CP2 Revision. theme: dynamic datatypes & data structures

CP2 Revision. theme: dynamic datatypes & data structures CP2 Revision theme: dynamic datatypes & data structures structs can hold any combination of datatypes handled as single entity struct { }; ;

More information

Web Programming and Design. MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh

Web Programming and Design. MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh Web Programming and Design MPT Junior Cycle Tutor: Tamara Demonstrators: Aaron, Marion, Hugh Plan for the next 5 weeks: Introduction to HTML tags, creating our template file Introduction to CSS and style

More information

l Determine if a number is odd or even l Determine if a number/character is in a range - 1 to 10 (inclusive) - between a and z (inclusive)

l Determine if a number is odd or even l Determine if a number/character is in a range - 1 to 10 (inclusive) - between a and z (inclusive) Final Exam Exercises Chapters 1-7 + 11 Write C++ code to: l Determine if a number is odd or even CS 2308 Fall 2016 Jill Seaman l Determine if a number/character is in a range - 1 to 10 (inclusive) - between

More information

Cleveland State University Department of Electrical and Computer Engineering. CIS 408: Internet Computing

Cleveland State University Department of Electrical and Computer Engineering. CIS 408: Internet Computing Cleveland State University Department of Electrical and Computer Engineering CIS 408: Internet Computing Catalog Description: CIS 408 Internet Computing (-0-) Pre-requisite: CIS 265 World-Wide Web is now

More information

You must include this cover sheet. Either type up the assignment using theory5.tex, or print out this PDF.

You must include this cover sheet. Either type up the assignment using theory5.tex, or print out this PDF. 15-122 Assignment 5 Page 1 of 11 15-122 : Principles of Imperative Computation Fall 2012 Assignment 5 (Theory Part) Due: Tuesday, October 30, 2012 at the beginning of lecture Name: Andrew ID: Recitation:

More information

.:: UNIT 4 ::. STACK AND QUEUE

.:: UNIT 4 ::. STACK AND QUEUE .:: UNIT 4 ::. STACK AND QUEUE 4.1 A stack is a data structure that supports: Push(x) Insert x to the top element in stack Pop Remove the top item from stack A stack is collection of data item arrange

More information

CS6501 IP Unit IV Page 1

CS6501 IP Unit IV Page 1 CS6501 Internet Programming Unit IV Part - A 1. What is PHP? PHP - Hypertext Preprocessor -one of the most popular server-side scripting languages for creating dynamic Web pages. - an open-source technology

More information

CS 222: Linked Lists, Queues, Stacks

CS 222: Linked Lists, Queues, Stacks CS 222: Linked Lists, Queues, Stacks Chris Kauffman Week 7-2 Logistics Reading Ch 10 (Vector/List Data Types) Start finishing up exercises Homework 6 Up HWs reweighted, worth 7% each Due next Tue night

More information

Connecting the Dots. Building Web Applications with PHP, HTML, CSS, and JavaScript

Connecting the Dots. Building Web Applications with PHP, HTML, CSS, and JavaScript Connecting the Dots Building Web Applications with PHP, HTML, CSS, and JavaScript John Valance division 1 systems johnv@div1sys.com www.div1sys.com All materials copyright 2014-2017 John Valance

More information

Assume you are given a Simple Linked List (i.e. not a doubly linked list) containing an even number of elements. For example L = [A B C D E F].

Assume you are given a Simple Linked List (i.e. not a doubly linked list) containing an even number of elements. For example L = [A B C D E F]. Question Assume you are given a Simple Linked List (i.e. not a doubly linked list) containing an even number of elements. For example L = [A B C D E F]. a) Draw the linked node structure of L, including

More information

JavaScript CS 4640 Programming Languages for Web Applications

JavaScript CS 4640 Programming Languages for Web Applications JavaScript CS 4640 Programming Languages for Web Applications 1 How HTML, CSS, and JS Fit Together {css} javascript() Content layer The HTML gives the page structure and adds semantics Presentation

More information

Notes beforehand... For more details: See the (online) presentation program.

Notes beforehand... For more details: See the (online) presentation program. Notes beforehand... Notes beforehand... For more details: See the (online) presentation program. Topical overview: main arcs fundamental subjects advanced subject WTRs Lecture: 2 3 4 5 6 7 8 Today: the

More information

JavaScript CS 4640 Programming Languages for Web Applications

JavaScript CS 4640 Programming Languages for Web Applications JavaScript CS 4640 Programming Languages for Web Applications 1 How HTML, CSS, and JS Fit Together {css} javascript() Content layer The HTML gives the page structure and adds semantics Presentation

More information

Programming. Lists, Stacks, Queues

Programming. Lists, Stacks, Queues Programming Lists, Stacks, Queues Summary Linked lists Create and insert elements Iterate over all elements of the list Remove elements Doubly Linked Lists Circular Linked Lists Stacks Operations and implementation

More information

All India Council For Research & Training

All India Council For Research & Training WEB DEVELOPMENT & DESIGNING Are you looking for a master program in web that covers everything related to web? Then yes! You have landed up on the right page. Web Master Course is an advanced web designing,

More information

UNIT -II. Language-History and Versions Introduction JavaScript in Perspective-

UNIT -II. Language-History and Versions Introduction JavaScript in Perspective- UNIT -II Style Sheets: CSS-Introduction to Cascading Style Sheets-Features- Core Syntax-Style Sheets and HTML Style Rle Cascading and Inheritance-Text Properties-Box Model Normal Flow Box Layout- Beyond

More information

Quiz 0 Review Session. October 13th, 2014

Quiz 0 Review Session. October 13th, 2014 Quiz 0 Review Session October 13th, 2014 Topics (non-exhaustive) Binary. ASCII. Algorithms. Pseudocode. Source code. Compiler. Object code. Scratch. Statements. Boolean expressions. Conditions. Loops.

More information

this is a cat CS50 Quiz 1 Review

this is a cat CS50 Quiz 1 Review CS50 Quiz 1 Review this is a cat CS50 Quiz 1 Review JavaScript CS50 Quiz 1 Review first, recall from zamyla Remember, PHP is run server-side. The HTML output of this PHP code is sent to the user. Server

More information

COP 3502 Spring 2018 Study Union Review

COP 3502 Spring 2018 Study Union Review Page 1 COP 3502 Spring 2018 Study Union Review Alec May Table of Contents: Tries 2 Heaps 3 Hash Tables 5 Base Conversion 6 Bitwise Operators 7 Backtracking 8 Sorts 9 Linked Lists 10 Tips and Resources

More information

Full Stack Web Developer

Full Stack Web Developer Full Stack Web Developer S.NO Technologies 1 HTML5 &CSS3 2 JavaScript, Object Oriented JavaScript& jquery 3 PHP&MYSQL Objective: Understand the importance of the web as a medium of communication. Understand

More information

CS6202 - PROGRAMMING & DATA STRUCTURES I Unit IV Part - A 1. Define Stack. A stack is an ordered list in which all insertions and deletions are made at one end, called the top. It is an abstract data type

More information

Shankersinh Vaghela Bapu Institue of Technology

Shankersinh Vaghela Bapu Institue of Technology Branch: - 6th Sem IT Year/Sem : - 3rd /2014 Subject & Subject Code : Faculty Name : - Nitin Padariya Pre Upload Date: 31/12/2013 Submission Date: 9/1/2014 [1] Explain the need of web server and web browser

More information

Uniform Resource Locators (URL)

Uniform Resource Locators (URL) The World Wide Web Web Web site consists of simply of pages of text and images A web pages are render by a web browser Retrieving a webpage online: Client open a web browser on the local machine The web

More information

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017

ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017 ECE 550D Fundamentals of Computer Systems and Engineering Fall 2017 The Operating System (OS) Prof. John Board Duke University Slides are derived from work by Profs. Tyler Bletsch and Andrew Hilton (Duke)

More information

JavaScript: Introduction, Types

JavaScript: Introduction, Types JavaScript: Introduction, Types Computer Science and Engineering College of Engineering The Ohio State University Lecture 19 History Developed by Netscape "LiveScript", then renamed "JavaScript" Nothing

More information

Web Programming Paper Solution (Chapter wise)

Web Programming Paper Solution (Chapter wise) Introduction to web technology Three tier/ n-tier architecture of web multitier architecture (often referred to as n-tier architecture) is a client server architecture in which presentation, application

More information

Abstract vs concrete data structures HEAPS AND PRIORITY QUEUES. Abstract vs concrete data structures. Concrete Data Types. Concrete data structures

Abstract vs concrete data structures HEAPS AND PRIORITY QUEUES. Abstract vs concrete data structures. Concrete Data Types. Concrete data structures 10/1/17 Abstract vs concrete data structures 2 Abstract data structures are interfaces they specify only interface (method names and specs) not implementation (method bodies, fields, ) HEAPS AND PRIORITY

More information

How to Create a NetBeans PHP Project

How to Create a NetBeans PHP Project How to Create a NetBeans PHP Project 1. SET UP PERMISSIONS FOR YOUR PHP WEB SITE... 2 2. CREATE NEW PROJECT ("PHP APPLICATION FROM REMOTE SERVER")... 2 3. SPECIFY PROJECT NAME AND LOCATION... 2 4. SPECIFY

More information

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR STUDENT IDENTIFICATION NO MULTIMEDIA COLLEGE JALAN GURNEY KIRI 54100 KUALA LUMPUR FIFTH SEMESTER FINAL EXAMINATION, 2014/2015 SESSION PSD2023 ALGORITHM & DATA STRUCTURE DSEW-E-F-2/13 25 MAY 2015 9.00 AM

More information

DIABLO VALLEY COLLEGE CATALOG

DIABLO VALLEY COLLEGE CATALOG COMPUTER SCIENCE COMSC Despina Prapavessi, Dean Math and Computer Science Division Math Building, Room 267 The computer science department offers courses in three general areas, each targeted to serve

More information

Week 5, continued. This is CS50. Harvard University. Fall Anna Whitney

Week 5, continued. This is CS50. Harvard University. Fall Anna Whitney This is CS50. Harvard University. Fall 2015. Anna Whitney Table of Contents 1. Linked Lists, continued... 1 1.1. Searching... 2 2. Stacks & Queues... 4 3. Memory... 9 4. More Data Structures... 13 5. Compression...

More information

Name CPTR246 Spring '17 (100 total points) Exam 3

Name CPTR246 Spring '17 (100 total points) Exam 3 Name CPTR246 Spring '17 (100 total points) Exam 3 1. Linked Lists Consider the following linked list of integers (sorted from lowest to highest) and the changes described. Make the necessary changes in

More information

Lecture : 3. Practical : 2. Course Credit. Tutorial : 0. Total : 5. Course Learning Outcomes

Lecture : 3. Practical : 2. Course Credit. Tutorial : 0. Total : 5. Course Learning Outcomes Course Title Course Code WEB DESIGNING TECHNOLOGIES DCE311 Lecture : 3 Course Credit Practical : Tutorial : 0 Total : 5 Course Learning Outcomes At end of the course, students will be able to: Understand

More information

A. Year / Module Semester Subject Topic 2016 / V 2 PCD Pointers, Preprocessors, DS

A. Year / Module Semester Subject Topic 2016 / V 2 PCD Pointers, Preprocessors, DS Syllabus: Pointers and Preprocessors: Pointers and address, pointers and functions (call by reference) arguments, pointers and arrays, address arithmetic, character pointer and functions, pointers to pointer,initialization

More information

Walk through previous lectures

Walk through previous lectures Walk through previous lectures Tuple tuple_name = (value, value,..., value) A way of packing multiple values into a variable >>> x = 3 >>> y = -5 >>> p = (x, y, 42) >>> p (3, -5, 42) name, name,..., name

More information

Linked Lists in C and C++

Linked Lists in C and C++ Linked Lists in C and C++ Professor Hugh C. Lauer CS-2303, System Programming Concepts (Slides include materials from The C Programming Language, 2 nd edition, by Kernighan and Ritchie, Absolute C++, by

More information

CS 241 Data Organization Binary Trees

CS 241 Data Organization Binary Trees CS 241 Data Organization Binary Trees Brooke Chenoweth University of New Mexico Fall 2017 Binary Tree: Kernighan and Ritchie 6.5 Read a file and count the occurrences of each word. now is the time for

More information

CMSC Introduction to Algorithms Spring 2012 Lecture 7

CMSC Introduction to Algorithms Spring 2012 Lecture 7 CMSC 351 - Introduction to Algorithms Spring 2012 Lecture 7 Instructor: MohammadTaghi Hajiaghayi Scribe: Rajesh Chitnis 1 Introduction In this lecture we give an introduction to Data Structures like arrays,

More information

5. JavaScript Basics

5. JavaScript Basics CHAPTER 5: JavaScript Basics 88 5. JavaScript Basics 5.1 An Introduction to JavaScript A Programming language for creating active user interface on Web pages JavaScript script is added in an HTML page,

More information

This is CS50 CS164. Mobile Software Engineering

This is CS50 CS164. Mobile Software Engineering This is CS50 CS164 Mobile Software Engineering diff cs50 cs164 HTML5, PHP, JavaScript, Objective-C workload typedef struct node { int n; struct node *next; } node; typedef struct node { student *student;

More information

Comp Sci 1MD3 Mid-Term II 2004 Dr. Jacques Carette

Comp Sci 1MD3 Mid-Term II 2004 Dr. Jacques Carette Comp Sci 1MD3 Mid-Term II 2004 Dr. Jacques Carette Name: Student No.: Duration : 50 minutes This midterm contains 18 questions on 4 pages This midterm will be marked out of 50. There are 60 total marks

More information

! Determine if a number is odd or even. ! Determine if a number/character is in a range. - 1 to 10 (inclusive) - between a and z (inclusive)

! Determine if a number is odd or even. ! Determine if a number/character is in a range. - 1 to 10 (inclusive) - between a and z (inclusive) Final Exam Exercises Chapters 1-7 + 11 Write C++ code to:! Determine if a number is odd or even CS 2308 Fall 2018 Jill Seaman! Determine if a number/character is in a range - 1 to 10 (inclusive) - between

More information

CS 241 Honors Concurrent Data Structures

CS 241 Honors Concurrent Data Structures CS 241 Honors Concurrent Data Structures Bhuvan Venkatesh University of Illinois Urbana Champaign March 27, 2018 CS 241 Course Staff (UIUC) Lock Free Data Structures March 27, 2018 1 / 43 What to go over

More information

Announcements. 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted

Announcements. 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted Announcements 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted 2. Campus is closed on Monday. 3. Install Komodo Edit on your computer this weekend.

More information

Midterm Review. CS 211 Fall 2018

Midterm Review. CS 211 Fall 2018 Midterm Review CS 211 Fall 2018 BSB 250 Official Time: 10:00 am to 10:50 am If we can start a few minutes early, we will So try to arrive closer to 9:50am We will need to finish right at 10:50 since there

More information

Data Structure Series

Data Structure Series Data Structure Series This series is actually something I started back when I was part of the Sweet.Oblivion staff, but then some things happened and I was no longer able to complete it. So now, after

More information

Student, Perfect Midterm Exam March 24, 2006 Exam ID: 3193 CS-081/Vickery Page 1 of 5

Student, Perfect Midterm Exam March 24, 2006 Exam ID: 3193 CS-081/Vickery Page 1 of 5 Student, Perfect Midterm Exam March 24, 2006 Exam ID: 3193 CS-081/Vickery Page 1 of 5 NOTE: It is my policy to give a failing grade in the course to any student who either gives or receives aid on any

More information

CS350 - Exam 1 (100 Points)

CS350 - Exam 1 (100 Points) Spring 2013 Name CS350 - Exam 1 (100 Points) 1.(25 points) Stacks and Queues (a) (5) For the values 4, 8, 2, 5, 7, 3, 9 in that order, give a sequence of push() and pop() operations that produce the following

More information

CPSC 221: Algorithms and Data Structures Lecture #1: Stacks and Queues

CPSC 221: Algorithms and Data Structures Lecture #1: Stacks and Queues CPSC 221: Algorithms and Data Structures Lecture #1: Stacks and Queues Alan J. Hu (Slides borrowed from Steve Wolfman) Be sure to check course webpage! http://www.ugrad.cs.ubc.ca/~cs221 1 Lab 1 is available.

More information

Announcements. 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted

Announcements. 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted Announcements 1. Class webpage: Have you been reading the announcements? Lecture slides and coding examples will be posted 2. Install Komodo Edit on your computer right away. 3. Bring laptops to next class

More information

Anatomy of an HTML document

Anatomy of an HTML document Anatomy of an HTML document hello World hello World This is the DOCTYPE declaration.

More information

"apple" "grape" "grape" "grape" "apple"

apple grape grape grape apple Test 1: CPS 100 Owen Astrachan and Dee Ramm February 21, 1997 Name: Honor code acknowledgment (signature) Problem 1 Problem 2 Problem 3 Problem 4 Problem 5 Problem 6 TOTAL: value 10 pts. 9 pts. 21 pts.

More information

Matriculation number:

Matriculation number: Department of Informatics Prof. Dr. Michael Böhlen Binzmühlestrasse 14 8050 Zurich Phone: +41 44 635 4333 Email: boehlen@ifi.uzh.ch AlgoDat Midterm 2 Spring 2018 27.04.2018 Name: Matriculation number:

More information

CS300 Final Review Questions 1

CS300 Final Review Questions 1 CS300 Final Review Questions 1 This is not a complete list of questions and topics, but a good sampling of questions that will help you study for the final. I strongly advise you to work through every

More information

Computer Science E-22 Practice Final Exam

Computer Science E-22 Practice Final Exam name Computer Science E-22 This exam consists of three parts. Part I has 10 multiple-choice questions that you must complete. Part II consists of 4 multi-part problems, of which you must complete 3, and

More information

CS637 Midterm Review

CS637 Midterm Review CS637 Midterm Review Coverage: Duckett Chapter 1-2: Basics: Can skip pp. 53-56 Chapter 3: Lists: all important Chapter 4:Links: all important Chapter 5:Images: can skip old code Chapter 6: Tables: all

More information

Birkbeck (University of London)

Birkbeck (University of London) Birkbeck (University of London) MSc Examination Department of Computer Science and Information Systems Internet and Web Technologies (COIY063H7) 15 Credits Date of Examination: 20 May 2015 Duration of

More information

SYSC 2006 CD. Come to the PASS workshop with your mock exam complete. During the workshop you can work with other students to review your work.

SYSC 2006 CD. Come to the PASS workshop with your mock exam complete. During the workshop you can work with other students to review your work. It is most beneficial to you to write this mock midterm UNDER EXAM CONDITIONS. This means: Complete the mock final in 180 minutes. Work on your own. Keep your notes and textbook closed. Attempt every question.

More information

PHP Personal Home Page PHP: Hypertext Preprocessor (Lecture 35-37)

PHP Personal Home Page PHP: Hypertext Preprocessor (Lecture 35-37) PHP Personal Home Page PHP: Hypertext Preprocessor (Lecture 35-37) A Server-side Scripting Programming Language An Introduction What is PHP? PHP stands for PHP: Hypertext Preprocessor. It is a server-side

More information

CPSC 221: Algorithms and Data Structures ADTs, Stacks, and Queues

CPSC 221: Algorithms and Data Structures ADTs, Stacks, and Queues CPSC 221: Algorithms and Data Structures ADTs, Stacks, and Queues Alan J. Hu (Slides borrowed from Steve Wolfman) Be sure to check course webpage! http://www.ugrad.cs.ubc.ca/~cs221 1 Lab 1 available very

More information

Http Error Code 403 Forbidden Dreamweaver Mysql

Http Error Code 403 Forbidden Dreamweaver Mysql Http Error Code 403 Forbidden Dreamweaver Mysql Dreamweaver Database Http Error Code 403 Forbidden 오류 403 Forbidden Adobe Systems Inc. Adobe Dreamweaver. 459. Dreamweaver Error 1045 오류. They can range

More information

Lecture Notes CPSC 122 (Fall 2014) Today Quiz 7 Doubly Linked Lists (Unsorted) List ADT Assignments Program 8 and Reading 6 out S.

Lecture Notes CPSC 122 (Fall 2014) Today Quiz 7 Doubly Linked Lists (Unsorted) List ADT Assignments Program 8 and Reading 6 out S. Today Quiz 7 Doubly Linked Lists (Unsorted) List ADT Assignments Program 8 and Reading 6 out S. Bowers 1 of 11 Doubly Linked Lists Each node has both a next and a prev pointer head \ v1 v2 v3 \ tail struct

More information

- Alan Perlis. Topic 24 Heaps

- Alan Perlis. Topic 24 Heaps Topic 24 Heaps "You think you know when you can learn, are more sure when you can write even more when you can teach, but certain when you can program." - Alan Perlis Recall priority queue Priority Queue

More information