new blog

now onwards visit www.iilmcse.blogspot.com for latest event and updates

CS 5A OS 1ST SESSIONAL MARKS

S.NO	ROLL NO	NAME	MARKS(OUT OF 30)
1	0715010037	BRIJENDRA KUMAR CHANDRA	14
2	0715010045	GYANCHAND	A
3	0715010052	ISHAN WALDIA	A
4	0715010118	ANUJ VERMA	21
5	0815010003	ABHAY KUMAR	24
6	0815010004	ABHISHEK KUMAR	13
7	0815010006	AKANKSHA	21
8	0815010007	AKSHAY DUA	23
9	0815010008	ALOK KUMAR SHARMA	21
10	0815010009	AMBIKA BHAT	28
11	0815010010	AMIT KUMAR	12
12	0815010011	AMIT KUMAR JAISWAL	7
13	0815010012	AMIT KUMAR MISHRA	14
14	0815010013	AMIT KUMAR SHIROMANI	9
15	0815010014	AMIT SINGH	24
16	0815010015	ANKIT KUMAR	21
17	0815010017	APURVA TIWARI	22
18	0815010018	ASAD HASNAIN BAQRI	20
19	0815010019	ASHA BISHT	26
20	0815010020	ASHISH KUMAR PATEL	A
21	0815010021	ASHISH VERMA	13
22	0815010023	ATUL KUMAR SINGH	25
23	0815010024	AVINASH KUMAR	12
24	0815010025	BRAHMADITYA BHASKAR	A
25	0815010026	DEEPANKER SRIVASTAVA	27
26	0815010027	DEEPANSHU TYAGI	23
27	0815010029	DEEPESH KUMAR	A
28	0815010030	DEVENDRA KUMAR GAUTAM	8
29	0815010031	DHEERAJ KUMAR BAWEJA	26
30	0815010033	DIGVIJAY SINGH BISHT	24
31	0815010034	DINAKAR PRASAD MAURYA	22
32	0815010035	DINESH KUMAR	12
33	0815010036	FAIZAN AHMAD	19
34	0815010037	GAGAN PREET SINGH	10
35	0815010038	GAJENDER	A
36	0815010039	GANESH PRASAD	11
37	0815010040	GARIMA SINGH	15
38	0815010041	GAURAV SINGH	19
39	0815010042	GAURAV VERMA	9
40	0815010043	HARSHIT GOEL	21
41	0815010044	HIMANSHU SAXENA	19
42	0815010046	MADHU SINGH	20
43	0815010048	MANOJ KUMAR	19
44	0815010049	MANVENDRA KUMAR	15
45	0815010050	MANVENDRA SINGH	21
46	0815010051	MOHAMMAD SHOEB	A
47	0815010052	MOHAMMED ABU HURERA	25
48	0815010054	MOHD FAROOQ JAVED	16
49	0815010055	MOHD KHALID	16
50	0815010056	MOHINI VERMA	23
51	0815010057	MUGDHA ARORA	22
52	0815010058	NEHA GUPTA	23
53	0815010059	NEHA RAJPUT	28

SCHEDULE OF FIRST SESSIONAL

CET-IILM-ACADEMY OF HIGHER LEARNING
FIRST SESSIONALS EXAMINATION,(ODD SEMESTER),2010
COMPUTER SCIENCE & ENGINEERING
SEM	DAY TIME	10 .00A.M.-11.00 A.M.	11.30 A. M.-12.30 A.M.	2.00 P. M.-3.00 P.M.	3.30 P. M.-4.30 P.M.
1ST SEM	20/09/2010 (Monday)		EAS-103 Engg. Mathematics		EAS-101,Physics
	21/09/2010 (Tuesday)		EAS-102 Chemistry		EEE-101 Electrical
	22/09/2010 (Wednesday)		EEC-101 Electronics		EME-101Manufacturing Process
	23/09/2010 (Thursday)				Ramedial English
3RD SEM	20/09/2010 (Monday)	EAS-301 Math. III		ECS-304 I T I M
	21/09/2010 (Tuesday)	ECS-301 DLD		ECS-302 Data Structure
	22/09/2010 (Wednesday)	ECS-303 Discret Mathmatics		EHU-301/EHU-302Ind. Psychology/ Indus Soc.
5TH SEM	20/09/2010 (Monday)	ECS-502 DAA		ECS-504 CG
	21/09/2010 (Tuesday)	ECS-501OS		ECS-503 OOT
	22/09/2010 (Wednesday)	ECS-505 GT		EHU-501 EME
7TH SEM	20/09/2010 (Monday)		TCS-701 Information to Web Tech		TCS031 Data Mining
	21/09/2010 (Tuesday)		TIT701 Cryptography		TCS-702 DIP
	22/09/2010 (Wednesday)		Open Elective

ASSIGNMENT 2

Q1. What advantages is there in having different time-quantum sizes on different levels of a multilevel queue scheduling?
Q2.What do you understand by process? Explain various states of a process with a suitable diagram. Explain process control block.
Q3.What is scheduling ?What are various criteria for scheduling?
Q4.What are schedulers and various types of schedulers?
Q5.What is process address space and process identification information?
Q6. Write short notes on the following:-
1.Dispatcher
2.Starvation
3.Aging
4.Convoy effect
5.Gantt chart
6.Cooperating processes
7.Multithreaded model
8.Resource allocation graph
9.Quantum
10.Bankers Algorithms(including safety and resource request algorithm).
Q7.What is preemptive and non preemptive scheduling?
Q8.What is a thread and how is it different from process? What are user and kernel level threads?
Q9.What is CPU scheduling ? What are various scheduling algorithms? Explain multiprocessor scheduling. Discuss design issues related to multiprocessor scheduling.
Q10.What is deadlock? What are various conditions for deadlock?
Q11. What is deadlock prevention and deadlock avoidance?
Q12.What are various methods for deadlock detection if:-
1.Single instance of each resource is available in the system.
2.Multiple instances of some resource is available in the system.
Q13.Explain deadlock recovery in detail.
NUMERICALS
Q14.Consider the following snapshot of a system:

Allocation Max Available

ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656




1.What is content of need matrix?
2.Is the system in a safe state?
3.If a request from process P1 arrives for (0,,4,2,0),can the request be granted immediately?
Q15.Consider the following table :
Process Burst Time Priority
P0 10 3
P1 1 1
P2 2 3
P3 1 4
P4 5 2
1.Draw four Gantt chart illustrating the execution of these processes using FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.
2.Calculate average waiting time for each of the scheduling algorithm (FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.)
3.Calculate average turn around time for each of the scheduling algorithm (FCFS,SJF,a non preemptive priority and RR (quantum=1) scheduling.)

ASSIGNMENT 1

Q1.What is operating system ? What are various functions of operating system?

Q2.Write short notes on the following types of operating system:

• Batch

• Interactive

• Time sharing

• Real time

• Distributed

• Network

Q3.Differentiate between multiprogramming and multithreading systems.

Q4.What is main advantage of multiprogramming?

Q5.Describe the differences between symmetric and asymmetric multiprocessing. What are the advantages and disadvantage of multiprocessor systems?

Q6. What are system calls ?What is the purpose of system calls?

Q7.Explain the layered approach of operating system structure.

Q8.What are various operating system services?

Q9.Explain the following:

• Re entrant Kernels

• Monolithic

• Microkernel systems.

Q10.What are various system components ?What are their major activities?