• Placement Questions
• /
• Programming

Placement Papers with Solutions

(#M40166286) JAVA QUESTION NEAREST PERFECT SQUARE Keep an EYE

Find the nearest perfect square of the given number.
Sample input:600
Sample output:576.

Sample input:47011
Sample output:47089

Asked In Java Arun (6 years ago)

Solved divya Read Solution (1)

Is this Puzzle helpful?   (5)   (2) Submit Your Solution Database

(#M40165956) C QUESTION Loop Keep an EYE

What will be the output of the C program, if input is 6?

#include
int main()
{
unsigned char i = 0;
for(;i<=0;i++) ;
printf("%dn",i);
return 0;
}

Asked In C Sandip Hazra (6 years ago)

Solved Arka Mondal Read Solution (6)

Is this Puzzle helpful?   (22)   (11) Submit Your Solution Output

(#M40164911) TCS QUESTION C programming Keep an EYE

1.Write a c program to convert binary to decimal
using command line arguments?
2.Write a c program to check whether given no. is palindrome or not?
3. C program to find sum of N prime nos.?

Asked In TCS Cs patel (8 years ago)

Solved ashok Read Solution (14)

Is this Puzzle helpful?   (94)   (16) Submit Your Solution Variables

(#M40158055) ANDROID QUESTION Technical Keep an EYE

What is a GCM in android?
Options
1) Google Cloud Messaging
2) Google Count Messaging
3) Google Message pack
4) None of the above

Solution

Google Cloud Messaging

Like manish sir answer on facebook.

Asked In Android Ashish (8 years ago)

Solved Read Solution (5)

Is this Puzzle helpful?   (1)   (1) Submit Your Solution Technical

(#M40154993) AMCAT QUESTION Technical (Computer Programming and Computer science) Keep an EYE

Can anyone solve this questions. I need help as I don't know the answers.
Question 1)
Let us assume that P is a process and following two statements are true about the process So, what can be concluded about the process P from these statements?
1. P can move from one processor to another in Symmetric Multiprocessor System.
2 P generates I/0 requests Infrequently, using more of Its time doing computations.
Options are:
1)P has soft affinity for the processor and is a CPU-bound process
2) P has soft affinity for the processor and Is a I/0-bound process
3)P has hard affinity for the processor and is a I/0-bound process
4) P has hard affinity for the processor and is a CPU-bound process

Question 2)
Which of the following statements is/are incorrect’
1. A thread can acquire more than one lock(Mute).
2. Deadlock will occur if a non-recursive mutex is locked more than once.
3. Mutex Is a signaling mechanism used to synchronize access to a resource.
1)Only 1
2)OnIy2
3Only3
4)Both 1 and 2

Question 3)
Each step in the evaluation of an Infix expression refers to the encounter of a token. In the evaluation of the fully parenthesized Infix expression -
((1*2)+4-((7*6)/(8-9)))
Which of the followrng options shows the contents of the Stack after 7th step’
1)((*)+-(
2)((1*2)+
3)((2+
4)(2+4


Question 4)
When a process creates a new process, then which of the following options is shared between the parent process and the child process –
1)Stack
2)Heap
3)Shared memory segment
4)Thread stack


Question 5)
Consider the given declarations-
integer (*arr1)[10]
integer *arr2[10]
Which of the following statements is true regarding the above?
1)arr1 is pointer to an array of integers
arr2 is array of integer pointers
2)arr1 and arr2 both are pointers to array of integers
3)arr1 and arr2 both are arrays of integer pointers
4)arr1 is array of integer pointers
arr2 is pointer to an array of integers


Question 6)
Ama wants to write a program to traverse trees but she does not know how to implement Stacks Which of the following methods can she use to bring out the same?
1) Adding another level of dummy leaf nodes
2) Adding parent node for each node of the tree.
3)Representing the given Binary tree as Threaded Binary tree.
Options are:
1)Only1
2)Only 2
3) Only3
4)Both 1 and 2
5)Both 2 and 3


Question 7)
A semaphore S is an integer variable that, apart from initialization, is accessed only through two standard atomic operations What are those operations?
1)test() and set()
2)wait() and signal()
3)lock() and unlock()
4) test() and flag()


Question8)
Consider the given conditions in regards to the circular queue
1) (FRONT = 0) and (REAR =CAPACITY - 1)
2) FRONT = REAR
3)FRONT = CAPACITY-- REAR
Which of the above conditions tests the overflow condition of a circular queue?
1)Only l
2)Only2
3)Onty3
4) Both l and 2
5) Both l and 3


Question 9)
There are 2 groups – group a and group b. Match the following
Group A
A)Selective Set
B)Selective Complement
C)Selective clear
D)Mask
Group B
1)0100
2)0111
3)0001
4)0110
Let’s suppose the value of Register R1= 0101 and Register R2= 0011. After performing the Group A operations on both the registers, what will be the content of register R1 in Group B for each specific operation?
1)A-3, B-1,C-4,D-2
2)A-2,B-4,C-1,D-3
3)A-4, B-2, C-3, D-1
4) A-1,B-3,C-2,D-4


