Amcat Reports - AM Pool - Andhra PDF

4/27/2018 _corporate_2_pager.
html
Aspiring Minds Candidate Ability Report

Candidate's AMCAT Result Analysis
Name Nagasai Gayathri Gamini AMCAT ID 30002434252345

Residence City N.A., NA Date of Birth (Gender) 1997-08-12(YYYY-MM-DD) (Female)
College GUDLAVALLERU ENGINEERING COLLEGE,Gudivada. Degree (Stream) B.Tech/B.E. ()
Email ID gayathrigamini489@gmail.com Mobile No. 9581308835
Percentage Marks (Passing
Year) 10th- 9% (2012) 12th- 95% (2014) College - 92%(2018)
AMCAT Score Table

This sec on provides an overview of a candidate's performance in different sec ons of AMCAT. The score ranges from 100 to 900.
Na onal College AMCAT

Module Sub-Module Name, Grade [A: Good, B: Average, C: Needs Improvement]
Percen le Percen le Score
English Comprehension 89% 97% 595 Grammar A Vocabulary A Comprehension A
Quan ta ve Ability
83% 98% 605 Applied Mathema cs A Basic Mathema cs A Advanced Mathema cs A
(Advanced)
Logical Ability 65% 89% 505 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning B
WriteX NA NA NA NA
23 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 89% 98% 545 A Data Structures A Basic Programming A
Theory
Note: if score is -1 it means candidate has not a empted sufficient number of ques ons. While -2 means the candidate has not a empted the module.
DNC: Did Not Complete, DNA: Did Not A empt. NA: Not Applicable
Strengths and Weaknesses

This sec on enumerates the strong and weak areas of a candidate. The candidate can be further evaluated on these areas according to the job requirements by the
interviewer.
Strong Areas
Grammar
Vocabulary
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
OOP and Complexity Theory
Data Structures
Basic Programming
Note: if a module is not colored, it means either the candidate has not a empted sufficient number of ques ons or has not taken or a empted that module.
Personality Summary
The graph below shows the candidate's score in different personality traits (Extraversion, Conscien ousness, Emo onal Stability, Openness to experience,
Agreeableness) and Polychronicity of AMPI model. For each trait, Z-score is provided. Different dimensions of the candidate's job suitability have been highlighted,
along with his/her personality type.
JOB SUITABILITY
People Interac on interac o Trainability trainabilit
Self Drive
sDriveBar Repe ve Job Suitability sDriveBar
PERSONALITY TYPE
Note: Low - , Medium = , High +
Idealist
Automata Details
Total Problems Total Time
2 75 mins
Total Score
The candidate has a empted all problems in the test.None of his/her a empted codes have passed their respec ve test suites completely
23 out of 100
However, on an average, his/her codes which fail the test suite posses basic structures required to solve the problem.
Addi onally, the candidate has wri en code that is poorly forma ed and contains redundant/use of improper coding constructs
file:///C:/Users/Shreya/AppData/Local/Temp/Rar$EXa0.210/tmp_wf/2018_04_27_17_09_44/corp_2_pager_reports/_corporate_2_pager.html 1/20
4/27/2018 _corporate_2_pager.html
Problem 1
Check the state of cells a er a given number of days where a cell is represented by an 8 element integer array.
Each cell state changes every day depending on its adjacent cells.
Input: cells-> 8 element integer array represen ng cells in ini al state, days-> integer number of days. Language : C
Output: 8 element integer array represen ng cells a er given number of days.
Note: A more detailed problem statement is shown to the candidates.
Scores
Func onal correctness 1/5 Programming Ability 3/5
Source code does not pass any basic test cases Basic program structure is consistent
It is either due to incorrect logic or it may have run me errors. Some advanced or edge cases may randomly pass. Right control structures exist with few/par ally correct data-dependencies.
Run me Complexity Score N.A. Programming Prac ces N.A.
Run me complexity score can not be generated Programming prac ces score can not be generated
This is because the source code failed to pass all test cases in the test suite. This is because source code has syntax/ run me errors and is unparseable or the source code does not meet the
minimum code-length specifica ons.
Candidate Source Code Results
Final Code Submi ed Code Execu on Summary
Code Compila on : Run me Error

1. // INCLUDE HEADER FILES NEEDED BY YOUR PROGRAM Compiler Warnings Generated : N.A.
2. // SOME LIBRARY FUNCTIONALITY MAY BE RESTRICTED Test Cases Passed : N.A.
3. // DEFINE ANY FUNCTION NEEDED
4. // FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED
5. int* cellCompete(int* cells, int days) Errors Generated
6. {
7. int temp[8],g=1,k,cells1[8],i; Uncaught Excep on in Output.
8. for(k=0;k<8;k++)
9. { Test Case Execu on Results
10. cells1[i]=cells[i];
11. temp[i]=cells[i]; Basic N.A.
12. } They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
13. while(g<=days) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. { Advanced N.A.
15. for(i=0;i<8;i++) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. { implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. if(i==0 && i==7) Edge N.A.
18. {
They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
19. cells1[i]=0;
20. } Total (Cases Passed/ Total Cases) N.A.
21. else if(temp[i-1]==cells1[i+1] && i!=0 && i!=7)
22. { Structural Vulnerabili es and Errors
23. cells1[i]=0;
24. } N.A.
25. else
26. { Average-Case Time Complexity Detected
27. cells1[i]=1;
28. } The complexity informa on cannot be generated.
29. }
The submi ed source code is incorrect and failed to execute.
30. days=days+1;
31. }
This problem can be ideally solved in O(N) me
32. return cells1[8];
33. }
*N represents the number of days
34. // FUNCTION SIGNATURE ENDS
*Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
complexity is measured here using the Big-O asympto c nota on.
*This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
It has been benchmarked across problems.
Execu on Sta s cs
Time taken to submit (hr:min:sec) : 00:39:09

Number of compiles a empts made : 26
Number of compila on a empts witnessing a successful compile : 0
Number of compile a empts witnessing a me-out : 0
Number of compile a empts witnessing run me errors : 0
Avg. no. of cases passed in each compile : 0%
Avg. me taken between each compile (hr:min:sec) : 00:01:30
Problem 2
Given a two-dimensional maze matrix, find out if a path exists to 9 from top-le corner where the path consists of 1s.
Input: grid-> two-dimensional array for maze matrix, m,n-> dimensions of the matrix Language : C
Output: Integer value 1 if a path exists, 0 if it does not.
Scores
Func onal correctness 1.3/5 Programming Ability 1/5
Par ally correct basic func onality Code unrelated to given problem
Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Seemingly unrelated to the problem at hand.
pass.
Run me Complexity Score 0/3 Programming Prac ces 1/4
Run me complexity score can not be generated Low readability, Low on program structure
This is because the source code failed to pass all test cases in the test suite. The source code is poorly forma ed and contains redundant/use of improper coding constructs.
Code Compila on : Pass

1. // INCLUDE HEADER FILES NEEDED BY YOUR PROGRAM Compiler Warnings Generated : No
2. // SOME LIBRARY FUNCTIONALITY MAY BE RESTRICTED Test Cases Passed : 18.8%
5. int isPath(int **grid, int m, int n) Warnings Generated
6. {
7. int i,j,h=0,count=0,k=0; None
8. for(i=0;i<m;i++)
10. for(j=0;j<n;j++)
11. { Basic 28.6%
12. if(grid[i][j]==0 && count==0) They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
13. { and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. h=0; Advanced 0%
15. k=1; They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. break; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. } Edge 100%
18. else if(grid[i][j]==9 )
19. {
20. h=1; Total 18.8%
21. count=count+1;
22. } Structural Vulnerabili es and Errors
23. }
24. if(k==1) Readability & Language Best Prac ces
25. { Line No7,7,7...: Variables are given very short name. (4)
26. break;
27. } Performance & Correctness
28. } Line No18...: Use of hardcoded values must be avoided. (1)
29. return h;
30. }
31. // FUNCTION SIGNATURE ENDS Average-Case Time Complexity Detected
The complexity informa on cannot be generated.

This problem can be ideally solved in O(N2) me
*N represents the number of rows/columns of the input grid
Execu on Sta s cs

Avg. no. of cases passed in each compile : 1.2 %
WriteX
Problem Statement - The candidate's essay on the topic 'Life in a big city is fast, full of hustle and bustle, whereas in a small city it’s slow and calm.' is given below:
Answer Comment
Staying in a big city leads to a be er life. In a small town, there won't be any opurtuni es much. And there won't be any Write your comments below
oppurtuni es to develop ourselves. while coming to big city, there will be many oppurtuni es to develop ourselves in any
streams like internet facility, and we can up to date on all the current affairs like scien fic inven ons, industrial changes and
so on.In ci es, there are so many facili es like hospitals, banks, schools.
In small towns, the hospitals which are present does not sa sfies all the pa ent's requirements because lack of equipment
and the surgeons whose belongs to all streams, does not available. while the hospitals in the ci es sa sfies all the needs and
requirements of the pa ent.. And all surgeons are available so that the pa ent can be operated by a specialised surgeon.
The educa on which is provided to the students is not sufficient and efficient because of lack of appropriate schools and
colleges. So that the students can't be provided w h well knowledge. While in ci es,the educa on which is provide is
efficient when compared with it by schools and colleges in small towns. The student will be provided with good knowledge
with the appropriate taken methods like Smart Educa on . And anyone can learn anything by their own.
The ci es will be clean and green.While the towns will not be clean and hygiene, so that the people's health will be spoiled
and harmful disease may be effected and even leads to death.In ci es many programs like"swatch Bharath" programs will
be implemented for people's health.
In ci es the job facili es will be more when compared to towns life because oppurtuni es are more.And the pr
Interviewer Feedback
Based upon the observa ons made and the candidate's interview and qualifica on, here you can comment whether you think the person should be further
considered for this posi on or not. Tick any one box for each area, on the basis of your opinion.
DIFFERENT AREAS OVERALL EVALUATION

Areas Good Average Not Acceptable Performance Tick any One
Communica on Skills Excellent
Problem Solving Good
Job Specific Skills Average
Experience Below Average
Overall Personality Poor
Final Decision : Hired Rejected On hold
Comments :

Name Lavanya Mutyala AMCAT ID 30002434285531

Email ID lavanyamutyala2005@gmail.com Mobile No. 8184878919
AMCAT Score Table


English Comprehension 64% 85% 510 Grammar A Vocabulary B Comprehension A
Quan ta ve Ability
76% 96% 575 Basic Mathema cs A Applied Mathema cs B Advanced Mathema cs A
(Advanced)
Logical Ability 52% 77% 470 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning B
WriteX NA NA NA NA
Electronics and Semiconductors and
72% 68% 356 Digital Electronics C Analog Electronics A A
Semiconductor Engineering Semiconductor Devices
Opera ng System &
Computer Science 68% 76% 438 A Computer Networks A DBMS C
Computer Architecture

interviewer.
Strong Areas Weak Areas

Grammar Digital Electronics
Comprehension DBMS
Basic Mathema cs
Advanced Mathema cs
Analog Electronics
Semiconductors and Semiconductor
Devices
Opera ng System & Computer
Architecture
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
WriteX
Answer Comment
I like living in any place when the situa on demands.But I feel very comfortable in living in a town.As there is Write your comments below
so peacefull atmosphere in towns when compared to ci es, I feel so pleasant in towns.As my na ve place is also a
town, I have lead my life so far with so much comfort. As with rapid technological advancement, there are so many
facili es available in town as in a city.
"villages are the backbones of a country"- said MAHAMATMA GANDHI.I found that there are so many things in
and around our towns that we have to learn from surroundings.There are so many things which have to be u lized
in a proper way in towns to make a country to be developed.
But there is "TWO SIDES OF A COIN".Even though ,the towns are pleasant but there are so many facili es in
ci es such as hospitals,colleges,museums,science fairs,zoo etc when compared to towns.In towns even though there
is lot of technology ,I think it is not at all u lizing in a proper way.The people in ci es will do anything as a duty
but not as a responsible person of a planet.
Even though there are many luxories in ci es they must be useful for the development of future
genera ons but not for their destruc on. There are many great persons who deserves a great respect in world ,
have told the importance of towns .EX-Vivekananda, Kalam..So where ever you i

Comments :

Name Sirichand Kuragan AMCAT ID 30002434752031

Residence City N.A., NA Date of Birth (Gender) 1997-06-09(YYYY-MM-DD) (Male)
Email ID sirichand774@gmail.com Mobile No. 9492315204
AMCAT Score Table


Quan ta ve Ability
80% 97% 590 Basic Mathema cs A Advanced Mathema cs A Applied Mathema cs B
(Advanced)
WriteX NA NA NA NA
0 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 32% 33% 345 C Basic Programming C Data Structures A
Theory
Opera ng System &
Computer Science 49% 51% 377 A Computer Networks B DBMS C

interviewer.

Grammar OOP and Complexity Theory
Comprehension Basic Programming
Basic Mathema cs DBMS
Advanced Mathema cs
Data Structures
Architecture
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
0 out of 100
The candidate has a empted all problems in the testAll of his/her a empted codes failed to compile.
Problem 1
Given the maximum size of the cache and a list of integers (to request from the cache), calculate the number of cache misses using the LRU cache algorithm. A cache
miss occurs when the requested integer does not exist in the cache. Ini ally, the cache is empty.
Input: max_cache_size-> maximum size of the cache, pages-> an integer array for page requests, len-> length of array pages. Language : C
Output: An integer for the the number of cache misses which is calculated using LRU (least recent used) algorithm.
Scores
Func onal correctness N.A. Programming Ability N.A.
Syntac cally incorrect code Programming ability score can not be generated
The source code has syntax errors in it. This is because source code has syntax/ run me errors and is unparseable.
Code Compila on : Compila on Error

5. int lruCountMiss(int max_cache_size, int *pages, int len) Errors Generated
^--^--^--^-- warning: unused parameter 'len'
6. { : In func on 'lruCountMiss':
7. // WRITE YOUR CODE HERE :5: warning: unused parameter 'max_cache_size'
8. :5: warning: unused parameter 'pages'
9. } :5: warning: unused parameter 'len'
^--^--^--^-- error: control reaches end of non-void func on :9: error: control reaches end of non-void func on
Test Case Execu on Results
Basic N.A.
They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
and do not reveal situa ons which need extra checks/handles to be placed on the logic.
Advanced N.A.
They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
Edge N.A.
Total (Cases Passed/ Total Cases) N.A.
Structural Vulnerabili es and Errors
N.A.
Average-Case Time Complexity Detected

*N represents the number of requested page references
Execu on Sta s cs

Number of compiles a empts made :1
Number of compila on a empts witnessing a successful compile :0
Problem 2
Check if a given string contains balanced sequence of parentheses.
Input: str ->string of characters which can be either "(" or ")". Language : C
Output: Count of balanced pairs if the sequence is balanced or -1 otherwise.
Scores

1. #include<stdio.h> Compiler Warnings Generated : N.A.
2. #include<conio.h> Test Cases Passed : N.A.
3. #include<string.h>
4. void main()
Errors Generated
^--^--^--^-- warning: return type of 'main' is not 'int'
5. {
6. int set,count=1,i; :4: warning: return type of 'main' is not 'int'
7. for(i=1;i<n;i++)
8. scanf("%s",&n); Test Case Execu on Results
9. if(n="("&&n"")"")
10. prin ("%d&n) Basic N.A.
11. count++ They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
12. and do not reveal situa ons which need extra checks/handles to be placed on the logic.
13. Advanced N.A.
14. They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
15. prin ("%d",&count); implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
16. } Edge N.A.
N.A.

*N represents the number of parentheses characters in the input sequence
Execu on Sta s cs

WriteX
Problem Statement - The candidate's essay on the topic 'Technology has significantly increased the average age of human beings.' is given below:
Answer Comment
Modern technology led to many siginificant changes in life style and livelihood of human beings.With the advent of many Write your comments below
innova ve innova ons,all the complica ons in human surviaval are more reduced.It can be simplified as technology acts as a
virtual helping hand for human beings in accomplishing day-to-day tasks.
For every technological inven on,there is a decrease in human interpreta on in that par cular field.This possibly made
many living habits and environmental changes.Technology too have a effect on average lifespan of human beings.With less
effort,manpower and stress many difficult tasks can be done with the technology available.Overall it decreases the man
hours required for doing par cular job in par cular field like medicine,commerce,business,manufacturing etc and the work
product is too efficient.
Consider the examples of technological advancements like portable computer i.e laptop which helps in off-duty works
and jet planes which typically reduces long distances etc.If there no machines used in manufacturing industries like
cars,cellphones,the final product will not be enough to the growing popula on and their demands.Along with working hours
employees are being forced to do extra hours to meet their product needs which has drama c effect on health,hygiene and
lifespan of the people.
Many manufacturing companies,business people and IT industries are trying to provide a friendly environment to their
employees to get the maximum extent of output from them by crea ng various programs. With some excep ons in certain
fields,all these machines,gadgets,devices and other things will definitely increase the average age of human beings.

