Electronic Packaging Designer

Electronic Packaging Designer Interview Questions and Answers

Updated 7 Jun 2015

Q1. In a tournament with N teams, where in one team can play only one match per day, develop an algo which schedules the matches in the tournament. Each team shall play with the other team once(same as designing th...

read more
Ans.

An algorithm to schedule matches in a tournament with N teams, where each team plays only one match per day.

  • Create a round-robin schedule where each team plays every other team once.

  • Start by assigning each team a number.

  • Generate a schedule by pairing teams based on their numbers.

  • Optimize the schedule by minimizing the number of days required.

  • Consider using a graph-based approach to find the optimal schedule.

Q2. Given two numbers m and n, write a method to return the first number r that is divisible by both (e.g., the least common multiple). ANS:Define q to be 1. for each prime number p less than m and n: find the larg...

read more
Ans.

The method returns the least common multiple (LCM) of two numbers m and n.

  • The method uses prime factorization to find the LCM.

  • It iterates through all prime numbers less than m and n.

  • For each prime number, it finds the largest power of the prime that divides both m and n.

  • The method then multiplies the current LCM by the prime raised to the maximum power.

  • Finally, it returns the computed LCM.

Q3. Design an algorithm that, given a list of n elements in an array, finds all the elements that appear more than n/3 times in the list. The algorithm should run in linear time ( n >=0 ) You are expected to use co...

read more
Ans.

Algorithm to find elements appearing more than n/3 times in an array in linear time

  • Divide the array into three equal parts

  • Iterate through the array and count the occurrences of each element in each part

  • Check if the count of any element is greater than n/3

  • Return the elements that meet the condition

Q4. A triangle ABC is given, a line DE is paralel to base side and that cuts the triangle. The ratio of area of triangle to the area of trapezium .given DE/BC=3/5

Ans.

The question asks about the ratio of the area of a triangle to the area of a trapezium formed by a parallel line cutting the triangle.

  • The given line DE is parallel to the base side of triangle ABC.

  • The ratio of DE to BC is 3:5.

  • We need to find the ratio of the area of triangle ABC to the area of the trapezium formed by DE and the base side of the triangle.

Are these interview questions helpful?

Q5. struct s1 { struct { struct {int x;}s2}s3}y; How to access x? ANS: y.s3.s2.x

Ans.

To access x, use the following syntax: y.s3.s2.x

  • Accessing x requires navigating through the nested structures

  • Start with y, then access s3, followed by s2, and finally x

Q6. main() { printf(?as?); printf(?hi?); printf(?is ?); } wat will b printed. 10. main() { unsigned short a=-1; unsigned char b=a; printf(?%d %d ?,a,b); } wat is o/p of the program

Ans.

Answering two programming questions related to printf() function and data types.

  • In the first program, the output will be 'as hi is'.

  • In the second program, the output will be '-1 255'.

  • The first program uses printf() function to print three strings.

  • The second program demonstrates type conversion from unsigned short to unsigned char.

  • The value of -1 in unsigned short is converted to 255 in unsigned char.

Share interview questions and help millions of jobseekers 🌟

man-with-laptop

Q7. There are set of coins of {50,25,10,5,1} paise in a box.Write a program to find the number of ways a 1 rupee can be created by grouping the paise

Ans.

The program finds the number of ways to create 1 rupee using different coins.

  • Use a recursive function to iterate through all possible combinations of coins

  • Start with the largest coin and subtract its value from the target amount

  • Repeat the process with the remaining coins until the target amount becomes zero

  • Count the number of successful combinations

Q8. #define clrscr() 100 main() { clrscr(); printf(?%d?,clrscr()); }

Ans.

The code snippet defines a macro called clrscr() and then calls it in the main function.

  • The macro clrscr() is defined as 100, so when it is called, it will be replaced with 100.

  • The printf statement will print the value returned by clrscr(), which is 100.

  • The output of the code will be '100'.

Q9. Bridges are used in which layer?

Ans.

Bridges are used in the network layer of the OSI model.

  • Bridges are used to connect two or more network segments or LANs.

  • They operate at the data link layer (Layer 2) of the OSI model.

  • Bridges use MAC addresses to forward data packets between segments.

  • They can filter and forward network traffic based on MAC addresses.

  • Examples of bridges include Ethernet bridges and wireless bridges.

Q10. main() { int ret; ret=fork(); ret=fork(); ret=fork(); ret=fork(); if(!ret) printf(

Ans.

The code snippet demonstrates the use of the fork() function to create multiple child processes.

  • The fork() function is used to create a new process by duplicating the existing process.

  • Each time fork() is called, it creates a new child process that starts executing from the same point as the parent process.

  • In the given code, fork() is called four times, resulting in a total of 16 processes (including the original parent process).

  • The if(!ret) condition checks if the current pro...read more

Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories

Interview experiences of popular companies

4.1
 • 398 Interviews
View all

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary

Electronic Packaging Designer Interview Questions
Share an Interview
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter