Explore topic-wise InterviewSolutions in Current Affairs.

(:) operator: It is known as the “cons” operator and is used to APPEND a head element to a LIST

(++) operator: It is a list concatenation operator, and it takes two operands and COMBINE them into a SINGLE list

(:) operator: It is known as the “cons” operator and is used to append a head element to a list

(++) operator: It is a list concatenation operator, and it takes two operands and combine them into a single list

NEWTYPE: It guarantees that your data will have EXACTLY the same representation at runtime, like the type that you wrap

Data: It declares a brand new data STRUCTURE at runtime

Newtype: It guarantees that your data will have exactly the same representation at runtime, like the type that you wrap

Data: It declares a brand new data structure at runtime

In Hazkel, lazy evaluation is USEFUL due to following reasons:

• Values will not be computed if they are not GOING to be used
• Haskell makes sure that the order in which the EXPRESSIONS are evaluated will never affect their result.
• Also, it ALLOWS the infinite lists

In Hazkel, lazy evaluation is useful due to following reasons:

In Haskell, the BEST way to implement “ord” is just to ADD deriving (EQ, Ord) to the type’s DEFINITION.

In Haskell, the best way to implement “ord” is just to add deriving (Eq, Ord) to the type’s definition.

In Haskell, there are two types of POLYMORPHISM:

Parametric Polymorphism: A function is parametrically polymorphic, if it behaves EQUALLY for all types, in at least one of its type parameters

BOUNDED Polymorphism: You have bounded polymorphism or ad hoc, if you have CUSTOM behavior that you want to have for certain set of types

In Haskell, there are two types of polymorphism:

Parametric Polymorphism: A function is parametrically polymorphic, if it behaves equally for all types, in at least one of its type parameters

Bounded Polymorphism: You have bounded polymorphism or ad hoc, if you have custom behavior that you want to have for certain set of types

In Haskell, data TYPES are COMBINED in TWO ways

List: It goes in [square brackets]

Tuples: It goes in (PARENTHESIS)

In Haskell, data types are combined in two ways

List: It goes in [square brackets]

Tuples: It goes in (parenthesis)

In Haskell, there are five numeric types that INCLUDES

Int: It is an integer having at LEAST 30 bits of precision

Integer: It is an integer having unlimited precision

Float: It is a single precision floating point NUMBER

Double: It is a double point precision floating point number

Rational: It is a fraction type with no rounding error

In Haskell, there are five numeric types that includes

Int: It is an integer having at least 30 bits of precision

Integer: It is an integer having unlimited precision

Float: It is a single precision floating point number

Double: It is a double point precision floating point number

Rational: It is a fraction type with no rounding error

In Haskell, prelude is a MODULE that consists of a bunch of standard definitions that GETS implicitly IMPORTED into Haskell PROGRAM.

In Haskell, prelude is a module that consists of a bunch of standard definitions that gets implicitly imported into Haskell program.

Haskell algebraic data TYPES are closed because it MAKES it a lot EASIER to write total functions. Functions that produce a RESULT, for all possible values of its type.

Haskell algebraic data types are closed because it makes it a lot easier to write total functions. Functions that produce a result, for all possible values of its type.

In Haskell, $ sign operator is used to avoid parenthesis, anything that appears after it will TAKE PRECEDENCE over anything that COMES before. For example, (putStrLn .SHOW) (1+1) can be replaced by putStrLn . show $ 1+1. While,. (dot) primary FUNCTION is to chain function and not to avoid parenthesis.

In Haskell, $ sign operator is used to avoid parenthesis, anything that appears after it will take precedence over anything that comes before. For example, (putStrLn .show) (1+1) can be replaced by putStrLn . show $ 1+1. While,. (dot) primary function is to chain function and not to avoid parenthesis.

Function definition in Haskell consists of a number of condition equations. At the beginning of each, after the function name, there are PATTERNS that SHOW to which data each equation applies. After that there are multiple clauses, representing DIFFERENT cases and a where CLAUSE to hold local definitions.

Function definition in Haskell consists of a number of condition equations. At the beginning of each, after the function name, there are patterns that show to which data each equation applies. After that there are multiple clauses, representing different cases and a where clause to hold local definitions.

• While working with Haskell, the FIRST step involves in WRITING a Haskell program is usually to WRITE down all the types.
• Haskell language is like a transcript just by looking at the function’s type it will tell you about what the function might do Turns run-time errors into compile time errors, it is BETTER to fix errors up front.

Each MONAD has its own application of the bind function LIKE:

• Failure Monad
• Error Monad
• List Monad
• Reader Monad
• STATE & WRITER Monad

Each monad has its own application of the bind function like:

A MONAD in Haskell is just a type for which the >>= operation is defined. Haskell’s I/O is based on Monads. It’s a specific way of binding operations TOGETHER or in other words, it’s a way of wrapping things and provide a METHOD to perform operations on the wrapped stuff WITHOUT unwrapping it.

A monad in Haskell is just a type for which the >>= operation is defined. Haskell’s I/O is based on Monads. It’s a specific way of binding operations together or in other words, it’s a way of wrapping things and provide a method to perform operations on the wrapped stuff without unwrapping it.

Benefits of Haskell expression:

• In Haskell, variable, data structure ETC. is immutable
• Haskell expression has no issues LIKE updating global variables or printing to the screen
• Everytime calling the same function with the same argument will result in the same output
• It is possible to DECOUPLE I/O from the rest of the code, reducing programming ERROR; it is very important feature of Haskell programming
• Without TELLING Haskell what type of data to read, read the function in the program will direct what to read.

Benefits of Haskell expression:

Haskell is an advanced functional programming language, PROVIDING easy INTEGRATION with other LANGUAGES, built-in concurrency, and RICH libraries. Haskell programming is centered on evaluating expressions rather than executing instructions.

Haskell is an advanced functional programming language, providing easy integration with other languages, built-in concurrency, and rich libraries. Haskell programming is centered on evaluating expressions rather than executing instructions.