Comments :

Name Teja Krishna Kunapareddy AMCAT ID 30002434814070

Email ID tejakrishnakunapareddy@gmail.com Mobile No. 9502380569
AMCAT Score Table


English Comprehension 64% 85% 510 Grammar B Vocabulary A Comprehension A
Quan ta ve Ability
67% 91% 545 Basic Mathema cs A Applied Mathema cs B Advanced Mathema cs B
(Advanced)
Logical Ability 52% 77% 470 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning C
WriteX NA NA NA NA
26 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 62% 78% 435 Data Structures B Basic Programming A B
Theory
Opera ng System &
Computer Science 68% 76% 438 A Computer Networks A DBMS C

interviewer.

Vocabulary Abduc ve Reasoning
Comprehension DBMS
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Basic Programming
Architecture
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
The candidate has a empted all problems in the test.None of his/her a empted codes have passed their respec ve test suites completely. 26 out of 100
Addi onally, the candidate has wri en code that does not follow best prac ces in its forma ng and may contain a few redundant/improper coding constructs
Problem 1
Scores
Par ally correct basic func onality Emerging basic structure

Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Appropriate keywords and tokens present, showing some understanding of a part of the problem.
pass.
Run me complexity score can not be generated High readability, Low on program structure
This is because the source code failed to pass all test cases in the test suite. The source code contains redundant/improper coding constructs and a few readability and forma ng issues.

1. #include<stdio.h> Compiler Warnings Generated : No
2. #include<conio.h> Test Cases Passed : 21.4%
3. int main()
4. {
5. int i,a[8]; Warnings Generated
6. }
7. int* cellCompete(int* cells, int days) None
8. { int i;
9. prin ("enter the cells"); Test Case Execu on Results
10. for(i=1;i<=8;i++)
11. { Basic 12.5%
12. scanf("%d",&cells[i]); They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
13. } and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. scanf("%d",&days); Advanced 0%
15. if(cells[2]==0) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
17. cells[1]=0; Edge 100%
18. }
19. else
20. { Total 21.4%
21. cells[1]=1;
23. if(cells[7]==0)
24. { Performance & Correctness
25. cells[8]=0; Line No7,29: Use of hardcoded values must be avoided.
26. }
27. else
29. cells[8]=1;
31.
32. for(i=2;i<=7;i++)
33. {
34. if((cells[i-1]==0 && cells[i+1]==0)||(cells[i-1]==1 && cells[i+1]==1))
35. cells[i]=0;
36. else
37. cells[i]=1; *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
38. } complexity is measured here using the Big-O asympto c nota on.
39. return &cells[1]; *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
40. It has been benchmarked across problems.
41. }
Execu on Sta s cs

Problem 2
Scores
Source code does not pass any basic test cases Code unrelated to given problem
It is either due to incorrect logic or it may have run me errors. Some advanced or edge cases may randomly pass. Seemingly unrelated to the problem at hand.
Run me complexity score can not be generated High readability, High on program structure
This is because the source code failed to pass all test cases in the test suite. The source code is readable and does not consist of any significant redundant/improper coding constructs.

