Answer Posted / vignesh1988i

SEE.,..... 1 ST ROUND WILL BE THE APTITUDE ROUND.......
in this basic questions on maths,vocabulary, reasoning
questions will be asked...... it can be online or writtern
accordsing to the companies...............
in vocabulary section:
meanings .... antonyms and synomys will be given so refer
GRE BARRONS 12th edition..........
comprehension passasges.... word anology........ sentence
corrections .............
in quantitative section:(BASIC MATHS)
questions related to numbers sequences,time and
distances, work finish sums, graphs will be given from that
questions will be asked....., next is pipes and cartesims
sums,,,, age problems,.... mixtures and allegation
problems....... etc etc will be asked....... so PLEASE REFER
TO PREVIOUS YEARS QUESTIONS AND R.S.AGGARWAL..............
in reasoning section:
critical reasoning......... TCS followes this.......
pl. refer GRE BARRONS 12th edition......... a passage will
be given.. then 5 q. will be asked ..... but the given all
choices you would think it is correct.. but one only it wil
be .......... this will be always tough...... then logical
reasoning.................. here you have to draw an see as
venn diagrams etc........ refer GRE BARRONS.............


TECH.INTERVIEW


if you are an comp. student you must have ideas about
C.C++,OS,data structures,DBMS very important....... and
microprocessors.......... what you put as your AREA OF
INTEREST they will concentrate in that........ questions
also will be there from your projects.........


if you are an non IT student.... you ought to
know C/C++.... basic criteria.......... if you are strong
enough in C/c++ you can be sure to enter any IT
companies...................................................


ALL THE BEST

Which are low level languages?

1083

---

What are dangling pointers in c?

1200

---

What is a node in c?

967

---

what are enumerations in C

1143

---

Is return a keyword in c?

1064

---

I need help with the following lab. Can anyone explain it to me on how to approach this problem. Coding would be great too !!! No busy waiting allowed. Remember that Java monitors are 'signal and continue'. The input data is called the database (DB). In this problem, it consists of a single variable initialized in the main thread, to contain the current time of day in HH:MM:SS:mmm format (mmm is milliseconds) truncated to 3 digits. Threads follow these rules: 1. Readers may all attempt to read at the same time, but NOT if a writer is writing (i.e.; the writer is in the monitor. 2. Writing is exclusive (only 1 writer at a time, no readers while writing). 3. Options: (to be specified by instructor) a. Readers have absolute priority over writers. b. Writers have absolute priority over readers c. When a reader arrives and a writer is waiting, the reader is suspended behind the writer instead of being admitted immediately. Thus, a writer waits for readers that were running when it arrived, but does not to wait for new readers. You may program this in C++ or Java. There are 4 controlling input values: 1. r – number of readers 2. w – number of writers 3. R – delay for a reader to restart 4. W – delay for a writer to restart Create the following program consisting of 1 main process (your main program) with n threads: 1. The main thread: a. Creates the 'n' threads needed. Of these, r of them are readers and w of them are writers. Starts all readers and writers. b. Waits for all 'n' threads to complete. You may use any method to detect when they are all complete. c. Prints out the resulting outputs from the threads. 2. Threads: a. When a thread starts to run, it immediately tries to enter the monitor. b. A reader thread reads the DB, outputs the exact message below, then exits: >>> DB value read =: HH:MM:SS:mmm by reader number: rr where the underlined text is replaced with actual data. c. A writer thread updates the DB with a new value (from the system time), outputs the exact message below, then exits: *** DB value set to: HH:MM:SS:mmm by writer number: ww where the underlined text is replaced with actual data. d. Each thread accesses the data a total of 10 times, exiting, then re-entering the monitor after each access. Hints: 1. File access *might* not be thread-safe, so you should be prepared to handle this. Read the documentation for the language you are using. 2. Suggested values for delays are: a. If looping, R >=1,000,000 and W>=100,000 b. If using “sleep”, then R=100 ms, W=50 ms. Additional: • Thread output is to ONE file used by ALL threads (so you need to synchronize access to it). • Readers must provide sufficient delay that results are useful (delay by R before re-trying). R is another input value. • Writers must also delay. Delay by W, updating the DB each time. W is an input. • Test your program with AT LEAST TWO different sets of values for r and w (#s of readers and writers) plus this set: r = 4, w=2. Basic operation of a thread: attempt to enter the monitor. If unsuccessful, you get put on a queue. When you get in, read or write the data (depending on type of thread), exit the monitor, wait the required delay amount, then try again. Repeat 10 times.

1967

---

What is data structure in c programming?

1062

---

What is #define used for in c?

1052

---

What is the purpose of type declarations?

1105

---

What does typeof return in c?

1076

---

Difference between Function to pointer and pointer to function

1054

---

What does != Mean in c?

1032

---

List the variables are used for writing doubly linked list program.

2014

---

What does a derived class inherit from a base class a) Only the Public members of the base class b) Only the Protected members of the base class c) Both the Public and the Protected members of the base class d) .c file

1101

---

Define and explain about ! Operator?

983

---