Question
What is the minimum and maximum number of select group
of persons who can be identified by the Board for offer of securities or invitation to subscribe securities under Private Placement?Solution
Section 42.Offer or invitation for subscription of securities on private placement- (2) A private placement shall be made only to a select group of persons who have been identified by the Board (herein referred to as “identified persons”), whose number shall not exceed fifty or such higher number as may be prescribed [excluding the qualified institutional buyers and employees of the company being offered securities under a scheme of employees stock option in terms of provisions of clause (b) of sub-section (1) of section 62], in a financial year subject to such conditions as may be prescribed. Companies (Prospectus and Allotment of Securities) Rules,2014- Rule 14. Private Placement-(2) For the purpose of sub-section (2) of section 42, an offer or invitation to subscribe securities under private placement shall not be made to persons more than two hundred in the aggregate in a financial year: Provided that any offer or invitation made to qualified institutional buyers, or to employees of the company under a scheme of employees stock option as per provisions of clause (b) of sub-section (1) of section 62 shall not be considered while calculating the limit of two hundred persons
Which of the following is true about the Round Robin (RR) CPU scheduling algorithm?
Which of the following is NOT a characteristic of the Internet of Things (IoT)?
The amortized time for inserting into a dynamic array (like C++ vector) is:
In a binary tree, if the number of leaf nodes is L, what is the number of nodes with two children?
A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?
Which sorting algorithm has an average-case time complexity of O(n log n) and is known for its efficiency, often using a divide-and-conquer approach?
Which algorithm guarantees minimum spanning tree and will produce a different tree depending on tie-breaking?
Which of the following is substring of “IXAMBEE”?
Which of the following is considered the strongest type of encryption method in modern cyber security practices?   Â