Answer: C) 4 Explanation: Let the required number be 'N' given that its quarter i.e; N/4 exceeds its double i.e, 2N by 7 => N/4 + 7 = 2N => N + 28 = 8N 7N = 28 N = 4.

The Sales Order is a confirmation document sent to the customers before delivering the goods or services.  Sales Order (SO) can be created once the quote is accepted by your prospective customer and the Purchase Order (PO) is sent by the customer for further processing.

Answer: A) INS Arihant Explanation:

The persons whose primary investing objective is to preserve capital while generating a tax-free income stream, then municipal bonds are worth considering. Municipal bonds (munis) are debt obligations issued by government entities. When you buy a municipal bond, you are loaning money to the issuer in exchange for a set number of interest payments over a predetermined period. At the end of that period, the bond reaches its maturity date, and the full amount of your original investment is returned to you.   Types of Municipal Bonds : Municipal bonds come in the following two varieties: 1. General obligation bonds (GO)2. Revenue bonds General obligation bonds, issued to raise immediate capital to cover expenses, are supported by the taxing power of the issuer. Revenue bonds, which are issued to fund infrastructure projects, are supported by the income generated by those projects.   Both types of bonds are tax exempt and particularly attractive to risk-averse investors due to the high likelihood that the issuers will repay their debts.

Answer: D) Bauxite Explanation:

Answer: A) 18 Explanation: (300 – 101)/11 = 199/11 = 18 1/1118 Numbers.

Answer: A) Bengaluru Explanation: Bengaluru becomes the first Indian city to get its very own logo Much like New York and Singapore, Bengaluru is set to get its own logo, becoming the first Indian city to do so.

Answer: A) Dn = log 2 (n+1) Explanation: A complete binary tree is a binary tree where all the levels have maximum number of nodes except possibly the last level.   The depth of complete binary tree of n nodes will be Dn=log 2 (n+1) where Dn is the height or depth of the tree and n is the number of nodes.