Design a linked list operation that takes a singly-linked list (only forward ptrs, no backward ptrs) as input and reverses the list.
Senior Software Interview Questions
75,489 senior software interview questions shared by candidates
It was regarding configuration management of code as I had worked on VSS and the questions were on TFS.
1) I have class hierarchy and should create array of different instances of this hierarchy. They asked me to write a function which iterates this array and executes different methods according to the instance class. I suggested that downcasting is a bad idea and that it can violate Liskov substitution rule of the SOLID principles, and this problem should be solved using collections and generics, but they did not accept this answer 2) Create Queue N size using only N size array. 3) some Java concurrency related questions: synchronized volatile, atomic, etc....
However the interview was about Senior Java Position, I just asked a couple of questions about Java and nothing about Javascript. The interview questions were about: 1. Data structure and algorithms (30 minutes) 2. Operating Systems Concepts (System calls, concurrency, etc, Device Drivers.) 3. TCP/IP Layered protocol ( I was really really good at this when I was in college :) ) Till now about 1 hour or more passed from the 90 minutes interview... 4. Couple of questions about REST, Java Concurrency and Testing I could understand the emphasis on the OS, algorithms design and analysis is to be asked at Google & Amazon-like companies or to be asked to a fresh engineer he is just graduated from the university with a fresh knowledge. I am not denying their questions about OS, Data structure, and algorithms, but to make most on the interview for such topics and eventually got rejected because my knowledge in JavaScript is not enough is not honesty in reporting the Interview status. I answered the algorithms question and OS, TCP/IP from memory (which mostly wasn't that accurate as I left university more than 10 years back).
What is the size og following structuires when packing is allowed and not allowed. Struct A { char c; int i; } Struct B {int i; char c; } Struct C { char c1; int i; char c2; }
You have chess board. How many squares are there in it totally?
check if a linked list is pallendrom.
Received solution for refactoring.
Consider 4 components of a color where: unsigned char red = 0x10; unsigned char green = 0xFF; unsigned char blue = 0x0F; unsigned char alpha = 0x44; Generate a packed color ARGB which is a 32 bit integer such that A is in the MSB of ARGB followed by red, green, blue ----------------- | A | R | G | B | -----------------
solve following program void main(){ int x =10; { int y =20; } pfintf('x=%d,y = %d',x. y); }
Viewing 141 - 150 interview questions