2. // SOME LIBRARY FUNCTIONALITY MAY BE RESTRICTED Test Cases Passed : 0%
5. int isPath(int **grid, int m, int n) Warnings Generated
6. {int i,j;
7. scanf("%d%d",&m,&n); None
8. for(i=0;i<m;i++)
9. for(j=0;j<n;j++) Test Case Execu on Results
10. scanf("%d",&grid[i][j]);
11. return 1; Basic 0%
13. // FUNCTION SIGNATURE ENDS and do not reveal situa ons which need extra checks/handles to be placed on the logic.
Advanced 0%
Edge 0%
Total 0%
N.A.

Execu on Sta s cs

WriteX
Answer Comment
Without any issues, people say life in big city is be er than in a small town. But, somewhat few peple Write your comments below
are managed to explain life is be er in small town compared to in a big city. Everyone's have their own views, we cant judge
people right or wrong by our own concern. Some like to live in beteween big buildings, advance technology. They want to be
highly civialized and modernized. Just assume, a life in between modernized people, can get everthing in our doorstep, every
thing we want be available, haves a good transport, a good cosmopoli an life, say people who rejects this. Every one wants
comfortable life, every one striving hard form morning to evening to be and wants his family in a comfortable zone.There is
no need to send our children to another town for school, no need for our ladies to travel long distances for vegetables, daily
needs. But not only we construc ng big walls in between buildings but also in between each and every person. As the walls
increases the distance between people is increasing. Each one is living like an independent man, without concerned with
society. But coming to the small towns, life is in between the people, every neighbour is like our rela ve. Every one concerns
about us. They would be our side when we were in need. Though we are travelling distances for our needs, like sending our
children to other towns, moving distances foe needs, we could be live together. Life will not be happier, i

Comments :

Name Jyothisree Bhima AMCAT ID 30002434840663

Email ID jyothisreebhima96@gmail.com Mobile No. 9705810678
AMCAT Score Table


Quan ta ve Ability
97% 99% 710 Basic Mathema cs A Advanced Mathema cs A Applied Mathema cs A
(Advanced)
Logical Ability 67% 90% 510 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning A
WriteX NA NA NA NA
25 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 82% 93% 505 B Data Structures A Basic Programming A
Theory
Opera ng System &
Computer Science 97% 100% 623 DBMS A A Computer Networks A

interviewer.
Strong Areas
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Abduc ve Reasoning
Data Structures
Basic Programming
DBMS
Opera ng System & Computer Architecture
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
25 out of 100
Problem 1
Given a pointer to any one node in a sorted circular linked list, insert a given number such that the linked list remains sorted.
Input: start-> any node in sorted circular linked list, n-> number to be inserted.
Output: A pointer to the newly inserted node.
Language : C
Scores

2. #include<stdio.h> Test Cases Passed : N.A.
3. // SOME LIBRARY FUNCTIONALITY MAY BE RESTRICTED
5. // cnode STRUCTURE IS DEFINED BY DEFAULT Errors Generated
7. cnode* insertSortedList(cnode* start, int n) : In func on 'insertSortedList':
^--^--^--^-- warning: unused parameter 'n' :7: warning: unused parameter 'start'
8. { :7: warning: unused parameter 'n'
9. // WRITE YOUR CODE HERE :12: error: control reaches end of non-void func on
10.
11. Test Case Execu on Results
12. }
^--^--^--^-- error: control reaches end of non-void func on Basic N.A.
13. // FUNCTION SIGNATURE ENDS They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
Advanced N.A.
Edge N.A.
N.A.

*N represents the number of elements in the input linked list
Execu on Sta s cs

Problem 2
Scores
Par ally correct basic func onality Basic program structure is consistent
Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Right control structures exist with few/par ally correct data-dependencies.
pass.
Run me complexity score can not be generated Low readability, High on program structure
This is because the source code failed to pass all test cases in the test suite. The source code does not follow best prac ces in its forma ng and may contain a few redundant/improper
coding constructs.

5. int lruCountMiss(int max_cache_size, int *pages, int len) Warnings Generated
6. {
7. // WRITE YOUR CODE HERE None
8. int a[100],i=0,k,j=0,l=0,count=0,flag=0,flag1=0,rec[100];
9. for(k=0;k<max_cache_size;k++) Test Case Execu on Results
10. {
11. rec[k]=0; Basic 35.7%
12. a[k]=1000; They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
14. while(i<len) Advanced 0%
15. { They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. for(k=0;k<max_cache_size;k++) implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. if(pages[i]==a[k]) Edge 100%
18. flag=1;
19. if(flag==1)
20. { Total 37.5%
21. rec[k]=0;
22. i++; Structural Vulnerabili es and Errors
23. }
24. else Readability & Language Best Prac ces
25. { Line No8,8,8...: Variables are given very short name. (5)
26. for(j=0;j<max_cache_size;j++) Line No47,48: Avoid crea ng deeply nested if-then statements since they are harder to read and error-prone to
27. { maintain.
28. if(a[j]==1000) Line No8,46,48...: iden fier should not be composed of only 'l' and 'O' (5)
29. {
30. flag1=1;
31. break; Average-Case Time Complexity Detected
32. }
33. The complexity informa on cannot be generated.
34. } The submi ed source code is incorrect and failed to execute.
35. if(flag1==1)
36. { This problem can be ideally solved in O(N) me
37. a[j]=pages[i];
38. i++; *N represents the number of requested page references
39. rec[j]=0;
40. count++; *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
42. else It has been benchmarked across problems.
43. {
44. for(k=0;k<max_cache_size;k++)
Execu on Sta s cs
45. {
46. if(rec[l]<rec[k])
47. { Time taken to submit (hr:min:sec) : 01:06:49
48. l=k; Number of compiles a empts made :8
49. }
50. } Number of compila on a empts witnessing a successful compile : 6
51. a[l]=pages[i]; Number of compile a empts witnessing a me-out : 0
52. rec[l]=0;
53. i++;
54. count++; Avg. no. of cases passed in each compile : 0%
55. } Avg. me taken between each compile (hr:min:sec) : 00:08:21
56.
57. }
58. for(k=0;k<max_cache_size;k++)
59. rec[k]++;
60.
61.
62. }
63. return count;
64. }
WriteX
Problem Statement - The candidate's essay on the topic 'Technology has significantly increased the average age of human beings.' is given below:
Answer Comment
I agree with this statement only in some contexts. The reason for agreeing with the statement is that Write your comments below
the heavy equipment with advanced technology are using in hospitals to treat the pa ents. With that equipment, the life of
the pa ent can be saved. So that some lives are saved and some other pa ents living me can be increased. As a result the
average age of human beings has a significant increase.
But most of the cases, I disagree with the statement. Because, technology was developing enormously so the
work that has done by the human being has been decreased. For example, to on or off the switch, we are using remotes. So
that human body addict for not doing a work. Hence, so many diseases are facing by human beings. So that average age of
human beings has been decreased. If we use technology in a proper way, the average age of human being will not be
decreased. To live healthily, one should do excercise. Due to this technology, the human being is not doing his basic works.
So lack of proper excercise, his muscles may not work a er some years. So I disagree with the above statement. We can use
the technology in many ways, but if we use it for small things average age of human being definitely decreased.
So finally technolgy can increas average of human beings in one

Comments :

Name Nikhat Tabassum AMCAT ID 30004132812798

College Sri Vasavi Ins tute of Engineering and Technology,Pedana. Degree (Stream) B.Tech/B.E. ()
Email ID nikha abassum96@gmail.com Mobile No. 7674816930
AMCAT Score Table


English Comprehension 83% 0NA 570 Grammar A Vocabulary A Comprehension A
Quan ta ve Ability
76% 0NA 575 Basic Mathema cs A Applied Mathema cs A Advanced Mathema cs A
(Advanced)
Logical Ability 67% 0NA 510 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning B
OOP and Complexity
Computer Programming 88% 0NA 535 Basic Programming A Data Structures A A
Theory
Opera ng System &
Computer Science 59% 0NA 408 A Computer Networks B DBMS C

interviewer.

Grammar DBMS
Vocabulary
Comprehension
Basic Mathema cs
Applied Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Basic Programming
Data Structures
Architecture
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Naveena Gooty AMCAT ID 30004174258040

MOTHER THERESA INSTITUTE OF ENGINEERING AND
College Degree (Stream) B.Tech/B.E. ()
TECHNOLOGY,Palmaneru.
Email ID gnaveena0397@gmail.com Mobile No. 9133847456
AMCAT Score Table


Quan ta ve Ability
38% 85% 460 Applied Mathema cs C Basic Mathema cs B Advanced Mathema cs B
(Advanced)
Logical Ability 81% 97% 555 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning A
OOP and Complexity
Computer Programming 62% 87% 435 Data Structures A A Basic Programming B
Theory
Opera ng System &
Computer Science 49% 68% 377 B DBMS A Computer Networks C

interviewer.

Grammar Applied Mathema cs
Vocabulary Computer Networks
Comprehension
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer

Comments :

Name Karumanchi Sai Lakshmi Madhurima AMCAT ID 30004257662399

College PACE Ins tute Of Technology,Ongole. Degree (Stream) B.Tech/B.E. ()
Email ID madhurimakarumanchi@gmail.com Mobile No. 9908073451
AMCAT Score Table


Quan ta ve Ability
83% 99% 605 Basic Mathema cs A Applied Mathema cs A Advanced Mathema cs A
(Advanced)
Logical Ability 67% 93% 510 Induc ve Reasoning A Deduc ve Reasoning C Abduc ve Reasoning A
Telecommunica ons
19% 18% 260 Communica on C Microwave Engineering C Electromagne sm C
Engineering
Opera ng System &
Computer Science 7% 2% 192 DBMS C Computer Networks C C

interviewer.

Grammar Deduc ve Reasoning
Comprehension Communica on
Basic Mathema cs Microwave Engineering
Applied Mathema cs Electromagne sm
Advanced Mathema cs DBMS
Induc ve Reasoning Computer Networks
Abduc ve Reasoning Opera ng System & Computer
Architecture
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Vamsi Krishna Muddada AMCAT ID 30005314211802

College GMR Ins tute of Technology,Srikakulam. Degree (Stream) B.Tech/B.E. ()
Email ID krishnavamsi631@gmail.com Mobile No. 8297720207
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 71% 78% 520 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning A
Fundamentals of Electrical Instrumenta on and
Electrical Engineering 93% 93% 548 A Electronics A A
Engineering Control
Opera ng System &
Computer Science 39% 46% 346 A Computer Networks C DBMS C

interviewer.

Grammar Computer Networks
Comprehension DBMS
Basic Mathema cs
Applied Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Abduc ve Reasoning
Fundamentals of Electrical
Engineering
Electronics
Instrumenta on and Control
Architecture
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name kiran kumar bobbili AMCAT ID 30005388696919

Residence City Srikakulam, NA Date of Birth (Gender) 1995-10-26(YYYY-MM-DD) (Male)
Gayathri Vidya Parishad College Of
Engineering,VISAKHAPATNAM.
Email ID kirankumarbobbili1212@gmail.com Mobile No. 8977369196
AMCAT Score Table


English Comprehension 83% 0NA 570 Vocabulary B Grammar A Comprehension A
Quan ta ve Ability
99% 0NA 785 Basic Mathema cs A Advanced Mathema cs A Applied Mathema cs A
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 68% 0NA 438 B DBMS A Computer Networks C

interviewer.

Basic Programming Computer Networks
Data Structures
Grammar
Comprehension
DBMS
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver

Comments :

Name M.Gnanadeep AMCAT ID 30005742108425

Residence City Rajam, NA Date of Birth (Gender) 1997-06-04(YYYY-MM-DD) (Male)
College GMR Ins tute of Technology,Srikakulam. Degree (Stream) B.Tech/B.E. ()
Email ID Deepu.malla@gmail.com Mobile No. 7330816588
AMCAT Score Table


English Comprehension 95% 0NA 640 Vocabulary A Grammar A Comprehension A
Quan ta ve Ability
(Advanced)
Logical Ability 92% 0NA 605 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning A
OOP and Complexity
Computer Programming 77% 0NA 485 Basic Programming A Data Structures A B
Theory
Electrical Engineering 100% 0NA 708 A A Electronics A
Engineering Control

interviewer.
Strong Areas
Basic Programming
Data Structures
Fundamentals of Electrical Engineering
Instrumenta on and Control
Electronics
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker


Comments :

Name Grandhi Sai Srinivasa Gupta AMCAT ID 30005781124676

Residence City Hyderabad, NA Date of Birth (Gender) 1997-06-20(YYYY-MM-DD) (Male)
College LAKI REDDY BALI REDDY COLLEGE OF ENGG.,Mylavaram. Degree (Stream) B.Tech/B.E. ()
Email ID saigupta577@gmail.com Mobile No. 9032881605
AMCAT Score Table


English Comprehension 60% 0NA 500 Vocabulary B Grammar C Comprehension A
Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 100% 0NA 715 C DBMS A Computer Networks A

interviewer.

Basic Programming Grammar
Data Structures Opera ng System & Computer
OOP and Complexity Theory Architecture
Comprehension
DBMS
Computer Networks
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Kanaka Raju Desamse AMCAT ID 30005828115199

Email ID dk.raja6666@gmail.com Mobile No. 8897526751
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 93% 93% 575 Data Structures A A Basic Programming A
Theory
Opera ng System &
Computer Science 68% 71% 438 A DBMS A Computer Networks C

interviewer.

Vocabulary
Comprehension
Basic Mathema cs
Advanced Mathema cs
Data Structures
Basic Programming
Architecture
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Vasamse Sai Sree Madhusudhan Rao AMCAT ID 30005828314367

Email ID vssmsrrjy@gmail.com Mobile No. 8790717338
AMCAT Score Table


Quan ta ve Ability
48% 41% 490 Basic Mathema cs A Advanced Mathema cs C Applied Mathema cs B
(Advanced)
OOP and Complexity
Computer Programming 71% 59% 465 Data Structures B A Basic Programming A
Theory
Telecommunica ons
97% 94% 484 Communica on A Microwave Engineering C Electromagne sm A
Engineering

interviewer.

Grammar Advanced Mathema cs
Vocabulary Microwave Engineering
Comprehension
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Communica on
Electromagne sm
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist

Comments :

Name Jhansi Vipulasri Chodise AMCAT ID 30005828504254

Email ID jhansivipulasri@gmail.com Mobile No. 7660045455
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 74% 72% 530 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning B
OOP and Complexity
Computer Programming 71% 59% 465 A Data Structures B Basic Programming A
Theory
Opera ng System &
Computer Science 30% 23% 315 C Computer Networks C DBMS B

interviewer.

Grammar Opera ng System & Computer
Vocabulary Architecture
Comprehension Computer Networks
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer

Comments :

Name Krishna Chaitanya Pullela AMCAT ID 30005828534271

Email ID chay16089@gmail.com Mobile No. 7674022526
AMCAT Score Table


English Comprehension 60% 58% 500 Grammar B Vocabulary A Comprehension B
Quan ta ve Ability
(Advanced)
Logical Ability 58% 48% 485 Induc ve Reasoning B Deduc ve Reasoning A Abduc ve Reasoning C
Electronics and Semiconductor Semiconductors and
72% 56% 356 Digital Electronics A Analog Electronics C A
Engineering Semiconductor Devices
Telecommunica ons
Engineering

interviewer.

Vocabulary Abduc ve Reasoning
Basic Mathema cs Analog Electronics
Advanced Mathema cs Communica on
Deduc ve Reasoning Microwave Engineering
Digital Electronics Electromagne sm
Devices
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector

Comments :

Name Nagineni Vidya Bharathi AMCAT ID 30005828841694

Email ID vbnagineni4d7@gmail.com Mobile No. 7032342623
AMCAT Score Table


Quan ta ve Ability
97% 93% 710 Applied Mathema cs A Advanced Mathema cs A Basic Mathema cs A
(Advanced)
92% 82% 420 Digital Electronics B A Analog Electronics A
Telecommunica ons
5% 4% 196 Electromagne sm C Communica on C Microwave Engineering C
Engineering
Not
Electrical Engineering NA 0 NA
A empted.

interviewer.

Grammar Electromagne sm
Vocabulary Communica on
Comprehension Microwave Engineering
Applied Mathema cs
Advanced Mathema cs
Basic Mathema cs
Abduc ve Reasoning
Devices
Analog Electronics
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Nurturer

Comments :

Name Jeevana Satya Sai Amba AMCAT ID 30006284392162

Residence City Machilipatnam, NA Date of Birth (Gender) 1997-06-23(YYYY-MM-DD) (Male)
College D.M.S. S.V.H. College of Engineering,Krishna. Degree (Stream) B.Tech/B.E. ()
Email ID jeevan.amba @gmail.com Mobile No. 7095027900
AMCAT Score Table


Quan ta ve Ability
76% 0NA 575 Basic Mathema cs A Advanced Mathema cs A Applied Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 22% 0NA 285 C DBMS C Computer Networks B

interviewer.

Basic Programming Opera ng System & Computer
Data Structures Architecture
OOP and Complexity Theory DBMS
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Execu ve


Comments :

Name Eeda Rajesh AMCAT ID 30006284670151

Residence City Nazvidu, NA Date of Birth (Gender) 1997-04-05(YYYY-MM-DD) (Male)
College LAKI REDDY BALI REDDY COLLEGE OF ENGG.,Mylavaram. Degree (Stream) B.Tech/B.E. ()
Email ID rajesheeda1234@gmail.com Mobile No. 9494762558
AMCAT Score Table


Quan ta ve Ability
71% 0NA 560 Basic Mathema cs B Advanced Mathema cs A Applied Mathema cs A
(Advanced)
Logical Ability 52% 0NA 470 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning B
OOP and Complexity
Theory
Opera ng System &
Computer Science 68% 0NA 438 A DBMS C Computer Networks B

interviewer.

Basic Programming DBMS
Data Structures
Vocabulary
Grammar
Comprehension
Architecture
Advanced Mathema cs
Applied Mathema cs
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Scien st


Comments :

Name Samhitha Chimalamarri AMCAT ID 30006284734778

Residence City Guntur, NA Date of Birth (Gender) 1997-03-18(YYYY-MM-DD) (Female)
College Vasireddy Venkatadri Ins tute of Technology,Guntur. Degree (Stream) B.Tech/B.E. ()
Email ID samhithasharma567@gmail.com Mobile No. 9908870380
AMCAT Score Table


Quan ta ve Ability
64% 0NA 535 Basic Mathema cs A Advanced Mathema cs B Applied Mathema cs A
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 59% 0NA 408 A DBMS B Computer Networks C

interviewer.

Data Structures
Vocabulary
Grammar
Comprehension
Architecture
Basic Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Maheswari Ramamurthy AMCAT ID 30006538604155

College Srinivasa Ramanujan Ins tute of Technology,Anantapur. Degree (Stream) B.Tech/B.E. ()
Email ID mashwri@gmail.com Mobile No. 9550549225
AMCAT Score Table


Quan ta ve Ability
54% 77% 505 Basic Mathema cs B Applied Mathema cs B Advanced Mathema cs B
(Advanced)
Logical Ability 74% 84% 530 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning C
Mo va on Evalua on Test 100% 30% 100 NA
57% 66% 324 Analog Electronics B Digital Electronics A C
OOP and Complexity
Computer Programming 29% 36% 335 Data Structures C C Basic Programming B
Theory

interviewer.

Grammar Abduc ve Reasoning
Vocabulary Semiconductors and Semiconductor
Comprehension Devices
Induc ve Reasoning Data Structures
Deduc ve Reasoning OOP and Complexity Theory
Digital Electronics
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker


Comments :

Name Ushasree Kaluguri AMCAT ID 30006538615654

Email ID 144g1a0284@srit.ac.in Mobile No. 9492161806
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Electrical Engineering 88% 88% 516 Electronics A A C
Engineering Control
OOP and Complexity
Computer Programming 59% 75% 425 B Basic Programming B Data Structures A
Theory

interviewer.

Vocabulary Instrumenta on and Control
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Electronics
Fundamentals of Electrical
Engineering
Data Structures
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Tanmayi Nerayanuru AMCAT ID 30006538796439

Email ID 144g1a0280@srit.ac.in Mobile No. 9704901712
AMCAT Score Table


Quan ta ve Ability
59% 81% 520 Basic Mathema cs B Advanced Mathema cs B Applied Mathema cs A
(Advanced)
Electrical Engineering 45% 48% 388 Electronics A B C
Engineering Control
OOP and Complexity
Computer Programming 21% 24% 305 Data Structures C C Basic Programming B
Theory

interviewer.

Grammar Instrumenta on and Control
Vocabulary Data Structures
Comprehension OOP and Complexity Theory
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Electronics
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Adventurer


Comments :

Name Anil Kumar Palagiri AMCAT ID 30006538833446

Email ID anilroyal909@gmail.com Mobile No. 8374665323
AMCAT Score Table


Quan ta ve Ability
(Advanced)
27% 30% 260 Analog Electronics C Digital Electronics A C
OOP and Complexity
Computer Programming 74% 86% 475 Data Structures A B Basic Programming B
Theory

interviewer.

Grammar Analog Electronics
Comprehension Semiconductors and Semiconductor
Basic Mathema cs Devices
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Digital Electronics
Data Structures
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Planner


Comments :

Name Swarna Rajesh AMCAT ID 30006563516079

College Tirumala Engineering College,Guntur. Degree (Stream) B.Tech/B.E. ()
Email ID rajeshswarna123@gmail.com Mobile No. 8333077686
AMCAT Score Table


English Comprehension 60% 88% 500 Grammar A Vocabulary B Comprehension B
Quan ta ve Ability
99% 100% 750 Advanced Mathema cs A Applied Mathema cs A Basic Mathema cs A
(Advanced)
21 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 74% 94% 475 Data Structures A B Basic Programming A
Theory

interviewer.
Strong Areas
Grammar
Advanced Mathema cs
Applied Mathema cs
Basic Mathema cs
Abduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver
Automata Details
2 75 mins
Total Score
21 out of 100
Problem 1
Scores

5. int a[7]; Errors Generated
6. int* cellCompete(int* cells, int days)
7. { Aborted while comparing result of the program. This may occur if you are returning a pointer
8. int i; which is not allocated expected memory. Run me Error: program tried to access
9. while(days--){ unathourised address. This may occur if your code uses a pointer to which memory is not
10. for(i=0;i<8;i++){ allocated or there is an array index out of bounds.
11. if(i==0) {
12. if((*cells+1)==1) a[0]=1; Test Case Execu on Results
13. else a[0]=0;
14. } Basic N.A.
15. else if(i==7){ They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
16. if((*cells-1)==1) a[7]=1; and do not reveal situa ons which need extra checks/handles to be placed on the logic.
17. else a[7]=0; Advanced N.A.
18. } They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
19. else if((*cells-1)==0){ implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
20. if((*cells+1)==0){ Edge N.A.
21. a[i]=0;
22. }
24. else if((*cells-1)==1){
25. if((*cells+1)==1){ Structural Vulnerabili es and Errors
26. a[i]=0;
27. } N.A.
28. }
29. else a[i]==1; Average-Case Time Complexity Detected
30. }
32. return 0;
33. }
34. int main(){
35. int *p,i,n;
36. for(i=0;i<8;i++)
37. scanf("%d",&a[i]);
38. scanf("%d",&n); *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
39. *p=a[0]; complexity is measured here using the Big-O asympto c nota on.
40. cellCompete(p,n); *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
41. i=0; It has been benchmarked across problems.
42. while(i<8)
43. { Execu on Sta s cs
44. prin ("%d",a[i]);
45. i++; Time taken to submit (hr:min:sec) : 00:43:39
46. }
47. return 0; Number of compiles a empts made : 16
48. } Number of compila on a empts witnessing a successful compile :6
Number of compile a empts witnessing a me-out :0
Number of compile a empts witnessing run me errors :6
Problem 2
Scores
pass.

1. #include<stdio.h> Compiler Warnings Generated : Yes
2. // INCLUDE HEADER FILES NEEDED BY YOUR PROGRAM Test Cases Passed : 12.5%
5. // FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED Warnings Generated
6. int a[100];
7. int lruCountMiss(int max_cache_size, int *pages, int len) : In func on 'lruCountMiss':
8. { :9:13: warning: unused variable 'a' [-Wunused-variable]
9. int i,n=0,a=0;
^--^--^--^--13: warning: unused variable 'a' [-Wunused-variable] Test Case Execu on Results
10. for(i=0;i<len;i++){
11. if(*pages==max_cache_size) Basic 14.3%
12. { They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
13. n=i; and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. } Advanced 0%
15. pages++; They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. } implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. return n; Edge 0%
18. } They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
19. int main(){
Total 12.5%
20. int m,n,*p,i;
21. scanf("%d",m);
22. scanf("%d",n); Structural Vulnerabili es and Errors
23. for(i=0;i<=n;i++)
24. scanf("%d",&a[i]); Readability & Language Best Prac ces
25. *p=a[0]; Line No6,9,9...: Variables are given very short name. (4)
26. m=lruCountMiss(m,p,n);
27. prin ("%d",&m); Performance & Correctness
28. return 0; Line NoArray...: Unused parameter/variable. (1)
29. }

Execu on Sta s cs


Comments :

Name Tahaseen Basree Mohammed AMCAT ID 30006563545631

Residence City N.A., NA Date of Birth (Gender) 1997-02-28(YYYY-MM-DD) ()
Email ID tahaseenbasree@gmail.com Mobile No. 9652098786
AMCAT Score Table


Quan ta ve Ability
68% 93% 550 Advanced Mathema cs A Basic Mathema cs A Applied Mathema cs B
(Advanced)
OOP and Complexity
Theory
Telecommunica ons
5% 4% 196 Communica on C Electromagne sm C Microwave Engineering C
Engineering

interviewer.

Comprehension Electromagne sm
Advanced Mathema cs Microwave Engineering
Basic Mathema cs
Induc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Kandru Bhargavi AMCAT ID 30006563749501

Email ID k.bhargavi2414@gmail.com Mobile No. 7286862266
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 29% 48% 335 B Basic Programming B Data Structures C
Theory
Telecommunica ons
Engineering

interviewer.

Grammar Data Structures
Applied Mathema cs Communica on
Basic Mathema cs Microwave Engineering
Advanced Mathema cs Electromagne sm
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Suman Mishra AMCAT ID 30006747234580

Residence City Bhubaneswar, NA Date of Birth (Gender) 1996-04-06(YYYY-MM-DD) (Male)
Anil Neerukonda Ins tute of Technology and
Science,Achampet.
Email ID sumanmishra1324@gmail.com Mobile No. 8121249252
AMCAT Score Table


Quan ta ve Ability
33% 0NA 445 Basic Mathema cs B Advanced Mathema cs B Applied Mathema cs C
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 49% 0NA 377 B DBMS C Computer Networks A

interviewer.

Data Structures Applied Mathema cs
Vocabulary
Grammar
Comprehension
Computer Networks
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver

Comments :

Name Chavatapalli Vineeth Sai Surya AMCAT ID 30006747489872

Residence City Rajahmundry, NA Date of Birth (Gender) 1996-08-08(YYYY-MM-DD) (Male)
Andhra University College of
Email ID chvineeth.2@gmail.com Mobile No. 8125767686
AMCAT Score Table


English Comprehension 76% 0NA 545 Vocabulary A Grammar A Comprehension B
Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
45 out
Automata NA NA
of 100

interviewer.
Strong Areas
Basic Programming
Data Structures
Vocabulary
Grammar
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
The candidate has a empted all problems in the test.Only one of his/her a empted codes has passed its respec ve test suite completely. 45 out of 100
Addi onally, the candidate has wri en code that contains redundant/improper coding constructs and a few readability and forma ng issues
Problem 1
Scores
Func onally correct source code Completely correct

Passes all the test cases in the test-suite for a given problem. A correct implementa on of the problem using the right control-structures and data dependencies.
Efficient complexity High readability, Low on program structure

The predicted complexity matches the ideal complexity with which the problem could have been solved. The source code contains redundant/improper coding constructs and a few readability and forma ng issues.

5. int* cellCompete(int a[], int days) Warnings Generated
6. {
8. int b[10];
9. for(int k=0;k<8;k++) Test Case Execu on Results
10. {
11. b[k]=a[k]; Basic 100%
13. for(int i=1;i<=days;i++) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. { Advanced 100%
15. for(int j=0;j<8;j++) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
17. if(j==0) Edge 100%
18. {
19. if(a[j+1]==0)
20. b[j]=0; Total 100%
21. else if(a[j+1]==1)
22. b[j]=1; Structural Vulnerabili es and Errors
23. }
24. if(j==7) Readability & Language Best Prac ces
25. { Line No8: Variables are given very short name.
26. if(a[j-1]==0)
27. b[j]=0; Performance & Correctness
28. else if(a[j-1]==1) Line No24,31: Use of hardcoded values must be avoided.
29. b[j]=1;
30. }
31. if(j!=0 && j!=7) Average-Case Time Complexity Detected
32. {
33. if((a[j-1]==0 && a[j+1]==0)|| (a[j-1]==1 && a[j+1]==1)) O(N)
34. {
35. b[j]=0;
36. }
37. else if((a[j-1]==0 && a[j+1]==1) || (a[j-1]==1 && a[j+1]==0)) *N represents the number of days
38. {
39. b[j]=1; *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
41. } *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
42. } It has been benchmarked across problems.
43. for(int k=0;k<8;k++)
44. a[k]=b[k]; Execu on Sta s cs
45. }
46. for(int i=0;i<8;i++) Time taken to submit (hr:min:sec) : 00:42:03
47. a[i]=b[i];
48. return a; Number of compiles a empts made : 21
49. Number of compila on a empts witnessing a successful compile : 16
50. }
Problem 2
Reverse second half of the linked list.
Input: list -> pointer to a linked list . Language : C
Output: Pointer to the linked list reversed from middle element.
Scores

4. // lnode STRUCTURE IS DEFINED BY DEFAULT
5. // FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED Errors Generated
6. lnode* reverseLinkedList(lnode* list)
7. { : In func on 'reverseLinkedList':
8. int i,j,k; :13:5: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
9. // WRITE YOUR CODE HERE :14:5: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
10. int n=0; :25:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
11. lnode* point,a,b,c; :29:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
12. point->next=list; :33:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
13. a->next=list; :36:12: error: invalid operands to binary != (have 'lnode {aka struct LNode}' and 'void *')
^--^--^--^--5: error: invalid type argument of '->' (have 'lnode {aka struct LNode}') :38:10: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
14. b->next=list; :39:11: error: 'next' undeclared (first use in this func on)
^--^--^--^--5: error: invalid type argument of '->' (have 'lnode {aka struct LNode}') :39:11: note: each undeclared iden fier is reported only once for each func on it appears in
15. while(point!=0) :41:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
16. { :42:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
17. n++; :43:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
18. point=point->next; :50:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
19. } :54:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
20. :58:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
21. if(n%2==0) :61:12: error: invalid operands to binary != (have 'lnode {aka struct LNode}' and 'void *')
23. for(i=1;i<=n/2;i++) :64:10: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
25. a=a->next; :66:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
:67:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
^--^--^--^--12: error: invalid type argument of '->' (have 'lnode {aka struct
:68:12: error: invalid type argument of '->' (have 'lnode {aka struct LNode}')
LNode}')
26. }
27. for(j=1;j<=n/2+1;j++) Test Case Execu on Results
28. {
29. b=b->next; Basic N.A.
^--^--^--^--12: error: invalid type argument of '->' (have 'lnode {aka struct They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
LNode}') and do not reveal situa ons which need extra checks/handles to be placed on the logic.
30. } Advanced N.A.
31. for(k=1;k<=n/2+2;k++) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
33. c=c->next; Edge N.A.
^--^--^--^--12: error: invalid type argument of '->' (have 'lnode {aka struct They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
LNode}') Total (Cases Passed/ Total Cases) N.A.
34. }
35. Structural Vulnerabili es and Errors
36. while(b!=NULL)
^--^--^--^--12: error: invalid operands to binary != (have 'lnode {aka struct N.A.
LNode}' and 'void *')
38. a->next=b;
LNode}')
39. b>next=c;
^--^--^--^--11: note: each undeclared iden fier is reported only once for each
func on it appears in
40. c>next=a; *N represents the length of linked list
41. a=a->next;
^--^--^--^--12: error: invalid type argument of '->' (have 'lnode {aka struct *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
LNode}') complexity is measured here using the Big-O asympto c nota on.
42. b=b->next; *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
LNode}')
Execu on Sta s cs
43. c=c->next;
LNode}') Time taken to submit (hr:min:sec) : 00:32:20
44. } Number of compiles a empts made :7
45. }
46. else Number of compila on a empts witnessing a successful compile :0
47. { Number of compile a empts witnessing a me-out :0
48. for(i=1;i<=(n-1)/2;i++) Number of compile a empts witnessing run me errors :0
49. {
50. a=a->next; Avg. no. of cases passed in each compile : 0%
^--^--^--^--12: error: invalid type argument of '->' (have 'lnode {aka struct Avg. me taken between each compile (hr:min:sec) : 00:04:37
LNode}')
51. }
52. for(j=1;j<=(n+1)/2;j++)
53. {
54. b=b->next;
LNode}')
55. }
56. for(k=1;k<=(n+3)/2;k++)
57. {
58. c=c->next;
LNode}')
59. }
60.
61. while(b!=NULL)
^--^--^--^--12: error: invalid operands to binary != (have 'lnode {aka struct
LNode}' and 'void *')
62. {
63. a->next=b;
LNode}')
64. b->next=c;
LNode}')
65. c->next=a;
LNode}')
66. a=a->next;
LNode}')
67. b=b->next;
LNode}')
68. c=c->next;
LNode}')
69. }
70. }
71. return list;
72.
73. }

