• Placement Questions

Frequently Asked Interview Questions and Answers

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

Integer i , k,j,n=5;
For i=n to 1 decrement 1
{
For j=n equal to i+1 decrement 1
{
Print blank space
}
For k= 1 to ((2*i)-1) increment 1
{
Print “*”;
}
Print end of line //takes the cursor to next line
}

What will the output when the given code will be executed

Asked In AMCAT dhritiman (9 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (4) Submit Your Solution Variables

(#M40154912) TCS QUESTION Apti Keep an EYE

George does 3/5th of a piece of work in 9 days. He then calls Paul. and they finish the work in 4 days. How long would Paul take to do the work by himself

28/32/30/35

Asked In TCS dhritiman (9 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (9)   (2) Submit Your Solution Time and Work

(#M40154302) AMCAT QUESTION Computer science Keep an EYE

The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page with 1 free main memory frame is recorded as follows :
0100, 0200,0330, 0430, 0499, 0510,0120, 0150, 0220, 0240, 0320, 0350
What is the total number of page faults?
1)8
2)10
3)12
4)13

Asked In AMCAT dhritiman (10 years ago)

Unsolved Read Solution (3)

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

(#M40154451) AMCAT QUESTION Computer science Keep an EYE

A process P is in its critical section. another process Q that tries to enter its critical section must loop continuously in the entry code.
Identify the situation

Options are:

1)Busy Waiting
2)Spinning
3) Deadlock
4) Starvation

Asked In AMCAT dhritiman (9 years ago)

Unsolved Read Solution (5)

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

(#M40154282) AMCAT QUESTION Computer science Keep an EYE

An Operating System is to schedule all processes in main memory (using scheduling algorithm) to run on the CPU at equal intervals. Each time a clock interrupt occurs, the interrupt handler checks how much time the current running process has used. If it has used up its entire time slice, then the CPU scheduling algorithm (in kernel) picks a different process to run. What is each switch of the CPU from one process to another called?
1) CPU switching
2)Process switching
3)Task switching
4)Context switching

Asked In AMCAT dhritiman (10 years ago)

Unsolved Read Solution (1)

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

(#M40154272) AMCAT QUESTION Computer science Keep an EYE

Choose the correct option.
Which of the given statements is/are true about the architecture of relational DBMS?
1. SDL is used to define conceptual schema.
2. VDL is used to define intemal schema.
3. Natural Language interface is used to take input from a naive user in english or standard language.
1)TTF
2)FTT
3)FFT
4)TFF

Asked In AMCAT dhritiman (10 years ago)

Unsolved Read Solution (1)

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

(#M40154842) TCS QUESTION Apti Keep an EYE

Two cars starts from a & b and travel towards each other at speeds 0f 59 kmph and 60 kmph respectively at the time of their meeting the second car has travelled 120km more than the first the distance between a & b in kms is a)720 b)1230 c)1320 d) 600

Asked In TCS dhritiman (9 years ago)

Unsolved Read Solution (8)

Is this Puzzle helpful?   (13)   (4) Submit Your Solution Time Distance and Speed

(#M40154848) TCS QUESTION Apti Keep an EYE

aj travels a part of his journey by taxi paying Rs15 per km and the rest by train paying Rs21 per km if he travels total 450km and pays Rs8130 the distance travelled by rail is a)180km b)260km c)190 d)230

Asked In TCS dhritiman (9 years ago)

Unsolved Read Solution (7)

Is this Puzzle helpful?   (4)   (3) Submit Your Solution Time Distance and Speed

(#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

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

Assuming 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

Asked In AMCAT dhritiman (9 years ago)

Unsolved Read Solution (1)

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