Pergunta de entrevista da empresa Teknuance Info Solutions

Round 2 : 1. About STL containers 2. Arrays, Vectors, Difference between the two, Unordered and ordered maps, Complexity of insertion or searching 3. Basic questions about Data structures, Linked list, Structure of a node, Insertion and deletion, Types of linked lists, Insertion of single linked list into a circular linked list by deleting a node, deletion of first node of circular linked list. 4. Difference between binary trees and binary search trees, Which one has less searching time complexity and why? 5. Basic algorithmic concepts, Finding a pair of numbers from array with given sum with linear time complexity, Frequency of particular words in a paragraph, Name string searching algorithms, What is hashing?, Remove dupicates from an array using extra space and without using extra space. 6. Questions about databases, types of databases, indexing and multi-threading in C++.

Resposta da entrevista

Sigiloso

19 de mar. de 2019

Google them for answers