Comments :

Name PUSARLA MANIKANTA SAI SUBODH AMCAT ID 30006747886316

Residence City Visakhapatnam, NA Date of Birth (Gender) 1996-10-14(YYYY-MM-DD) (Male)
Anil Neerukonda Ins tute of Technology and
Science,Achampet.
Email ID saisubodh07@gmail.com Mobile No. 7799400588
AMCAT Score Table


English Comprehension 64% 0NA 510 Vocabulary B Grammar B Comprehension A
Quan ta ve Ability
(Advanced)
Logical Ability 56% 0NA 480 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning B
OOP and Complexity
Computer Programming 55% 0NA 415 Basic Programming B Data Structures A C
Theory
Opera ng System &
Computer Science 76% 0NA 469 A DBMS B Computer Networks A

interviewer.

Data Structures OOP and Complexity Theory
Comprehension
Architecture
Computer Networks
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Scien st

Comments :

Name Lakshmi Narayana Reddy Gaddam AMCAT ID 30006806350494

Residence City Rayacho , NA Date of Birth (Gender) 1996-05-03(YYYY-MM-DD) (Male)
Email ID lakshmangaddam953@gmail.com Mobile No. 9963348986
AMCAT Score Table


Quan ta ve Ability
54% 0NA 505 Basic Mathema cs B Advanced Mathema cs B Applied Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 97% 0NA 623 A DBMS A Computer Networks C

interviewer.

Data Structures
Vocabulary
Grammar
Comprehension
Architecture
DBMS
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :

Name Rama Krishna Reddy Gaddam AMCAT ID 30006806545745

Residence City Rayacho , NA Date of Birth (Gender) 1996-05-03(YYYY-MM-DD) (Male)
Email ID ram99441@gmail.com Mobile No. 8686536382
AMCAT Score Table


Quan ta ve Ability
64% 0NA 535 Basic Mathema cs B Advanced Mathema cs A Applied Mathema cs A
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 96% 0NA 592 A DBMS A Computer Networks A

interviewer.
Strong Areas
Basic Programming
Data Structures
Vocabulary
Grammar
Comprehension
DBMS
Computer Networks
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Vinay Raja Pratap AMCAT ID 30006850159742

Email ID Vinayrajapratap1234@gmail.com Mobile No. 9603972423
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 71% 62% 465 Data Structures B Basic Programming A A
Theory
Telecommunica ons
77% 59% 388 Microwave Engineering A Communica on C Electromagne sm A
Engineering
Opera ng System &
Computer Science 59% 52% 408 DBMS B B Computer Networks A

interviewer.

Grammar Communica on
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Microwave Engineering
Electromagne sm
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Surya Koteswararao Grandhi AMCAT ID 30006850177049

Email ID suryagrandhi97@gmail.com Mobile No. 7032494288
AMCAT Score Table


English Comprehension 73% 61% 535 Grammar A Vocabulary A Comprehension B
Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 99% 99% 655 Basic Programming A Data Structures A A
Theory
Opera ng System &

interviewer.

Vocabulary
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Data Structures
Architecture
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer

Comments :

Name Jyothsnapriya Jerripothula AMCAT ID 30006850266111

Gayatri Vidya Parishad College of Engineering for
Women,Visakhapatnam.
Email ID jyothsna1697@gmail.com Mobile No. 8919923305
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 99% 99% 655 Data Structures A Basic Programming A A
Theory
Opera ng System &
Computer Science 93% 93% 562 A Computer Networks A DBMS A

interviewer.
Strong Areas
Vocabulary
Basic Mathema cs
Applied Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector

Comments :

Name Mahesh Rsd Narava AMCAT ID 30006850351995

Email ID nrsdmahesh007@gmail.com Mobile No. 7675079735
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Computer Programming 96% 94% 605 A Basic Programming A Data Structures A
Theory
Telecommunica ons
77% 59% 388 Microwave Engineering B Electromagne sm A Communica on C
Engineering

interviewer.

Grammar Communica on
Comprehension
Applied Mathema cs
Advanced Mathema cs
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Data Structures
Electromagne sm
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker

Comments :

Name Kowshik AMCAT ID 30007085090900

Residence City Chodavaram, NA Date of Birth (Gender) 1997-08-26(YYYY-MM-DD) (Male)
College Koneru Lakshmaiah College of Engineering,Guntur. Degree (Stream) B.Tech/B.E. ()
Email ID kesav.koushik@gmail.com Mobile No. 7095221880
AMCAT Score Table


English Comprehension 76% 0NA 545 Vocabulary A Grammar B Comprehension A
Quan ta ve Ability
83% 0NA 605 Basic Mathema cs A Advanced Mathema cs B Applied Mathema cs A
(Advanced)
Logical Ability 79% 0NA 545 Induc ve Reasoning B Deduc ve Reasoning A Abduc ve Reasoning A
OOP and Complexity
Computer Programming 74% 0NA 475 Basic Programming A Data Structures B A
Theory
Opera ng System &
Computer Science 59% 0NA 408 A DBMS C Computer Networks C

interviewer.

OOP and Complexity Theory Computer Networks
Vocabulary
Comprehension
Architecture
Basic Mathema cs
Applied Mathema cs
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Mary surekha sankuru AMCAT ID 30007085526001

Email ID surekhasankuru36@gmail.com Mobile No. 7732085278
AMCAT Score Table


Quan ta ve Ability
(Advanced)
57% 0NA 324 C Analog Electronics B Digital Electronics A
OOP and Complexity
Theory

interviewer.

Basic Programming Semiconductors and Semiconductor
OOP and Complexity Theory Devices
Digital Electronics
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Shiva Keshav Varma AMCAT ID 30007085632207

Residence City Vishakhapatnam, NA Date of Birth (Gender) 1996-05-02(YYYY-MM-DD) (Male)
College Lakireddy Bali Reddy College of Engineering,Mylavaram. Degree (Stream) B.Tech/B.E. ()
Email ID vshivakeshavvarma@gmail.com Mobile No. 9052509218
AMCAT Score Table


English Comprehension 80% 0NA 560 Vocabulary B Grammar A Comprehension A
Quan ta ve Ability
(Advanced)
Logical Ability 56% 0NA 480 Induc ve Reasoning C Deduc ve Reasoning A Abduc ve Reasoning B
OOP and Complexity
Theory
Opera ng System &
Computer Science 68% 0NA 438 A DBMS B Computer Networks B

interviewer.

Basic Programming Induc ve Reasoning
Grammar
Comprehension
Architecture
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Deduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Nurturer


Comments :

Name Chandrakala Bara AMCAT ID 30007094175835

College G Pullaiah College Of Engineering & Technology,Kurnool. Degree (Stream) B.Tech/B.E. ()
Email ID bchandrakala333@gmail.com Mobile No. 9493608513
AMCAT Score Table


Quan ta ve Ability
71% 76% 560 Advanced Mathema cs A Basic Mathema cs A Applied Mathema cs A
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 83% 86% 500 C Computer Networks A DBMS A

interviewer.

Comprehension Architecture
Advanced Mathema cs
Basic Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Mogilipalli Maheswari AMCAT ID 30007094203322

Email ID maheswarimogilipalli311@gmail.com Mobile No. 9494509676
AMCAT Score Table


Quan ta ve Ability
54% 61% 505 Basic Mathema cs B Advanced Mathema cs B Applied Mathema cs B
(Advanced)
OOP and Complexity
Computer Programming 65% 65% 445 B Basic Programming B Data Structures A
Theory
Opera ng System &

interviewer.

Induc ve Reasoning Architecture
Deduc ve Reasoning
Data Structures
Computer Networks
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Chandrakala Kundarapu AMCAT ID 30007094264699

Email ID kchandrakala235@gmail.com Mobile No. 8500133915
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 83% 86% 500 A Computer Networks B DBMS B

interviewer.
Strong Areas
Vocabulary
Comprehension
Induc ve Reasoning
Deduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer

Comments :

Name Abdul Azeez Khan AMCAT ID 30007094275423

Email ID azeezkhan2197@gmail.com Mobile No. 7207060442
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 30% 21% 315 C Computer Networks C DBMS B

interviewer.

Advanced Mathema cs
Basic Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Nukaraju Chandra Manvi AMCAT ID 30007094420730

Email ID chandramanvi98@gmail.com Mobile No. 7032385196
AMCAT Score Table


Quan ta ve Ability
64% 69% 535 Applied Mathema cs A Basic Mathema cs B Advanced Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 59% 58% 408 A DBMS B Computer Networks C

interviewer.

Vocabulary
Comprehension
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Data Structures
Architecture
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :
file:///C:/Users/Shreya/AppData/Local/Temp/Rar$EXa0.210/tmp_wf/2018_04_27_17_09_44/corp_2_pager_reports/_corporate_2_pager.html 100

Name Pranathi Nune AMCAT ID 30007094895595

Email ID pranathinune30@gmail.com Mobile No. 9440590789
AMCAT Score Table


Quan ta ve Ability
76% 78% 575 Applied Mathema cs B Basic Mathema cs A Advanced Mathema cs A
(Advanced)
Electronics and Semiconductor Semiconductors and
96% 97% 452 Analog Electronics B A Digital Electronics C
Engineering Semiconductor Devices
Telecommunica ons
47% 48% 324 Communica on C Microwave Engineering A Electromagne sm A
Engineering

interviewer.

Comprehension
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Devices
Microwave Engineering
Electromagne sm
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Saisrithanuja Kunese y AMCAT ID 30007915443599

Narasaraopeta Engineering College,
Narasaraopet,Narasaraopet.
Email ID thanujakunise y01@gmail.com Mobile No. 8919834808
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &

interviewer.

Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Sravanthi Pingali V Sai Naga AMCAT ID 30007915972799

Narasaraopeta Engineering College,
Narasaraopet,Narasaraopet.
Email ID pingali_sravanthi@yahoo.com Mobile No. 8790032256
AMCAT Score Table


Quan ta ve Ability
64% 77% 535 Basic Mathema cs B Applied Mathema cs B Advanced Mathema cs A
(Advanced)
OOP and Complexity
Computer Programming 97% 99% 625 Basic Programming A Data Structures A A
Theory
Opera ng System &

interviewer.

Comprehension
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Data Structures
Architecture
DBMS
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker


Comments :

Name Mallipudi Sri Lakshmi Sowmya AMCAT ID 30008237232013

Residence City Mandapeta, NA Date of Birth (Gender) 1997-01-31(YYYY-MM-DD) (Male)
College Shri Vishnu Engineering College for Women,Bhimavaram. Degree (Stream) B.Tech/B.E. ()
Email ID mslsowmya@gmail.com Mobile No. 9948412677
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
27% 0NA 260 C Analog Electronics B Digital Electronics C

interviewer.

Data Structures Devices
Vocabulary Digital Electronics
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Nannapaneni Manoj Kumar AMCAT ID 30008286007209

Residence City Guntur, NA Date of Birth (Gender) 1997-09-01(YYYY-MM-DD) (Male)
Email ID nannapanenimanoj1997@gmail.com Mobile No. 8500234739
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
99% 0NA 484 A Analog Electronics A Digital Electronics A

interviewer.
Strong Areas
Basic Programming
Data Structures
Semiconductors and Semiconductor Devices
Analog Electronics
Digital Electronics
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Execu ve


Comments :
file:///C:/Users/Shreya/AppData/Local/Temp/Rar$EXa0.210/tmp_wf/2018_04_27_17_09_44/corp_2_pager_reports/_corporate_2_pager.html 110/

Name KETHA AKHIL SRAVAN AMCAT ID 30008286488927

Residence City Tanuku, NA Date of Birth (Gender) 1997-05-01(YYYY-MM-DD) (Male)
College Sagi RamaKrishnam Raju Engineering College,Bhimavaram. Degree (Stream) B.Tech/B.E. ()
Email ID akhilsravan.ketha@gmail.com Mobile No. 9494339002
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 48% 0NA 460 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning B
OOP and Complexity
Theory
72% 0NA 356 A Analog Electronics C Digital Electronics A

interviewer.

Basic Programming Analog Electronics
Data Structures
Devices
Digital Electronics
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Scien st


Comments :

Name Mohammed Sadia Sultana AMCAT ID 30008286608793

Residence City Vijayawada, NA Date of Birth (Gender) 1996-10-30(YYYY-MM-DD) (Female)
Velgapudi Ramakrishna Siddhartha Engineering
College,Vijayawada.
Email ID sadiakhan3196@gmail.com Mobile No. 8897001808
AMCAT Score Table


Quan ta ve Ability
59% 0NA 520 Basic Mathema cs B Advanced Mathema cs A Applied Mathema cs B
(Advanced)
Logical Ability 71% 0NA 520 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning A
OOP and Complexity
Theory
Opera ng System &
Computer Science 49% 0NA 377 B DBMS A Computer Networks C

interviewer.

Data Structures
Comprehension
DBMS
Advanced Mathema cs
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Execu ve

Comments :

Name Appana Bhavya AMCAT ID 30008340261294

Residence City Amalapuram, NA Date of Birth (Gender) 1997-07-22(YYYY-MM-DD) (Female)
College Shri Vishnu Engineering College for Women,Bhimavaram. Degree (Stream) B.Tech/B.E. ()
Email ID bhavyalucky13@gmail.com Mobile No. 8985988200
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 71% 0NA 520 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning A
OOP and Complexity
Theory
41% 0NA 292 A Analog Electronics C Digital Electronics C

interviewer.

Basic Programming Analog Electronics
Data Structures Digital Electronics
Devices
Vocabulary
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Manikanta Muralikrishna Merugumala AMCAT ID 30008374109481

College Sri Vasavi Ins tute of Engineering and Technology,Pedana. Degree (Stream) B.Tech/B.E. ()
Email ID mmm.murali587@gmail.com Mobile No. 9182666714
AMCAT Score Table


Quan ta ve Ability
71% 95% 560 Advanced Mathema cs A Basic Mathema cs B Applied Mathema cs A
(Advanced)
23 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 52% 71% 405 Data Structures B B Basic Programming A
Theory

