Thread State and Thread Class Methods

20. Using Java Awt and Java Applet, write a program to draw a pie chart according to the model in the following figure:

21. Using Java Awt, Java Applet and mouse events MouseListener write a program to draw 4 squares according to the following pattern, so that when you click on a square, it will change color randomly.

22. Using Java Awt, Java Applet and MouseListener mouse events, write a program to draw a human face according to the model in the image below, so that when you click on Smile, the human face will be smile (yellow background and smiling mouth), and when you click on Sad, the face will be sad (brown background, crooked mouth).

23. Using Java Awt, Java Applet draws 20 lines of Java text on the screen forming a circle with color gradually changing from red to blue according to the pattern in the following image:

24. Using Java Awt, Java Applet draw a target (red and white concentric circles) according to the pattern in the following image:

25. Using Java Awt, Java Applet, write a program to draw blue lines on a white background around a fixed center according to the pattern in the following image:

26. Using Java Awt, Java Applet, write a program to draw pink rectangles on a white background according to the pattern in the following image:

27. Using Java Awt, Java Applet, write a program to draw a chess board with red and black squares according to the pattern in the following image:

CHAPTER 6: MULTITHREADING PROGRAMMING

6.1. Introduction to threaded programming

Thread is a unique property of Java. It is the smallest unit of executable code that can perform a certain task. Java language, Java virtual machine both are threaded systems.

6.2. Threading and multithreading

Java supports multithreading, it is capable of working with multiple threads. An application can contain multiple threads. Each thread is assigned a specific task, they are executed concurrently with other threads.

Multithreading minimizes system idle time. This allows you to write highly efficient programs with maximum CPU utilization. Each part of

The program is called a thread, each thread defines a way of execution. This is a special case of multitasking.

In multitasking, multiple programs run concurrently, each with at least one thread in it. A single processor executes all these programs. The programs are thus executed as if they were concurrent, when in reality the processor switches back and forth between the programs.

6.3. Creating and managing streams

When Java programs are executed, the main thread is already executing.

The two important elements in the main flow are:

 Sub-streams will be created from it.

 It is the last thread to finish its execution. As soon as the main thread stops executing, the program is terminated .

Although the main thread is created automatically with program execution, it can be controlled through a thread object.

Streams can be created in two ways:

 Declare the class as a subclass of the Thread class, and the run() method of the Thread class needs to be overridden.

Example 6.1: Create a subclass of Thread class

class Mydemo extends Thread

{

public void run()

{

//execute

}

}

 Declare a class that implements the Runnable interface. Then define the run() method.

class MyDemo implements Runnable

{

public void run()

{

//execute

}

}

Example 6.2: Show how the main flow is controlled

import java.io.*;

public class Mythread extends Thread

{

public static void main(String args[])

{

Thread t = Thread.currentThread(); System.out.println("The current Thread is :" + t); t.setName("MyJavaThread"); System.out.println("The thread is now named: " + t); try{

for(int i = 0; i <3;i++)

{

System.out.println(i); Thread.sleep(1500);

}

}

catch(InterruptedException e)

{

System.out.println("Main thread interupted");

}

}

}

The following figure shows the output of the above program.

Figure 6.1. Result of executing example 6.2

In the output above

[main, 5 , main]

The thread group it depends on

Priority is set by JVM

Name of the stream

Each thread in a Java program is given a priority. The Java virtual machine never changes the priority of a thread. The priority remains constant until the thread is terminated.

Each thread has a priority value that ranges from Thread.MIN_PRIORITY (=1), to Thread.MAX_PRIORITY (=10). Each thread belongs to a thread group, and each thread group has its own priority. Each thread has a default priority value Thread.NORM_PRIORITY of 5. New threads inherit the priority of the thread that created them.

The Thread class has several constructors, two of which are mentioned below:

public Thread(String threadname)

The structure of a thread is named “threadname”

public Thread()

A thread constructs a thread with the name “Thread, concatenated with a number; for example Thread-1, Thread-2, etc…

The program starts the thread execution by calling the start() method of the Thread class. This method will call the run() method, where the job definition is

execute. This method can be overridden in a subclass of the Thread class, or in an object implementing the Runnable interface.

6.4. Thread Life Cycle

Figure 6.2. Stream life cycle

6.5. Thread state and methods of Thread class

