Given an array of distinct n integers, find if there exists a quadruple (x, y, z, w x+y+z+w= 0.

if there are multiple such quadruples, you may output any of them.

(a) design an efficient algorithm for the problem in terms of worst-case running time.

(b) can you get a more efficient algorithm in terms of expected running time?

Consider a byte-addressable computer with 16mb of main memory, a cache capable of storing a total of 64kb of data and block size of 32 bytes. (a) how many bits in the memory address? (b) how many blocks are in the cache? (c) specify the format of the memory address, including names and sizes, when the cache is: 1. direct-mapped 2. 4-way set associative 3. fully associative

Ihave been given the number of guns per 100, and the total firearm-related deaths per 100,000. i have to find the actual number of guns per country and actual number of gun-related deaths. if somebody could show me how to do 1 question, i can finish the rest, i am just confused. tia

What are the 12 colors of the spectrum called?