In your own words, what are lambda expressions and what are list comprehensions?

What type of device does a computer turn to first when attempting to make contact with a host with a known IP address on another network? a. Default gateway b. DNS server c. Root server d. DHCP server

I have a Discrete Structures exam soon and it's all about algorithms. I need help understanding how to prove the correctness of iterative algorithms

2.  Write a Scheme function numofatoms that determines the number of elements in a list. For example, (numOfSymbols '((1 3) 7 (4 (5 2) ) ) should return 6.

Suppose you have a list of key/value pairs (i.e., a nested list where each element of the list is a (key value)pair. For example, the list might look like this: '((France Paris) (France Nice) (Spain Madrid) (Poland Krakow) (Poland Warsaw)) (Notice that the keys need not be unique for this problem.) Write a function named first-occurrence in Scheme that takes a key and a list then returns the value of the first item on the list with a matching key. Return '() if none of items on the list has a matching key. You must use either fold or reduce to do the vast majority of the work. You may use the built-in foldmethod by adding the line (require 'list-lib), or you can use your own implementation. The built-in fold function has parameters in this order: action partial-result lst. You may assume that the list contains an element with the key to be updated. For example, (first-occurrence 'Germany '((France Paris) (Germany Bonn) (Germany Berlin))) should return 'Bonn (first-occurrence 'Poland…

Write a function two in Scheme that takes a single parameter, a list of integers. The function tworeturns #t if the list of integers includes two equal integers. Otherwise, it returns #f. The list L isflat, i.e., it does not contain sublists.

I need the answer as soon as possible

question in c++