Search Topics....

Wednesday, August 22, 2012

System Administrator Job Vacancy @ KPSC

Applications  are  invited  from  qualified  persons  for  the  Post  of  System Administrator in the Kerala Public Service Commission on Deputation basis. Officers working in Central/State Government/Quasi government or Autonomous Bodies drawing a Scale of Pay not below Rs.23,200-31,150 or those who are working in the Cadre of
Assistant Professor/Reader/Professor in Government Engineering Colleges  Possessing the prescribed qualifications shall submit their applications through proper channel.

MTech in Computer Science with 10 Yrs experience in managing a centre
offering Computer Software or network services and interfacing with user community.
BTech in Computer Science with 12 Yrs experience in managing a centre offering
Computer Software or network services and interfacing with user community.
Applications received after the Last Date for receipt of applications and
Applications without proper authentication of the Head of Office/ Head of Department
will not be entertained.

Last Date of Receipt of Application           :  12.09.2012
Address to which applications are to be sent  :
Joint Secretary
Establishment Wing
Kerala Public Service Commission
Pattom, Thiruvananthapuram-4

Tuesday, August 21, 2012

Computer Video Lessons

Computer terms and definition are presented in a very understandable way for Bank clerical and PO Exams.. View the video Now.

Friday, August 17, 2012

Young professionals programme - YPP

The Young Professionals Programme examination in Information Systems and Technology covers a wide range of topics in the areas of development and operation of information systems, electronic data processing, computer system architecture, programming and analysis, operating systems, database management systems, network infrastructure, information security, and other related topics. If you are successful in the examination, you could be assigned to a job that covers any or a combination of these areas. 

The typical job in this area is Associate Information Technology Officer. Some of the key responsibilities of an Associate Information Technology Officer would be (These duties are generic and may not be carried out by all Associate Information Technology Officers.): 

• Assists in the design, development, installation and operation of information systems, including systems analysis, programming and operation support. 
• Participates in the preparation of user requirements and other technical specifications. 
• Analyse well-defined modules within the system, develop enhancements and new features to existing systems. 
• Undertakes rigorous testing and proving the feasibility of applications software. 
• Assist in the analysis of various informational problems in conjunction with personnel of organizational units and making recommendations on the feasibility and cost benefits of implementing information technology solutions. 
• Preparing system and programme documentation and related technical/operational manuals. 
• Undertakes technical evaluation on the acquisition of information technology equipment and services. 
• Ensures data security and integrity. 
• Participates in developing and maintaining disaster recovery plans. 
• Prepares, updates and maintains system’s documentation, assists in the development of Service Level Agreements (SLAs) between the client and OICT, for either specific IT services or general IT support, including any charge back mechanisms. 
• Assists in procurement exercise, including conducting needs assessments and benchmarks, preparing technical specifications and evaluation criteria. 
• Assists in the set-up and monitoring of software and IT service performance measures. 
• Actively Participates in Helpdesk support services. 
• Advises users on the most suitable hardware and software for different tasks; continuously maintains and enhances software. 
• Drafts training materials and conducts training sessions and demonstrations of systems for users. 

Education RequirementAt least a first-level university degree in the following fields: 

1. Main course of study: Computing 
1.1 Fields of study: Computer Programming, Data Processing, Networks, Operating Systems – Software Development, Systems Design, Artificial Intelligence, Computer Graphics, Computer Science, Information Technology, Software Engineering, Computer Engineering, Systems Analysis

2. Main course of study: Mathematics & Statistics 
2.1 Fields of study: Actuarial Science, Mathematics, Operations Research, Statistics, Applied Mathematics, Logic, Mathematics and Computer Science

3. Main course of study: Engineering & Engineering Trades 
3.1 Fields of study: Electricity, Electronics, Energy & Chemical Engineering, Engineering, Telecommunications, Electrical Engineering, Electronic Engineering, Robotics, Mechanical Engineering

