Genetic Algorithms Interview Questions & Answers

4 avg. rating (80% score) - 1 votes

Genetic Algorithms Interview Questions

    1. Question 1. Explain What Is An Algorithm In Computing?

      Answer :

      An algorithm is a well-defined computational procedure that takes some value as input and generates some value as output. In simple words, it’s a sequence of computational steps that converts input into the output.

    2. Question 2. Explain What Is Quick Sort Algorithm?

      Answer :

      Quick Sort algorithm has the ability to sort list or queries quickly. It is based on the principle of partition exchange sort or Divide and conquers. This type of algorithm occupies less space, and it segregates the list into three main parts.

      • Elements less than the Pivot element.
      • Pivot element.
      • Elements greater than the Pivot element.

    3. Question 3. Explain What Is Time Complexity Of Algorithm?

      Answer :

      Time complexity of an algorithm indicates the total time needed by the program to run to completion. It is usually expressed by using the big O notation.

    4. Question 4. Mention What Are The Types Of Notation Used For Time Complexity?

      Answer :

      The types of Notations used for Time Complexity includes:

      Big Oh: It indicates “fewer than or the same as” <expression>iterations

      Big Omega: It indicates “more than or same as” <expression>iterations

      Big Theta: It indicates “the same as”<expression>iterations

      Little Oh: It indicates “fewer than” <expression>iterations

      Little Omega: It indicates “more than” <expression>iterations

    5. Question 5. Explain How Binary Search Works?

      Answer :

      In binary search, we compare the key with the item in the middle position of the array. If the key is less than the item searched then it must lie in the lower half of the array, if the key is greater than the item searched than it should be in upper half of the array.

    6. Question 6. Explain Whether It Is Possible To Use Binary Search For Linked Lists?

      Answer :

      Since random access is not acceptable in linked list, it is impossible to reach the middle element of O (1) time. This, binary search is not possible for linked list.

    7. Question 7. Explain What Is Bubble Sort Algorithm?

      Answer :

      Bubble sort algorithm is also referred as sinking sort. In this type of sorting, the list to be sorted out compares the pair of adjacent items. If they are organized in the wrong order, it will swap the values and arrange them in the correct order.

    8. Question 8. Mention What Are The Three Laws Of Recursion Algorithm?

      Answer :

      All recursive algorithms must follow three laws:

      • It should have a base case.
      • A recursive algorithm must call itself.
      • A recursive algorithm must change its state and move towards the base case.

    9. Question 9. Explain What Is A Recursive Algorithm?

      Answer :

      Recursive algorithm is a method of solving a complicated problem by breaking a problem down into smaller and smaller sub-problems until you get the problem small enough that it can be solved easily. Usually, it involves a function calling itself.

    10. Question 10. Explain What Is Radix Sort Algorithm?

      Answer :

      Radix sort puts the element in order by comparing the digits of the numbers. It is one of the linear sorting algorithms for integers.

    11. Question 11. Explain What Is The Difference Between Best Case Scenario And Worst Case Scenario Of An Algorithm?

      Answer :

      Best case scenario: Best case scenario for an algorithm is explained as the arrangement of data for which the algorithm performs best. For example, we take a binary search, for which the best case scenario would be if the target value is at the very center of the data you are searching. The best case time complexity would be 0 (1)

      Worst case scenario: It is referred for the worst set of input for a given algorithm. For example quick sort, this can perform worst if you select the largest or smallest element of a sublist for the pivot value. It will cause quick sort to degenerate to O (n2).

    12. Question 12. List Out Some Of The Commonly Used Cryptographic Algorithms?

      Answer :

      Some of the commonly used cryptographic algorithms are:

      • 3-way
      • Blowfish
      • CAST
      • CMEA
      • GOST
      • DES and Triple DES
      • IDEA
      • LOKI and so on

    13. Question 13. Explain How To Find Whether The Linked List Has A Loop?

      Answer :

      To know whether the linked list has a loop, we will take two pointer approaches. If we maintain two pointers, and we increase one pointer after processing two nodes and other after processing every node, we are likely to encounter a situation where both the pointer will be pointing to the same node. This will only occur if linked list has a loop.

    14. Question 14. Explain How Encryption Algorithm Works?

      Answer :

      Encryption is the process of converting plaintext into a secret code format referred as “Cipher text”. To convert the text, algorithm uses a string of bits referred as “keys” for calculations. The larger the key, the greater the number of potential patterns for creating cipher text. Most encryption algorithm use codes fixed blocks of input that have length about 64 to 128 bits, while some uses stream method.

    15. Question 15. Explain What A “hash Algorithm” Is And What Are They Used For?

      Answer :

      “Hash Algorithm” is a hash function that takes a string of any length and decreases it to a unique fixed length string. It is used for password validity, message & data integrity and for many other cryptographic systems.

    16. Question 16. Explain What Is Space Complexity Of Insertion Sort Algorithm?

      Answer :

      Insertion sort is an in-place sorting algorithm which means that it requires no extra or little. storage. For insertion sort, it requires only single list elements to be stored out-side the initial data, making the space-complexity 0(1).

    17. Question 17. Explain What Is Skip List?

      Answer :

      Skip list the method for data structuring, where it allows the algorithm to search, delete and insert elements in a symbol table or dictionary. In a skip list, each element is represented by a node. The search function returns the content of the value related to key. The insert operation associates a specified key with a new value, while the delete function deletes the specified key.

    18. Question 18. Explain What Is Heap Sort?

      Answer :

      Heap-sort can be defined as a comparison based sorting algorithm. It divides its input into the unsorted and sorted region, until it shrinks the unsorted region by eliminating the smallest element and moving that to the sorted region.

All rights reserved © 2018 Wisdom IT Services India Pvt. Ltd DMCA.com Protection Status

Genetic Algorithms Tutorial