mooc udacity

Log on to the instance and save the data (use SharedPreferences to save the user name for MOOC notes ). Take notes when you perform operations after learning the video. 0. video address: http://www.imooc.com/video/3265 1. Function preview: Note: 1) enter the wrong user name and password and click log on. A prompt box is displayed, indicating "Logon prohibited "; 2) enter the correct user name and password, and click log on. The prompt box "Logon succ

The product and sum of the two unary polynomials are obtained by the design function respectively.Input format:Input is divided into 2 lines, each line is given the number of non-0 polynomial, and then the exponential degradation way to enter a polynomial non-0 coefficients and exponents (absolute value is not more than 1000 integers). The numbers are separated by a space.Output format:The output is divided into 2 rows, and the coefficients and exponents of the product polynomial and the polynom

Springmvc notes (from MOOC), springmvc 1. Preparations: springmvc-related jar packages. 2. Here we first use eclipse for operations. First, let's look at an interface programming. All the knowledge points in the future are drawn out through this interface programming. OneInterface. java 1 package gys;2 3 public interface OneInterface {4 String hello(String world);5 } OneInterfaceImpl. java 1 package gys; 2 3 public class OneInterfaceImpl implemen

take to get the full content of the URL link Web page based on HTTP1.0?4) If the browser does not have a parallel TCP connection configured, how long does it take for the HTTP1.1 to get the full content of the URL link Web page based on non-pipelining mode? How long does it take to get the full content of the URL link Web page based on the HTTP1.1 mode?1) because there is no cache locally, it requires a minimum of 1 queries. A maximum of 3 recursive queries are required.Answer: 1 RTTD ~ 3 Rttd.

In the previous article, a process was introduced, and the process of stack changes when calling subroutines was analyzed. This article describes the process of multi-process execution, when a process needs to stop to wait for a certain condition or the CPU to allocate the time slice run out need to switch to another process, when the switch first generates an interrupt, then the CPU will perform the corresponding interrupt processing operation, An important operation, for example, is to protect

will be transferred to go to execute subroutine code, in order to be able to accurately return when the subroutine executes, need to push the address of the next instruction of the call instruction into the stack. Then create a new stack for the subroutine, the assembly instructions are as follows: PUSHL%EBP MOVL%esp,%EBP The PUSHL%ebp instruction pushes the base address of the stack of the keynote program into the stack, and ESP,EBP all points to the next bit of the start of

of the current process of printing the PID, and then determine whether the clock interrupt the dispatch flag (my_need_sched) is set to 1, if 1 will be the dispatch flag 0, call My_schedule (), avoid the message mechanism, Then print the PID of the current process again. Myinterrupt.cThe My_time_handler () implementation is called per thousand and the Dispatch flag (my_need_sched) is not 1 o'clock, printing ">>>my_timer_handler hereThe above code is the process scheduling function fault-toler

database driver package, connection pooling (C3P0)-related jar packages.(2). Spring Related JAR Packages(3). Log PackageConfiguration file:(1). Log4j.properties: Log records(2). Jdbc.properties: Database Connection Configuration file(3). applicationContext.xml:Spring Core FileCreate a package, write business logic:(1) Definition Interface/accountservice: Business Layer Interface(2) Define implementation class/accountserviceimpl: Business layer Implementation class, invoking DAO layer(3) Operati

values can cause changes in block 2hash values .... In turn ... (To change all chunks.) ）5. Build Your own BlockchainPart:(i). Implement a chain-type structure(b). Implement a simple HTTP server, externally exposed read-write interfaceSteps:Step1: Creating a block (development environment: Goland)A. Create a project DemochainDemichain/block.goB. Create a block fileC. Creating block structures and functionsStructure:Calculate hash valueGenerate new BlocksFounding blocksStep2: Create BlockchainVi

ordering.3. Merge sortIdea: Divide the whole sequence into multiple sub-sequences, sequence the subsequence sequentially, and finally merge into an ordered sequence, with the following algorithm:/** * Merge sort, time complexity O (NLOGN) * @param arr array to sort * @param the starting position of the lo to sort interval * @param hi to the end of the sort interval */public static void MergeSort ( Int[] arr, int lo, int hi) {//If there is only one element left in the interval, the recursive if

discovers that the X process is waiting for this I/O (at which point X has become blocked), and the handler sets X to Wake_up 6. process Management may set process X to the next process so that the get system invokes the data and returns to the user-state stack 7. from the point of view of the CPU execution instructions: 8. from a memory point of view, all physical addresses are mapped to more than 3G of address space. Because this part is shared for all processes: The experimental

node service (preferred to go to the school folder below.) Input command node Index.js)Show Results:School is also exposed to the outside. The5. The node. JS API usesnode. JS Core module: http/url/querystring module"1". URL URLs parsingVideo: https://www.imooc.com/video/6710URL Document directory: https://nodejs.org/dist/latest-v8.x/docs/api/url.html"2" QueryString parameter Processing tool (serialization/deserialization/escape/reversal semantics)https://www.imooc.com/video/6711//Video addressh

());a_2 = Beishu * R.geta ();b_2 = Beishu * R.GETB ();}return new fraction (a_1 + a_2, b_1);}Public fraction multiply (fraction r) {//multiplies its score and R's fraction to produce a new fraction object.return new Fraction (A_ * (R.geta ()), B_ * (R.GETB ()));}public void print () {//outputs itself as a "numerator/denominator" to the standard output with a carriage return with a newline. If the score is 1/1, you should output 1. When the numerator is greater than the denominator, there is no

Import Java.util.Scanner;public class Report {public static void Main (string[] args) {String[] s={"faint signals, barely perceptible","Very Weak signals","Weak signals","Fair signals","Fairly good signals","Good signals","Moderately strong signals","Strong signals","Extremely strong signals"};String[] r={"unreadable","Barely readable, occasional words distinguishable","Readable with considerable difficulty","Readable with practically no difficulty","Perfectly readable"};String rs= "";int i;Scan

TOP1: Academy Onlinehttp://www.xuetangx.com/TOP2: NetEase Cloud Classroomhttp://study.163.com/Top3:courserahttps://www.coursera.org/Top4:edxhttps://www.edx.org"C Language Program Design" by Zhejiang University: Link: http://pan.baidu.com/s/1o63Hs2e

Definition of supervised learning and unsupervised learning Idea of supervised learning is to teach computer how to do something. Idea of unsupervised learning is to let the computer learn by itself. Reinforcement Learning: Reinforcement Learning

1, MyStringRequired Input: ABC def 123 456 Require output ABC,ABC,ABC def,def,def 123,123,123 456,456,456 #include #include #include using namespace std; Class MyString {char * p; public:mystring (const char * s) {if (s) {p = new Char[strlen (s)

To achieve the QQ new account application and the old account landing simplified version of the function. The biggest challenge is: it is said that the current QQ number has 10 digits. Input format: The input first gives a positive integer nn (\le 10

TOP1: Academy Onlinehttp://www.xuetangx.com/TOP2: NetEase Cloud Classroomhttp://study.163.com/Top3:courserahttps://www.coursera.org/Top4:edxhttps://www.edx.org"C Language Program Design" by Zhejiang University: Link: http://pan.baidu.com/s/1o63Hs2e

Simple integer Partitioning problem total time limit: 100ms memory limit: 65536kB description A positive integer n is represented as a sum of a series of positive integers, n=n1+n2+...+nk, where n1>=n2>=...>=nk>=1, K>=1.This representation of