interviewer.
Strong Areas
Vocabulary
Comprehension
Advanced Mathema cs
Applied Mathema cs
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
23 out of 100
Problem 1
Language : Java
Scores

1. // IMPORT LIBRARY PACKAGES NEEDED BY YOUR PROGRAM Compiler Warnings Generated : N.A.
2. // SOME CLASSES WITHIN A PACKAGE MAY BE RESTRICTED Test Cases Passed : N.A.
3. // DEFINE ANY CLASS AND METHOD NEEDED
4. // CNode CLASS IS DEFINED BY DEFAULT
5. // CLASS BEGINS, THIS CLASS IS REQUIRED Errors Generated
6. public class SortedList
7. { :13: error: missing return statement
8. //METHOD SIGNATURE BEGINS, THIS METHOD IS REQUIRED }
9. public sta c CNode insertSortedList(CNode start, int n) ^
10. { 1 error
11. // INSERT YOUR CODE HERE
13. }
^--^--^--^-- error: missing return statement Basic N.A.
14. // METHOD SIGNATURE ENDS They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Input: max_cache_size-> maximum size of the cache, pages-> an integer array for page requests, len-> length of array pages. Language : Java
Scores
Par ally correct basic func onality Basic program structure is consistent
Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Right control structures exist with few/par ally correct data-dependencies.
pass.
coding constructs.

1. // IMPORT LIBRARY PACKAGES NEEDED BY YOUR PROGRAM Compiler Warnings Generated : No
2. // SOME CLASSES WITHIN A PACKAGE MAY BE RESTRICTED Test Cases Passed : 31.3%
3. // DEFINE ANY CLASS AND METHOD NEEDED
4. // CLASS BEGINS, THIS CLASS IS REQUIRED
5. public class LeastRecentPage Warnings Generated
6. {
7. // METHOD SIGNATURE BEGINS, THIS METHOD IS REQUIRED None
8. public sta c int lruCountMiss(int max_cache_size, int[] pages)
10. int a[] = new int[max_cache_size];
11. int i,j,flag=0,k=0,miss=1; Basic 35.7%
12. They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
13. for(j=max_cache_size-1;j>=0;j--) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. { Advanced 0%
15. a[j]=pages[k]; They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. k++; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. } Edge 0%
18. for(i=max_cache_size;i<pages.length;i++)
19. {
20. flag=0; Total 31.3%
21. for(j=0;j<max_cache_size-1;j++)
23. if(a[j]==pages[i])
24. { Readability & Language Best Prac ces
25. flag=1; Line No10,11,11...: Variables are given very short names. (4)
26. break;
27. }
28. } Average-Case Time Complexity Detected
29. if(flag==0)
30. { The complexity informa on cannot be generated.
31. miss++;
32.
33. for(k=max_cache_size-1;k>0;k--)
34. {
35. a[k]=a[k-1];
36. }
37. a[0]=pages[i]; *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
38. complexity is measured here using the Big-O asympto c nota on.
40. } It has been benchmarked across problems.
41. return miss;
42. Execu on Sta s cs
43. }
44. // METHOD SIGNATURE ENDS Time taken to submit (hr:min:sec) : 00:58:33
45. }

Comments :

Name Sai Tharun Pathakota AMCAT ID 30008454258813

College Narayana Engineering College,Nellore,Nellore. Degree (Stream) B.Tech/B.E. ()
Email ID saitharun21081996@gmail.com Mobile No. 7075245478
AMCAT Score Table


Quan ta ve Ability
(Advanced)
14 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 68% 88% 455 Data Structures B Basic Programming B A
Theory
Opera ng System &
Computer Science 49% 58% 377 C Computer Networks A DBMS C

interviewer.

Basic Mathema cs DBMS
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
Automata Details
2 75 mins
Total Score
Addi onally, the candidate has wri en code that contains redundant/improper coding constructs and a few readability and forma ng issues
Problem 1
Scores
Par ally correct basic func onality Emerging basic structure

Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Appropriate keywords and tokens present, showing some understanding of a part of the problem.
pass.
Run me complexity score can not be generated High readability, Low on program structure
This is because the source code failed to pass all test cases in the test suite. The source code contains redundant/improper coding constructs and a few readability and forma ng issues.