Question 10)
Please solve the numerical
Assume that a pipelining is implemented and the data given are
b=3,Pj=04, Pt=06
where
b = jump penalty(loss of cycles due to jump)
Pj = probablity that the instruction is a jump
Pt = probability that the jump is taken
What will be the execution efficiency?
1)0.58
2)0.52
3)0.66
4)0.5

Question 11)
Which of the following statements are true?
1)Transfer of data from Main Memory to Cache Memory is known as mapping process
2) Associative Memory stores both address and data of memory word
3)If the word is not found in the Cache and is in main memory, it is a miss
4) Content Addressable Memory and Associative Memory are same
Options are:
1)Both 1 and 3
2) Both 2 and 3
3)Both 1 and 4
4)1,2 and 3
5)All-1,2, 3 and 4


Question 12)
How many locations can be addressed by a memory chip haying 14 address pins and 4 data pins?
1)2
2)2^10
3) 2^14
4 2^18

Question13)
Friends,Please give the answer-
Shortforms given are
Process> Pro
Arrival Time>A
Priority >Pri
Burst Time in Milliseconds (ms)>B
Friends,Please give the answer after studying process table.
Pro A Pri B(in ms)
P1 0 2 10
P2 0 5 2
P3 2 4 1
P4 2 1 2
P5 3 3 3
There are 5 processess-
Calculate the average waiting time, if the processes are first processed by the first come first serve(FCFS) scheduling (according to their order In the Question) untill all of them arrive . in the system and when all the processes have arrived then they will be scheduled by priority scheduling.
1)7.2
2)8.2
3)9.2
4)10.2


Question 14)
Friends,Please give the answer-
Shortforms given are
Process> Pro
Arrival Time>A
Priority >Pri
Burst Time in Milliseconds (ms)>B
Pro A Pri B(in ms)
P1 0 3 10
P2 0 1 1
P3 2 5 2
P4 2 4 1
P5 3 2 5
There are 5 processes P1, P2. P3, P4 and P5 which are processed by Preemptive Priority scheduling algorithm. In what sequence the processes would be scheduled, if lower number in the priority column in the given table denotes the higher priority?
1)P2-P1-P1-P5-P1-P1-P4-P3
2)P2-P1-P5-P1-P1-P4-P3
3) P2-P1-P1-P5-P4-P1-P3
4) P2-P1-P1-P5-P1-P4-P3



Question 15)
Friends,Please give the answer-
Shortforms given are
Process> Pro
Arrival Time>A
Burst Time in Milliseconds (ms)>B
Pro A B(in ms)
P1 3 3
P2 2 1
P3 0 6
P4 6 5


There are 3 processes P1,P2, and P3 as shown in the process table which are processed by preemptive shortest-job-first(SJP) schedulong algorithm,in what sequence the cpu will be assigned the process-
1)P2-P1-P4-P3
2)P2-P3-P1-P3-P4
3)P3-P1-P4-P2
4)P3-P2-P1-P3-P4

Asked In AMCAT dhritiman (9 years ago)

Solved sai suresh Read Solution (28)

Is this Puzzle helpful?   (22)   (5) Submit Your Solution Arrays

(#M40154740) C QUESTION Basic C Keep an EYE

void main()
{
int i=5;

printf("%d%d",i*2,i++);

getch();
}
what will be the output:

Asked In C Mangesh Nakhate (9 years ago)

Solved Syed Ashraf Read Solution (19)

Is this Puzzle helpful?   (30)   (6) Submit Your Solution Basics

(#M40154634) HUAWEI QUESTION C Programming Keep an EYE

#include
int main()
{
int a,b;
if(a=1,b=0)
printf("Yes");
else
printf("No");
return 0;
}

Asked In Huawei Kethineni Vinodh (9 years ago)

Solved VINU CHOWDARY Read Solution (5)

Is this Puzzle helpful?   (8)   (3) Submit Your Solution Basics

(#M40154633) HUAWEI QUESTION C Programming Keep an EYE

#include
#define mult(x,y) x*y
int main()
{
int a=5,b=5;
printf("%d",mult(a+b,a+b));
return 0;
}

Asked In Huawei Kethineni Vinodh (9 years ago)

Solved VINU CHOWDARY Read Solution (7)

Is this Puzzle helpful?   (7)   (2) Submit Your Solution Technical

(#M40154571) AMCAT QUESTION Computer Science and Computer Programming Keep an EYE

1 TB disk storage in a computer is equal to___________
1) 10^5 KB
2) 10^8 KB
3)10^9 kb
4)10^12 kb

Asked In AMCAT dhritiman (9 years ago)

Solved Sindhuri Read Solution (18)

Is this Puzzle helpful?   (40)   (8) Submit Your Solution Variables

(#M40154457) AMCAT QUESTION Computer science Keep an EYE

Which of the following statements is true about the logical view of a database?
Options are:
1)It is also known as physical view and there can be one or more logical views of a database
2) It is also known as physical view and there is only one logical view of a database
3)It is also known as conceptual view and there can be one or more logical views of a database
4) It is also known as conceptual view and there is only one logical view of a database

Asked In AMCAT dhritiman (9 years ago)

Solved raviranjan Read Solution (3)

Is this Puzzle helpful?   (20)   (3) Submit Your Solution Basics