Learn more about our help with Assignments: Math
Search & Filtering
Sales $713,800
Less: Cost of goods sold 323,000
Gross profit $390,800
Less: Selling & administrative expenses $186,000
Depreciation expense 17,000
Interest expense 27,000 230,000
Add: gain on sale of land $160,800
21,800
Income before taxes $182,600
Income taxes 36,800
Net income $145,800
Other data:
1. Long-term investments were purchased for cash at a cost of $74,600.
2. Cash proceeds from the sale of land totaled $76,200.
3. Store equipment of $44,000 was purchased by signing a short-term note payable. Also, a $150,000 telecommunications system was acquired by issuing 3,000 shares of preferred stock.
4. A long-term note of $49,400 was repaid.
5. Twenty thousand shares of common stock were issued at $5.19 per share.
6. The company paid cash dividends amounting to $128,600. Use Direct & Indirect Method for Cash flow
Less: Cost of goods sold 323,000
Gross profit $390,800
Less: Selling & administrative expenses $186,000
Depreciation expense 17,000
Interest expense 27,000 230,000
Add: gain on sale of land $160,800
21,800
Income before taxes $182,600
Income taxes 36,800
Net income $145,800
Other data:
1. Long-term investments were purchased for cash at a cost of $74,600.
2. Cash proceeds from the sale of land totaled $76,200.
3. Store equipment of $44,000 was purchased by signing a short-term note payable. Also, a $150,000 telecommunications system was acquired by issuing 3,000 shares of preferred stock.
4. A long-term note of $49,400 was repaid.
5. Twenty thousand shares of common stock were issued at $5.19 per share.
6. The company paid cash dividends amounting to $128,600. Use Direct & Indirect Method for Cash flow
so this is the riddle in Differential Calculus with Analytic geometry.
with the ff. conditions prove that mathematically that a girl is a problem.
condition no.1
you need time to have a money.
condition no.2
you need time and money to have a girl.
condition no.3
money is the root of the problems.
i hope you can help me.
Thank you!!!
with the ff. conditions prove that mathematically that a girl is a problem.
condition no.1
you need time to have a money.
condition no.2
you need time and money to have a girl.
condition no.3
money is the root of the problems.
i hope you can help me.
Thank you!!!
im doing a 1489 math project and i need help with alot of the answers, please help me
Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).
What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
(A) i=2
(B) i=3
(C) i=4
(D) i=5
Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the earlier part and acknowledgments are always piggy backed. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the
frame processing time.)
(A) 16ms
(B) 18ms
(C) 20ms
(D) 22ms
What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
(A) i=2
(B) i=3
(C) i=4
(D) i=5
Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the earlier part and acknowledgments are always piggy backed. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the
frame processing time.)
(A) 16ms
(B) 18ms
(C) 20ms
(D) 22ms
A 25 Kbps satellite link has a propagation delay of 400 ms. The transmitter employs the "go back n ARQ" scheme with n set to 10. Assuming that each frame is 100 bytes long, what is the maximum data rate possible?
A) 5 Kbps
B) 10 Kbps
C) 15 Kbps
D) 20 Kbps
A) 5 Kbps
B) 10 Kbps
C) 15 Kbps
D) 20 Kbps
On a system using round robin scheduling there is only one process of r time units. Round robin time quantum is q, process switch time is s. If s<q<r then what is process switch overhead?
On a system using round robin scheduling let t represents the time needed to to perform a process switch, q represents the round robin time quantum and p represents the average time a process runs before blocks on input. Give a formula for CPU efficiency if t<q<p.
a 20 kbps device is connected to a processor. the interrupt overhead is 10 microseconds. what is the minimum performance achieved when interrupt initiated data transfer is used instead of programmed i/o?
Consider a hypothetical processor that supports two address, one address and
zero address instructions. It has a 256 word memory, and a 20 bit instruction is
placed in 1 word of memory (memory is word addressable). Given that there
exist 8 two address instructions and 1984 one address instructions. The total
number of zero address instructions formulated is ____________.
zero address instructions. It has a 256 word memory, and a 20 bit instruction is
placed in 1 word of memory (memory is word addressable). Given that there
exist 8 two address instructions and 1984 one address instructions. The total
number of zero address instructions formulated is ____________.
Which of the following is a regular language?
(A) L1 = Set of balanced parenthesis where alphabet sigma={(,)}
(B) L2 = Set of all unary strings |sigma| = 1 of lengths equal to Fibonacci numbers
greater than 5 (i.e. 8, 13, 21, . . . .)
(C) L3 = Kleene closure of the language in option (B)
(D) None of these
(A) L1 = Set of balanced parenthesis where alphabet sigma={(,)}
(B) L2 = Set of all unary strings |sigma| = 1 of lengths equal to Fibonacci numbers
greater than 5 (i.e. 8, 13, 21, . . . .)
(C) L3 = Kleene closure of the language in option (B)
(D) None of these
