Consider the C code Below.void function(int n){ if (n == 1) return; for (int i = 0; i<n; i++) { for (int j = 1; j< = n; j++) { printf("*"); break; } }}Which of the following is the tightest upper bound on time complexity of above function.(A) O(n2)(B) O(n)(C) O(n log n)(D) O(1)

Consider the C code Below.void function(int n){ if (n == 1) return; fo

1.	Consider the C code Below.void function(int n){ if (n == 1) return; for (int i = 0; i<n; i++) { for (int j = 1; j< = n; j++) { printf("*"); break; } }}Which of the following is the tightest upper bound on time complexity of above function.(A) O(n2)(B) O(n)(C) O(n log n)(D) O(1)
Answer»

Discussion

No Comment Found

Related InterviewSolutions

In public key and private key cryptography, host ‘A’ has PuA and PrA, host ‘B’ has PuB and PrB as public and private keys respectively. Now, if ‘A’ wants to send a message to ‘B’ securely, which key will be used by ‘A’ for encryption ?(A) PuA(B) PuB(C) PrA(D) PrB
A broadcast channel has 10 nodes and total capacity of 12 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 50 μseconds to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1000 Bytes. The maximum throughput of broadcast channel is:(A) 9.16 Mbps(B) 11.16 Mbps(C) 10Mbps(D) 10.33 Mbps
Match the protocol with the characteristics:1. Mails are stored on the computer client use.2. Stateless protocol3. Converts MAC address to IP address.4. Used to send error messages(A) 1: POP3, 2: HTTP, 3: ARP, 4: SMTP(B) 1: IMAP, 2: HTTP, 3: RARP, 4: SMTP(C) 1: POP3, 2: HTTP, 3: RARP, 4: ICMP(D) 1: IMAP, 2: HTTP, 3: ARP, 4: ICMP
Consider the following CFG S -> AaAb | Bb A -> ԑ B -> ԑThe above grammar is:(A) Ambiguous(B) Left recursive(C) Left factored(D) None of these
Consider the following grammarS -> Aa | bAc | dc | bdaA -> dThe above grammar is:(A) Not LALR(1) but SLR(1)(B) Both LALR(1) and SLR(1)(C) LALR(1) but not SLR(1)(D) Neither LALR(1) nor SLR(1)
A directed acyclic graph represents one form of intermediate representation. The number of non terminal nodes in DAG of a = (b+c)*(b+c) expression is:(A) 2(B) 3(C) 4(D) 5
Using the EMPLOYEE table, the following query is issued to generate the name, salary and the salary increased after an appraisal by 25 %. The increased salary for all the employee should be above 25000.SELECT fname, salary, salary + (salary *0.25) AS "INCREASED_SALARY" FROM employee WHERE increased_salary > 25000; The above query throws an error. What is the reason for the error ?(A) The parenthesis is missing in the expression used in SELECT statement.(B) Single quotes must be used to define a column alias.(C) Column alias cannot be used in the WHERE clause.(D) Column alias in the WHERE clause must be enclosed within double quotation marks.
Let 5 stations are connected to CSMA/CD network . Every station wants to transmit data with probability p = 0.6. It is given that there will be no collision if only one station will transmit. What is the probability of successful transmission ?(A) 1(B) 0(C) 0.0768(D) 0.768
A counting semaphore was initialized to 0, then 20 V operations were successfully completed on this semaphore, followed with 18 P operations, the resulting value of the semaphore is:(A) 18(B) 20(C) 0(D) 2
The following graph shows the schedule of five transactions. The schedule is:(A) View Serializable(B) Conflict Serializable(C) Both (A) and (B)(D) Not serializable

Consider the C code Below.void function(int n){ if (n == 1) return; for (int i = 0; i&lt;n; i++) { for (int j = 1; j&lt; = n; j++) { printf("*"); break; } }}Which of the following is the tightest upper bound on time complexity of above function.(A) O(n2)(B) O(n)(C) O(n log n)(D) O(1)

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment

Consider the C code Below.void function(int n){ if (n == 1) return; for (int i = 0; i<n; i++) { for (int j = 1; j< = n; j++) { printf("*"); break; } }}Which of the following is the tightest upper bound on time complexity of above function.(A) O(n2)(B) O(n)(C) O(n log n)(D) O(1)