@

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

self doubt

vijju532 asked in Databases Aug 23, 2018

128 views

0 votes

0 votes

is view seriziability came into the npc problem ??

databases
time-complexity

vijju532 asked in Databases Aug 23, 2018

128 views

1 comment

commented Aug 23, 2018

npc means??????

0

0

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 votes

0 votes

non deterministic complete problem

vijju532 answered Aug 23, 2018

0 Comments

Please log in or register to add a comment.

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

0 votes

3 answers

1

Nisha Bharti asked in Algorithms Sep 26, 2022

194 views

Self doubt.
What is the time & space complexity of this algorithm? Main() { for(i=n; i>10; i=i^1/4) { for(j=201; j<n^3; j=j+400) { for(k=47; k<=n^84; k=k*108) { k=k^61; } } } }

Nisha Bharti asked in Algorithms Sep 26, 2022

by Nisha Bharti

194 views

algorithms
time-complexity
space-complexity
self-doubt

0 votes

0 votes

1 answer

2

tusharb asked in Algorithms Feb 18, 2022

360 views

Algorithm self doubt
As we know the time complexity of solving the greedy knapsack algorithm depends mainly on the sorting algorithm used, Can we use counting sort as the sorting algorithm to reduce the time complexity to O(n)?

tusharb asked in Algorithms Feb 18, 2022

360 views

algorithms
self-doubt
sorting
time-complexity

1 vote

1 vote

0 answers

3

srestha asked in Algorithms May 19, 2019

325 views

Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??

srestha asked in Algorithms May 19, 2019

325 views

algorithms
recurrence-relation
time-complexity

1 vote

1 vote

1 answer

4

sumitr asked in Algorithms Apr 10, 2019

906 views

Algorithm Time Complexity-Self Doubt
What is the best case and worst case of the algorithm? And when will best case and worst case will happen?? int main() { for(i=1 ; i<=n ; i++) { if(n%i == 0) { for(j=1 ; j<=n ; j++) { printf("Hello"); } } } }

sumitr asked in Algorithms Apr 10, 2019

by sumitr

906 views

algorithms
time-complexity
self-doubt

Subscribe to GATE CSE 2023 Test Series

Subscribe to GO Classes for GATE CSE 2023

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

From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test

Subjects

All categories
General Aptitude (2.5k)
Engineering Mathematics (9.3k)
Digital Logic (3.3k)
Programming and DS (5.9k)
Algorithms (4.6k)
Theory of Computation (6.7k)
Compiler Design (2.3k)
Operating System (5.0k)
Databases (4.6k)
CO and Architecture (3.8k)
Computer Networks (4.6k)
Non GATE (1.3k)
Others (2.4k)
Admissions (649)
Exam Queries (842)
Tier 1 Placement Questions (17)
Job Queries (74)
Projects (9)
Unknown Category (853)

Recent Blog Comments

Yaa toa intentionally bohot jyada sahi time kiya...
Man, I feel you! I left my job to do gate this...
Yes, CDU provides assistance for internships...
Are you fully aware of the job opportunities in...
When this exam will happen ?

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
Contact Us

Developed by Chun

Twitter WhatsApp Facebook Reddit LinkedIn Email

Link Copied!