Firstranker's choice
--- Content provided by FirstRanker.com ---
Code No. 10069
FACULTY OF COMMERCE
B.Com. V - Semester (CBCS) Examination, November / December 2019
(Common Paper for General / Computers /Computer Applications / Advertising / Foreign Trade and Tax Procedure Courses)
Subject: Computerized Accounting
--- Content provided by FirstRanker.com ---
Paper Code — BC - 507 Elective — |
Time: 3 Hours Max.Marks: 80
PART - A (5x4 = 20 Marks)
[Short Answer Type]
Note: Answer any five of the following questions.
--- Content provided by FirstRanker.com ---
- Key Board Conventions
- Stock Categories
- Debit Note
- Receivable Management
- Cash Book
- Deletion of Groups
- New Reference
- Cash Flow Statement
--- Content provided by FirstRanker.com ---
PART - B (5x12 = 60 Marks)
[Essay Answer Type]
--- Content provided by FirstRanker.com ---
Note: Answer all the questions.
- a) “ERP is a one step solution for all Business requirements” — Elucidate.
OR
b) Explain the advantages of Single and Multi-Ledger Creation with examples. - a) What are the options available in Inventory Masters for maintaining Stock in Accounting Software?
--- Content provided by FirstRanker.com ---
OR
b) Explain with examples the differences between Stock Categories and Stock Groups. - a) Explain the process of recording Business Transactions in Accounting Software.
OR
b) What do you mean by Voucher Types? Explain any five Voucher Types. - a) What is Accounts Receivable? Write the advantages of maintaining Bill-Wise details.
OR
b) Explain Payable Management in Accounting Software. - a) What is MIS? What are the advantages of MIS Reports?
OR--- Content provided by FirstRanker.com ---
b) What reports can be generated in Accounting Software that infer financial position of Business.
--- Content provided by FirstRanker.com ---
Firstranker's choice
--- Content provided by FirstRanker.com ---
Code No. 10070
FACULTY OF COMMERCE
B.Com. V - Semester (CBCS) Examination, November / December 2019 (Only for Computer / Computer Application Courses) Subject: Business Analytics
Paper Code — BC - 507 Elective = |
Time: 3 Hours Max.Marks: 80
--- Content provided by FirstRanker.com ---
PART - A (5x4 = 20 Marks)
[Short Answer Type]
Note: Answer any five of the following questions.
- Opportunities of Decision Science Approach
- Unbounded Solution
- Application Areas of LPP
- Optionality Test
- Define Two Phase Method
- Departing Variable
- Kurtosis
- Standard Deviation
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
PART - B (5x12 = 60 Marks)
[Essay Answer Type]
Note: Answer all the questions.
- a) Define Operation Research. Give the main characteristics of Operation Research.
--- Content provided by FirstRanker.com ---
OR
b) “Much of the success of applications of Decision Sciences is due to Computers” — Discuss. - a) What is LPP? Give a brief account of applications of LPP.
OR
b) Evening shift resident doctors-in a Government Hospital work five consecutive days and have to consecutive days off. Their five days of work can start on any day of the week and the schedule rotates indefinitely. The hospital requires the following minimum number of doctors working:--- Content provided by FirstRanker.com ---
Sun Mon Tues Wed Thurs Fri Sat 35 55 60 50 60 50 45 - a) A box manufacturer makes small and large boxes from large piece of cardboard. The large box requires 4 Sq.ft. per box, while small boxes require 3 Sq.ft per box. The manufacturer is required to make at least three large boxes and at least twice as many small boxes as large boxes. If 60 Sq,ft. of cardboard is in stock and if profit on small and large boxes are Rs.2/- and Rs.3/- per box respectively. Find how many of each should be made in order to maximize the total profit (Use Graphic Method).
OR
- b) Put the following LPP into Standard Form. Find x1, x2, x3, x4 to Maximize x1 + 2x2 + 3x+3+ + 4x4 + 5, Subject to the Constraints: 4x1 + 3x2 + 2x3 + x4 < 10 X1-X3+2x4=2 X1+Xx2+x3+x4>=1 and x1,x2>=0,x3>=0, x4 =0.
- a) Using Simplex Method, solve: Maximize Z = 3x1 + 2x2 Subject to the Constraints: x1 + x2< 4 X1 —X2<2 X1, X2>=0
OR
b) Using Simplex Algorithm, Solve: Maximize Z = 2x1 + x2 Subject to the Constraints: 4x1 + 3x2 <12 4x1+Xx2<8 4x1—X2<4 X1,%X2>=0 - a) What are the various types of positional averages? Explain the uses of Median and partitioned values.
OR--- Content provided by FirstRanker.com ---
b) Find the missing information from the following:Group-I Group-II Group-III Group-IV Number 50 ? 90 200 S.D. 6 7 ? 7.746 Mean 113 ? 115 116
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
This download link is referred from the post: OU B.Com Last 10 Years 2010-2020 Question Papers || Osmania University