Technical Manager = What are you doing? How much are you willing to contribute? etc. This is mostly behaviour round. HR = Again, straight forward questions. Technical = this round contains two coding test. You will work as a team with some other candidate on a test. Basically, you have to demonstrate your teamwork skills. Also, how well you handle the situation e.g. are you a follower or a leader etc.
Programador Sql Interview Questions
Programador Sql Interview Questions
SQL son las siglas de Structured Query Language (lenguaje de consulta estructurado) y un programador SQL es la persona encargada de crear bases de datos SQL y las aplicaciones que funcionan con ellas. Por lo general, utilizan tablas de diseño y recursos de almacenamiento para mayor estabilidad, fiabilidad y rendimiento. En una entrevista para un puesto de programador SQL, pueden hacerte preguntas sobre tus conocimientos de programación y habilidades de resolución de problemas.
Preguntas de entrevista más frecuentes para programador/a SQL y cómo responderlas
Pregunta n.º 1: ¿Qué tipos de claves existen en SQL y cuándo las usarías?
Pregunta n.º 2: ¿Qué tipos de normalización existen en SQL y cuándo los usas?
Pregunta n.º 3: ¿Con qué lenguajes de programación estás familiarizado?
711,480 programador sql interview questions shared by candidates
You have three sock drawers. One has red and blue socks, one has blue and green socks, and one has green and red socks. What is the expected number of socks you must pull to be sure which drawer is which, assuming that the number of socks of each color in each drawer is both large and equal?
Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. All these operations of SpecialStack must be O(1). To implement SpecialStack, you should only use standard Stack data structure and no other data structure like arrays, list, etc.
Given an array, find there are 3 numbers have when we add them the value will equals a specified sum Example: {1,4,6,10,20,21} Sum=32, Result:true (1+10+21) Sum=65, Result:false
Write algorithm to compute the intersection of two arrays. What is the time complexity of this algorithm (using the big O notation)?
Given a string, find whether it has any permutation of another string. Need to be efficient
1. What is a virtual? 2. If class has virtual function, what happens in compile time and in run time? 3. What is a polymorphism? 4. Write the function that gets array of chars and returns number of elements with 3 bits ON, performance is important. 5. Write the function that draws a line from x1,y1 to x2,y2 6. You have very long function with many return statements. You have to determine how much time it runs.
1- Given an array of integers, positive and negative. find an interval in that array, whose elements constitutes the maximum sum
Given an integer write a function that converts the input into a linkedList where each node corresponds to a number of the integer. Eg: 25697 == 2 -> 5 -> 6 -> 9 -> 7 Then write a function that takes 2 linkedList, add the corresponding integers and return a third list with the result.
Sabes que es c++?
Viewing 1721 - 1730 interview questions