int i=14; if (i=15) i++; How much is i?
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
1. Write a function to implement the "cat" command in Linux 2. Find the first character that only appears once in the whole string
How do you write an algorithm to count all subsets of strings in a string.
you have two eggs, and a 100 storey building, find out the highest floor to throw them from so that they wont break, and in minimum number of tries.
You have 25 horses, and you want to know which are the top 3 fastest, but you don't have a stopwatch. You can race the horses, but the track is only big enough to fit 5 horses at a time. How do you find the first, second and third fastest horses using the least amount of races possible?
whats is the difference between merge and join .
decide whether the enter should be accepted or not for a passcode, one number missing is permitted, can be missed several times, 18687 is the passcode, then 167 is accepted, the rest should be right and in right sequence.
How many characters in the front of a string would need to be added in order to make it a palindrome.
given a matrix, you can move right or down only and cost of each move is 1. Find an optimal way to reach to right-bottom from top-left of the matrix.
Viewing 1361 - 1370 interview questions