Answer:
thanksssssssss
Question #3
Multiple Choice
Which statement is true?
O A collection is a type of deque.
O A list is a type of deque.
O A deque is a type of list.
O Adeque is a type of collection.
Answer:
D. A deque i a type of collection
Explanation:
I do computer science too ;3
Match the following internet related terms to their definition
Answer:
1st buble goes to web address 2nd goes to browser 3rd goes to chat 4th goes to email
Explanation:
write passage on computer virus
Answer:
A computer virus is a relatively small program that attaches itself to data and program files before it delivers its malicious act. There are many distinct types of viruses and each one has a unique characteristic. Viruses are broken up into to main classes, file infectors and system or boot-record infectors.
hope it helpsBluetooth uses this medium to connect two devices.
Select one:
a. microwave signals
b. fiber optics
c. infrared light
d. radio signals
Answer:
D
Explanation:
Bluetooth is the wireless technology which allows for the exchange of the data between different devices. It uses wavelength to transmit information and generally works with short rage devices.
Due to Bluetooth relies on the range of devices and hence it depends on the UHF radio waves. These have a range of 2.4 to 2.5 Ghz. Such that the devices can talk to each other. The usage is control automation system.Hence the option D is correct.
Learn more about the uses this medium to connect two devices.
brainly.in/question/5681178.
While your hands are on home row, both of your thumbs are on _____.
Answer:
While your hands are on home row, both of your thumbs are on Space-barI know this will definitely help✍️✍️✍️An algorithm whose worst-case time complexity is bounded above by a polynomial function of its size is called a(n)
Answer:
polynomial-bounded algorithms
Explanation:
There are two algorithm complexities and they are time and space complexities. They can be denoted with the big-O notation. The big-o notation for a time and space complexity gets the worst-case time and space respectively.
The time complexity gets the measure of the execution time of an algorithm. When the time function is a polynomial ( k^n + k^n-1 ...) then the algorithm is said to be a polynomial-bounded algorithm.