Showing posts with label Computer Science. Show all posts
Showing posts with label Computer Science. Show all posts

Sunday, August 22, 2010

CS1002 UNIX INTERNALS ANNA UNIVERSITY CHENNAI B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING

0 comments

ANNA UNIVERSITY CHENNAI: CHENNAI – 600 025
B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING
(Offered in Colleges affiliated to Anna University)
CURRICULUM AND SYLLABUS – REGULATIONS – 2004
B.E. COMPUTER SCIENCE AND ENGINEERING
LIST OF ELECTIVES FOR COMPUTER SCIENCE AND ENGINEERING
CS1002 UNIX INTERNALS 3 0 0 100
AIM
To understand the kernel, I/O & files, process control, scheduling and memory management policies in unix.
OBJECTIVES
• To get thorough understanding of the kernel..
• To understand the file organization and management.
• To know the various system calls.
• To have a knowledge of process architecture, process control & scheduling and memory management

CS340 - COMPUTER ARCHITECTURE ANNA UNIVERSITY CHENNAI B.E DEGREE PROGRAMME COMPUTER SCIENCE AND ENGINEERING

0 comments

ANNA UNIVERSITY :: CHENNAI – 600 025
MODEL QUESTION PAPER
VI SEMESTER
B.E. COMPUTER SCIENCE AND ENGINEERING

CS340 - COMPUTER ARCHITECTURE - II Question Papers
Time: Three Hours Maximum: 100 Marks
Answer All The Questions

PART – A (10 x 2 = 20 Marks)

1. Consider a processor with a clock cycle time of 1 ns running code with the following instruction mix:-
Frequency Clock cycle count
ALU operation 45% 1
Loads 22% 3
Stores 15% 3
Branches 18% 2
A new level of cache is being added, that speeds up memory access time by 2, and increases clock cycle time by 50%. Find the improvement.
2. The common trend in processor, in that the size of the operand keeps increasing (8 to 16 to 32 etc.). Recently there is a move towards keeping them small. What are the advantages?
3. Dhrystone is a well-known integer benchmark. Computers A and B are measured to perform DA & DB executions of the Dhrystone benchmark per second. Computer A has a MIPS of MIPSA. What is the fallacy in calculating the MIPS of B to be MIPSB = MIPSAX (DB/DA)?
4. What is meant by ‘having precise exceptions’? when can you allow a processor to not have precise exceptions?
5. What is meant by predication?
6. How is loop level parallelism determined?
7. Is it possible to use a global branch prediction for certain branches, and a local branch prediction for others? If so, how? If not, why not?
8. What are the key ideas used in hardware-based speculation?
9. How can an atomic operation be achieved using a pair of separate instructions?
10. How does the SCSI bus allow interlacing of commands from different initiators to a single target.