4. Main course of study: Physical Sciences 
4.1. Fields of study: Astronomy & Space Sciences, Chemistry, Geology, Geophysics, Marine Sciences, Meteorology & Atmospheric Sciences, Mineralogy, Palaeoecology, Physical Anthropology, Physical Geography, Physics, Vulcanology 

5. Main course of study: Business & Administration 
5.1. Fields of study: Management, Business Computing, Management Systems

HSST Exam Alert

19/09/2012 Wednesday 08.00 AM  to 09.15 AM
Candidates can download the Admission Ticketsthrough the Website from 01/09/2012 onwards.

Tuesday, August 14, 2012

GATE Exam Syllabus 2013

Syllabus for Computer Science and Information Technology (CS)

Mathematical LogicPropositional Logic; First Order Logic.
ProbabilityConditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & AlgebraSets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
CombinatoricsPermutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph TheoryConnectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Linear AlgebraAlgebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical MethodsLU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.
CalculusLimit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.
Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.
Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.
Web technologies: HTML, XML, basic concepts of client-server computing.

Using Cipher to Erase Disk Unused or Free Space


Deleting a file does not erase the actual data of the file. Until that space is overwritten by a new file or data (randomly), it can be restored easily using special, easily-obtainable software. Therefore, after deleting files, you need to run such a program to ensure that the data of those files is also gone.

For example, you would want to run this command when you sell the drive or otherwise physically dispose of the drive. You might also want to use it if you deleted some sensitive data, and there was a risk that someone may gain physical access to the drive (such as with a laptop).

Open "My Computer" from your desktop and note the desired drive letter
OPTIONAL: Delete any files from that drive that are no longer needed.
Click the Windows Start button and select "Run..."
In the "Run dialog", type cmd and then press OK.
A command prompt window will be opened.
Type cipher /w:D:\ (You can substitute the desired drive letter for D)
Press Enter and wait for the operation to complete.

To cancel the operation, press Ctrl+C. All the commands are case-insensitive.

Monday, August 13, 2012



1. The postfix expression AB + CD –  *
can be evaluated using a
 (A) stack
 (B) tree
 (C) queue
 (D) linked list
2. The post order traversal of a binary
tree is DEBFCA. Find out the preorder traversal.
 (D) None of the above
3. The branch logic that provides making
capabilities in the control unit is known
 (A) Controlled transfer
 (B) Conditional transfer
 (C) Unconditional transfer
 (D) None of the above
4. The number of colours required to
properly colour the vertices of every
planer graph is
 (A) 2
 (B) 3
 (C) 4
 (D) 5
5. Networks that use different
technologies can be connected by
 (A) Packets
 (B) Switches
 (C) Bridges
 (D) Routers
6. Both hosts and routers are TCP/IP
protocol software. However, routers do
not use protocol from all layers. The
layer for which protocol software is not
needed by a router is
 (A) Layer – 5 (Application)
 (B) Layer – 1 (Physical)
 (C) Layer – 3 (Internet)
 (D) Layer – 2 (Network Interface)
7. In multiuser database if two users wish
to update the same record at the same
time, they are prevented from doing so
 (A) Jamming
 (B) Password
 (C) Documentation
 (D) Record lock
8. A binary search tree is a binary tree :
 (A) All items in the left subtree are
less than root
 (B) All items in the right subtree are
greater than or equal to the root
 (C) Each subtree is itself a binary
search tree
 (D) All of the above
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two (2)
marks. Attempt all the questions.  J-87-12 3  Paper-II
9. What deletes the entire file except the
file structure ?
 (C) ZAP
10. Which command is the fastest among
the following ?
 (A) COPY TO  
11. B+ tree are preferred to binary tree in
Database because
 (A) Disk capacity are greater than
memory capacities
 (B) Disk access is much slower than
memory access
 (C) Disk data transfer rates are much
less than memory data transfer
 (D) Disks are more reliable than
12. A Transaction Manager is which of the
following ?
 (A) Maintains a log of transactions
 (B) Maintains before and after
