Bndl: Llf New Perspectives Htm L5 Css3 & Javascript, 6th Edition
6th Edition
ISBN: 9781337755870
Author: Carey
Publisher: CENGAGE L
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 14, Problem 1RA
Program Plan Intro
To add name and date in comment section of file save ag_squares_txt.html, ag_squares_txt.js and ag_cards2_txt.js, and save each of them after removing the txt extension.
Expert Solution & Answer
Explanation of Solution
Given information: The files,ag_squares_txt.html, ag_squares_txt.js and ag_cards2_txt. jsare provided under the folder html14→Review with reference material.
Explanation:
In HTML comments are provided within symbols <!-- comments --> whereas JS comments are included within the symbols /* comments */.
Follow below steps to add name and date in the html file ag_squares_txt.html:
1.Right click on file name.
2.Select Open with →HTML editor
3.Write your name and date in Author and Date fields in comment section (<!-- -->) respectively.
4.Click File →Save As.
5.Under Save As window, provide new name to file after removing _txt extension.
6.Click Save.
A new update file will get created in the same directory.
Follow below steps to add name and date in the files ag_squares_txt.js and ag_cards2_txt.js:
1. Right click on file name.
2.Select Open with →HTML editor
3.Write your name and date in Author and Date fields in comment section(/* ---- */) respectively.
4.Click File →Save As.
5.Under Save As window, provide a new name to file after removing _txt extension.
6. Click Save.
A new update file will get created in the same directory.
Want to see more full solutions like this?
Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Design a dynamic programming algorithm for the Longest Alternating Subsequence problem
described below:
Input: A sequence of n integers
Output: The length of the longest subsequence where the numbers alternate between being larger and
smaller than their predecessor
The algorithm must take O(n²) time. You must also write and explain the recurrence.
Example 1:
Input: [3, 5, 4, 1, 3, 6, 5, 7, 3, 4]
Output: 8 ([3, 5, 4, 6, 5, 7, 3, 4])
Example 2:
Input: [4,7,2,5,8, 3, 8, 0, 4, 7, 8]
Output: 8 ([4, 7, 2, 5, 3, 8, 0,4])
(Take your time with this for the subproblem for this one)
Design a dynamic programming algorithm for the Coin-change problem described below:
Input: An amount of money C and a set of n possible coin values with an unlimited supply of each
kind of coin.
Output: The smallest number of coins that add up to C exactly, or output that no such set exists.
The algorithm must take O(n C) time. You must also write and explain the recurrence.
Example 1:
Input: C24, Coin values = = [1, 5, 10, 25, 50]
Output: 6 (since 24 = 10+ 10+1+1 +1 + 1)
Example 2:
Input: C = 86, Coin values = [1, 5, 6, 23, 35, 46, 50]
Output: 2 (since 86 = 46+35+5)
Design a dynamic programming algorithm for the Longest Common Subsequence problem de-
scribed below
Input: Two strings x = x1x2 xm and y = Y1Y2... Yn
Output: The length of the longest subsequence that is common to both x and y.
.
The algorithm must take O(m n) time. You must also write and explain the recurrence.
(I want the largest k such that there are 1 ≤ i₁ < ... < ik ≤ m and 1 ≤ j₁ < ... < jk ≤ n such that
Xi₁ Xi2 Xik = Yj1Yj2 ··· Yjk)
Example 1:
Input: x = 'abcdefghijklmnopqrst' and y = 'ygrhnodsh ftw'
Output: 6 ('ghnost' is the longest common subsequence to both strings)
Example 2:
Input: x = 'ahshku' and y = ‘asu'
Output: 3 ('asu' is the longest common subsequence to both strings)
Chapter 14 Solutions
Bndl: Llf New Perspectives Htm L5 Css3 & Javascript, 6th Edition
Ch. 14 - Prob. 1RACh. 14 - Prob. 2RACh. 14 - Prob. 3RACh. 14 - Prob. 4RACh. 14 - Prob. 5RACh. 14 - Prob. 6RACh. 14 - Prob. 7RACh. 14 - Prob. 8RACh. 14 - Prob. 9RACh. 14 - Prob. 10RA
Ch. 14 - Prob. 11RACh. 14 - Prob. 12RACh. 14 - Prob. 13RACh. 14 - Prob. 14RACh. 14 - Prob. 15RACh. 14 - Prob. 1CP1Ch. 14 - Prob. 2CP1Ch. 14 - Prob. 3CP1Ch. 14 - Prob. 4CP1Ch. 14 - Prob. 5CP1Ch. 14 - Prob. 6CP1Ch. 14 - Prob. 7CP1Ch. 14 - Prob. 8CP1Ch. 14 - Prob. 9CP1Ch. 14 - Prob. 10CP1Ch. 14 - Prob. 11CP1Ch. 14 - Prob. 12CP1Ch. 14 - Prob. 13CP1Ch. 14 - Prob. 14CP1Ch. 14 - Prob. 15CP1Ch. 14 - Prob. 16CP1Ch. 14 - Prob. 17CP1Ch. 14 - Prob. 1CP2Ch. 14 - Prob. 2CP2Ch. 14 - Prob. 3CP2Ch. 14 - Prob. 4CP2Ch. 14 - Prob. 5CP2Ch. 14 - Prob. 6CP2Ch. 14 - Prob. 7CP2Ch. 14 - Prob. 8CP2Ch. 14 - Prob. 9CP2Ch. 14 - Prob. 10CP2Ch. 14 - Prob. 11CP2Ch. 14 - Prob. 12CP2Ch. 14 - Prob. 13CP2Ch. 14 - Prob. 14CP2Ch. 14 - Prob. 15CP2Ch. 14 - Prob. 16CP2Ch. 14 - Prob. 17CP2Ch. 14 - Prob. 18CP2Ch. 14 - Prob. 19CP2Ch. 14 - Prob. 20CP2Ch. 14 - Prob. 1CP3Ch. 14 - Prob. 2CP3Ch. 14 - Prob. 3CP3Ch. 14 - Prob. 4CP3Ch. 14 - Prob. 5CP3Ch. 14 - Prob. 6CP3Ch. 14 - Prob. 7CP3Ch. 14 - Prob. 8CP3Ch. 14 - Prob. 9CP3Ch. 14 - Prob. 10CP3Ch. 14 - Prob. 11CP3Ch. 14 - Prob. 12CP3Ch. 14 - Prob. 13CP3Ch. 14 - Prob. 14CP3Ch. 14 - Prob. 15CP3Ch. 14 - Prob. 16CP3Ch. 14 - Prob. 17CP3Ch. 14 - Prob. 18CP3Ch. 14 - Prob. 19CP3Ch. 14 - Prob. 20CP3Ch. 14 - Prob. 21CP3Ch. 14 - Prob. 22CP3Ch. 14 - Prob. 23CP3Ch. 14 - Prob. 24CP3Ch. 14 - Prob. 25CP3Ch. 14 - Prob. 26CP3Ch. 14 - Prob. 27CP3Ch. 14 - Prob. 28CP3Ch. 14 - Prob. 1CP4Ch. 14 - Prob. 2CP4Ch. 14 - Prob. 3CP4Ch. 14 - Prob. 4CP4Ch. 14 - Prob. 5CP4Ch. 14 - Prob. 6CP4Ch. 14 - Prob. 7CP4
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Design a dynamic programming algorithm for the problem described below Input: A list of numbers A = = [a1,..., an]. Output: A contiguous subsequence of numbers with the maximum sum. The algorithm must take O(n) time. You must also write and explain the recurrence. (I am looking for an i ≥ 1 and k ≥ 0 such that a + ai+1 + ···ai+k has the largest possible sum among all possible values for i and k.) Example 1: Input: A[5, 15, -30, 10, -5, 40, 10]. Output: [10, 5, 40, 10] Example 2: Input: A = [7, 5, 7, 4, -20, 6, 9, 3, -4, -8, 4] Output: [6,9,3]arrow_forwardDesign a dynamic programming algorithm for the Longest Increasing Subsequence problem described below: Input: A sequence of n integers Output: The length of the longest increasing subsequence among these integers. The algorithm must take O(n²) time. You must also write and explain the recurrence. Example 1: Input: [5, 3, 6, 8, 4, 6, 2, 7, 9, 5] Output: 5 ([3, 4, 6, 7, 9]) Example 2: Input: [12, 42, 66, 73, 234, 7, 543, 16] Output: 6 ([42, 66, 73, 234, 543])arrow_forwardDesign a dynamic programming algorithm for the Subset Sum problem described below: Input: A set of n integers A and an integer s Output: A subset of A whose numbers add up to s, or that no such set exists. The algorithm must take O(n·s) time. You must also write and explain the recurrence. Example 1: Input: A = {4, 7, 5, 2, 3}, s = 12 Output: {7,2,3} Example 2: Input: A{4, 7, 5,3}, s = 6 Output: 'no such subset'arrow_forward
- TECNOLOGIE DEL WEB 2023/2023 (VER 1.1) Prof. Alfonso Pierantonio 1. Project Requirements The project consists in designing and implementing a Web application according to the methodology and the technologies illustrated and developed during the course. This document describe cross-cutting requirements the application must satisfy. The application must be realized with a combination of the following technologies: PHP MySQL HTML/CSS JavaScript, jQuery, etc templating The requirements are 2. Project size The application must have at least 18 SQL tables The number of SQL tables refers to the overall number of tables (including relation normalizations). 3. Methodology The application must be realized by adopting separation of logics, session management, and generic user management (authentication/permissions). Missing one of the above might correspond to a non sufficient score for the project. More in details: 3.1 Separation of Logics The separation of logics has to be realizse by using…arrow_forwardWrite a C program to calculate the function sin(x) or cos(x) using a Taylor series expansion around the point 0. In other words, you will program the sine or cosine function yourself, without using any existing solution. You can enter the angles in degrees or radians. The program must work for any input, e.g. -4500° or +8649°. The function will have two arguments: float sinus(float radians, float epsilon); For your own implementation, use one of the following relations (you only need to program either sine or cosine, you don't need both): Tip 1: Of course, you cannot calculate the sum of an infinite series indefinitely. You can see (if not, look in the program) that the terms keep getting smaller, so there will definitely be a situation where adding another term will not change the result in any way (see problem 1.3 – machine epsilon). However, you can end the calculation even earlier – when the result changes by less than epsilon (a pre-specified, sufficiently small number, e.g.…arrow_forwardWrite a C program that counts the number of ones (set bits) in the binary representation of a given number. Example:Input: 13 (binary 1101)Output: 3 unitsarrow_forward
- I need help to resolve or draw the diagrams. thank youarrow_forwardYou were requested to design IP addresses for the following network using the addressblock 166.118.10.0/8, connected to Internet with interface 168.118.40.17 served by the serviceprovider with router 168.118.40.1/20.a) Specify an address and net mask for each network and router interface in the table provided. b) Give the routing table at Router 1.c) How will Router 1 route the packets with destinationi) 168.118.10.5ii) 168.118.10.103iii) 168.119.10.31iii) 168.118.10.153arrow_forwardI would like to get help to draw an object relationship diagram for a typical library system.arrow_forward
- Given the network of bridges in figure, and assuming that LAN ports on A, B, C, D, E, J are 10 Mbs (cost 100 for ports) except for ports on F, G, I, H, K which are 100Mbps LANs (cost 19 for ports) Draw the obtained spanning tree, cross the blocking state ports, and circle the designated ports and write the best cost broadcasted by each router next to its root port. list in logic level detail the expected last STP messages that will define the final status at each router.arrow_forwardNext, you are going to combine everything you've learned about HTML and CSS to make a static site portfolio piece. The page should first introduce yourself. The content is up to you, but should include a variety of HTML elements, not just text. This should be followed by an online (HTML-ified) version of your CV (Resume). The following is a minimum list of requirements you should have across all your content: Both pages should start with a CSS reset (imported into your CSS, not included in your HTML) Semantic use of HTML5 sectioning elements for page structure A variety other semantic HTML elements Meaningful use of Grid, Flexbox and the Box Model as appropriate for different layout components A table An image Good use of CSS Custom Properties (variables) Non-trivial use of CSS animation Use of pseudeo elements An accessible colour palette Use of media queries The focus of this course is development, not design. However, being able to replicate a provided design for the web is…arrow_forwardI would like to get help to draw an object relationship diagram for a typical library system.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScriptComputer ScienceISBN:9781305503922Author:Patrick M. CareyPublisher:Cengage Learning
Np Ms Office 365/Excel 2016 I NtermedComputer ScienceISBN:9781337508841Author:CareyPublisher:Cengage
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Cengage Learning
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage