@

Dark Mode

Profile
Edit my Profile
Messages
My favorites

Register

Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams

Dark Mode

GATE Overflow | Algorithms | Test 1 | Question: 6

Bikram asked in Algorithms Oct 4, 2016

406 views

2 votes

2 votes

The time complexity of calculating $2^{100}$ is

Polynomial
Exponential
Constant
Linear

go-alogrithms-1
algorithms
time-complexity

Bikram asked in Algorithms Oct 4, 2016

by Bikram

406 views

0 Comments

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

7 votes

7 votes

Best answer

There is no variable input needed to calculate $2^{100}$ and so complexity of calculation will be constant.

Digvijay Pandey answered Oct 11, 2016 selected Oct 11, 2016 by Arjun

by Digvijay Pandey

0 Comments

Please log in or register to add a comment.

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

4 votes

4 votes

1 answer

1

Bikram asked in Algorithms Oct 4, 2016

377 views

GATE Overflow | Algorithms | Test 1 | Question: 20
Let $T(n)$ denote the number of times the for loop in below code is executed on any input $n$. What can be said about $T(n)$? int iscompute(int n) { for (int i=2;i<=sqrt(n); i++) if(n%i) == 0) { printf("not computed"); return 0; } return 1; } ... $T(n)= O(\sqrt n)$ and $T(n)= \Omega(1)$ $T(n)= O( n)$ and $T(n)= \Omega (\sqrt n)$ None

Bikram asked in Algorithms Oct 4, 2016

by Bikram

377 views

go-alogrithms-1
algorithms
asymptotic-notation
time-complexity

2 votes

2 votes

1 answer

2

Bikram asked in Algorithms Oct 4, 2016

335 views

GATE Overflow | Algorithms | Test 1 | Question: 16
The Matrix Chain-Product dynamic programming Algorithm runs in _______ linear time exponential time quadratic time cubic time

Bikram asked in Algorithms Oct 4, 2016

by Bikram

335 views

go-alogrithms-1
algorithms
dynamic-programming
time-complexity

1 vote

1 vote

1 answer

3

Bikram asked in Algorithms Oct 4, 2016

353 views

GATE Overflow | Algorithms | Test 1 | Question: 12
Match the following two columns given in a table: 1. Randomized quick sort a. $\Theta(n+k)$ 2. Insertion sort b. $\Theta\left(n^2\right)$ 3. selection sort c. $\Theta(n)$ 4. Bucket sort d. $\Theta(n\log n)$ 1- a; 2- c; 3 -b; 4- d; 1- c; 2- a; 3 -d; 4- b; 1- b; 2- d; 3 -a; 4- c; 1- d; 2- c; 3 -b; 4- a;

Bikram asked in Algorithms Oct 4, 2016

by Bikram

353 views

go-alogrithms-1
algorithms
sorting
time-complexity
match-the-following
easy

3 votes

3 votes

1 answer

4

Bikram asked in Algorithms Oct 4, 2016

528 views

GATE Overflow | Algorithms | Test 1 | Question: 9
Let we have 3 steps of an arbitrary program fragment whose running times are $O(n^2), \: O(n^3)$ and $O(n\log n)$, then the running time of whole program is $O(n^3)$ $\Omega(n^3)$ $\Omega(n \log n)$ $\Theta(n^6 \log n)$

Bikram asked in Algorithms Oct 4, 2016

by Bikram

528 views

go-alogrithms-1
algorithms
asymptotic-notation
time-complexity

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent Posts

Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes

Subjects

All categories
General Aptitude (3.5k)
Engineering Mathematics (10.4k)
Digital Logic (3.6k)
Programming and DS (6.2k)
Algorithms (4.8k)
Theory of Computation (6.9k)
Compiler Design (2.5k)
Operating System (5.2k)
Databases (4.8k)
CO and Architecture (4.0k)
Computer Networks (4.9k)
Artificial Intelligence (79)
Machine Learning (48)
Data Mining and Warehousing (25)
Non GATE (1.4k)
Others (2.7k)
Admissions (684)
Exam Queries (1.6k)
Tier 1 Placement Questions (17)
Job Queries (80)
Projects (11)
Unknown Category (870)

64.3k questions

77.9k answers

244k comments

80.0k users

Recent Blog Comments

category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...

Send feedback
Rank Predictor
College Prediction
Useful Links
FAQ
Corrections
Discuss
Copyright
Request
Testimonials
Chat Logs
Chat
Badges
Search tips
Exam Category
Blog Category
Blog Tags
Privacy
Test Series
GATER
Refund Policy
Terms and Conditions
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!