A manager of a department at Google wants to schedule 15-min coffee chat between two employees every week for his 6 employees. Design and write a program to help this manager. • Each employee should have a meeting with a new person. So, no meeting with the same person until they meet all the other colleagues. • Use functional programming or object-oriented programing. • You can have your own design to cover the requirements but you should consider a design with better time complexity. • You can use any data structures (lists, dictionaries, stacks, queues, ...) • The number 6 here is an example and imaging there are "n" (an even number) employees in the group (for this example n =6) • Every week each employee should have a meeting and just one meeting with one person. • Every week they should have a meeting with a new person. • Until week 5 (n-1 weeks) they should have a meeting with the same person. employees = [employee_1, employee_2, employee 3, employee 4, employee_5, employee_6] For example for week 1: employee_1 & employee_2 will have a coffee meeting. employee_3 & employee_4 will have a coffee meeting. employee 5 & employee_6 will have a coffee meeting. Week 2: ... Week 3: ... Week 5:...
A manager of a department at Google wants to schedule 15-min coffee chat between two employees every week for his 6 employees. Design and write a program to help this manager. • Each employee should have a meeting with a new person. So, no meeting with the same person until they meet all the other colleagues. • Use functional programming or object-oriented programing. • You can have your own design to cover the requirements but you should consider a design with better time complexity. • You can use any data structures (lists, dictionaries, stacks, queues, ...) • The number 6 here is an example and imaging there are "n" (an even number) employees in the group (for this example n =6) • Every week each employee should have a meeting and just one meeting with one person. • Every week they should have a meeting with a new person. • Until week 5 (n-1 weeks) they should have a meeting with the same person. employees = [employee_1, employee_2, employee 3, employee 4, employee_5, employee_6] For example for week 1: employee_1 & employee_2 will have a coffee meeting. employee_3 & employee_4 will have a coffee meeting. employee 5 & employee_6 will have a coffee meeting. Week 2: ... Week 3: ... Week 5:...
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter2: Elements Of High-quality Programs
Section: Chapter Questions
Problem 9RQ
Related questions
Question
use python and fuctioncial
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage