Cloud Computing
See Answer →“Roles are the expected behaviour of a job position”. In light of this statement, discuss various roles an office manager is expected to play in an office.
See Answer →How do office environments change? Does this have any specific implication for office etiquette? Substantiate your answer with suitable examples.
See Answer →Transfer Pricing
See Answer →Responsibility Accounting
See Answer →Cash Budget
See Answer →Trend Analysis
See Answer →Statement Cost and Estimated Cost
See Answer →Reserve and Reserve Fund
See Answer →Cost Control and Cost Reduction
See Answer →Cost Accounting and Management Accounting
See Answer →Elucidate the steps followed in Target Costing.
See Answer →What is a sales Budget? How is it prepared?
See Answer →“Balance sheet is a statement of assets and liabilities or sources and uses of capital or both”. Comment.
See Answer →What are the different techniques of cost management? Explain.
See Answer →“Cost volume profit analysis and break even point analysis are same”. Comment.
| Division | |||
| A | B | C | |
| Contribution (Rs.) Sales (Rs.) | 50,000 | 50,000 | 50,000 |
| 4,00,000 | 5,00,000 | 6,00,000 | |
| 24,00,000 | 20,00,000 | 16,00,000 | |
| No. of employees | 22,500 | 12,000 | 10,500 |
You are required to evaluate the performance using Rate of Return on Investment (ROI) and Residual Income (RI) criteria.
See Answer →Write about the features of LuneOS. Also, discuss the process management, memory management and security management functions of LuneOS Mobile Operating System(GNU-General Public Licence).
See Answer →Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System.
See Answer →Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.
See Answer →On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume that the head is initially at cylinder 123. Suppose the requests have arrived, forming the following disk queue:
123, 874, 692, 475, 105, 376, 499, 542, 789, 645, 12, 923
(i) Perform the computation for the following disk scheduling algorithms:
(a) FCFS (b) SSTF (c) SCAN (d) LOOK
(ii) Depict the corresponding schemes in the form of a diagram.