Skip to main content

MCS-022 Assignment Questions July 2012

Question 1
(a) Explain the working of Token Ring? Compare it with token Bus. (5 Marks)
(b) Describe kerberos management in Windows 2000 operating system. (5 Marks)
Question 2: Give the answer of following in context of Linux Operating system.
(a) Write the purpose and syntax of nice and renice commands. (5 Marks)
(b) Explain the use and importance of FSCK commond. (5 Marks)
(c) Describe the ext2 and ext3 file systems? (10 Marks)

Question 3
(a) What are the contents of Password files and where are they
located in Windows? Also, explain the concept of Shadow passwords? (5 Marks)
(b) Explain "Distributed File System" with reference to Windows 2000. (5 Marks)

Question 4:
Write a shell script that searches the file contents in a directory and its sub-directories for a text string given by the user. It list
all such file names having that given string and store in a temp file “abc”. (10 Marks)

Question 5:
What are different kinds of user groups in windows 2000?
Explain each main features and privileges of each group. (10 Marks)
Question 6: How does Windows 2000 manage the domains? Also, trust
relationship is created and managed between domains? (10 Marks)

Question 7
(a) How are CIA (Confidentiality, Integrity and Availability) issues of Security
are being provided by Windows 2000 Operating System? (5 Marks)
(b) Explain the purpose and features of registry management. Also, explain
the uses of it.

Comments

Popular posts from this blog

IGNOU Syllabus for interview/test for admission to PhD programme in Computer Science

COMPUTER SCIENCE AND APPLICATION (Syllabus for interview/test for admission to PhD programme in Computer Science) Computer Architecture: representation of numbers; Octal, Hexadecimal, and Binary 2’s complement and 1’s complement arithmetic, Floating point representation. Combinational Circuit Design, Sequential Circuit Design, Hardware and Microprogrammed processor design, Instruction formats, Addressing modes, Memory types and organisation, interfacing peripheral devices, Interrupts. Data Structures & Algorithms: Arrays, stacks, queues, lists, linked, trees, graphs priority queues, heaps, Binary tree, AVL tree, B-tree and Hash tables. Graphs : connected graphs, regular and bipartite graphs, cycles and circuits. Tree and rooted tree. Spanning tree of a graph, Eccentricity of a vertex, radius and diameter of a graph. Hamiltonian, Eulerian graphs and Planar graphs. Sorting and Searching Algorithms, Binary Search, Analysis of Algorithms, Asymptotic notation...

IGNOU ON-LINE EXAMINATION FORM

Students are required to pay examination fee @ Rs. 60/- per course for theory as well as practical. A late fee of Rs. 300/- from 1st October, 2012 to 20th October, 2012 and Rs. 500/- from 21st Ocltober, 2012 to 31st October 2012 also needs to be included, if submitted during this period. Mode of payment Credit Card  Demand Draft  Cash Payment Debit Card of Union Bank of India  Results of June, 2012 Term-end examinations are available on University website  www.ignou.ac.in  . Please see result status before filling examination form.  Click here to see the result status of June, 2012 Examination.   Select and enter Programme code and Examination Centre Code from the options available. If the centre opted by the student is not activated as examination centre or not allotted for any other reason, alternative examination centre will be allotted.  Select courses carefully. Courses for theory as well as practical needs to be selected separate...