5. #include<string.h> Warnings Generated
6. #include<stdio.h>
7. int balancedParentheses(char *str) None
8. {
9. // WRITE YOUR CODE HERE Test Case Execu on Results
10. char exps[100],stk[100];
11. int top=-1,i=0,count=0; Basic 14.3%
13. strcpy(exps,str); and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. for(i=0;exps[i]!='';i++) Advanced 0%
15. { They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. if(exps[i]=='('||exps[i]=='['||exps[i]=='{') Edge 0%
18. {
19. top++;
20. stk[top]=exps[i]; Total 6.3%
21.
23. else
24. if(exps[i]==')') Readability & Language Best Prac ces
25. { Line No11: Variables are given very short name.
26. if(stk[top]=='(')
27. { Performance & Correctness
28. top--; Line No13: Almost always, snprin is be er than strcpy
29.
30. count++;
32. else
33. { prin ("unbalanced expression"); return -1;} The complexity informa on cannot be generated.
34. }
35. else
36. if(exps[i]==']'){
37. if(stk[top]=='[') {
38. top--;
39.
40. count++; *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
42. *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
43. else{ It has been benchmarked across problems.
44. prin ("unbalanced expression");
45. return -1; Execu on Sta s cs
46. }
47. } Time taken to submit (hr:min:sec) : 01:11:20
48. if(exps[i]==')')
49. { Number of compiles a empts made : 17
50. if(stk[top]=='{') top--; Number of compila on a empts witnessing a successful compile :6
51. else{
52. prin ("unbalanced");
53. return -1; Number of compile a empts witnessing run me errors :0
54. } Avg. no. of cases passed in each compile : 2.2 %
55. }
56. if(top==-1) Avg. me taken between each compile (hr:min:sec) : 00:04:11
57. {
58. prin ("expression is balanced");
59. return count;
60. }
61. else{
62. prin ("expression is not balanced");
63. return -1;
64. }
65. }
66.
67.
68. return -1;
69.
70. }
Problem 2
Scores

5. int isPath(int **grid, int m, int n) Errors Generated
^--^--^--^--35: warning: unused parameter 'n' [-Wunused-parameter]
6. { : In func on 'isPath':
7. // WRITE YOUR CODE HERE :5:18: warning: unused parameter 'grid' [-Wunused-parameter]
8. :5:28: warning: unused parameter 'm' [-Wunused-parameter]
9. } :5:35: warning: unused parameter 'n' [-Wunused-parameter]
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- :9:1: error: control reaches end of non-void func on [-Werror=return-type]
cc1: some warnings being treated as errors
type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs


Comments :

Name Vyjayanth Svs P AMCAT ID 30008626422586

Andhra Loyola Ins tute Of Engineering and
Technology,Vijayawada.
Email ID vyjayanth.sai@gmail.com Mobile No. 7207464751
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 71% 0NA 520 Induc ve Reasoning B Deduc ve Reasoning B Abduc ve Reasoning A
33 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 84% 0NA 515 Basic Programming A A Data Structures A
Theory

interviewer.
Strong Areas
Grammar
Vocabulary
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Abduc ve Reasoning
Basic Programming
Data Structures
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Nurturer
Automata Details
2 75 mins
Total Score
Problem 1
Scores
Correct basic func onality with par ally correct advanced func onality Basic program structure is consistent
Passes all the basic test cases in the test-suite and a percentage of the advanced test cases. Right control structures exist with few/par ally correct data-dependencies.
coding constructs.

5. int balancedParentheses(char *str) Warnings Generated
6. {
8. int i,l,r;
9. l=0; Test Case Execu on Results
10. r=0;
11. if(str[0]!='') Basic 100%
13. for(i=0;str[i]!='';i++) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. { Advanced 62.5%
15. if(str[i]=='(' ) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. l++; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. else Edge 100%
18. r++;
19. }
20. if(l==r) Total 81.3%
21. {
22. return l; Structural Vulnerabili es and Errors
23. }
24. else Readability & Language Best Prac ces
25. { Line No8,8,8: Variables are given very short name.
26. return -1; Line No8,9,16...: iden fier should not be composed of only 'l' and 'O' (5)
27. }
28. }
29. else Average-Case Time Complexity Detected
30. {
31. prin ("Please enter a string to check"); The complexity informa on cannot be generated.
33. return 0;
34. } This problem can be ideally solved in O(N) me
Execu on Sta s cs

Problem 2
Input: list -> pointer to a linked list . Language : C
Scores

7. { : In func on 'reverseLinkedList':
8. :11:15: error: storage size of 'revlist' isn't known
9. int i,j,c,m; :33:9: warning: return from incompa ble pointer type [-Wincompa ble-pointer-types]
10. c=0; :11:15: warning: unused variable 'revlist' [-Wunused-variable]
11. struct lnode revlist;
^--^--^--^--15: warning: unused variable 'revlist' [-Wunused-variable] Test Case Execu on Results
12. struct lnode* r;
13. for(i=0;list[i].next!=NULL;i++) Basic N.A.
15. c++; and do not reveal situa ons which need extra checks/handles to be placed on the logic.
16. } Advanced N.A.
17. m=(c+1)/2; They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
18. for(i=0;i<m;i++) implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
19. { Edge N.A.
20. revlist[i].value=list[i].value; They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
21. revlist[i].next=list[i].next;
22. }
23. for(j=c;j>=m;j--,i++)
25. revlist[i].value=list[j].value;
26. revlist[i].next=list[j].next; N.A.
27. if(j==m)
29. revlist[i].next=NULL;
32. r=&revlist;
33. return r;
^--^--^--^--9: warning: return from incompa ble pointer type [-Wincompa ble-
pointer-types] *N represents the length of linked list
34. }
35. // FUNCTION SIGNATURE ENDS *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
Execu on Sta s cs


Comments :

Name Gundapu Ganesh AMCAT ID 30008950292825

Email ID gundapu.ganesh@gmail.com Mobile No. 8125988902
AMCAT Score Table


Quan ta ve Ability
(Advanced)
57% 41% 324 Digital Electronics B Analog Electronics C A
OOP and Complexity
Computer Programming 77% 87% 485 Data Structures B Basic Programming A A
Theory

interviewer.

Grammar Analog Electronics
Vocabulary
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Devices
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :

Name Manish Kumar Gangula AMCAT ID 30008950503423

Email ID mkmanishkumar0490@gmail.com Mobile No. 8977790142
AMCAT Score Table


Quan ta ve Ability
(Advanced)
96% 90% 452 Digital Electronics A Analog Electronics A C
OOP and Complexity
Theory

interviewer.

Grammar Semiconductors and Semiconductor
Vocabulary Devices
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Digital Electronics
Analog Electronics
Basic Programming
Data Structures
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Nuthika u Sharona AMCAT ID 30008950552951

Email ID sharona.nuthika u@gmail.com Mobile No. 8978273935
AMCAT Score Table


Quan ta ve Ability
(Advanced)
84% 67% 388 Digital Electronics B A Analog Electronics A
OOP and Complexity
Computer Programming 59% 73% 425 Data Structures B B Basic Programming A
Theory

interviewer.
Strong Areas
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Analog Electronics
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Atluri Sreeja AMCAT ID 30008950658171

Email ID sreejaatluri@gmail.com Mobile No. 8332877359
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &

interviewer.

Comprehension DBMS
Advanced Mathema cs
Basic Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker


Comments :

Name Lakshminarayana Reddy Gaddam AMCAT ID 30008950753597

Email ID lakshmangaddam58@gmail.com Mobile No. 7893045578
AMCAT Score Table


Quan ta ve Ability
64% 69% 535 Basic Mathema cs A Advanced Mathema cs A Applied Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 49% 54% 377 B Computer Networks A DBMS C

interviewer.

Grammar DBMS
Vocabulary
Comprehension
Basic Mathema cs
Advanced Mathema cs
Data Structures
Basic Programming
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Hari Krishna Chinta AMCAT ID 30008950938956

Email ID hkharikrishna62@gmail.com Mobile No. 7416131030
AMCAT Score Table


Quan ta ve Ability
64% 69% 535 Basic Mathema cs B Advanced Mathema cs A Applied Mathema cs B
(Advanced)
Logical Ability 67% 73% 510 Induc ve Reasoning B Deduc ve Reasoning A Abduc ve Reasoning A
OOP and Complexity
Theory
Opera ng System &
Computer Science 22% 15% 285 C Computer Networks C DBMS C

interviewer.

Advanced Mathema cs DBMS
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer


Comments :

Name Boggarapu Vyshnavi AMCAT ID 30009037095311

Residence City Kanigiri, NA Date of Birth (Gender) 1997-08-07(YYYY-MM-DD) (Female)
College R.V.R. & J.C. College of Engineering,CHODAVARAM. Degree (Stream) B.Tech/B.E. ()
Email ID vyshnavi.b999@gmail.com Mobile No. 9010365940
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 85% 0NA 570 Induc ve Reasoning B Deduc ve Reasoning A Abduc ve Reasoning A
OOP and Complexity
Theory
72% 0NA 356 C Analog Electronics C Digital Electronics A

interviewer.

Data Structures Devices
OOP and Complexity Theory Analog Electronics
Digital Electronics
Vocabulary
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name AKUTHOTA ROOPANJANI AMCAT ID 30009037387205

College R.V.R. & J.C. College of Engineering,CHODAVARAM. Degree (Stream) B.Tech/B.E. ()
Email ID roopanjanigupta1997@gmail.com Mobile No. 9989874479
AMCAT Score Table


Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 49% 0NA 377 C DBMS A Computer Networks A

interviewer.

Basic Programming Opera ng System & Computer
Data Structures Architecture
Vocabulary
Grammar
Comprehension
DBMS
Computer Networks
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Kamu venkata sai arun raj AMCAT ID 30009066937012

Residence City Visakhapatnam, NA Date of Birth (Gender) 1997-08-01(YYYY-MM-DD) (Male)
Maharaj Vijayaram Gajapathi Raj College Of
Engg.,Vizianagaram.
Email ID arun.raj1897@gmail.com Mobile No. 7382056028
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Logical Ability 46% 0NA 455 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning C
OOP and Complexity
Theory
Opera ng System &
Computer Science 59% 0NA 408 A DBMS C Computer Networks C

interviewer.

Data Structures Computer Networks
OOP and Complexity Theory Abduc ve Reasoning
Comprehension
Architecture
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker

Comments :

Name manideep AMCAT ID 30009852094658

Residence City Hyderabad, NA Date of Birth (Gender) 1996-05-03(YYYY-MM-DD) (Male)
College gitam university,VISAKHAPATNAM. Degree (Stream) B.Tech/B.E. ()
Email ID jakkimanideep932@gmail.com Mobile No. 9949445340
AMCAT Score Table


Quan ta ve Ability
59% 0NA 520 Basic Mathema cs A Advanced Mathema cs B Applied Mathema cs B
(Advanced)
OOP and Complexity
Computer Programming 71% 0NA 465 Basic Programming B Data Structures A B
Theory
Telecommunica ons
63% 0NA 356 Communica on C Electromagne sm A Microwave Engineering B
Engineering

interviewer.

Data Structures Communica on
Electromagne sm
Vocabulary
Comprehension
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Execu ve


Comments :

Name Laxmana Sujith Thammana AMCAT ID 30009852623281

Gandhi Ins tute of Technology and
Management,VISAKHAPATNAM.
Email ID babblutammana@gmail.com Mobile No. 9704473732
AMCAT Score Table


English Comprehension 76% 0NA 545 Vocabulary A Grammar A Comprehension B
Quan ta ve Ability
(Advanced)
OOP and Complexity
Theory
84% 0NA 388 A Analog Electronics A Digital Electronics A

interviewer.
Strong Areas
Basic Programming
Analog Electronics
Digital Electronics
Vocabulary
Grammar
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Adventurer


Comments :

Name Prasanna Kamal Vemula AMCAT ID 130010044203645

Email ID kamal1056@gmail.com Mobile No. 8985719346
AMCAT Score Table


Quan ta ve Ability
(Advanced)
6 out
Automata NA NA
of 100

interviewer.
Strong Areas
Grammar
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker
Automata Details
2 75 mins
Total Score
6 out of 100
The candidate has a empted all problems in the test.None of his/her a empted codes have passed their respec ve test suites completely.
Problem 1
Scores
Source code does not pass any basic test cases Emerging basic structure
It is either due to incorrect logic or it may have run me errors. Some advanced or edge cases may randomly pass. Appropriate keywords and tokens present, showing some understanding of a part of the problem.

5. #include<stdio.h> Errors Generated
6.
7. int lruCountMiss(int max_cache_size, int *pages, int len) Uncaught Excep on in Output.
8. {
9. int ms=0,c[max_cache_size],i,j,k,l; Test Case Execu on Results
10. for(i=1;i<max_cache_size;i++)
11. c[i]=0x98778; Basic N.A.
13. for(i=0;i<len;i++) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. { Advanced N.A.
15. for(j=0;j<max_cache_size;j++) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
17. if(j==max_cache_size-4) Edge N.A.
18. {
19. for(k=i;max_cache_size;k++)
20. { Total (Cases Passed/ Total Cases) N.A.
21. c[i]=c[j+1];
23. c[max_cache_size]=pages[i];
24. break; Readability & Language Best Prac ces
25. } Line No9,9,9...: Variables are given very short name. (6)
26. else if(j==max_cache_size-1) Line No9,28,28...: iden fier should not be composed of only 'l' and 'O' (6)
27. {
28. for(l=0;l<max_cache_size;l++) Performance & Correctness
29. { Line No11...: Use of hardcoded values must be avoided. (1)
30. c[l]= c[l++];
31. }
32. c[max_cache_size]=pages[i]; Average-Case Time Complexity Detected
33. ms++;
36. }
37. return ms-1; This problem can be ideally solved in O(N) me
38. }
39. // FUNCTION SIGNATURE ENDS *N represents the number of requested page references
40. int main()
41. { *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
42. prin ("LRU "); complexity is measured here using the Big-O asympto c nota on.
43. int days,pages1[50]; *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
44. int max; It has been benchmarked across problems.
45. int *csptr=pages1;
46. prin ("Enter max cache size"); Execu on Sta s cs
47. scanf("%d",&max);
48. int len; Time taken to submit (hr:min:sec) : 00:47:51
49. prin ("Enter length ");
50. scanf("%d",&len); Number of compiles a empts made : 51
51. prin ("Enter data "); Number of compila on a empts witnessing a successful compile : 42
52. scanf("%d",&pages1); Number of compile a empts witnessing a me-out :7
53. prin ("Count miss ",lruCountMiss(max,csptr,len));
54. return 0; Number of compile a empts witnessing run me errors : 11
55. } Avg. no. of cases passed in each compile : 2.6 %
Problem 2
Input: start-> any node in sorted circular linked list, n-> number to be inserted. Language : C
Scores

4. // cnode STRUCTURE IS DEFINED BY DEFAULT
6. #include<stdio.h>
7. : In func on 'insertSortedList':
8. cnode* insertSortedList(cnode* start, int n) :12:8: error: 'header' undeclared (first use in this func on)
^--^--^--^--43: warning: unused parameter 'n' [-Wunused-parameter] :12:8: note: each undeclared iden fier is reported only once for each func on it appears in
9. { :12:22: error: 'new' undeclared (first use in this func on)
10. // WRITE YOUR CODE HERE :20:9: error: 'current' undeclared (first use in this func on)
11. :21:22: error: 'null' undeclared (first use in this func on)
12. if(header->next==new->next) :8:32: warning: unused parameter 'start' [-Wunused-parameter]
^--^--^--^--22: error: 'new' undeclared (first use in this func on) :8:43: warning: unused parameter 'n' [-Wunused-parameter]
13. { : At top level:
14. header->next=new; :34:6: warning: return type of 'main' is not 'int' [-Wmain]
15. new->next=header; : In func on 'insertSortedList':
16. :28:1: error: control reaches end of non-void func on [-Werror=return-type]
17. } cc1: some warnings being treated as errors
18. else if(header->next==new->next)
20. current->next=header->next;
^--^--^--^--9: error: 'current' undeclared (first use in this func on) Basic N.A.
21. header->next=null; They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
^--^--^--^--22: error: 'null' undeclared (first use in this func on) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
22. } Advanced N.A.
23. else They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
25. current->next=new->next; Edge N.A.
26. new->next=header; They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
28. }
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return-
type]
29. struct cnode{
N.A.
30. int data;
31. struct cnode *next,*null,*current,*header,*new;
32. Average-Case Time Complexity Detected
33. };
34. void main() The complexity informa on cannot be generated.
^--^--^--^--6: warning: return type of 'main' is not 'int' [-Wmain] The submi ed source code is incorrect and failed to execute.
35. {
36. int n,data,l; This problem can be ideally solved in O(N) me
37. prin ("Enter data");
38. scanf("%d",&data); *N represents the number of elements in the input linked list
39. prin ("enter length ");
40. scanf("%d",&l); *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
41. insertSortedList(data,n);
42. It has been benchmarked across problems.
43. }
44. Execu on Sta s cs
45.


Comments :

Name Vishtamse Prabhandini AMCAT ID 130010044292727

Email ID vistamse y.prabhandini@gmail.com Mobile No. 8121939093
AMCAT Score Table


Quan ta ve Ability
(Advanced)
0 out
Automata NA NA
of 100

interviewer.
Strong Areas
Grammar
Comprehension
Basic Mathema cs
Advanced Mathema cs
Applied Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Inspirer
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Scores

5. int balancedParentheses(int c,int d,char *str[]) Errors Generated
^--^--^--^--43: warning: parameter 'str' set but not used [-Wunused-but-set-
parameter] : In func on 'balancedParentheses':
6. int c=atoi(c); :6:1: error: parameter 'c' is ini alized
:6:12: warning: passing argument 1 of 'atoi' makes pointer from integer without a cast [-
^--^--^--^--12: warning: passing argument 1 of 'atoi' makes pointer from integer
Wint-conversion]
without a cast [-Wint-conversion]
In file included from
7. int d=atoi(d);
/disk2/automata_so wares/automata/scoring/files_compiler/resources/automata-
^--^--^--^--12: warning: passing argument 1 of 'atoi' makes pointer from integer c_cpp/binaries/c-headers/stdam.h:29:0,
without a cast [-Wint-conversion] from :0:
8. { /usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int'
9. for(i=1,i<=8,i++) extern int atoi (__const char *__nptr)
^--^--^--^--21: error: expected expression before ')' token ^
10. { :7:1: error: parameter 'd' is ini alized
11. char a=atos(str[]); :7:12: warning: passing argument 1 of 'atoi' makes pointer from integer without a cast [-
^--^--^--^--14: warning: unused variable 'a' [-Wunused-variable] Wint-conversion]
12. } In file included from
13. for(i=1,i<=8,i++) /disk2/automata_so wares/automata/scoring/files_compiler/resources/automata-
^--^--^--^--21: error: expected expression before ')' token c_cpp/binaries/c-headers/stdam.h:29:0,
14. { from :0:
15. if str[i]='(' /usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int'
^--^--^--^--12: error: expected '(' before 'str' extern int atoi (__const char *__nptr)
16. c=c+1 ^
17. else :5:5: error: old-style parameter declara ons in prototyped func on defini on
18. d=d+1 :9:9: error: 'i' undeclared (first use in this func on)
^--^--^--^--0, :9:9: note: each undeclared iden fier is reported only once for each func on it appears in
19. } :9:12: warning: le -hand operand of comma expression has no effect [-Wunused-value]
20. if(c==d) :9:17: warning: le -hand operand of comma expression has no effect [-Wunused-value]
21. prin ('%d',c) :9:21: error: expected ';' before ')' token
^--^--^--^--12: warning: passing argument 1 of 'prin ' makes pointer from integer :9:21: error: expected expression before ')' token
without a cast [-Wint-conversion] :11:16: error: implicit declara on of func on 'atos' [-Werror=implicit-func on-declara on]
22. else :11:25: error: expected expression before ']' token
^--^--^--^--5: error: expected ';' before 'else' :11:14: warning: unused variable 'a' [-Wunused-variable]
23. prin ("-1") :13:12: warning: le -hand operand of comma expression has no effect [-Wunused-value]
24. :13:17: warning: le -hand operand of comma expression has no effect [-Wunused-value]
25. } :13:21: error: expected ';' before ')' token
^--^--^--^--5: error: control reaches end of non-void fu :13:21: error: expected expression before ')' token
26. :15:12: error: expected '(' before 'str'
27. prin ("enter the string"); :21:12: warning: mul -character character constant [-Wmul char]
:21:12: warning: passing argument 1 of 'prin ' makes pointer from integer without a cast [-
^--^--^--^--12: error: expected declara on specifiers or '...' before string constant
Wint-conversion]
28. // WRITE YOUR CODE HERE
29.
^--^--^--^--0,
c_cpp/binaries/c-headers/stdam.h:18:0,
30. }
from :0:
^--^--^--^--1: error: expected iden fier or '(' before '}' token /usr/include/stdio.h:361:12: note: expected 'const char * restrict' but argument is of type
31. // FUNCTION SIGNATURE ENDS 'int'
extern int prin (__const char *__restrict __format, ...);
^
:22:5: error: expected ';' before 'else'
:5:43: warning: parameter 'str' set but not used [-Wunused-but-set-parameter]
: At top level:
:27:12: error: expected declara on specifiers or '...' before string constant
:30:1: error: expected iden fier or '(' before '}' token
: In func on 'balancedParentheses':
:25:5: error: control reaches end of non-void fu
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Given arrays with arrival mes and burst mes for n processes, find average wai ng me using round-robin scheduling. Arrival Time -> [0,100), Burst Time -> (0,100).
The arrays are sorted in ascending order by arrival me.
Input: arrival-> an integer array for list of arrival mes for n number of processes, run-> an integer array for list of burst mes for n number of processes, n-> an integer
represen ng the number of jobs, q-> an integer represen ng the scheduling quantum.
Language : C
Output: A floa ng point number for the average wai ng me which is calculated using round-robin scheduling.
Scores

5. float wai ngTimeRobin(int *arrival, int *run, int n, int q) Errors Generated
6. {
7. // WRITE YOUR CODE HERE : In func on 'wai ngTimeRobin':
8. int a=atoi(arrival); :8:16: warning: passing argument 1 of 'atoi' from incompa ble pointer type [-Wincompa ble-
^--^--^--^--16: warning: passing argument 1 of 'atoi' from incompa ble pointer pointer-types]
type [-Wincompa ble-pointer-types] In file included from
9. int b=atoi(run); /disk2/automata_so wares/automata/scoring/files_compiler/resources/automata-
^--^--^--^--16: warning: passing argument 1 of 'atoi' from incompa ble pointer
from :0:
type [-Wincompa ble-pointer-types] /usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int *'
10. int c=atoi(n);
extern int atoi (__const char *__nptr)
^--^--^--^--9: warning: unused variable 'c' [-Wunused-variable] ^
11. int d=atoi(q); :9:16: warning: passing argument 1 of 'atoi' from incompa ble pointer type [-Wincompa ble-
^--^--^--^--9: warning: unused variable 'd' [-Wunused-variable] pointer-types]
12. prin ("wai ng me of the job is:"%(a+b)) In file included from
^--^--^--^--41: error: invalid operands to binary % (have 'char *' and 'int') /disk2/automata_so wares/automata/scoring/files_compiler/resources/automata-
13. c_cpp/binaries/c-headers/stdam.h:29:0,
14. from :0:
15. } /usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int *'
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- extern int atoi (__const char *__nptr)
type] ^
16. // FUNCTION SIGNATURE ENDS :10:16: warning: passing argument 1 of 'atoi' makes pointer from integer without a cast [-
Wint-conversion]
from :0:
/usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int'
^
:11:16: warning: passing argument 1 of 'atoi' makes pointer from integer without a cast [-
Wint-conversion]
from :0:
/usr/include/stdlib.h:148:12: note: expected 'const char *' but argument is of type 'int'
^
:12:41: error: invalid operands to binary % (have 'char *' and 'int')
:15:1: error: expected ';' before '}' token
:11:9: warning: unused variable 'd' [-Wunused-variable]
:10:9: warning: unused variable 'c' [-Wunused-variable]
:15:1: error: control reaches end of non-void func on [-Werror=return-type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

*N represents the number of processes
Execu on Sta s cs


Comments :

Name Mallarapu Ramya AMCAT ID 130010044380275

Email ID ramya.mallarapu9@gmail.com Mobile No. 8333933124
AMCAT Score Table


Quan ta ve Ability
(Advanced)
0 out
Automata NA NA
of 100

interviewer.
Strong Areas
Grammar
Vocabulary
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Planner
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Language : C
Scores

2. Struct Test Cases Passed : N.A.
3. void main()
^--^--^--^--1: error: expected '=', ',', ';', 'asm' or '__a ribute__' before 'void'
Errors Generated
4. {
5. struct Cnode
6. { :3:1: error: expected '=', ',', ';', 'asm' or '__a ribute__' before 'void'
7. int value; : In func on 'insertSortedList':
8. cnode* next; :22:7: warning: assignment from incompa ble pointer type [-Wincompa ble-pointer-types]
9. }; :23:13: error: request for member 'next' in something not a structure or union
10. int *ptr; :25:12: warning: assignment makes integer from pointer without a cast [-Wint-conversion]
11. int x; :25:20: error: request for member 'next' in something not a structure or union
12. int node=malloc(sizeof(int)); :27:15: error: request for member 'value' in something not a structure or union
13. ptr=node; :30:18: error: request for member 'next' in something not a structure or union
14. prin ("Enter any value to insert"); :34:13: error: request for member 'next' in something not a structure or union
15. scanf("%d",&x); :36:11: error: request for member 'next' in something not a structure or union
16. insertSortedList(node,x); :36:22: error: request for member 'next' in something not a structure or union
17. } :37:12: error: request for member 'value' in something not a structure or union
18. cnode* insertSortedList(cnode* start, int n) :38:12: error: request for member 'next' in something not a structure or union
19. { :40:13: error: request for member 'next' in something not a structure or union
20. int i; :42:11: warning: assignment makes integer from pointer without a cast [-Wint-conversion]
^--^--^--^--8: warning: variable 'i' set but not used [-Wunused-but-set-variable] :42:19: error: request for member 'next' in something not a structure or union
21. int *ptr,*ptr1,*ptr2; :44:52: error: request for member 'value' in something not a structure or union
:47:11: warning: return from incompa ble pointer type [-Wincompa ble-pointer-types]
^--^--^--^--14: warning: variable 'ptr1' set but not used [-Wunused-but-set-
:21:14: warning: variable 'ptr1' set but not used [-Wunused-but-set-variable]
variable]
:20:8: warning: variable 'i' set but not used [-Wunused-but-set-variable]
22. ptr=start;
^--^--^--^--7: warning: assignment from incompa ble pointer type [-
Wincompa ble-pointer-types]
23. while(ptr.next!=NULL)
^--^--^--^--13: error: request for member 'next' in something not a structure or Basic N.A.
union They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
24. {
25. for(i=ptr;ptr.next!=NULL;ptr++) Advanced N.A.
^--^--^--^--20: error: request for member 'next' in something not a structure or They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
union
26. { Edge N.A.
27. if(n<ptr.value) They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
^--^--^--^--15: error: request for member 'value' in something not a structure or Total (Cases Passed/ Total Cases) N.A.
union
29. ptr1=ptr;
30. ptr2=ptr.next; N.A.
^--^--^--^--18: error: request for member 'next' in something not a structure or
union Average-Case Time Complexity Detected
31. }
^--^--^--^--13: error: request for member 'next' in something not a structure or This problem can be ideally solved in O(N) me
union
35. { *N represents the number of elements in the input linked list
36. ptr1.next=start.next;
^--^--^--^--22: error: request for member 'next' in something not a structure or *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
union complexity is measured here using the Big-O asympto c nota on.
37. start.value=n;
^--^--^--^--12: error: request for member 'value' in something not a structure or
union Execu on Sta s cs
38. start.next=ptr2;
union Time taken to submit (hr:min:sec) : 00:57:39
39. } Number of compiles a empts made : 12
union Number of compile a empts witnessing a me-out :0
41. { Number of compile a empts witnessing run me errors :0
42. for(i=ptr;ptr.next!=NULL;ptr++)
union Avg. me taken between each compile (hr:min:sec) : 00:04:48
43. {
44. prin ("values present in the list %d",ptr.value);
^--^--^--^--52: error: request for member 'value' in something not a structure or
union
45. }
46. }
47. return ptr;
^--^--^--^--11: warning: return from incompa ble pointer type [-Wincompa ble-
pointer-types]
48. }
Problem 2
Scores

2. void main() Test Cases Passed : N.A.
^--^--^--^--6: warning: return type of 'main' is not 'int' [-Wmain]
3. {
Errors Generated
4. int a,b,i,j,n;
5. int c[][];
6. int *grid; :2:6: warning: return type of 'main' is not 'int' [-Wmain]
7. prin ("Enter no of rows"); : In func on 'isPath':
8. scanf("%d",&a); :39:1: error: control reaches end of non-void func on [-Werror=return-type]
9. prin ("Enter no of columns"); cc1: some warnings being treated as errors
10. scanf("%d",&b);
11. if(a==b) Test Case Execu on Results
12. {
13. for(i=0;i<a;i++) Basic N.A.
15. for(j=0;j<b;j++) and do not reveal situa ons which need extra checks/handles to be placed on the logic.
16. { Advanced N.A.
17. scanf("%d",&n); They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
18. c[i][j]=n; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
19. } Edge N.A.
20. } They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
21. }
22. c[i][j]=grid;
23. isPath(grid,a,b);
25. int isPath(int **grid, int m, int n)
26. { N.A.
27. int i,j;
28. for(i=0;i<m;i++) Average-Case Time Complexity Detected
29. {
30. for(j=0;j<n;j++) The complexity informa on cannot be generated.
31. { The submi ed source code is incorrect and failed to execute.
32. if(grid[i][j]==9)
33. {
34. prin ("Mooshak can reach the chunk of cheese"); This problem can be ideally solved in O(N2) me
35. }
36. }
37. }
38. complexity is measured here using the Big-O asympto c nota on.
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- It has been benchmarked across problems.
type]
40. // FUNCTION SIGNATURE ENDS Execu on Sta s cs



Comments :

Name Chakka Premadeepika AMCAT ID 130010044491453

Email ID premadeepika22@gmail.com Mobile No. 9059861070
AMCAT Score Table


Quan ta ve Ability
(Advanced)
13 out
Automata NA NA
of 100

interviewer.
Strong Areas
Grammar
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
Automata Details
2 75 mins
Total Score
The candidate has a empted all problems in the test.None of his/her a empted codes have passed their respec ve test suites completely 13 out of 100
Problem 1
Scores

6. int* cellCompete(int*,int);
7. int* cellCompete(int* cells, int days) Aborted while running program. Run me Error: program tried to access unathourised
8. { address. This may occur if your code uses a pointer to which memory is not allocated or
9. // WRITE YOUR CODE HERE there is an array index out of bounds.
10. int i,j,t,u[10];
12. for(i=0;i<=7;i++)
13. { Basic N.A.
14. u[i]=cells[i]; They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
16. Advanced N.A.
17. u[-1]=0; They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
18. u[8]=0; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
19. Edge N.A.
20. for(t=0;t<days;t++)
21. {
22. Total (Cases Passed/ Total Cases) N.A.
23. for(j=0;j<=7;j++)
25. if(u[j-1]==u[j+1])
26. { Readability & Language Best Prac ces
27. cells[j]=0; Line No10,10,10...: Variables are given very short name. (4)
28. }
29. else Performance & Correctness
30. { Line No12,23,36...: Use of hardcoded values must be avoided. (3)
31. cells[j]=1;
32. }
34. cells[-1]=0;
35. cells[8]=0; The complexity informa on cannot be generated.
36. for(i=-1;i<=8;i++)
37. {
38. u[i]=cells[i];
39. }
40.
41.
42. } *Average Case Time Complexity is the order of performance of the algorithm given a random set of inputs. This
43. return cells; complexity is measured here using the Big-O asympto c nota on.
45. // FUNCTION SIGNATURE ENDS It has been benchmarked across problems.
46. int main()
47. { Execu on Sta s cs
48. int days,cells[10],i,*p;
49. prin ("enter no of days"); Time taken to submit (hr:min:sec) : 01:14:10
50. scanf("%d",&days);
51. prin ("enter cell 8 values"); Number of compiles a empts made : 36
52. for(i=0;i<=7;i++) Number of compila on a empts witnessing a successful compile : 23
53. {
54. scanf("%d",&cells[i]);
55. } Number of compile a empts witnessing run me errors :1
56. p=cellCompete(cells,days); Avg. no. of cases passed in each compile : 2.4 %
57. for(i=0;i<=7;i++)
58. { Avg. me taken between each compile (hr:min:sec) : 00:02:03
59. prin ("%d",*p);
60.
61. }
62. return 0;
63. }
Problem 2
Language : C
Scores

^--^--^--^--59: warning: unused parameter 'q' [-Wunused-parameter]
6. { : In func on 'wai ngTimeRobin':
7. // WRITE YOUR CODE HERE :5:29: warning: unused parameter 'arrival' [-Wunused-parameter]
8. :5:43: warning: unused parameter 'run' [-Wunused-parameter]
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- :5:59: warning: unused parameter 'q' [-Wunused-parameter]
type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs


Comments :

Name Mandala Lsrajyalakshmi Andal AMCAT ID 130010044975869

Email ID mandala.lalitha@gmail.com Mobile No. 8332827572
AMCAT Score Table


Quan ta ve Ability
67% 76% 545 Applied Mathema cs A Basic Mathema cs B Advanced Mathema cs A
(Advanced)
0 out
Automata NA NA
of 100

interviewer.
Strong Areas
Grammar
Applied Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Scores

6. int lruCountMiss(int,int,int);
^--^--^--^--5: note: previous declara on of 'lruCountMiss' was here :7:6: warning: return type of 'main' is not 'int' [-Wmain]
7. void main() :18:5: error: conflic ng types for 'lruCountMiss'
^--^--^--^--6: warning: return type of 'main' is not 'int' [-Wmain] :6:5: note: previous declara on of 'lruCountMiss' was here
9. int n,a[100],i,ps,re; :22:10: error: 'a' undeclared (first use in this func on)
10. prin ("enter no of pages and page size"); :22:10: note: each undeclared iden fier is reported only once for each func on it appears in
11. scanf("%d%d",&n,&ps); :23:15: error: 'n' undeclared (first use in this func on)
12. prin ("enter page values"); :26:14: error: 'i' undeclared (first use in this func on)
13. for(i=0;i<n;i++) :29:15: error: expected expression before ']' token
14. scanf("%d",&a[i]); :18:22: warning: unused parameter 'max_cache_size' [-Wunused-parameter]
15. re=lruCountMiss(ps,*a,n); :18:43: warning: unused parameter 'pages' [-Wunused-parameter]
16. prin ("%d",re); :18:54: warning: unused parameter 'len' [-Wunused-parameter]
17. } :36:1: error: control reaches end of non-void func on [-Werror=return-type]
18. int lruCountMiss(int max_cache_size, int *pages, int len) cc1: some warnings being treated as errors
^--^--^--^--54: warning: unused parameter 'len' [-Wunused-parameter]
20. int k,d;
21. int b[3]; Basic N.A.
22. b[0]=a[0]; They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
^--^--^--^--10: note: each undeclared iden fier is reported only once for each and do not reveal situa ons which need extra checks/handles to be placed on the logic.
func on it appears in Advanced N.A.
23. for(k=1;k<n;k++) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
^--^--^--^--15: error: 'n' undeclared (first use in this func on) implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
24. { Edge N.A.
25. d=0; They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
26. if(a[i]!=b[d]) Total (Cases Passed/ Total Cases) N.A.
^--^--^--^--14: error: 'i' undeclared (first use in this func on)
28. d++;
29. b[]
N.A.
^--^--^--^--15: error: expected expression before ']' token
30. }
31. }
32.
33. The complexity informa on cannot be generated.
34. // WRITE YOUR CODE HERE The submi ed source code is incorrect and failed to execute.
35.
36. } This problem can be ideally solved in O(N) me
type] *N represents the number of requested page references
Execu on Sta s cs

Problem 2
Scores

^--^--^--^--34: warning: unused parameter 'days' [-Wunused-parameter]
6. { : In func on 'cellCompete':
7. // WRITE YOUR CODE HERE :5:23: warning: unused parameter 'cells' [-Wunused-parameter]
8. :5:34: warning: unused parameter 'days' [-Wunused-parameter]
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- cc1: some warnings being treated as errors
type]
10. // FUNCTION SIGNATURE ENDS Test Case Execu on Results
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs


Comments :

Name Nirmala Devi Kethireddy AMCAT ID 130010068266239

Email ID nirmala2438@gmail.com Mobile No. 9704134516
AMCAT Score Table


English Comprehension 64% 66% 510 Grammar C Vocabulary A Comprehension A
Quan ta ve Ability
68% 76% 550 Basic Mathema cs A Applied Mathema cs B Advanced Mathema cs B
(Advanced)
WriteX NA NA NA NA
0 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 92% 98% 565 Data Structures A A Basic Programming A
Theory

interviewer.

Vocabulary Grammar
Comprehension
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Language : C
Scores

6. cnode* insertSortedList(cnode* start, int n)
^--^--^--^--43: warning: unused parameter 'n' [-Wunused-parameter] : In func on 'insertSortedList':
7. { :6:32: warning: unused parameter 'start' [-Wunused-parameter]
8. // WRITE YOUR CODE HERE :6:43: warning: unused parameter 'n' [-Wunused-parameter]
type] Test Case Execu on Results
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Scores

5. int lruCountMiss(int max_cache_size, int *pages, int len) Errors Generated
^--^--^--^--54: warning: unused parameter 'len' [-Wunused-parameter]
7. // WRITE YOUR CODE HERE :5:22: warning: unused parameter 'max_cache_size' [-Wunused-parameter]
8. :5:43: warning: unused parameter 'pages' [-Wunused-parameter]
9. } :5:54: warning: unused parameter 'len' [-Wunused-parameter]
type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

