functional quiz 1.2

What is pattern matching?

• a functionality that checks if a objects is an examplar of some particular class

• tool that makes reccursion easier

• alternative to if-else expressions

• a technique where you test an expression to determine if it has certain characteristics

What is a case class?

• classes that cannot have fields

• implementatoin of the inheritance concept in Scala programming language 

• classes that are required to inherite a class or implement an interface

• immutable classes that can be decomposed via pattern matching

Why generics are important?

• They generilize type that is used inside of a class

• generalization of several modules that work similarly

• generlization of a group of functions

• ?

During pattern matching, possible case classes are determined in compile time

• true

• false

• neither

• both

What is a function of a map function?

• Transform every member of collection in accordance to a function provided

• Square every element in a list

• check if element in a list

• higher order function that create all possible combinations of elements in a list

• function that create an object that describes collection of key-value pairs

What is a correct implementation of a map function for class below:

class Example[A, B, C](a: A, b: B, c: C)

• .

  def map(f: (A, B, C) => Example[A, B, C]): Example[A, B, C] = f(a, b, c)

• def map[D](f: (A, B, C) => D): D = f(a, b, c)

• def map[D](f: (A, B, C) => D, g: A => A, h: B => B, k: C => C): D = f(g(a), h(b), k(c))

• true

Which of the functions below can be used to implement a sum of a list?

• filter

• map

• reduce

• adjoin

What is a result of a function below?

val list = List(1, 4, -9, 0, -6, 0, -2) print(list.filter(_ % 2 == 0).reduce((acc, element) => acc + element * -1))

• 12

• 17

• 666

• 667

What is thee result of following code?

val list = List(1, 4, -9, 0, -6, 0, -2) list match { case List(a, b, c) => print(a + b + c) case List(a, b, c, d, e, f) => print(a b c d e * f) }

Answer should be without spaces

• error

• no

• yes

• shm|667|17

When implementing a Binary Search Tree are possible case classes for a node? (based on your assignment3)

• NonEmptyNode

  EmptyNode

• RedNode

  Node

• BlackNode

• NilNode

  ActiveNode