PwC Associate Software Engineer Interview Questions and Answers

It was a MCQ type round with 3 coding questions. This round consisted of questions from aptitude, SQL knowledge and a sql command writing question, Programming basics, Web Technology, 2 coding questions. CS Subjects and some Situational based questions.

It was a Just a minute round in which a topic was given by the interviewer to speak upon.

Q1. What all technologies you feel will be fruitful in learning with regards to your future growth?
Add your answer

Q1. Explain NOSQL databases and their working?
Ans. 
NOSQL databases are non-relational databases that provide flexible schema design and horizontal scalability.
• NOSQL databases store data in key-value pairs, wide-column stores, document databases, or graph databases.

• They are designed for handling large volumes of data and are highly scalable.

• Examples include MongoDB, Cassandra, Redis, and Neo4j.
Answered by AI
Add your answer

Q1. Describe the working of your projects and how did you manage with hectic load of your curriculum being a part of your project building which is from some other domain?
Add your answer

Find the greatest element in the moving array

Q1. Interviewer Asked me to build Airline Management System
Add your answer

Reasoning, maths and clocks based questions.

2 codings. DSA based.

Q1. What are OOPs Concepts?
Ans. 
OOPs Concepts are fundamental principles of Object-Oriented Programming that help in organizing and designing code.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (object).

• Inheritance: Allowing a class to inherit properties and behavior from another class.

• Polymorphism: Ability of objects to take on multiple forms or have multiple behaviors.

• Abstraction: Hiding the complex implementat...read more
Answered by AI
Add your answer
Q2. What is AVL tree?
Ans. 
AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.
• AVL tree was named after its inventors Adelson-Velsky and Landis.

• It is a type of binary search tree where the heights of the two child subtrees of any node differ by at most one.

• AVL trees are used to maintain a balanced tree structure, ensuring O(log n) time complexity for insertion, deletion, a...read more
Answered by AI
Add your answer
Q3. Define LIFO, FIFO etc
Ans. 
LIFO stands for Last In, First Out and FIFO stands for First In, First Out.
• LIFO: Last In, First Out - the last item added to a stack is the first one to be removed.

• FIFO: First In, First Out - the first item added to a queue is the first one to be removed.
Answered by AI
Add your answer
Q4. Share your college experienceon coding.
Ans. 
I gained hands-on coding experience through coursework, projects, and internships during my college years.
• Took courses in programming languages such as Java, C++, and Python.

• Participated in coding competitions and hackathons to enhance my skills.

• Completed coding projects in areas like web development, data analysis, and software engineering.

• Interned at a tech company where I worked on real-world coding projects.

• Collabo...read more
Answered by AI
Add your answer

Q1. Introduce yourself (3 mins)
Add your answer
Q2. Area of Interests (3 mins)
Add your answer

MCQS on Java, HTML, CSS, DSA, JS and OS. Platform was Hackerrank.