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

Question 1

Pregunta n.º 1: ¿Qué tipos de claves existen en SQL y cuándo las usarías?

How to answer
Respuesta recomendada: Esta pregunta te permite mostrar tus conocimientos de SQL. Explica los tipos más comunes de claves en SQL e indica cómo pueden identificar filas y columnas en las tablas. Las claves funcionan como identificadores únicos, lo que permite que los usuarios recuperen los datos con facilidad.
Question 2

Pregunta n.º 2: ¿Qué tipos de normalización existen en SQL y cuándo los usas?

How to answer
Respuesta recomendada: La normalización en SQL suele utilizarse para organizar datos y reducir redundancias. Puedes demostrar tu experiencia explicando los métodos de normalización que más usas. Por ejemplo, muchos programadores dividen una tabla grande en varias más pequeñas para facilitar la lectura.
Question 3

Pregunta n.º 3: ¿Con qué lenguajes de programación estás familiarizado?

How to answer
Respuesta recomendada: Muchos desarrolladores usan además JavaScript, HTML, Python, PL/SQL y otros lenguajes. Enumera los lenguajes que conoces y explica cómo los has usado en tu empleo anterior. Además, menciona los títulos de programación que posees.

710,358 programador sql interview questions shared by candidates

I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?
avatar

Software Development Engineer Intern

Interviewed at Amazon

3.5
Feb 10, 2013

I was asked two questions. Q 1. You are given two version numbers of a software, like Version 10.3.4 and Version 10.3.41. Write a program to find out which of the version numbers are the latest. If version 1 is latest output -1, if version number 2 is latest output +1 else output 0 if same version. Both the version numbers are taken as string. He also asks to make the program of minimum time complexity as we can. At the end he also asked the difference between an iterative program and one with recurrence and their advantages and disadvantages. Q 2. Given two files with a list of application IDs (or some kind of data) stored in them , write a program to compare the data in the two files and output all the common data found in each. What data structure would you use and why ? Give a minimum time and space complexity algorithm. Why did you choose the particular data Structure or algorithm ?

Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this structure outside of the traditional double links. Write a procedure in C++ that flattens this structure into a single list.

Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this structure outside of the traditional double links. Write a procedure in C++ that flattens this structure into a single list.

Viewing 331 - 340 interview questions

Glassdoor has 710,358 interview questions and reports from Programador sql interviews. Prepare for your interview. Get hired. Love your job.