amina.bm

I know that NP problems can't be solved in polynomial time.But what do NP complete and NP hard problems mean?

Suppose i have an algorithm whose time is represented by th function T(n)=n^3+2n^2 So what does n mean?

2^(2^n)=O(2^n). Is it true or false? Thanks in advance

please I want to know how to program

i'm akill studying computer science and engineering in india.my question is which book is good for studying data structure with c programming?

we all know that Caeasar Cipher accepts only alphabets from A-Z and its key is n<=26. Caesar Cipher does not accept numbers. last night , I found an exercise which said that this code a certain code is encoded using Caesar Cipher **BUT** this code is a **composed of numbers …

i want to convert numbers into following pattern if i input `.33` then should produce `1/3` here i am not asking for the exact answer but i just need a good logic to solve this problem.

I want to create an algorithm which shows how to create a linked list that could store a database of animals ie its species and physical features etc can any one help me