Enhanced Discovering Computers 2017 (Shelly Cashman Series) (MindTap Course List)
1st Edition
ISBN: 9781305657458
Author: Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 6, Problem 2CTQ
Explanation of Solution
Current memory modules:
The following are the current memory modules used to increase the memory capacity...
Explanation of Solution
Differences of memory modules:
The following table represents the currently used memory modules and its differences based upon the type, size, speed and price.
| Characteristics | SIMM | DIMM | RIMM |
| Type | The memory board uses 30 pin connector types. | The memory board uses 168 pin or 184 pin connector type. |
The memory board uses 168 pin connector type. |
| Size | It is about |
Explanation of Solution
Recommendations to upgrade laptop’s memory:
Based upon the expert’s knowledge from the industry, the following are the methods and recommendations to upgrade the laptop’s memory,
- Initially, check how much memory is available on the laptop to avoid the bottle necks of the computer.
- Open the “Windows Task manager” and in the “Task manager” tab, it shows how much memory is used out of total memory.
- For more detailed view, there is an option “Open Resource monitor” in the Task manager window that shows the amount of physical memory available in the laptop.
- Next, check whether the laptop can be upgraded or not...
Explanation of Solution
Type and amount of memory for laptop:
- There is an application called “Crucial system scanner” which is need to be downloaded based upon the terms and conditions.
- After downloading and executing the application, it displays some of the re...
Explanation of Solution
Reason for not purchasing more memory on laptop:
Even though the computer is supported for more memory, the mother board supports for limited amount of memory or else the memory would not work.
- On each motherboard, there is a controller to access the Random Access Memory (RAM). So, there will be a limiting factor to access the memory by that controller...
Explanation of Solution
Available slots in memory modules:
The following are the simple steps to check the available slots in the laptop,
- First open task manager in “Run” command.
- Then select “performance” tab and click on the “memory section”...
Explanation of Solution
Safety measures:
While upgrading the memory in laptop, there will be a chance of electrostatic discharge and to avoid this, let need to ground the component and this can be achieved by the following safety measure...
Explanation of Solution
Better option:
Actually, this is a complex decision to take whether the laptop is needed to be upgraded or replaced. This is because,
- Some of the different component in the laptop is not an easy process to replace, but it is possible to upgrade the laptop if some of the proper tools are available.
- Moreover, the user requires little patience to upgrade the laptop...
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
15 points
Save ARS
Consider the following scenario in which host 10.0.0.1 is communicating with an external SMTP mail server at IP
address 128.119.40.186.
NAT translation table
WAN side addr
LAN side addr
(c), 5051
(d), 3031
S: (e),5051
SMTP
B
D (f.(g)
10.0.0.4
server
138.76.29.7
128.119.40.186
(a) is the source IP address at A, and its value.
S: (a),3031
D: (b), 25
10.0.0.1
A
10.0.0.2.
1. 138.76.29.7
10.0.0.3
6.3A-3. Multiple Access protocols (3). Consider the figure below, which shows the arrival of 6
messages for transmission at different multiple access wireless nodes at times t=0.1, 1.4, 1.8, 3.2,
3.3, 4.1. Each transmission requires exactly one time unit.
1
t=0.0
2
3
45
t=1.0
t-2.0
t-3.0
6
t=4.0
t-5.0
For the CSMA protocol (without collision detection), indicate which packets are successfully
transmitted. You should assume that it takes .2 time units for a signal to propagate from one node to
each of the other nodes. You can assume that if a packet experiences a collision or senses the
channel busy, then that node will not attempt a retransmission of that packet until sometime after
t=5. Hint: consider propagation times carefully here. (Note: You can find more examples of problems similar to this here B.]
☐
U
ப
5
-
3
1
4
6
2
Just wanted to know, if you had a scene graph, how do you get multiple components from a specific scene node within a scene graph? Like if I wanted to get a component from wheel from the scene graph, does that require traversing still?
Like if a physics component requires a transform component and these two component are part of the same scene node. How does the physics component knows how to get the scene object's transform it is attached to, this being in a scene graph?
Chapter 6 Solutions
Enhanced Discovering Computers 2017 (Shelly Cashman Series) (MindTap Course List)
Ch. 6 - Prob. 1SGCh. 6 - Prob. 2SGCh. 6 - Prob. 3SGCh. 6 - Prob. 4SGCh. 6 - Prob. 5SGCh. 6 - Prob. 6SGCh. 6 - Prob. 7SGCh. 6 - Prob. 8SGCh. 6 - Prob. 9SGCh. 6 - Prob. 10SG
Ch. 6 - Prob. 11SGCh. 6 - Prob. 12SGCh. 6 - Prob. 13SGCh. 6 - Prob. 14SGCh. 6 - Prob. 15SGCh. 6 - Prob. 16SGCh. 6 - Prob. 17SGCh. 6 - Prob. 18SGCh. 6 - Prob. 19SGCh. 6 - Prob. 20SGCh. 6 - Prob. 21SGCh. 6 - Prob. 22SGCh. 6 - Prob. 23SGCh. 6 - Prob. 24SGCh. 6 - Prob. 25SGCh. 6 - Prob. 26SGCh. 6 - Prob. 27SGCh. 6 - Prob. 28SGCh. 6 - Prob. 29SGCh. 6 - Prob. 30SGCh. 6 - Prob. 31SGCh. 6 - Prob. 32SGCh. 6 - Prob. 33SGCh. 6 - Prob. 34SGCh. 6 - Prob. 35SGCh. 6 - Prob. 36SGCh. 6 - Prob. 37SGCh. 6 - Prob. 38SGCh. 6 - Describe how bus width and word size affect and...Ch. 6 - Prob. 40SGCh. 6 - Prob. 41SGCh. 6 - Prob. 42SGCh. 6 - Prob. 43SGCh. 6 - Prob. 44SGCh. 6 - Prob. 45SGCh. 6 - Prob. 46SGCh. 6 - Prob. 47SGCh. 6 - Prob. 1TFCh. 6 - Prob. 2TFCh. 6 - Prob. 3TFCh. 6 - Prob. 4TFCh. 6 - Prob. 5TFCh. 6 - Prob. 6TFCh. 6 - Prob. 7TFCh. 6 - Prob. 8TFCh. 6 - Prob. 9TFCh. 6 - Prob. 10TFCh. 6 - Prob. 11TFCh. 6 - Prob. 12TFCh. 6 - Prob. 1MCCh. 6 - Prob. 2MCCh. 6 - Prob. 3MCCh. 6 - Prob. 4MCCh. 6 - Prob. 5MCCh. 6 - Prob. 6MCCh. 6 - Prob. 7MCCh. 6 - Prob. 8MCCh. 6 - Prob. 1MCh. 6 - Prob. 2MCh. 6 - Prob. 3MCh. 6 - Prob. 4MCh. 6 - Prob. 5MCh. 6 - Prob. 6MCh. 6 - Prob. 7MCh. 6 - Prob. 8MCh. 6 - Prob. 9MCh. 6 - Prob. 10MCh. 6 - Prob. 2CTCh. 6 - Prob. 3CTCh. 6 - Prob. 4CTCh. 6 - Prob. 5CTCh. 6 - Prob. 6CTCh. 6 - Prob. 7CTCh. 6 - Prob. 8CTCh. 6 - Prob. 9CTCh. 6 - Prob. 10CTCh. 6 - Prob. 11CTCh. 6 - Prob. 12CTCh. 6 - Prob. 13CTCh. 6 - Prob. 14CTCh. 6 - Prob. 15CTCh. 6 - Prob. 16CTCh. 6 - Prob. 17CTCh. 6 - Prob. 18CTCh. 6 - Prob. 19CTCh. 6 - Prob. 20CTCh. 6 - Prob. 21CTCh. 6 - Prob. 22CTCh. 6 - Prob. 23CTCh. 6 - Prob. 24CTCh. 6 - Prob. 25CTCh. 6 - Prob. 26CTCh. 6 - Prob. 27CTCh. 6 - Prob. 1PSCh. 6 - Prob. 2PSCh. 6 - Prob. 3PSCh. 6 - Prob. 4PSCh. 6 - Prob. 5PSCh. 6 - Prob. 6PSCh. 6 - Prob. 7PSCh. 6 - Prob. 8PSCh. 6 - Prob. 9PSCh. 6 - Prob. 10PSCh. 6 - Prob. 11PSCh. 6 - Prob. 1.1ECh. 6 - Prob. 1.2ECh. 6 - Prob. 1.3ECh. 6 - Prob. 2.1ECh. 6 - Prob. 2.2ECh. 6 - Prob. 2.3ECh. 6 - Prob. 3.1ECh. 6 - Prob. 3.2ECh. 6 - Prob. 3.3ECh. 6 - Prob. 4.1ECh. 6 - Prob. 4.2ECh. 6 - Prob. 4.3ECh. 6 - Prob. 5.1ECh. 6 - Prob. 5.2ECh. 6 - Prob. 5.3ECh. 6 - Prob. 2IRCh. 6 - Prob. 4IRCh. 6 - Prob. 5IRCh. 6 - Prob. 1CTQCh. 6 - Prob. 2CTQCh. 6 - Prob. 3CTQCh. 6 - Prob. 4CTQ
Knowledge Booster
Similar questions
- How to develop a C program that receives the message sent by the provided program and displays the name and email included in the message on the screen?Here is the code of the program that sends the message for reference: typedef struct { long tipo; struct { char nome[50]; char email[40]; } dados;} MsgStruct; int main() { int msg_id, status; msg_id = msgget(1000, 0600 | IPC_CREAT); exit_on_error(msg_id, "Creation/Connection"); MsgStruct msg; msg.tipo = 5; strcpy(msg.dados.nome, "Pedro Silva"); strcpy(msg.dados.email, "pedro@sapo.pt"); status = msgsnd(msg_id, &msg, sizeof(msg.dados), 0); exit_on_error(status, "Send"); printf("Message sent!\n");}arrow_forward9. Let L₁=L(ab*aa), L₂=L(a*bba*). Find a regular expression for (L₁ UL2)*L2. 10. Show that the language is not regular. L= {a":n≥1} 11. Show a derivation tree for the string aabbbb with the grammar S→ABλ, A→aB, B→Sb. Give a verbal description of the language generated by this grammar.arrow_forward14. Show that the language L= {wna (w) < Nь (w) < Nc (w)} is not context free.arrow_forward
- 7. What language is accepted by the following generalized transition graph? a+b a+b* a a+b+c a+b 8. Construct a right-linear grammar for the language L ((aaab*ab)*).arrow_forward5. Find an nfa with three states that accepts the language L = {a^ : n≥1} U {b³a* : m≥0, k≥0}. 6. Find a regular expression for L = {vwv: v, wЄ {a, b}*, |v|≤4}.arrow_forward15. The below figure (sequence of moves) shows several stages of the process for a simple initial configuration. 90 a a 90 b a 90 91 b b b b Represent the action of the Turing machine (a) move from one configuration to another, and also (b) represent in the form of arbitrary number of moves.arrow_forward
- 12. Eliminate useless productions from Sa aA BC, AaBλ, B→ Aa, C CCD, D→ ddd Cd. Also, eliminate all unit-productions from the grammar. 13. Construct an npda that accepts the language L = {a"b":n≥0,n‡m}.arrow_forwardYou are given a rope of length n meters and scissors that can cut the rope into any two pieces. For simplification, only consider cutting the rope at an integer position by the meter metric. Each cut has a cost associated with it, c(m), which is the cost of cutting the rope at position m. (You can call c(m) at any time to return the cost value.) The goal is to cut the rope into k smaller pieces, minimizing the total cost of cutting. B Provide the pseudo-code of your dynamic programming algorithm f(n,k) that will return the minimum cost of cutting the rope of length n into k pieces. Briefly explain your algorithm. What is the benefit of using dynamic programming for this problem? What are the key principles of dynamic programming used in your algorithm?arrow_forwardDetermine whether each of the problems below is NP-Complete or P A. 3-SAT B. Traveling Salesman Problem C. Minimum Spanning Tree D. Checking if a positive integer is prime or not. E. Given a set of linear inequalities with integer variables, finding a set of values for the variables that satisfies all inequalities and maximizes or minimizes a given linear objective function.arrow_forward
- 1. Based on our lecture on NP-Complete, can an NP-Complete problem not have a polynomial-time algorithm? Explain your answer. 2. Prove the conjecture that if any problem in NP is not polynomial-time solvable, then no NP-Complete problem is polynomial-time solvable. (You can't use Theorem 1 and 2 directly) 3. After you complete your proof in b), discuss how this conjecture can be used to solve the problem of whether P=NP.arrow_forwardBased on our lectures and the BELLMAN-FORD algorithm below, answer the following questions. BELLMAN-FORD (G, w, s) 1 INITIALIZE-SINGLE-SOURCE (G, s) 2 for i = 1 to |G. VI - 1 3 4 5 6 7 8 for each edge (u, v) = G.E RELAX(u, v, w) for each edge (u, v) = G.E if v.d> u.d+w(u, v) return FALSE return TRUE 1. What does the algorithm return? 2. Analyze the complexity of the algorithm.arrow_forward(Short-answer) b. Continue from the previous question. Suppose part of the data you extracted from the data warehouse is the following. Identify the missing values you think exist in the dataset. Use Column letter and Row number to refer to each missing value in the dataset. Please write down how you want to address each particular missing value (you can group them if they receive same treatment). For imputation, you do not need to calculate the exact imputed values but just describe what kind of value you want to use to impute.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Enhanced Discovering Computers 2017 (Shelly Cashm...Computer ScienceISBN:9781305657458Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. CampbellPublisher:Cengage Learning
Enhanced Discovering Computers 2017 (Shelly Cashm...
Computer Science
ISBN:9781305657458
Author:Misty E. Vermaat, Susan L. Sebok, Steven M. Freund, Mark Frydenberg, Jennifer T. Campbell
Publisher:Cengage Learning