Title:Problems faced by students in Placement Interviews.
Author: 1. Pankaj Kolekar-0222092
2.Kunal Kotigre-0222093
3.Pravin More-0222099.
Introduction:
Placement is a critical time for students as it marks the start of their professional careers. However, it can also be a stressful time, as students face a number of challenges. Some of the most common problems faced by students during placement include lack of preparation and poor communication skill. However, there are a number of things that students can do to overcome these challenges.
Objective:
To understand the underlying issues of “Problems faced by students in Placement Interviews”.
Literature Review:
An Overview of Service Placement Problem in Fog and Edge Computing:
Published in: ACM Computing Surveys May2021 Business Source Elite By: SALAHT, FARAH AIT DESPREZ FREDERIC,LEBRE, ADRIEN
To support the large and colorful operations generated by the Internet of effects( IoT), Fog Computing was introduced to round the Cloud Computing and offer Cloud- suchlike services at the edge of the network with low quiescence and real- time responses. Large- scale, geographical distribution, and diversity of edge computational bumps make service placement in similar structure a grueling issue. Diversity of stoner prospects and loT bias characteristics also complicate the deployment problem. This composition presents a check of current exploration conducted on Service Placement Problem( SPP) in the Fog/ Edge Computing. Grounded on a new bracket scheme, a categorization of current proffers is given and linked issues and challenges are bandied.
Genetic algorithms and greedy-randomized adaptive search procedure for router placement problem in wireless networks
By Sylejmani, Kadri Kadriu, Admir llazi, Endrit Krasniqi, Bujar Wireless networks are present in all the large structures or spots, and they’re anticipated to give high speed Internet for the connected druggies. This can be achieved by connecting wireless routers to the Internet backbone through fast connection lines(e.g. fiber optics), as well chancing optimal distribution of the routers along the structure, so that the targeted area is covered with Internet access as much as possible, handed that the cost constraints of routers and the cost of their collective connection are satisfied. thus, in this paper, we present two approaches for working the problem of router placement in a two- dimensional area, where the thing is to give optimal Internet content by meeting the cost constraints. Our first approach is grounded on inheritable Algorithms, and the alternate bone
Data Collection:
Based on the problem to understand the issue of Problem faced by students in Placement Interview following questions were asked using likert scale.
I get nervous during interview.
I am confident in my Communication skills.
I have lack of Confidence while talking.
I fumble while answering question.
I have good Confidence about my knowledge.
Data Analysis:
Mean
0.06
0.00
-0.13
-0.22
0.14
Standard Deviation
1.41
1.44
1.43
1.43
1.32
Standard Error
0.14
0.14
0.14
0.14
0.13
Z Value
0.42
0.00
-0.91
-1.54
1.06
Neutral
Neutral
Neutral
Neutral
Neutral
Conclusion
1 People are neutral towards feeling nervous in interview .
2.people are neutral towards their communication skills .
3 people are neutral towards their lack of confidence while talking .
4. People are neutral towards fumbling while answering
5. People are neutral towards having a good knowledge
Reference:
SALAHT, F. A.; DESPREZ, F.; LEBRE, A. An Overview of Service Placement Problem in Fog and Edge Computing. ACM Computing Surveys, [s. l.], v. 53, n. 3, p. 1–35, 2021. DOI 10.1145/3391196. Disponível em: https://research.ebsco.com/linkprocessor/plink?id=d2f88573-38f7-3e8d-8d41-844208e676c6. Acesso em: 9 ago. 2023.
SYLEJMANI, K. et al. Genetic algorithms and greedy-randomized adaptive search procedure for router placement problem in wireless networks. Journal of High Speed Networks, [s. l.], v. 25, n. 3, p. 273–300, 2019. DOI 10.3233/JHS-190616. Disponível em: https://research.ebsco.com/linkprocessor/plink?id=03968335-538d-3f1a-8f86-d11f55e58605. Acesso em: 9 ago. 2023.