WriteX
Answer Comment
I agree life in a small town is be er than life in a big city, because it improve rela onships and friendly nature with friends. Write your comments below
But in big city there is no rela ons even with their rela ves in the same city. It destroy the rela onships. In a small town so
many friends are added and play game with them and a end so many rela ve and friends par es. These places near to
villages so if they have holidays, they enjoy their holidays in villages because it had very pieceful nature. If some familes have
problems automa cally their rela ves or friends react very quickly and help to them. But in big city they don't take any risks
to solve other problems and see others if they are in problem. They always busy with their works and their family only. This
large ci es are long from small ci es and villages so they don't try to go their rela ve homes and they forgot their
rela onships.
In small towns, they know rela ons from childhood. And they play so many games. Their minds are very sharp and easily
communicate with new persons, by this they improve their network very easily. But whoever live in big ci es they are silent
and not commucate others and they always spend their me with their families only. They don't a end any par es.

Comments :

Name Kun Supriya Nagendra AMCAT ID 130010068419815

Email ID 144g1a04a4@srit.ac.in Mobile No. 8096736496
AMCAT Score Table


Quan ta ve Ability
(Advanced)
WriteX NA NA NA NA
15 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 26% 27% 325 Data Structures B Basic Programming C C
Theory

interviewer.

Grammar Basic Programming
Vocabulary OOP and Complexity Theory
Comprehension
Applied Mathema cs
Advanced Mathema cs
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver
Automata Details
2 75 mins
Total Score
The candidate has a empted all problems in the test.None of his/her a empted codes have passed their respec ve test suites completely.
15 out of 100
Problem 1
Language : C
Scores

type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Scores
pass.
Run me Complexity Score 0/3 Programming Prac ces N.A.

5. int balancedParentheses(char *str) Warnings Generated
6. {
7. if(strlen(str)%2==0) None
8. {
9. return(strlen(str)); Test Case Execu on Results
10. }
11. else Basic 28.6%
13. return(-1); and do not reveal situa ons which need extra checks/handles to be placed on the logic.
14. } Advanced 50%
15. They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
16. implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
17. } Edge 100%
Total 43.8%
N.A.

Execu on Sta s cs

WriteX
Problem Statement - The candidate's essay on the topic 'The role of culture and tradi on is equally important to science in the progress and well-being of a society.' is given
below:
Answer Comment
Yes. The role of culture and tradi on is equally important to science in the progress and well-being of a society. Every Write your comments below
country should have their own culture and tradi on to servive in this world. It is more o en to follow the rules of culture
and tradi on in our own's country.
Now a days, science and technology plays a very important role in this world. So every person in this world should be very
fortunate to follow the culture and tradi on of this country. In order to servive in this world fastly we use technology as a
improved version. But, in order to survive the culture and tradi on also plays a very important role as of the science and
technology.
The technology is being improved in everyday life but it is quite important to rather be followed up the rules and regula ons
of our culture and tradi on. That should be the important ma er that no one should break. As of now there is no such
misbehaviour of the persons regarding the rules and regula ons of the society.
Now a days the technology has improved alot compared to the previous sec ons.
Today it is so much important to survive so we should follow the rules and regula ons of the culture and tradi on .
Finally, I conclude that culture and tradi on is very important as of science and technology.

Comments :

Name Nikhitha Tambrahalli AMCAT ID 130010068573431

Email ID nikhitha97simple@gmail.com Mobile No. 9441961796
AMCAT Score Table


English Comprehension 64% 66% 510 Grammar B Vocabulary B Comprehension A
Quan ta ve Ability
(Advanced)
Logical Ability 74% 83% 530 Induc ve Reasoning A Deduc ve Reasoning B Abduc ve Reasoning A
WriteX NA NA NA NA
0 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 55% 78% 415 B Basic Programming A Data Structures C
Theory

interviewer.

Comprehension Data Structures
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Abduc ve Reasoning
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Language : C
Scores

type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Language : C
Scores

2. #include<conio.h> Test Cases Passed : N.A.
^--^--^--^--18: fatal error: conio.h: No such file or directory
3. // INCLUDE HEADER FILES NEEDED BY YOUR PROGRAM
Errors Generated
6. // cnode STRUCTURE IS DEFINED BY DEFAULT :2:18: fatal error: conio.h: No such file or directory
7. // FUNCTION SIGNATURE BEGINS, THIS FUNCTION IS REQUIRED compila on terminated.
10. // WRITE YOUR CODE HERE
11. Basic N.A.
13. // FUNCTION SIGNATURE ENDS and do not reveal situa ons which need extra checks/handles to be placed on the logic.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

WriteX
Problem Statement - The candidate's essay on the topic 'The true defini on of success is to have a healthy work-life balance.' is given below:
Answer Comment
Yes I will agree for this statement because in my point of view success will come if we make our work-life balance. Consider Write your comments below
our life as example we have to do our work within me in that me only we will face so many problems that may be related
to our family in that case generally we loose our pa ence and we will get distracted from our work this leads to the work
failure within me so we have to balance those things and should complete the work. person having somany problems got
success in his project this happened beacuse even though he is facing that issues ll he worked hard to complete his work
this will show his responsibility towards his job. Well organised things seem to be perfect, so is our life. The blend of
simplicity and balance makes ones life perfect. I here by believe that the true defini on od success is to have a healthy work-
life balance.

Comments :

Name Mounika Rachamallu AMCAT ID 130010068742335

Email ID mounirachamallu@gmail.com Mobile No. 8501014342
AMCAT Score Table


Quan ta ve Ability
83% 88% 605 Applied Mathema cs A Basic Mathema cs A Advanced Mathema cs B
(Advanced)
WriteX NA NA NA NA
0 out
Automata NA NA
of 100
OOP and Complexity
Theory

interviewer.
Strong Areas
Vocabulary
Comprehension
Applied Mathema cs
Basic Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Planner
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Input: arrival-> an integer array for list of arrival mes for n number of processes, run-> an integer array for list of burst mes for n number of processes, n-> an integer Language : C
Scores

type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Input: start-> any node in sorted circular linked list, n-> number to be inserted. Language : C
Scores

7. { :6:32: warning: unused parameter 'start' [-Wunused-parameter]
8. // WRITE YOUR CODE HERE :6:43: warning: unused parameter 'n' [-Wunused-parameter]
type] Test Case Execu on Results
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

WriteX
Answer Comment
Life in a small town is be er compare to big city why because in big ci es there were no rela onships between the Write your comments below
neighbours and no one is take responsibibility iwhen we are in problems.The places of small towns also peaceful and no
traffic and no accidents.In big ci es traffic is heavy. every day we hear about the accidents becaus eof traffic.Pollu on is also
heavy in big ci es because factories are consrtucted near to the ci es.In small town factories are construct out of the towns
and also avoid release the wastage from the factories.
Life is peaceful in small towns compare to big ci es.For doing jobs mandatory to go to the big ci es.i am always oppos ethe
big ci es.In ci es no one is encourage us when we are in problems.But in small towns neighbours are good and heap a lot
and responsibility of us.There is no traffic problems in small towns and no one got accidents.If got accident the surrounding
people as early as possible take him/her into hospital and take responsibility but in ci es no one take responsibility.every
one busy with works and job.
In small towns we are care to see the parents.if any health problems immediately take to the hospital but in big ci es if we
are went to office.No on eis take responsibility of our parents.No one is saw our parents like ur.In ci es most of the people
take parents and join them in oldage homes But thsi is not correct .In small towns whater works we have maintain and
balance the both.every body remember without parents we are nothing.Job is important but parents also important so we
balance the both in cri cal situa ons also give important to parents.

Comments :

Name Venkatagopi Maddi AMCAT ID 130010118532319

College Chebrolu Engineering College,Guntur. Degree (Stream) B.Tech/B.E. ()
Email ID maddivenkatagopi@gmail.com Mobile No. 9030456211
AMCAT Score Table


Quan ta ve Ability
68% 97% 550 Basic Mathema cs B Applied Mathema cs A Advanced Mathema cs B
(Advanced)
41% 41% 292 Analog Electronics B Digital Electronics B C
OOP and Complexity
Computer Programming 65% 75% 445 Basic Programming A Data Structures B B
Theory

interviewer.

Vocabulary Semiconductors and Semiconductor
Applied Mathema cs Devices
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist


Comments :

Name Gopiraju Son neni AMCAT ID 130010599833215

Andhra Loyola Ins tute Of Engineering and
Technology,Vijayawada.
Email ID sgraj150797@gmail.com Mobile No. 7659091049
AMCAT Score Table


