Question
Which of the following data structures offers O(1)
average-case time complexity for insertion, deletion, and search operations?Solution
Hash tables, when implemented with a good hash function and collision resolution strategy, provide average-case O(1) time complexity for these operations. Worst-case can be O(N) in case of many collisions.
What is the minimum amount of unexpired risk reserve mandated by the Executive Committee of the General Insurance Council for Other Insurance?
Standard hours for actual production = 5,000 hours; Actual hours worked = 5,500; Std rate per hour = ₹80. Calculate Labour Efficiency Variance.
The costs which were incurred in the past and ignored under capital budgeting are known as_____.Â
How is working capital provided by banks calculated under the Turnover Method?
Which of the following is typically a module in an EIS-based accounting system?
a) Accounts Payable
b) Accounts Receivable
c) Inven...
What is the rate of TDS under GST for an intra-state supply?
XYZ Ltd. shows difference between written-down value of a depreciable asset in books (₹4 lakh) vs tax books (₹5.5 lakh). The corporate tax rate is 3...
What is the revised agency commission for e-mode revenue transactions by banks as per RBI's update?
What is the primary objective of the Fiscal Responsibility and Budget Management (FRBM) Act in India?
According to Companies Act 2013, one person company will always be formed as:
