1,518 Answered Questions for the topic computer science
06/16/19
What does it mean when Microsoft says that different companies are using Azure as a platform?
06/09/19
Is the role of the sysadmin dying with the advent and increasing popularity of cloud computing?
06/04/19
Way to go from recursion to iteration?
I've used recursion quite a lot on my many years of programming to solve simple problems, but I'm fully aware that sometimes you need iteration due to memory/speed problems.So, sometime in the very...
more
Follows
•
1
Expert Answers
•1
![]()
Computer Science
06/01/19
Longest path in an undirected tree with only one traversal?
There is this standard algorithm for finding longest path in undirected trees using two depth-first searches: * Start DFS from a random vertex $v$ and find the farthest vertex from it; say it is...
more
Computer Science
06/01/19
Count the actual number of additions, subtractions, multiplications, divisions, and comparisons that must be performed when the algorithm segment is executed
assume that n is a positive integer.Algorithm 1for i ← 1 to n/2 do a ← n – i end for
Computer Science
05/25/19
App Development
Results for: I want to develop an app that is a nutrition logger but also has an added functionality of being able to order from fast food chains such as McDonalds within the app would I need a...
more
05/24/19
What's "P=NP?", and why is it such a famous question?
The question of whether P=NP is perhaps the most famous in all of Computer Science. What does it mean? And why is it so interesting?
Follows
•
1
Expert Answers
•1
![]()
05/24/19
Why is (a | b ) equivalent to a - (a & b) + b?
I was looking for a way to do a BITOR() with an Oracle database and came across a suggestion to just use BITAND() instead, replacing BITOR(a,b) with a + b - BITAND(a,b).I tested it by hand a few...
more
Follows
•
2
Expert Answers
•2
![]()
![]()
Computer Science Linear Algebra
05/22/19
Use the axioms of Boolean algebra to prove the complement law 0’ =1
Follows
•
1
Expert Answers
•1
![]()
Computer Science
05/22/19
The first term of a certain sequence is 1, and each subsequent term is obtained by tripling the previous term and adding 2 to the result. Write down a recursive definition of the sequence.
Computer Science Linear Algebra
05/22/19
Find a recursive and a non-recursive definition for the sequence: 3, 4, 13, 14, 23, 24, …
Follows
•
2
Expert Answers
•1
![]()
Computer Science
05/22/19
How Is a Computer Able to Store and Quickly Manipulate All the Data Required For A Computer Display?
I did some quick math on how much data is contained on a screen at any given instant and I ended up with a number well beyond what I thought was possible. 256 colors for Red, Green, and Blue each...
more
Computer Science
05/22/19
Hash tables versus binary trees?
When implementing a dictionary ('I want to look up customer data by their customer IDs'), the typical data structures used are hash tables and binary search trees. I know for instance that the C++...
more
Follows
•
1
Expert Answers
•1
![]()
Computer Science
05/21/19
P, NP and specialised Turing Machines?
I'm sort of new, but very interested to the field of computing and complexity theory, and I want to clarify my understanding about how to class problems, and how strongly the problems relate to the...
more
Follows
•
2
Expert Answers
•1
![]()
Computer Science
05/21/19
What is the difference between halting, accepting, and deciding in the context of Turing machines?
Does accepting mean that the TM will read and recognize a char from the cell it's currently reading from? And is it the case that a TM halts iff the input is decidable?
Follows
•
2
Expert Answers
•1
![]()
Still looking for help? Get the right answer, fast.
Ask a question for free
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Find an Online Tutor Now
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.