Quan ta ve Ability
(Advanced)
26 out of
Automata NA NA
100
Not
Computer Programming NA 0 NA
A empted.

interviewer.
Strong Areas
Grammar
Comprehension
Applied Mathema cs
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Thinker
Automata Details
2 75 mins
Total Score
26 out of 100
However, on an average, his/her codes which fail the test suite posses sema c structures similar to their respec ve correct solu ons.
Problem 1
Scores
Par ally correct basic func onality Correct with inadvertent errors
Source code compiles and passes only some of the basic test cases. Some advanced or edge cases may randomly Correct control structures and cri cal data-dependencies incorporated. Some inadvertent errors make the code
pass. fail test cases.

1. // INCLUDE HEADER FILES NEEDED BY YOUR PROGRAM Compiler Warnings Generated : Yes
5. int* cellCompete(int* cells, int days) Warnings Generated
6. {
7. // WRITE YOUR CODE : In func on 'cellCompete':
8. int a[8],i,j,b,c; :8:21: warning: unused variable 'c' [-Wunused-variable]
^--^--^--^--19: warning: unused variable 'b' [-Wunused-variable] :8:19: warning: unused variable 'b' [-Wunused-variable]
9. for(i=0;i<8;i++)
10. a[i]=cells[i]; Test Case Execu on Results
11. for(j=0;j<days;j++)
12. { Basic 50%
13. for(i=1;i<7;i++) They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
14. { and do not reveal situa ons which need extra checks/handles to be placed on the logic.
15. Advanced 25%
16. if((a[i-1]==0 && a[i+1]==0) || (a[i-1]==1 && a[i+1]==1) ) They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
17. cells[i]=0; implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
18. else Edge 100%
19. cells[i]=1; They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
20. }
Total 50%
21. for(i=0;i<8;i++)
22. a[i]=cells[i];
24. cells[0]=cells[7]=0;
25. return cells; Readability & Language Best Prac ces
26. Line No8,8,8...: Variables are given very short name. (5)
27. }
28. // FUNCTION SIGNATURE ENDS Performance & Correctness
Line NoArray...: Unused parameter/variable. (2)

Execu on Sta s cs

Problem 2
Language : C
Scores

type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs


Comments :

Name Harshini Nandyala AMCAT ID 130010647453563

V N R VIGNAN JYOTHI INSTITUTE OF ENGG. AND
TECH.,Rangareddy.
Email ID harshinin123@gmail.com Mobile No. 7386120275
AMCAT Score Table


Quan ta ve Ability
95% 0NA 680 Basic Mathema cs A Applied Mathema cs A Advanced Mathema cs A
(Advanced)
Logical Ability 79% 0NA 545 Induc ve Reasoning A Deduc ve Reasoning A Abduc ve Reasoning C
0 out
Automata NA NA
of 100
OOP and Complexity
Computer Programming 62% 0NA 435 B Data Structures B Basic Programming A
Theory

interviewer.

Grammar Abduc ve Reasoning
Vocabulary
Comprehension
Basic Mathema cs
Applied Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Deduc ve Reasoning
Basic Programming
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Idealist
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Input: grid-> two-dimensional array for maze matrix, m,n-> dimensions of the matrix
Language : C
Scores

5. int isPath(int **grid, int m, int n) Errors Generated
^--^--^--^--35: warning: unused parameter 'n' [-Wunused-parameter]
6. { : In func on 'isPath':
7. // WRITE YOUR CODE HERE :5:18: warning: unused parameter 'grid' [-Wunused-parameter]
8. :5:28: warning: unused parameter 'm' [-Wunused-parameter]
type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Problem 2
Language : C
Scores

7. { :8:5: error: unknown type name 'node'
8. node *p1,*p2,*p; :10:7: warning: assignment from incompa ble pointer type [-Wincompa ble-pointer-types]
^--^--^--^--5: error: unknown type name 'node' :11:12: error: request for member 'number' in something not a structure or union
9. p1=NULL; :11:21: error: 'x' undeclared (first use in this func on)
10. p2=start; :11:21: note: each undeclared iden fier is reported only once for each func on it appears in
:11:28: error: request for member 'next' in something not a structure or union
:14:14: error: request for member 'next' in something not a structure or union
Wincompa ble-pointer-types] :16:18: error: request for member 'next' in something not a structure or union
11. for(;p2->number<x;p2=p2->next)
:20:8: error: 'node' undeclared (first use in this func on)
^--^--^--^--28: error: request for member 'next' in something not a structure or :20:13: error: expected ';' before 'malloc'
union :21:6: error: request for member 'number' in something not a structure or union
12. { :22:6: error: request for member 'next' in something not a structure or union
13. p1=p2; :25:14: warning: assignment from incompa ble pointer type [-Wincompa ble-pointer-types]
14. if(p2->next->next ==NULL) :29:11: error: request for member 'next' in something not a structure or union
^--^--^--^--14: error: request for member 'next' in something not a structure or :6:43: warning: unused parameter 'n' [-Wunused-parameter]
union : At top level:
15. { :34:12: error: unknown type name 'node'
16. p2=p2->next; :47:13: error: unknown type name 'node'
^--^--^--^--18: error: request for member 'next' in something not a structure or :65:1: error: return type defaults to 'int' [-Werror=implicit-int]
union : In func on 'insertSortedList':
17. break; :32:1: error: control reaches end of non-void func on [-Werror=return-type]
19. }
20. p=(node)malloc(sizeof(node)); Test Case Execu on Results
^--^--^--^--13: error: expected ';' before 'malloc'
21. p->number=x; Basic N.A.
^--^--^--^--6: error: request for member 'number' in something not a structure or They demonstrate the primary logic of the problem. They encompass situa ons which would be seen on an average
union and do not reveal situa ons which need extra checks/handles to be placed on the logic.
22. p->next=NULL; Advanced N.A.
^--^--^--^--6: error: request for member 'next' in something not a structure or They contain pathological input condi ons which would a empt to break codes which have incorrect / semi-correct
union implementa ons of the correct logic or incorrect / semi-correct formula on of the logic.
23. if(p1==NULL) Edge N.A.
24. { They specifically confirm whether the code runs successfully on the extreme ends of the domain of inputs.
25. start=p;
Wincompa ble-pointer-types]
26. }
27. else
28. { N.A.
29. p1->next=p;
^--^--^--^--11: error: request for member 'next' in something not a structure or Average-Case Time Complexity Detected
union
30. return (start); The complexity informa on cannot be generated.
32. }
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- This problem can be ideally solved in O(N) me
type]
33. *N represents the number of elements in the input linked list
34. void print(node * list)
^--^--^--^--12: error: unknown type name 'node'
35. { *This is the complexity detected by empirically fi ng a curve to the run- me for different input sizes to the given code.
36. if(list->next !=NULL) It has been benchmarked across problems.
37. {
38. prin ("%d-->",list->number); Execu on Sta s cs
39. if(list->next->next == NULL)
40. {
41. prin ("%d",list->next->number); Time taken to submit (hr:min:sec) : 00:30:16
42. print(list->next); Number of compiles a empts made :2
43. }
44. return;
45. } Number of compile a empts witnessing a me-out :0
46. } Number of compile a empts witnessing run me errors :0
47. void create(node *list)
^--^--^--^--13: error: unknown type name 'node'
48. { Avg. me taken between each compile (hr:min:sec) : 00:15:08
49. prin ("give numbern");
50. prin ("give 0 at the end");
51. scanf("%d",&list->number);
52.
53. if(list->number ==0)
54. {
55. list->next=NULL;
56. }
57. else
58. {
59. list->next= (node*)malloc(sizeof(node));
60. create(list->next);
61. }
62. return;
63. }
64.
65. main()
^--^--^--^--1: error: return type defaults to 'int' [-Werror=implicit-int]
66. {
67. int n;
68. node* start;
69. void create(node *p);
70. node *insert(node *p, int n);
71. void print(node *p);
72. start= (node *)malloc(sizeof(node));
73. create(start);
74. prin ("n");
75. prin ("original list:");
76. prin (head);
77. prin ("nn");
78. prin ("input number to be inserted");
79. scanf("%d",&n);
80. start=insert(start,n);
81. prin ("n");
82. prin ("the new list:");
83. print(start);
84.
85. }

Comments :

Name Shaik Karishma AMCAT ID 130010706725941

Email ID karishmask222@gmail.com Mobile No. 8523092817
AMCAT Score Table


Quan ta ve Ability
54% 70% 505 Applied Mathema cs B Basic Mathema cs B Advanced Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &

interviewer.

Induc ve Reasoning DBMS
Deduc ve Reasoning
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :

Name Surapureddy Anjani AMCAT ID 130010706725949

Email ID anjanisurapureddy@gmail.com Mobile No. 9618110678
AMCAT Score Table


Quan ta ve Ability
71% 82% 560 Applied Mathema cs B Basic Mathema cs A Advanced Mathema cs A
(Advanced)
Logical Ability 48% 49% 460 Induc ve Reasoning A Deduc ve Reasoning C Abduc ve Reasoning B
OOP and Complexity
Theory
Opera ng System &
Computer Science 76% 86% 469 DBMS B A Computer Networks A

interviewer.

Grammar Deduc ve Reasoning
Vocabulary
Comprehension
Basic Mathema cs
Advanced Mathema cs
Induc ve Reasoning
Basic Programming
Data Structures
Architecture
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :

Name Venkatanagadurganikhila Immadise y AMCAT ID 130010673446447

College S V College Of Engineering,Tirupa . Degree (Stream) B.Tech/B.E. ()
Email ID ivndnikhila222@gmail.com Mobile No. 9491272561
AMCAT Score Table


Quan ta ve Ability
64% 62% 535 Basic Mathema cs A Applied Mathema cs A Advanced Mathema cs B
(Advanced)
OOP and Complexity
Theory
Opera ng System &
Computer Science 30% 27% 315 Computer Networks A DBMS C C

interviewer.

Vocabulary DBMS
Comprehension Opera ng System & Computer
Basic Mathema cs Architecture
Applied Mathema cs
Abduc ve Reasoning
Data Structures
Basic Programming
Computer Networks
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Giver


Comments :

Name Gurucharan Chowdary Ananthaneni AMCAT ID 130010673653183

College S V College Of Engineering,Tirupa . Degree (Stream) B.Tech/B.E. ()
Email ID gurucharan257@gmail.com Mobile No. 9676531422
AMCAT Score Table


Quan ta ve Ability
(Advanced)
57% 49% 324 Digital Electronics C Analog Electronics A A
OOP and Complexity
Computer Programming 74% 86% 475 Basic Programming A B Data Structures A
Theory

interviewer.

Vocabulary
Comprehension
Induc ve Reasoning
Deduc ve Reasoning
Abduc ve Reasoning
Analog Electronics
Devices
Basic Programming
Data Structures
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Protector


Comments :

Name Sushma Pesala AMCAT ID 130010858327466

College SREE VENKATESWARA COLL OF ENGG,Nellore. Degree (Stream) B.Tech/B.E. ()
Email ID sushmapesala@gmail.com Mobile No. 8978166030
AMCAT Score Table


Quan ta ve Ability
(Advanced)
Essay Wri ng NA NA NA NA
3% 1% 164 Digital Electronics C C Analog Electronics C
0 out
Automata NA NA
of 100

interviewer.

Basic Mathema cs Semiconductors and Semiconductor
Advanced Mathema cs Devices
Analog Electronics
Personality Summary
JOB SUITABILITY
Self Drive
PERSONALITY TYPE
Visionary
Automata Details
2 75 mins
Total Score
0 out of 100
Problem 1
Input: list -> pointer to a linked list .
Language : C
Scores

^--^--^--^--33: warning: unused parameter 'list' [-Wunused-parameter] : In func on 'reverseLinkedList':
7. { :9:8: error: 'n' undeclared (first use in this func on)
8. // WRITE YOUR CODE HERE :9:8: note: each undeclared iden fier is reported only once for each func on it appears in
9. for(n>) :9:10: error: expected expression before ')' token
^--^--^--^--10: error: expected expression before ')' token :9:10: error: expected expression before ')' token
10. :11:1: error: expected expression before '}' token
11. } :6:33: warning: unused parameter 'list' [-Wunused-parameter]
type]
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

*N represents the length of linked list
Execu on Sta s cs

Problem 2
Scores

^--^--^--^--34: warning: unused parameter 'days' [-Wunused-parameter]
6. { : In func on 'cellCompete':
7. // WRITE YOUR CODE HERE :5:23: warning: unused parameter 'cells' [-Wunused-parameter]
8. :5:34: warning: unused parameter 'days' [-Wunused-parameter]
^--^--^--^--1: error: control reaches end of non-void func on [-Werror=return- cc1: some warnings being treated as errors
type]
10. // FUNCTION SIGNATURE ENDS Test Case Execu on Results
Basic N.A.
Advanced N.A.
Edge N.A.
N.A.

Execu on Sta s cs

Essay Wri ng
Problem Statement - The candidate's essay on the topic 'The factors that one would consider while deciding whether to join a par cular organiza on or not. The job is of
candidate's choice and the salary meets expecta ons.ﾠﾠ' is given below:
Answer Comment
Firstly i will known about the organisa on details such as where it is situated and do it have any other branches not only in Write your comments below
our country but also in the abroad. As i living in the same place wherei born i wolud like to go to the new place in order to
know about the culture and the way of thinking that the people in that place are so that it will help me to think in the
different way that helps me and the sciety.
Second thing is about the environment of the company and its growth. If there is growth in the company only then the
people feel interested to complete the task and perform their best. If the facili es are not good then the employees feel
red and discomfort to perfom so this may effect the reputa on of the company.
Moreover i will prefer to join the company where i can get more knowledge and improve my skills rather than amount they
are giving.I feel that the people who are sa sfied with the work are more happy that the people who are ge ng more
amount salary. People who are ge ng high salary and doing the job that don't like may leads to increase in the streelevel
and are more worried about loosing job. Person who gets salary that is sufficient to lead the life and is working in the area
where they are interested will feel curious abot the task and do efforts as much as they can to complte the work.

Comments :

Amcat Reports - AM Pool - Andhra PDF

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Amcat Reports - AM Pool - Andhra PDF

Hochgeladen von

Copyright:

Verfügbare Formate

4/27/2018 _corporate_2_pager.

Aspiring Minds Candidate Ability Report

Name Nagasai Gayathri Gamini AMCAT ID 30002434252345

AMCAT Score Table

Na onal College AMCAT

Strengths and Weaknesses

People Interac on interac o Trainability trainabilit

Func onal correctness 1/5 Programming Ability 3/5

Run me Complexity Score N.A. Programming Prac ces N.A.

Candidate Source Code Results

Final Code Submi ed Code Execu on Summary

Code Compila on : Run me Error

Time taken to submit (hr:min:sec) : 00:39:09

Func onal correctness 1.3/5 Programming Ability 1/5

Run me Complexity Score 0/3 Programming Prac ces 1/4

Candidate Source Code Results

Final Code Submi ed Code Execu on Summary

Code Compila on : Pass

The complexity informa on cannot be generated.

This problem can be ideally solved in O(N2) me

*N represents the number of rows/columns of the input grid

Time taken to submit (hr:min:sec) : 00:24:39

DIFFERENT AREAS OVERALL EVALUATION

Final Decision : Hired Rejected On hold

Aspiring Minds Candidate Ability Report

Name Lavanya Mutyala AMCAT ID 30002434285531

AMCAT Score Table

Na onal College AMCAT

Strengths and Weaknesses

Strong Areas Weak Areas

People Interac on interac o Trainability trainabilit

DIFFERENT AREAS OVERALL EVALUATION

Final Decision : Hired Rejected On hold

Aspiring Minds Candidate Ability Report

Name Sirichand Kuragan AMCAT ID 30002434752031

AMCAT Score Table

Na onal College AMCAT

Strengths and Weaknesses

Strong Areas Weak Areas

People Interac on interac o Trainability trainabilit

Func onal correctness N.A. Programming Ability N.A.

Run me Complexity Score N.A. Programming Prac ces N.A.

Candidate Source Code Results

Final Code Submi ed Code Execu on Summary

Code Compila on : Compila on Error

Structural Vulnerabili es and Errors

Average-Case Time Complexity Detected

The complexity informa on cannot be generated.

This problem can be ideally solved in O(N) me

*N represents the number of requested page references

Time taken to submit (hr:min:sec) : 00:04:21

Func onal correctness N.A. Programming Ability N.A.

Run me Complexity Score N.A. Programming Prac ces N.A.

Candidate Source Code Results

Final Code Submi ed Code Execu on Summary

Code Compila on : Compila on Error

Structural Vulnerabili es and Errors

Average-Case Time Complexity Detected

The complexity informa on cannot be generated.

This problem can be ideally solved in O(N) me

*N represents the number of parentheses characters in the input sequence

Time taken to submit (hr:min:sec) : 00:19:15

DIFFERENT AREAS OVERALL EVALUATION