Given the following struct definition in C, what would sizeof(myStruct) return? typedef struct { short a; long b; char c; } myStruct;
Engenheiro De Software Interview Questions
Engenheiro De Software Interview Questions
Engenheiros de software criam programas para desenvolver softwares de computador. As entrevistas são altamente técnicas. Portanto, prepare-se para resolver problemas de codificação e de matemática. As perguntas específicas que são feitas dependem do tipo de programação exigido na vaga. Pesquise sobre uma área específica de software, como desenvolvimento web, desenvolvimento de aplicativos ou desenvolvimento de sistemas.
Principais perguntas de entrevista para engenheiro(a) de software e como respondê-las
Pergunta 1: Como você descreve seu processo de programação?
Pergunta 2: Quais linguagens de programação você conhece e prefere?
Pergunta 3: Dê um exemplo de um projeto bem-sucedido que você tenha concluído.
420,226 engenheiro de software interview questions shared by candidates
"Solve a maze", you have a 2D matrix with 1's as blocked and 0's as path. Find a path from one corner to another, backtracking should be allowed.
Explain the data structure you would use to implement pop() and push(Object, int) for a Priority Queue.
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 ?
Coding Challenge 1) Find the longest palindromic substring from the given string. No need of DP solution.
If you have a program that runs slow, how will you improve it to run faster?
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.
Sort a array, [W B W B B W W B ] === [W W W W B B B B ]
1. IsAnagram 2. Count unique substring of length k
Write a function that returns true when number of things (N) can be precisely divided into boxes of 6, 9 and 20 => N = 6x + 9y + 20z
Viewing 251 - 260 interview questions