database images
 (C) Maintains appropriate concurrency
 (D) All of the above
13. Leaves of which of the following trees
are at the same level ?
 (A) Binary tree
 (B) B-tree
 (C) AVL-tree
 (D) Expression tree
14. Which of the following TCP/IP
Internet protocol is diskless machine
uses to obtain its IP address from a
server ?
 (A) RAP
 (B) RIP
 (C) ARP
 (D) X.25
15. Decryption and encryption of data are
the responsibility of which of the
following layer ?
 (A) Physical layer
 (B) Data Link layer
 (C) Presentation layer
 (D) Session layer
16. In which circuit switching, delivery of
data is delayed because data must be
stored and retrieved from RAM ?
 (A) Space division
 (B) Time division
 (C) Virtual
 (D) Packet Paper-II 4  J-87-12
17. In which Routing Method do all the
routers have a common database ?
 (A) Distance vector
 (B) Link state
 (C) Link vector
 (D) Dijkestra method
18. Page Shift Keying (PSK) Method is
used to modulate digital signal at        
9600 bps using 16 level. Find the line
signals and speed (i.e. modulation
 (A)  2400 bauds (B) 1200 bauds
 (C) 4800 bauds (D) 9600 bauds
19. The station to hub distance in which it
is 2000 metres.
 (A) 100 Base-T

 (B) 100 Base-F
 (C) 100 Base-T

 (D) 100 Base-T
20. Main aim of software engineering is to
 (A) program
 (B) software
 (C) within budget
 (D) software within budget in the
given schedule
21. Key process areas of CMM level 4 are
also classified by a process which is
 (A) CMM level 2
 (B) CMM level 3
 (C) CMM level 5
 (D) All of the above
22. Validation means
 (A) are we building the product right
 (B) are we building the right product
 (C) verification of fields
 (D) None of the above
23. If a process is under statistical control,
then it is
 (A) Maintainable
 (B) Measurable
 (C) Predictable
 (D) Verifiable
24. In a function oriented design, we
 (A) minimize cohesion and maximize
 (B) maximize cohesion and minimize
 (C) maximize cohesion and
maximize coupling
 (D) minimize cohesion and minimize
25. Which of the following metric does not
depend on the programming language
used ?
 (A) Line of code
 (B) Function count
 (C) Member of token
 (D) All of the above
26. A / B+
 tree index is to be built on the
name attribute of the relation
STUDENT. Assume that all students
names are of length 8 bytes, disk block
are of size 512 bytes and index
pointers are of size 4 bytes. Given this
scenario what would be the best choice
of the degree (i.e. the number of
pointers per node) of the B+
 tree ?
 (A) 16 (B) 42
 (C) 43 (D) 44  J-87-12 5  Paper-II
27. The Inorder traversal of the tree will
yield a sorted listing of elements of
tree in
 (A) Binary tree
 (B) Binary search tree
 (C) Heaps
 (D) None of the above
28. Mobile IP provides two basic
 (A) Route discovery and registration
 (B) Agent discovery and registration
 (C) IP binding and registration
 (D) None of the above
29. Pre-emptive scheduling is the strategy
of temporarily suspending a gunning
 (A) before the CPU time slice expires
 (B) to allow starving processes to run
 (C) when it requests I/O
 (D) to avoid collision
30. In round robin CPU scheduling as time
quantum is increased the average turn
around time
 (A) increases
 (B) decreases
 (C) remains constant
 (D) varies irregularly
31. Resources are allocated to the process
on non-sharable basis is
 (A) mutual exclusion
 (B) hold and wait
 (C) no pre-emption
 (D) circular wait
32. Cached and interleaved memories are
ways of speeding up memory access
between CPU’s and slower RAM.
Which memory models are best suited
(i.e. improves the performance most)
for which programs ?
 (i) Cached memory is best suited for
small loops.
 (ii) Interleaved memory is best
suited for small loops
 (iii) Interleaved memory is best
suited for large sequential code.
 (iv) Cached memory is best suited for
large sequential code.
 (A) (i) and (ii) are true.
 (B) (i) and (iii) are true.
 (C) (iv) and (ii) are true.
 (D) (iv) and (iii) are true.
33. Consider the following page trace :          
4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5
 Percentage of page fault that would
occur if FIFO page replacement
algorithm is used with number of
frames for the JOB  m = 4 will be
 (A) 8
 (B) 9
 (C) 10
 (D) 12
34. Check sum used along with each
packet computes the sum of the data,
where data is treated as a sequence of
 (A) Integer
 (B) Character
 (C) Real numbers
 (D) Bits  Paper-II 6  J-87-12
35. If an integer needs two bytes of
storage, then the maximum value of a
signed integer is
 (A) 2
 – 1
 (B) 2
 – 1
 (C) 2

 (D) 2
36. Which of the following logic families
is well suited for high-speed operations ?
 (A) TTL
 (B) ECL
 (C) MOS
37. Interrupts which are initiated by an
instruction are
 (A) Internal
 (B) External
 (C) Hardware
 (D) Software
38. printf(“%c”, 100);
 (A) prints 100
 (B) prints ASCII equivalent of 100
 (C) prints garbage
 (D) none of the above
39. For the transmission of the signal,
Bluetooth wireless technology uses
 (A) time division multiplexing
 (B) frequency division multiplexing
 (C) time division duplex
 (D) frequency division duplex
40. Consider the following statements :
 I. Recursive languages are closed
under complementation.
 II. Recursively enumerable languages
are closed under union.
 III. Recursively enumerable languages
are closed under complementation.
 Which of the above statements are true ?
 (A) I only
 (B) I and II
 (C) I and III
 (D) II and III
41. What is the routing algorithm used by
RIP and IGRP ?
 (B) Link-state
 (C) Dynamic
 (D) Dijkestra vector
42. Identify the incorrect statement :
 (A) The overall strategy drives the        
E-Commerce data warehousing
 (B) Data warehousing in an            
E-Commerce environment should
be done in a classical manner.
 (C) E-Commerce opens up an
entirely new world of web
 (D) E-Commerce security threats can
be grouped into three major
categories.  J-87-12 7  Paper-II
43. Reliability of software is directly
dependent on
 (A) quality of the design
 (B) number of errors present
 (C) software engineers experience
 (D) user requirement
44. ______ is not an E-Commerce
 (A) House banking
 (B) Buying stocks
 (C) Conducting an auction
 (D) Evaluating an employee
45. ______ is a satellite based tracking
system that enables the determination
of person’s position.
 (A) Bluetooth
 (B) WAP
 (C) Short Message Service
 (D) Global Positioning System
46. A complete microcomputer system
consists of
 (A) Microprocessor
 (B) Memory
 (C) Peripheral equipment
 (D) All of the above
47. Where does a computer add and
compare data ?
 (A) Hard disk
 (B) Floppy disk
 (C) CPU chip
 (D) Memory chip
48. Pipelining strategy is called implement
 (A) instruction execution
 (B) instruction prefetch
 (C) instruction decoding
 (D) instruction manipulation
49. Which of the following data structure
is linear type ?
 (A) Strings
 (B) Lists
 (C) Queues
 (D) All of the above
50. To represent hierarchical relationship
between elements, which data structure
is suitable ?
 (A) Dequeue
 (B) Priority
 (C) Tree
 (D) All of the above

Finally UGC Published the answer keys of NET Exam held on 24th june 2012

Question Papers, Keys and Online Feedback System for Answer Keys (for UGC NET held on 24th June, 2012) are available.

The students who had appeared in NET held on 24th June, 2012 can give online feedback upto 21st August, 2012.

Download Answer Keys Now 

Courtesy : UGC Official Website

Saturday, August 11, 2012

Operating Systems Question Bank for HSST Computer Science Examination 2012

Q.Interface provided by an Operating System
(D) Both CUI and GUI

Q. One can interface with operating system by meansof-
(A) Operating system call in a program
(B) Operating system commands
(C) Operating system process
(D) Both by operating system call and operating system commands

Q.Which of the following is not a type of processing?
(B) Network
(C) Batch
(D) Multiprogramming

Q.A method, which transfers the entire block of data from its own buffer to main memory
takes place without intervention by CPU.
Programmed input/output
Interrupt driven input/output
Direct Memory Access (DMA)
Resident monitor

Q. Which of the following is not a multi-programming operating system ?
Multitasking operating system
Multi user operating system
Time sharing system
Network operating system

Q. The operating system is the most common type of____________ software.
A. communication
B. application
D. word-processing software

Q. The two broad categories of software are:
A. word processing and spreadsheet.
B. transaction and application.
C. Windows and Mac OS.
system and application

Q. Which level of security is implemented in Windows NT?
(A) Al 
(B) Cl
(C) B2 
(D) C2 

Q. The UNIX shell : 
(A) does not come with the rest of the system
(B) forms the interface between the user and the kernal 
(C) does not give any scope for programming
(D) does not allow calling one program from with in another

Q. YACC is a program in UNIX used for:
(A) automatic scanner generation
(B) automatic parser generation
(C) automatic code generation
(D) none of these 

Q. The invalid file in UNIX from among the ones given below is: 
(A) /bin/unix 
(B) fete/passwd
(C) fete/group 
(D) fusr/bin/vi

Q. The very first process created by the Kernal in UNIX is : 
(A) init 
(B) getty
(C) fork
(D) none among these 

Q.    Which command divides the surface of the blank disk into sectors and assign a unique address to each one
a.    Ver
b.    Format
c.    Fat
d.    Chkdsk

Q. Each time you turn on your computer, it will check on the control filea., io.sys
c., io.sys, msdos.sys
d. Chkdsk.exe

Q. If you need to duplicate the entire disk, which command will you use?
a. Copy
b. Diskcopy
c. Chkdsk
d. Format

Q. Which of the following extensions suggest that the file is a backup copy
a. Bak
b. Bas
c. Com
d. Txt

Q. Round robin scheduling is essentially the preemptive version of ________. 
2 Shortest job first 
3 Shortes remaining 
4 Longest time first 

Q. A page fault occurs 
1 when the page is not in the memory 
2 when the page is in the memory 
3 when the process enters the blocked state 
4 when the process is in the ready state 

Q. Which of the following will determine your choice of systems software for your computer ? 
1 Is the applications software you want to use compatible with it ? 
2 Is it expensive ? 
3 Is it compatible with your hardware ? 
4 Both 1 and 3 

Q. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a: 

1 Semaphore 
2 Deadlock 
3 Signal 
4 Interrupt 

Q.What is a shell ? 
1 It is a hardware component 
2 It is a command interpreter 
3 It is a part in compiler 
4 It is a tool in CPU scheduling 

Q. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called:
1 Static loading 
2 Dynamic loading 
3 Dynamic linking 
4 Overlays 

Q. In the blocked state 
1 the processes waiting for I/O are found 
2 the process which is running is found 
3 the processes waiting for the processor are found 
4 none of the above 

Q. What is the memory from 1K - 640K called ? 
1 Extended Memory 
2 Normal Memory 
3 Low Memory 
4 Conventional Memory 

Q.Virtual memory is __________. 
1 An extremely large main memory 
2 An extremely large secondary memory 
3 An illusion of extremely large main memory 
4 A type of memory used in super computers. 

Q. The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by 
1 Editors 
2 Compilers 
3 System Call 
4 Caching 

Q. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67. 
1 310 
2 324 
3 315 
4 321 

Q.Multiprogramming systems:
1 Are easier to develop than single programming systems 
2 Execute each job faster 
3 Execute more jobs in the same time 
4 Are used only on large main frame computers 

Q. Which is not the state of the process ? 
1 Blocked 
2 Running 
3 Ready 
4 Privileged 

Q. The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting. 
1 The statement is false 
2 The statement is true. 
3 The statement is contradictory. 
4 None of the above 

Q.The problem of thrashing is effected scientifically by ________. 
1 Program structure 
2 Program size 
3 Primary storage size 
4 None of the above 

Q. The state of a process after it encounters an I/O instruction is __________. 
1 Ready 
2 Blocked/Waiting 
3 Idle 
4 Running 

Q. The number of processes completed per unit time is known as __________. 
1 Output 
2 Throughput 
3 Efficiency 
4 Capacity 

Q._________ is the situation in which a process is waiting on another process,which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress. 

1 Deadlock 
2 Starvation 
3 Dormant 
4 None of the above 

Q.Which of the following file name extension suggests that the file is Backup copy of another file ? 
1 TXT 
2 COM 
3 BAS 
4 BAK 

Q. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy? 
1 Time-sharing 
2 SPOOLing 
3 Preemptive scheduling 
4 Multiprogramming 

Q. A critical region 
1 is a piece of code which only one process executes at a time 
2 is a region prone to deadlock 
3 is a piece of code which only a finite number of processes execute 
4 is found only in Windows NT operation system 

Q.The mechanism that bring a page into memory only when it is needed is called _____________ 
1 Segmentation 
2 Fragmentation 
3 Demand Paging 
4 Page Replacement 

Q. PCB = 
1 Program Control Block 
2 Process Control Block 
3 Process Communication Block 
4 None of the above 
Right Ans ) 2 

