Interview Experience for Synopsys

College : ABES Engineering College(Tier 3)

Opportunity: 12 months internship (On-Campus)

Rounds: 1st Round (Online Assesment) 
        2nd Round(Interview on basic DSA , Competitive Programming and Operating System)
	    3rd Round(Medium DSA questions plus deep knowledge of Data Structure)
		
Selection Criteria: 70%/75% till your 6th Semester (Computer Science and ECE branches)-Batch(2024)

Round Details :
**1st Round**: (Aptitude Section) It contains medium level aptitude and logical reasoning 20 MCQs
			               (Digital Logic):It contains questions on the Logic Gates (XOR,NAND) and also contains some electronic question (10 MCQs)
						   
						   
After the 1st Round around 60 students were shortlisted for interview and 20 of them were interviewed after resume shortlisting .


**2nd Round**
		Interviewer has firstly asked my introduction and then asked my projects mentioned in resume . 
		
		1)He has gone through my coding profiles and CP ranks. 
		After that He came with the sheet containing 5-6(subcodes) which are really very interesting. 
		These codes are some basic programs of DSA but Interviewer has make them very complex by changing that codes.He asked me to identify what is this code doing and explain why?.
		I took around 15-20 minutes to solve these 6 questions.
		
		2) After this He asked me basic DSA questions 
		1st : 2 sum in leetcode Also asked me to not use sort function.
		2nd : reverse of words in a string . 
		3rd: Tree questions on Travesals .All traversal code(BFS and DFS) .(only functions)
		I took 20 minutes to solve all these.
		
		3) Operating System:(Next 20 minutes)	
		He asked me about topics like Deadlock,Ways to protect Deadlock,
		Conditions for deadlock,Why deadlock happens.
		He asked me about semaphore,mutex .
		He asked me about  Reader-Writer Problems, multithreading and also asked me to write the code for this.
		
**3rd Round**(Medium DSA questions and deep knowledge of Data structure):
Intervier asked me about 
	1)Introduction
	2)Asked me about STL Datastructure :set and map
	3)Which data stucture is uses in hashing in map in STL(Red Black Tree and AVL) and complexity of Insertion , Deletion and  Find function .
	4)Inorder,Preorder,Postorder Traversal (code)
    5)Which algorithm is used in STL sort function.I told quicksort .He asked me to write the code of quicksort.
    6)After this He asked me about BST and LCA of BST ,also asked me to write the code for finding LCA of BST.
    7)Three Sum :Leetcode 
    8)Asked me about Heap (Priority_queue),Its functions and complexity.
	9)Level Order Traversal(Code)

 Result:Selected for Internship. Got a selection mail after 15 days of interview(4 students were selected)
 Location:Bangalore
 Duration:July(2023)-June(2024)