A newly created thread is in the 'born' state. The thread does not start running immediately after it is created. It waits for its own start() method to be called. from there it is in the “ready to run” state. The thread enters the “running” state when the system grants it access to the processor.

The sleep() method can be used to temporarily stop the execution of a thread. The thread becomes available after the sleep() method finishes. A thread in the 'sleeping' state does not use the processor. A thread enters the 'waiting' state when a thread calls the wait() method.

When other threads have finished using the object, calling the notify() method, the thread returns to the “ready” state. A thread enters the “blocked” state when it is performing input/output operations. It enters the “ready” state when the input/output methods it is waiting for are completed. A thread enters the “dead” state after its run() method has finished executing, or when its stop() method is called.

Besides the methods mentioned above, the Thread class also has the following methods:

Method

Purpose
enumerate(Thread t)	Copies all current threads into the specified array.

Maybe you are interested!

• Qos Assurance Methods for Multimedia Communications zt2i3t4l5ee zt2a3gs zt2a3ge zc2o3n4t5e6n7ts low. The EF PHB requires a sufficiently large number of output ports to provide low delay, low loss, and low jitter. EF PHBs can be implemented if the output port's bandwidth is sufficiently large, combined with small buffer sizes and other network resources dedicated to EF packets, to allow the router's service rate for EF packets on an output port to exceed the arrival rate λ of packets at that port. This means that packets with PHB EF are considered with a pre-allocated amount of output bandwidth and a priority that ensures minimum loss, minimum delay and minimum jitter before being put into operation. PHB EF is suitable for channel simulation, leased line simulation, and real-time services such as voice, video without compromising on high loss, delay and jitter values. Figure 2.10 Example of EF installation Figure 2.10 shows an example of an EF PHB implementation. This is a simple priority queue scheduling technique. At the edges of the DS domain, EF packet traffic is prioritized according to the values ​​agreed upon by the SLA. The EF queue in the figure needs to output packets at a rate higher than the packet arrival rate λ. To provide an EF PHB over an end-to-end DS domain, bandwidth at the output ports of the core routers needs to be allocated in advance to ensure the requirement μ > λ. This can be done by a pre-configured provisioning process. In the figure, EF packets are placed in the priority queue (the upper queue). With such a length, the queue can operate with μ > λ. Since EF was primarily used for real-time services such as voice and video, and since real-time services use UDP instead of TCP, RED is generally not suitable for EF queues because applications using UDP will not respond to random packet drop and RED will strip unnecessary packets. 2.2.4.2 Assured Forwarding (AF) PHB PHB AF is defined by RFC 2597. The purpose of PHB AF is to deliver packets reliably and therefore delay and jitter are considered less important than packet loss. PHB AF is suitable for non-real-time services such as applications using TCP. PHB AF first defines four classes: AF1, AF2, AF3, AF4. For each of these AF classes, packets are then classified into three subclasses with three distinct priority levels. Table 2.8 shows the four AF classes and 12 AF subclasses and the DSCP values ​​for the 12 AF subclasses defined by RFC 2597. RFC 2597 also allows for more than three separate priority levels to be added for internal use. However, these separate priority levels will only have internal significance. PHB Class PHB Subclass Package type DSCP AF4 AF41 Short 100010 AF42 Medium 100100 AF43 High 100110 AF3 AF31 Short 011010 AF32 Medium 011100 AF33 High 011110 AF2 AF21 Short 010010 AF22 Medium 010100 AF23 High 010110 AF1 AF11 Short 001010 AF12 Medium 001100 AF13 High 001110 Table 2.8 AF DSCPs The AF PHB ensures that packets are forwarded with a high probability of delivery to the destination within the bounds of the rate agreed upon in an SLA. If AF traffic at an ingress port exceeds the pre-priority rate, which is considered non-compliant or “out of profile”, the excess packets will not be delivered to the destination with the same probability as the packets belonging to the defined traffic or “in profile” packets. When there is network congestion, the out of profile packets are dropped before the in profile packets are dropped. When service levels are defined using AF classes, different quantity and quality between AF classes can be realized by allocating different amounts of bandwidth and buffer space to the four AF classes. Unlike EF, most AF traffic is non-real-time traffic using TCP, and the RED queue management strategy is an AQM (Adaptive Queue Management) strategy suitable for use in AF PHBs. The four AF PHB layers can be implemented as four separate queues. The output port bandwidth is divided into four AF queues. For each AF queue, packets are marked with three “colors” corresponding to three separate priority levels. In addition to the 32 DSCP 1 groups defined in Table 2.8, 21 DSCPs have been standardized as follows: one for PHB EF, 12 for PHB AF, and 8 for CSCP. There are 11 DSCP 1 groups still available for other standards. 2.2.5.Example of Differentiated Services We will look at an example of the Differentiated Service model and mechanism of operation. The architecture of Differentiated Service consists of two basic sets of functions: Edge functions: include packet classification and traffic conditioning. At the inbound edge of the network, incoming packets are marked. In particular, the DS field in the packet header is set to a certain value. For example, in Figure 2.12, packets sent from H1 to H3 are marked at R1, while packets from H2 to H4 are marked at R2. The labels on the received packets identify the service class to which they belong. Different traffic classes receive different services in the core network. The RFC definition uses the term behavior aggregate rather than the term traffic class. After being marked, a packet can be forwarded immediately into the network, delayed for a period of time before being forwarded, or dropped. We will see that there are many factors that affect how a packet is marked, and whether it is forwarded immediately, delayed, or dropped. Figure 2.12 DiffServ Example Core functionality: When a DS-marked packet arrives at a Diffservcapable router, the packet is forwarded to the next router based on Per-hop behavior is associated with packet classes. Per-hop behavior affects router buffers and the bandwidth shared between competing classes. An important principle of the Differentiated Service architecture is that a router's per-hop behavior is based only on the packet's marking or the class to which it belongs. Therefore, if packets sent from H1 to H3 as shown in the figure receive the same marking as packets from H2 to H4, then the network routers treat the packets exactly the same, regardless of whether the packet originated from H1 or H2. For example, R3 does not distinguish between packets from h1 and H2 when forwarding packets to R4. Therefore, the Differentiated Service architecture avoids the need to maintain router state about separate source-destination pairs, which is important for network scalability. Chapter Conclusion Chapter 2 has presented and clarified two main models of deploying and installing quality of service in IP networks. While the traditional best-effort model has many disadvantages, later models such as IntServ and DiffServ have partly solved the problems that best-effort could not solve. IntServ follows the direction of ensuring quality of service for each separate flow, it is built similar to the circuit switching model with the use of the RSVP resource reservation protocol. IntSer is suitable for services that require fixed bandwidth that is not shared such as VoIP services, multicast TV services. However, IntSer has disadvantages such as using a lot of network resources, low scalability and lack of flexibility. DiffServ was born with the idea of ​​solving the disadvantages of the IntServ model. DiffServ follows the direction of ensuring quality based on the principle of hop-by-hop behavior based on the priority of marked packets. The policy for different types of traffic is decided by the administrator and can be changed according to reality, so it is very flexible. DiffServ makes better use of network resources, avoiding idle bandwidth and processing capacity on routers. In addition, the DifServ model can be deployed on many independent domains, so the ability to expand the network becomes easy. Chapter 3: METHODS TO ENSURE QoS FOR MULTIMEDIA COMMUNICATIONS In packet-switched networks, different packet flows often have to share the transmission medium all the way to the destination station. To ensure the fair and efficient allocation of bandwidth to flows, appropriate serving mechanisms are required at network nodes, especially at gateways or routers, where many different data flows often pass through. The scheduler is responsible for serving packets of the selected flow and deciding which packet will be served next. Here, a flow is understood as a set of packets belonging to the same priority class, or originating from the same source, or having the same source and destination addresses, etc. In normal state when there is no congestion, packets will be sent as soon as they are delivered. In case of congestion, if QoS assurance methods are not applied, prolonged congestion can cause packet drops, affecting service quality. In some cases, congestion is prolonged and widespread in the network, which can easily lead to the network being "frozen", or many packets being dropped, seriously affecting service quality. Therefore, in this chapter, in sections 3.2 and 3.3, we introduce some typical network traffic load monitoring techniques to predict and prevent congestion before it occurs through the measure of dropping (removing) packets early when there are signs of impending congestion. 3.1. DropTail method DropTail is a simple, traditional queue management method based on FIFO mechanism. All incoming packets are placed in the queue, when the queue is full, the later packets are dropped. Due to its simplicity and ease of implementation, DropTail has been used for many years on Internet router systems. However, this algorithm has the following disadvantages: − Cannot avoid the phenomenon of “Lock out”: Occurs when 1 or several traffic streams monopolize the queue, making packets of other connections unable to pass through the router. This phenomenon greatly affects reliable transmission protocols such as TCP. According to the anti-congestion algorithm, when locked out, the TCP connection stream will reduce the window size and reduce the packet transmission speed exponentially. − Can cause Global Synchronization: This is the result of a severe “Lock out” phenomenon. Some neighboring routers have their queues monopolized by a number of connections, causing a series of other TCP connections to be unable to pass through and simultaneously reducing the transmission speed. After those monopolized connections are temporarily suspended, Once the queue is cleared, it takes a considerable amount of time for TCP connections to return to their original speed. − Full Queue phenomenon: Data transmitted on the Internet often has an explosion, packets arriving at the router are often in clusters rather than in turn. Therefore, the operating mechanism of DropTail makes the queue easily full for a long period of time, leading to the average delay time of large packets. To avoid this phenomenon, with DropTail, the only way is to increase the router's buffer, this method is very expensive and ineffective. − No QoS guarantee: With the DropTail mechanism, there is no way to prioritize important packets to be transmitted through the router earlier when all are in the queue. Meanwhile, with multimedia communication, ensuring connection and stable speed is extremely important and the DropTail algorithm cannot satisfy. The problem of choosing the buffer size of the routers in the network is to “absorb” short bursts of traffic without causing too much queuing delay. This is necessary in bursty data transmission. The queue size determines the size of the packet bursts (traffic spikes) that we want to be able to transmit without being dropped at the routers. In IP-based application networks, packet dropping is an important mechanism for indirectly reporting congestion to end stations. A solution that prevents router queues from filling up while reducing the packet drop rate is called dynamic queue management. 3.2. Random elimination method – RED 3.2.1 Overview RED (Random Early Detection of congestion; Random Early Drop) is one of the first AQM algorithms proposed in 1993 by Sally Floyd and Van Jacobson, two scientists at the Lawrence Berkeley Laboratory of the University of California, USA. Due to its outstanding advantages compared to previous queue management algorithms, RED has been widely installed and deployed on the Internet. The most fundamental point of their work is that the most effective place to detect congestion and react to it is at the gateway or router. Source entities (senders) can also do this by estimating end-to-end delay, throughput variability, or the rate of packet retransmissions due to drop. However, the sender and receiver view of a particular connection cannot tell which gateways on the network are congested, and cannot distinguish between propagation delay and queuing delay. Only the gateway has a true view of the state of the queue, the link share of the connections passing through it at any given time, and the quality of service requirements of the traffic flows. The RED gateway monitors the average queue length, which detects early signs of impending congestion (average queue length exceeding a predetermined threshold) and reacts appropriately in one of two ways: − Drop incoming packets with a certain probability, to indirectly inform the source of congestion, the source needs to reduce the transmission rate to keep the queue from filling up, maintaining the ability to absorb incoming traffic spikes. − Mark “congestion” with a certain probability in the ECN field in the header of TCP packets to notify the source (the receiving entity will copy this bit into the acknowledgement packet). Figure 3. 1 RED algorithm The main goal of RED is to avoid congestion by keeping the average queue size within a sufficiently small and stable region, which also means keeping the queuing delay sufficiently small and stable. Achieving this goal also helps: avoid global synchronization, not resist bursty traffic flows (i.e. flows with low average throughput but high volatility), and maintain an upper bound on the average queue size even in the absence of cooperation from transport layer protocols. To achieve the above goals, RED gateways must do the following: − The first is to detect congestion early and react appropriately to keep the average queue size small enough to keep the network operating in the low latency, high throughput region, while still allowing the queue size to fluctuate within a certain range to absorb short-term fluctuations. As discussed above, the gateway is the most appropriate place to detect congestion and is also the most appropriate place to decide which specific connection to report congestion to. − The second thing is to notify the source of congestion. This is done by marking and notifying the source to reduce traffic. Normally the RED gateway will randomly drop packets. However, if congestion If congestion is detected before the queue is full, it should be combined with packet marking to signal congestion. The RED gateway has two options: drop or mark; where marking is done by marking the ECN field of the packet with a certain probability, to signal the source to reduce the traffic entering the network. − An important goal that RED gateways need to achieve is to avoid global synchronization and not to resist traffic flows that have a sudden characteristic. Global synchronization occurs when all connections simultaneously reduce their transmission window size, leading to a severe drop in throughput at the same time. On the other hand, Drop Tail or Random Drop strategies are very sensitive to sudden flows; that is, the gateway queue will often overflow when packets from these flows arrive. To avoid these two phenomena, gateways can use special algorithms to detect congestion and decide which connections will be notified of congestion at the gateway. The RED gateway randomly selects incoming packets to mark; with this method, the probability of marking a packet from a particular connection is proportional to the connection's shared bandwidth at the gateway. − Another goal is to control the average queue size even without cooperation from the source entities. This can be done by dropping packets when the average size exceeds an upper threshold (instead of marking it). This approach is necessary in cases where most connections have transmission times that are less than the round-trip time, or where the source entities are not able to reduce traffic in response to marking or dropping packets (such as UDP flows). 3.2.2 Algorithm This section describes the algorithm for RED gateways. RED gateways calculate the average queue size using a low-pass filter. This average queue size is compared with two thresholds: minth and maxth. When the average queue size is less than the lower threshold, no incoming packets are marked or dropped; when the average queue size is greater than the upper threshold, all incoming packets are dropped. When the average queue size is between minth and maxth, each incoming packet is marked or dropped with a probability pa, where pa is a function of the average queue size avg; the probability of marking or dropping a packet for a particular connection is proportional to the bandwidth share of that connection at the gateway. The general algorithm for a RED gateway is described as follows: [5] For each packet arrival Caculate the average queue size avg If minth ≤ avg < maxth div.maincontent .s1 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 15pt; } div.maincontent .s2 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 15pt; } div.maincontent .p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent .s3 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; } div.maincontent .s4 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s5 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s6 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 14pt; } div.maincontent .s7 { color: black; font-family:Wingdings; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s8 { color: black; font-family:Arial, sans-serif; font-style: italic; font-weight: bold; text-decoration: none; font-size: 15pt; } div.maincontent .s9 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: bold; text-decoration: none; font-size: 14pt; } div.maincontent .s10 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 9pt; vertical-align: 6pt; } div.maincontent .s11 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; } div.maincontent .s12 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 10pt; } div.maincontent .s13 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-d
• Please State the Points to Note About Teaching Content and Methods
• Methods of Inputstream Class
• State Management Methods for Real Estate Business
• Car body electrical practice - 8 zt2i3t4l5ee zt2a3gs zt2a3ge zc2o3n4t5e6n7ts If the voltage is out of specification, replace the wire or connector. If the voltage is within specification, install the front fog light relay and follow step 5. Step 5 Check the front fog light switch - Remove the D4 connector of the fog light switch - Use a multimeter to measure the resistance of the front fog light switch. Measurement location Condition Standard D4-3 (BFG) -D4-4 (LFG) Light switchFront Fog OFF >10kΩ D4-3 (BFG) -D4-4 (LFG) Front fog light switchON <1 Ω - Standard resistor D4 connector is located on the combination switch assembly. If the resistance is out of specification, replace the combination switch (the fog light switch is located in the combination switch). If the resistance is within specification, follow step 6. Step 6 Check wiring and connectors (front fog light relay-light selector switch) - Disconnect connector D4 of the combination switch assembly - Use a voltmeter to measure the voltage value of jack D4 on the wire side. Measurement location Control modecontrol Standard D4-3 (BFG) - (-) AQ TAIL 11 to 14 V D4 connector for the wiring of the combination switch assembly If the voltage does not meet the standard, replace the wire or connector. If the voltage is within standard, there may have been an error in the previous measurements. Step 7 Check the front fog lights - Remove the front fog light electrical connector. - Supply battery voltage to the fog lamp terminals Jack 8, B9 of front fog lamp on the electrical side blind first. Power supply location Terms and Conditions Battery positive terminal - Terminal 2Battery negative terminal - Terminal 1 Fog lightsbefore morning - If the light does not come on, replace the bulb. If the light is on, re-plug the jack and continue to step 8. Step 8 Check wiring and connectors (relay and front fog lights) - Disconnect the B8 and B9 connectors of the front fog lights. - Use a voltmeter to measure voltage at the following locations: Measurement location Switch location Terms and Conditions B8-2 - (-) AQ Electric lock ON TAIL size switchFog switch ON 11 to 14 V B9-2 - (-) AQ Electric lock ONTAIL size switch Fog switch ON 11 to 14 V B8 and B9 connectors on the front fog lamp wiring side Voltage is not up to standard, repair or replace the jack. If up to standard, there may have been an error in the measurement process. 2.2.4. Procedure for removing, installing and adjusting fog lights 1. Procedure for removing - Remove the front inner ear pads Use a screwdriver to remove the 3 screws and remove the front part of the front inner ear liner -Remove the fog light assembly + Disconnect the connector. + Use a screwdriver to remove 3 screws to remove the fog light cover 2. Installation sequence -Rotate the fog lamp bulb in the direction indicated by the arrow as shown in the figure and remove the fog lamp from the fog lamp assembly. -Rotate the fog light bulb in the direction indicated by the arrow as shown in the figure and install the light into the fog light assembly. - Use a screwdriver to install the fog light cover -Install the electrical connector Attention: Be careful not to damage the plastic thread on the lamp assembly. - Install the front inner ear pads Use a screwdriver to install the front inner bumper with 3 screws. 3. Prepare the vehicle to adjust the fog light convergence. Prepare the vehicle: - Make sure there is no damage or deformation to the vehicle body around the fog lights. - Add fuel to the fuel tank - Add oil to standard level. - Add engine coolant to standard level. - Inflate the tire to standard pressure. - Place spare tire, tools and jack in original design position - Do not leave any load in the luggage compartment. - Let a person weighing about 75 kg sit in the driver's seat. 4. Prepare to check the fog light convergence a/ Prepare the vehicle status as follows: - Place the car in a dark enough place to see the lines. The lines are the dividing line, below which the light from the fog lights can be seen but above which it cannot. - Place the car perpendicular to the wall. - Keep a distance of 7.62 m between the center of the fog lamp and the wall. - Park the car on level ground. - Press the car down a few times to stabilize the suspension. Note: A distance of approximately 7.62 m is required between the vehicle (fog lamp center) and the wall to adjust the convergence correctly. If the distance of 7.62 m cannot be achieved, set the correct distance of 3 m to check and adjust the fog lamp convergence. (Since the target area varies with the distance, please follow the instructions as shown in the figure.) b/ Prepare a piece of thick white paper about 2 m high and 4 m wide to use as a screen. c/ Draw a vertical line through the center of the screen (line V). d/ Set the screen as shown in the picture. Note: - Keep the screen perpendicular to the ground. - Align the V line on the screen with the center of the vehicle. e/Draw the reference lines (H, V LH and V RH lines) on the screen as shown in the figure.HINT: Mark the center of the fog lamp on the screen. If the center mark cannot be seen on the fog lamp, use the center of the fog lamp or the manufacturer's name mark on the fog lamp as the center mark. H line (fog light height): Draw a line across the screen so that it passes through the center mark. Line H should be at the same height as the center mark of the fog light bulb. Line V LH, V RH (center mark position of left fog lamp LH and right fog lamp RH): Draw two lines so that they intersect line H at the center marks. 5. Check the fog light convergence a/ Cover the fog lamp or remove the connector of the other side fog lamp to prevent light from the unchecked fog lamp from affecting the fog lamp convergence test. b/ Start the engine. c/ Turn on the fog lights and make sure that the dividing line is outside the standard area as shown in the drawing. 6. Adjust the fog light convergence Use a screwdriver to adjust the fog light to the standard area by turning the toe adjustment screw. Note: If the screw is adjusted too far, loosen it and then tighten it again, so that the last rotation of the light adjustment screw is clockwise. 3. Self-study questions 1. Describe the operating principle of the lighting system with automatic headlight function 2. Describe the operating principle of the lighting system with the function of rotating headlights when turning 3. Draw diagram and connect lighting system on Hyundai Porter car 4. Draw diagram and connect lighting system on Honda Accord 1992 5. Draw the lighting circuit on a 1993 Toyota Lexus LESSON 3 MAINTENANCE AND REPAIR OF SIGNAL SYSTEM I. IMPLEMENTATION GOAL After completing this lesson, students will be able to: - Distinguish between types of signals on cars - Correctly describe common symptoms and suspected areas causing damage. - Connecting signal circuits ensures technical requirements - Disassemble, install, check, maintain and repair the signal system to ensure technical requirements. - Ensure safety in work and industrial hygiene II. LESSON CONTENT 1. General description The signal system equipped on cars aims to create signals to notify other vehicles participating in traffic about the vehicle's operating status such as: stopping, parking, braking, reversing, turning... Signals are used either by light such as headlamps, brake lights, turn signals….. or by sound such as horns, reverse music…. Just like the lighting system. A signal system circuit usually consists of: battery, fuse, wire, relay, electrical load and control switch. Only some switches of the signal system are on the combination switch. The switches of other signals are usually located in different locations such as in the gearbox or brake pedal…… 2. Maintenance and repair 2.1. Turn signals and hazard lights The installation location of the turn signal is shown in Figure 3.1. The turn signal control switch is located in the combination switch under the steering wheel. Turning this switch to the right or left will make the turn signal turn right or left. The hazard light switch is used when the vehicle has a problem while participating in traffic. When the hazard light switch is turned on, all the turn signals on the vehicle will light up at a certain frequency. The hazard light switch is usually placed separately from the turn signal switch (some old cars integrate the hazard and turn signal switches on the same combination switch cluster). Figure 3.1 Turn signal switch Figure 3.2 Hazard switch The part that generates the flashing frequency for the lights is called a turn signal relay. The turn signal relay usually has 3 terminals: B (positive power supply); E (negative power supply); L (providing the turn signal switch to distribute to the lamp) 2.1.1. Circuit diagram To generate the frequency for the turn signal, a turn signal relay is used in the turn signal circuit. The current from the turn signal relay will be sent to the turn signal switch assembly to distribute the current to the turn signal lights for the driver's purpose. Figure 3.3. Schematic diagram of a turn signal circuit without a hazard switch 1. Battery; 2. Electric lock; 3. Turn signal relay; 4. Turn signal switch; 5. Turn signal lamp; 6. Turn signal lamp; 7. Hazard switch Figure 3.4 Schematic diagram of turn signal circuit with hazard switch 1. Battery; 2. Combination switch cluster; 3. Turn signal; 4. Turn signal light; 5. Turn signal relay Today's cars no longer use three-pin turn signal relays (B, L, E) but use eight-pin turn signal relays (figure 3.5) (pin number 8 is used for hazard lights). For this type, the current supplying the turn signal lights is supplied directly from the turn signal relay to the lights. div.maincontent .p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent p { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; margin:0pt; } div.maincontent .s1 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; } div.maincontent .s2 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s3 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s4 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; } div.maincontent .s5 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 13pt; vertical-align: 1pt; } div.maincontent .s6 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 11pt; } div.maincontent .s7 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; vertical-align: -9pt; } div.maincontent .s8 { color: black; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 11pt; } div.maincontent .s9 { color: #008000; font-family:"Times New Roman", serif; font-style: normal; font-weight: normal; text-decoration: none; font-size: 14pt; } div.maincontent .s10 { color: black; font-family:"Times New Roman", serif; font-style: italic; font-weight: normal; te

