Unit 3 Practice for Review
3 Pages

Unit 3 Practice for Review

Course Number: ACCOUNTING n/a, Summer 2009

College/University: Kaplan University

Word Count: 418

Rating:

Document Preview

Notes Receivable and Accounts Receivable can also be called trade receivables. (Points: 1) True False 2. Receivables from company owners and officers should be disclosed separately on the balance sheet. (Points: 1) True False 3. Other receivables include non trade receivables such as loans to company officers. (Points: 1) True False 4. When companies sell their receivables to other companies, the transaction is...

Unformatted Document Excerpt
Coursehero >> Nebraska >> Kaplan University >> ACCOUNTING n/a

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Receivable Notes and Accounts Receivable can also be called trade receivables. (Points: 1) True False 2. Receivables from company owners and officers should be disclosed separately on the balance sheet. (Points: 1) True False 3. Other receivables include non trade receivables such as loans to company officers. (Points: 1) True False 4. When companies sell their receivables to other companies, the transaction is called factoring (Points: 1) True False 5. Of the two methods of accounting for uncollectible receivables, the allowance method provides in advance for uncollectible receivables. (Points: 1) True False 6. Generally accepted accounting principles do not normally allow the use of the direct write-off method of accounting for uncollectible accounts. (Points: 1) True False 7. The direct write-off method records Bad Debt Expense in the year the specific account receivable is determined to be uncollectible. (Points: 1) True False 8. Allowance for Doubtful Accounts is debited under the direct write-off method when an account is determined to be uncollectible. (Points: 1) True False 9. Under the direct write-off method, no attempt is made to match Bad Debt Expense to Sales Revenue in the same accounting period. (Points: 1) True False 10. The estimate based on sales method violates the matching principle. (Points: 1) True False 11. When the estimate based on analysis of receivables is used, income is reduced when a specific is receivable written off. (Points: 1) True False 12. When an account receivable that has been written off is subsequently collected, the account receivable is said to be reinstated. (Points: 1) True False 13. Allowance for Doubtful Accounts is a liability account. (Points: 1) True False 14. At the end of a period, before the accounts are adjusted, Allowance for Doubtful Accounts has a debit balance of $2,000. If the estimate of uncollectible accounts determined by aging the receivables is $30,000, the current provision to be made for uncollectible accounts expense is $30,000. (Points: 1) True False 15. When using the estimate based on analysis of receivables, the amount computed in the analysis is always the required amount that would be recorded in the adjusting entry. (Points: 1) True False 16. The Allowance for Doubtful Accounts is similar to Accumulated Depreciation in that the account represents the total of all accounts written-off since the beginning year. (Points: 1) True False 17. The equation for computing interest on an interest-bearing note is as follows: interest equals maturity value times interest rate times time. (Points: 1) True False 18. The due date of a 60-day note dated July 10 is September 10. (Points: 1) True False 19. The maturity value of a note receivable is always the same as its face value. (Points: 1) True False 20. The interest on a 6%, 60-day note for $5,000 is $300. (Points: 1) True False

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Kaplan University - ACCOUNTING - n/a
Test 1 Summer 2005 Accounting 2301Name:_Multiple Choice Identify the letter of the choice that best completes the statement or answers the question. _ 1. Allowance for Doubtful Accounts has a credit balance of $800 at the end of the year (before adjustm
Kaplan University - ACCOUNTING - n/a
AC 116 MIDTERM QUESTIONS AND ANSWERS Chapter 81. A necessary element of internal control is a. database b. systems design c. systems analysis d. information and communication ANS: D 2. An example of a preventive control is a. the use of a bank account b.
Kaplan University - ACCOUNTING - n/a
Revised July 2008EXAM REVIEW ACCOUNTING 101 - UNIT III - CHAPTERS 7, 8 & 9STUDY SUGGESTIONS Review your class notes, homework exercises and problems. Be sure to review any chapter appendicies assigned on the General Course Outline. Review Demonstration
Kaplan University - ACCOUNTING - n/a
Chapter 4 Key Terms AC114 Accounting Iaccounting cycle clearing account closing entries closing process The process that begins with analyzing and journalizing transactions and ends with the post-closing trial balance. Another name for the income summary
Kaplan University - ACCOUNTING - n/a
Chapter 3 Key Terms AC114 Accounting Iaccounting period concept The accounting concept that assumes that the economic life of the business can be divided into time periods.accrual basis Under this basis of accounting, revenues and expenses are reported
Kaplan University - ACCOUNTING - n/a
Chapter 2 Key Terms AC114 Accounting Iaccount account receivable assets balance of the account capital account chart of accounts correcting journal entry credits debits double-entry accounting system drawing expenses horizontal analysis journal journal e
Kaplan University - ACCOUNTING - n/a
Chapter 1 Key Terms AC114 Accounting Iaccount form account payable account receivable accounting accounting equation assets balance sheet business The form of balance sheet that resembles the basic format of the accounting equation, with assets on the le
Kaplan University - ACCOUNTING - n/a
Chapter 7 Key Terms AC114 Accounting Iaverage inventory cost flow method consigned inventory consignee consignor first-in, firstout (FIFO) inventory cost flow method gross profit method inventory turnover last-in, firstout (LIFO) inventory cost flow meth
Kaplan University - ACCOUNTING - n/a
Prob. 71B1.Purchas es Date Quantity Unit Cost Cost of Merchandise Sold Total Cost Quantity Unit Cost Total Cost Quantity Inventory Unit Cost Total CostJan.1 10 28200214,200 75 25 110 20 20 21 21 21 21 22 22 22 24 24 25 1,500 525 2,310 420 945 990 1
Kaplan University - ACCOUNTING - n/a
Prob. 65BApr. 3 Merchandise Inventory. Accounts PayablePrescott Co. . [$42,000 ($42,000 40%)] = $25,200. 4 Cash. Sales. 4 Cost of Merchandise Sold. Merchandise Inventory. 5 Merchandise Inventory. Accounts PayableStafford Co. . 6 Accounts PayablePrescott
Kaplan University - ACCOUNTING - n/a
Prob. 41B1. LIGHTWORKS COMPANY Income Statement For the Year Ended July 31, 2010 Revenues: Fees revenue. Rent revenue. Total revenues. Expenses: Salaries and wages expense. Advertising expense. Utilities expense. Repairs expense. Depreciation expenseequi
Kaplan University - ACCOUNTING - n/a
Prob. 35B1. a. Insurance Expense. Prepaid Insurance. Insurance expired ($7,200 $1,800). Supplies Expense. Supplies. Supplies used ($1,980 $750). Depreciation ExpenseBuilding. Accumulated DepreciationBuilding. Building depreciation. Depreciation ExpenseEq
Kaplan University - ACCOUNTING - n/a
Prob. 23B1. JOURNALDate Credit Post. DescriptionPages 1 and 2Ref. Debit2010 Apr. 1 2 6 8Cash. Jose Guadalupe, Capital. Rent Expense. Cash. Equipment. Accounts Payable. Truck. Cash. Notes Payable. Supplies. Cash. Cash. Fees Earned. Prepaid Insurance.
Kaplan University - ACCOUNTING - n/a
Prob. 13B1.FAIR PLAY FINANCIAL SERVICESIncome Statement For the Month Ended January 31, 2010Fees earned. Expenses: . Salaries expense . Rent expense . Auto expense . Supplies expense . Miscellaneous expense . . Net income. $$39,50016,000 7,500 4,50
Kaplan University - ACCOUNTING - n/a
What is goal setting and why is it important?1) What are Short-term goals? Those goals that can be achieved in a relatively brief period of time- 1 year or less. 2) What are Intermediate-term goals? They can be achieved in 1 to 5 years. 3) What are Long-
BU - CS - 565
Lecture outline Nearest-neighbor search in low dimensions kd-trees Nearest-neighbor search in high dimensions LSH Applications to data miningDefinition Given: a set X of n points in Rd Nearest neighbor: for any query point qRd return the point xX m
BU - CS - 565
CASCS565,DataMiningCourselogistics Coursewebpage: www.cs.bu.edu/~evimaria/teaching.html Schedule:MonWed,45:30 Instructor:EvimariaTerzi, evimaria@cs.bu.edu Officehours:Mon2:304pm,Tues 10:30am12(orbyappointment) Mailinglist:cascs565a1l@bu.eduTopicstob
BU - CS - 565
Mining Association Rules in Large DatabasesAssociation rules Given a set of transactions D, find rules that will predict the occurrence of an item (or a set of items) based on the occurrences of other items in the transactionMarket-Basket transactions
BU - CS - 565
Recap: Mining association rules from large datasetsRecap Task 1: Methods for finding all frequent itemsets efficiently Task 2: Methods for finding association rules efficientlyRecap Frequent itemsets (measure: support) Apriori principle Apriori algor
BU - CS - 565
ClusteringLecture outline Distance/Similarity between data objects Data objects as geometric data points Clustering problems and algorithms K-means K-median K-centerWhat is clustering? A grouping of data objects such that the objects within a group a
BU - CS - 565
Clustering IIHierarchical Clustering Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram A tree-like diagram that records the sequences of merges or splits60 .25405 .1324 5 20 .105 .01 3 101
BU - CS - 565
Clustering IIILecture outline Soft (model-based) clustering and EM algorithm Clustering aggregation [A. Gionis, H. Mannila, P. Tsaparas: Clustering aggregation, ICDE 2004] Impossibility theorem for clustering [Jon Kleinberg, An impossibility theorem for
BU - CS - 565
ClusteringIVOutline Impossibilitytheoremforclustering Densitybasedclusteringandsubspace clustering BiclusteringorcoclusteringGeneralformofimpossibility results Defineasetofsimpleaxioms(properties) thatacomputationaltaskshouldsatisfy Provethattheredoes
BU - CS - 565
Clustering VOutline Validating clustering results Randomization testsCluster Validity All clustering algorithms provided with a set of points output a clustering How to evaluate the goodness of the resulting clusters? Tricky because clusters are in th
BU - CS - 565
Dimensionality reductionOutline From distances to points : MultiDimensional Scaling (MDS) FastMap Dimensionality Reductions or data projections Random projections Principal Component Analysis (PCA)Multi-Dimensional Scaling (MDS) So far we assumed th
BU - CS - 565
Lecture outline Dimensionality reduction SVD/PCA CUR decompositions Nearest-neighbor search in low dimensions kd-treesDatasets in the form of matricesWe are given n objects and d features describing the objects. (Each object has d numeric values des
BU - CS - 565
Boston University Department of Computer Science CS 565 Data MiningMidterm Exam Date: Oct 14, 2009 Write Your University Number Here: Answer all questions. Good luck! Problem 1 [25 points] True or False: 1. Maximal frequent itemsets are sucient to determ
BU - CS - 565
Problem Set 1September 14, 2009Due date:Monday, September 28 2009 at 4pm; before class.Exercise 1: (20 points) Some years ago, greek video-club chain Seven had the following oer to their customers: every time a customer rented a DVD, he was given a ra
BU - CS - 565
Problem Set 2September 28, 2009Due date:Wed, October 14 2009 at 4pm; before class.Exercise 1: (20 points) Assume two d-dimensional real vectors x and y . And denote by xi (yi ) the value in the i-th coordinate of x (y ). Prove or disprove the followin
BU - CS - 565
Problem Set 3December 3, 2009Due date:Wed, Dec 9 2009 at 4pm; submit by email.Exercise 1: (30 points) You are asked to evaluate the performance of two classication models, M1 and M2 . The test set you have chosen contains 26 binary attributes, labeled
BU - CS - 565
Solutions to Problem Set 1October 7, 2009Exercise 1: (20 points) Some years ago, greek video-club chain Seven had the following oer to their customers: every time a customer rented a DVD, he was given a random coupon with the title of the Academy awards
BU - CS - 565
BU - CS - 565
Boston University Department of Computer Science CS 565 Data MiningMidterm Exam Solutions Date: Oct 14, 2009 Write Your University Number Here: Answer all questions. Good luck! Problem 1 [25 points] True or False: 1. Maximal frequent itemsets are sucient
BU - CS - 565
Time-series data analysisWhy deal with sequential data? Because all data is sequential All data items arrive in the data store in some order Examples transaction data documents and words In some (or many) cases the order does not matter In many cases
BU - CS - 565
Lecture outline Classification Decision-tree classificationWhat is classification?What is classification? Classification is the task of learning a target function f that maps attribute set x to one of the predefined class labels yWhat is classificati
BU - CS - 565
Lecture outline Classification Nave Bayes classifier Nearest-neighbor classifierEager vs Lazy learners Eager learners: learn the model as soon as the training data becomes available Lazy learners: delay model-building until testing data needs to be cla
BU - CS - 565
Lecture outline Support vector machinesSupport Vector Machines Find a linear hyperplane (decision boundary) that will separate the dataSupport Vector MachinesB1 One Possible SolutionSupport Vector MachinesB2 Another possible solutionSupport Vect
BU - CS - 565
Model Evaluation Metrics for Performance Evaluation How to evaluate the performance of a model? Methods for Performance Evaluation How to obtain reliable estimates? Methods for Model Comparison How to compare the relative performance of different mo
BU - CS - 565
Link Analysis RankingHow do search engines decide how to rank your query results? Guess why Google ranks the query results the way it does How would you do it?Nave ranking of query results Given query q Rank the web pages p in the index based on sim(
BU - CS - 565
More on RankingsQuery-independent LAR Have an a-priori ordering of the web pages Q: Set of pages that contain the keywords in the query q Present the pages in Q ordered according to order What are the advantages of such an approach?InDegree algorithm
BU - CS - 565
More on RankingsQuery-independent LAR Have an a-priori ordering of the web pages Q: Set of pages that contain the keywords in the query q Present the pages in Q ordered according to order What are the advantages of such an approach?InDegree algorithm
BU - CS - 565
Graph ClusteringWhy graph clustering is useful? Distance matrices are graphs as useful as any other clustering Identification of communities in social networks Webpage clustering for better data management of web dataOutline Min s-t cut problem Min cu
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 2Homework 2, due Feb 3You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score to
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 3Homework 3, due Feb 17You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score t
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 4Homework 4, due Feb 24You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score t
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 5HOMEWORK 5,DUEMARCH 3You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 6HOMEWORK 6,DUEMARCH 17You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 7HOMEWORK 7,DUEMARCH 24You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 8HOMEWORK 8,DUEAPRIL 14You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 9HOMEWORK 9,DUEAPRIL 21You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a score
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsHomework 10HOMEWORK 10,DUEAPRIL 28You must prove your answer to every question. Problems with a () in place of a score may be a little too advanced, or too challenging to most students, so I do not assign a sco
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsSELF-CHECKQUESTIONS2I may keep adding to this list, please come back checking. . . Problem 1. Let A be a positive semidenite matrix. (a) Show that aii 0 for all i .Solution. Consider a vector x with x i = 1 and
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsMidterm exam 1Midterm exam 1Only a single hand-written crib sheet can be used, no books or notes. Even if I ask for just a yes/no answer, you must always give a proof. You may get some points even if you write I
BU - CS - 530
Spring 2010CS530 Analysis of AlgorithmsMidterm exam 2MIDTERMEXAM2Only a single hand-written crib sheet can be used, no books or notes. Even if I ask for just a yes/no answer, you must always give a proof. You may get some points even if you write I
BU - CS - 565
CS 535 - Fall 2008 - MIDTERM with Answers DIRECTIONS: Do any 4 of the following 5 problems. Each problem is worth 10 points. Write all of your answers in your blue book. The test is open book and you can use one page of notes. 1. a. Let f be a total compu
United States Merchant Marine Academy - EEE - EEE3017W
EEE3017W - Tutorial 3C ProgrammingTotal marks: 30Tuts are done in individually. Submit your completed tut as either a MS Word document (.doc/.docx) or pdf together with your code/circuits in a zipped archive on Vula by the appropriate date. If you have
United States Merchant Marine Academy - EEE - EEE3017W
EEE3017W - Tutorial 2System DesignTotal marks: 40Tuts are done in individually. Submit your completed tut as either a MS Word document (.doc/.docx) or pdf together with your code/circuits in a zipped archive on Vula by the appropriate date. If you have
United States Merchant Marine Academy - EEE - EEE3017W
EEE3017W - Laboratory 6Microcontroller CTotal marks: 20Labs are done in pairs (Groups bigger than two will not be allowed). Complete the Lab according to the instructions in the handout. Submit your completed lab as either a MS Word document (.doc/.doc
United States Merchant Marine Academy - EEE - EEE3017W
EEE3017W - Laboratory 5C ProgrammingTotal marks: 40 Labs are done in pairs (Groups bigger than two will not be allowed). Complete the Lab according to the instructions in the handout. Submit your completed lab as either a MS Word document (.doc/.docx) o
United States Merchant Marine Academy - EEE - EEE3017W
Tutorial 3 Power Distribution System Solutions
United States Merchant Marine Academy - EEE - EEE3017W
EEE3057S Tutorial 1 - Power Distribution Systems 4 August 2010 Power Distribution Systems 1. Five lines, A, B, C, D, and E run to a common point O. Find the potential of O and the current leaving each supply point assuming that no current is tapped from p