Senior Software Engineer Interview Questions

its 1 byte as address will be allocated to the class when initalized.

ya correct 1 byte it occupies for an empty class, 4 functions are declared by compiler during compilation inside empty class, they are, 1) copy compilation 2) overload assignment operator 3)default constructor 4)default destructor, search in google for more imformation and refer a book called " object oriented programming with c++" by subhash k u , pearson publication, best book for c++

Put you question please.

Can you please specify what questions did the interviewer asked??

no idea

What's the question?

As you cant traversce in linked list back so we have to copy the content of next value in list to the current node(node to be removed)

void removeElement(node n) { n.data = n.next.data; n.next=n.next.next; }

Later tells me i am looking for few specific words

There are 5 Design Patterns: 1. The Factory Method - provides a simple decision making class that returns one of several possible subclasses of an abstract base class depending on the data that are provided. 2. The Abstract Factory Method - provides an interface to create and return one of several families of related objects. 3. The Builder Pattern - separates the construction of a complex object from its representation, so that several different representations can be created depending on the needs of the program. 4. The Prototype Pattern - starts with an initialized and instantiated class and copies or clones it to make new instances rather than creating new instances. 5. The Singleton Pattern - is a class of which there can be no more than one instance. It provides a single global point of access to that instance.

8*8 + 7*7 + 6*6 ... 1*1

total number of squares on chess board is given by recurrence relation: f(n) = f(n - 1) + n^2 f(8) = 7! + 8^2 = 140 + 64 so in total there is 204 squares... you can check this relation with smaller boards where its possible visually count squares..

Recruiter wanted to play chess instead of the software product domain level probabilities

it is 20-1 which is 19. Since 19 matches should be played to eliminate 19 people

It is n-1

1

use two stacks

Keep 2 stacks, let's call them inbox and outbox. Queue: - Push the new element onto inbox Dequeue: - If outbox is empty, refill it by popping each element from inbox and pushing it onto outbox - Pop and return the top element from outbox Using this method, each element will be in each stack exactly once - meaning each element will be pushed twice and popped twice, giving amortized constant time operations.