define a thread group, and its subgroups.
getName()	Returns the name of the stream
isAlive()	Returns True, if the thread is still alive
getPriority()	Returns the thread priority
setName(String name)	Name the stream.
join()	Wait until the thread dies.
isDaemon()	Check if the thread is a daemon thread
setDeamon(boolean on)	Mark the thread as background or
resume()	Resume execution from suspended state
sleep()	Stops thread execution for a period of time.
start()	Call the run() method to start a thread.

Table 6.1. Methods of a thread class

Round-robin scheduling refers to threads with the same priority. When threads with the same priority execute at the same time, round-robin processor time sharing is automatically applied.

The latest version of Java does not support the Thread.suspend(), Thread.resume(), and Thread.stop() methods, because the methods create a deadlock risk.

6.6. Stream Schedule

Most Java programs are multithreaded. But the CPU is only capable of executing one thread at a time. When more than one thread with the same priority is executing at the same time, the programmer, or the Java virtual machine, or the operating system ensures that the CPU is shared between them. This is called thread control (thread scheduling).

No Java virtual machine has a specific mechanism for thread control. Some Java environments support time-sharing. Here, each thread gets a small portion of the processor time, called a quantum. The thread can execute its task during the allocated time period. After this time period, the thread must suspend its execution, even if it has not completed it. The next thread with the same priority will use the processor for the next time period. Java controls the time-sharing among all threads with the same priority.