Documente Academic
Documente Profesional
Documente Cultură
1.which two files are used during operation of the DBMS?Ans:data dictionary and
transaction log
4.Access time of symbol table will be logarithmic if it is implemented using Ans: Search
Trees
5.Manager's salary details are to be hidden from Employee Table. This Technique is
called as(UGC NET)Ans: External level Datahiding or Conceptual level hiding(?)
8.While estimating the cost of software, Lines of Code (LOC) and Function Points (FP)
are used to measure which one of the following?(UGC NET)Ans: Size of software
9.Page stealing is_____Ans: Taking page frame from another working set
10.XOR Gate is ideal for testing parity because even parity produce____ and odd parity
produce____ output?Ans: Low,High(as in Indiabix site)
11.Question related to Data link layer error detectionAns: Cyclic Redundancy check
16. students and course enrolled relationship ofAns: Many to Many (Doubtful whether
the question was Student to course relation?)
20.End to end and Host to Host delivery is a reposibility of ___ LayerAns: Transport
Layer
21. Device which Compiles the code in system which wil be used in another systemAns:
Cross compiler
23. What is multiprogrmming operating system?Ans: Single user can run mulpile
programs
24. three types of authorities of user category can be updated using which command
chuser,chgrp,cat.Ans:?
26. Data integrity conrol is__Ans: has the data dictionary keep the date and time of last
access last
back-up, and most recent modification for all files
27.There are certain packages that allow people to define data items, place these items
in particular records, combine the records into designated files and then manipulate and
retrieve the stored data. What are they called?Ans: DBMS
28.Which of the following derivations does a bottom-up parser use while parsing an
input string ? The input is scanned from left to right.
30.What utility do you use to transfer files and exchange messages?Ans : EMAIL
31.The main difference between a DFSA and an NDFSA isAns: in DFSA, from any
given state, there can't be any alphabet leading to two diferent states
33.The number of instructions needed to add 'n' numbers and store the result in
memory usingonly one address instruction isA)N+1 B)N-1 c)independent of nAns : A or
C (?)
1. DNS - SNMP
2. FUNCTIONAL DEPENDENCIES - Attributes
3. two tables can link thorugh - Foreign key
4. foreign key obtained from - Candidate key
5. Distributed system - resource sharing
6. Sql - structured query language
7. correct order -Select from where
8. to eliminate duplicates -Distinct
9. belady's anomaly -Fifo
10. bubble sort -400
11. binary tree with n nodes ,how many nodes will have degree 2 : N-1
12. 2*1 MUX 2POWER10 *1 - 1023
13. HUB- PHYSICAL LAYER
14. TRANSPORT- INTERACTS USER AND NETWORK LAYER