Q. FIFO scheduling is ________. 
1 Preemptive Scheduling 
2 Non Preemptive Scheduling 
3 Deadline Scheduling 
4 Fair share scheduling 

Q. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________. 
1 Process Blocking 
2 Context Switch 
3 Time Sharing 
4 None of the above 
Right Ans ) 2 

Q.Which directory implementation is used in most Operating System? 
1 Single level directory structure 
2 Two level directory structure 
3 Tree directory structure 
4 Acyclic directory structure 

Q.The Banker¿s algorithm is used 
1 to prevent deadlock in operating systems 
2 to detect deadlock in operating systems 
3 to rectify a deadlocked state 
4 none of the above 

Q. A thread 
1 is a lightweight process where the context switching is low 
2 is a lightweight process where the context swithching is high 
3 is used to speed up paging 
4 none of the above 

Q. ______ is a high level abstraction over Semaphore. 
1 Shared memory 
2 Message passing 
3 Monitor 
4 Mutual exclusion 

Q.A tree sturctured file directory system 
1 allows easy storage and retrieval of file names 
2 is a much debated unecessary feature 
3 is not essential when we have millions of files 
4 none of the above 

Q. Which of the following is the feature of distributed operation system?
Real time  
Single tasking
All of these

Q.Kernel is
A part of operating system
An operating system
A hardware
A register

Q.UNI X operating system is based on
(A) Language structure
(B) Kernel approach
(C) Virtual machine
(D) Time sharing

Q.Virtual machine are-
(A) Lack of machine
(B) Illusion of real machine
(C) Physical machine
(D) None of these

Q. PMTLR is acronym for
(A) Page Map Table Limit Register
(B) Page Memory Table with Limit Register
(C) Both (A) and (B)
(D) None of these

Q.Paging is a
(A) Virtual Memory
(B) Memory management scheme
(C) Allocation of memory
(D) Deadlock prevention scheme

Q.TLB is the acronym of
(A) Translation Looking Buffer
(B) Translation Look aside Buffer
(C) Translation Left Buffer
(D) Translation Look Block

Q.Tracking and recording of page modifications is usually performed in hardware by adding a
written-into bit to each entry of the page map table. This bit is sometimes called

(A) Buddy bits (B) Protection bits
(C) Priority bits (D) Dirty bits

Q. Replacements policies for different pages is required when
(A) There is no unused page frames in main memory
(B) Allocation of new incoming item
(C) Both (A) and (B)
(D) None of these