1. Honey pot is an example for:
- Security Auditing Software
- Encryption-decryption Software
- Instruction-detection Software
- Virus
2. Hibernate in Windows XP/Windows 7 means:
A. Shutdown the computer without closing the running application.
B. Shutdown the computer terminating all running applications
C. Restart the computer
D. Restart the computer in safe mode
3. The unix shell is
A. A command line interpreter
B. set of user commands
C. A GUI interface
D. All of the above
4. If every non key attribute is functionally depend on primary key, then the relation will be :
A. First normal form
B. Second normal form
C. Third normal form
D. Fourth normal form
5.In tuple relation model, tuple is equivalent to :
A. Record
B. Table
C. File
D. Field
6. An attribute of one table is matching the primary key of another table, is known as:
A. Secondary Key
B. Foreign Key
C. Candidate Key
D. Composite Key
7.The maintenance activity to fin and fix error during operation of error is
A. adaptive maintenance
B. Corrective maintenance
C. Perfective maintenance
D. Preventive maintenance
8. Which method uses small increments with minimum planning and iteration are short time frames?
A. Water fall Model
B. Spiral Model
C. Agile Model
D. Prototype Model
9. Telnet is a
A Remote login
B.Television network
C.Network of telephone
D. None of the above
10. Trends to outsource IT functions t other countries is known as
A. Outer outsourcing
B. External outsourcing
C. Foreign outsourcing
D. Offshore outsourcing
11. Which of the following method of channelization are used for mobile data internet working?
A. Time division multiple access
B. Frequency division Multiple access
C. Code division Multiple access
D. All of the above
12 .PN G Stands for:
A. Packet network graphics
B. Portable network graphics
C. Protocol for network graphics
D. None of the above
13. Mutual exclusion problem occurs between
A. Process that share resources
B. Process use s not the same resources
C. Two disjoint process that do not interact
D. None of the above
14. Time for the disk, rotate to the start of the desired sector is known as:
A. Seek time
B. Transfer time
C. Latency time
D. Access time
15. Preemptive Scheduling is the strategy of temporally suspending a running process:A. To avoid collision
B. When it request i/o
C. Before the CPU time slice expires
D. None of the above
16. Application like Banking and Reservation require which type of operating system
A. Hard real time
B. Soft real time
C. Real time
D. Time sharing
17. which testing method is normally used as the acceptance test for a software system?
A. unit testing
B. Integration testing
C. Functional testing
D. Regression testing
18. Which among the following is the risk driven process model?
A . Prototyping
B. Spiral Model
C. Component based development
D. Waterfall model
Exp:The spiral model is a software development process model developed by Barry W. Boehm in 1986. It is based on the assumption that the development of applications is an iterative cycle that is repeated until the set goal is reached. The spiral model minimizes the risk of failure in large software projects considerably by regularly assessing risks and checking the intermediate product on a regular basis.
19. In cyclomatic complexity, if E is the number of edges and N is the number of nodes, V(G), for a flow graph is defined as:
A.E-N+2
B. E-N-1
C. E+N-2
D. E+N-1
20. Which among the following is the programmable DMA controller in 8086?
A.8259
B.8257
C.8251
21. INT2 in 8086 is:
A. Single step interrupt
B. Non maskable interrupt
c C. Division by zero interrupt
D. Overflow interrupt
22. Which among the following is the maximum mod signal in 8085?
A. DT/R
B. HOLD
C. ALE
D. LOCK
A. , O(n2)time
A. Single step interrupt
B. Non maskable interrupt
c C. Division by zero interrupt
D. Overflow interrupt
22. Which among the following is the maximum mod signal in 8085?
A. DT/R
B. HOLD
C. ALE
D. LOCK
23.
IN 8086 Microprocessor of the following has the highest priority among all the type of interrupt:
A. NM 1
B. type 255
C. over flow
D. Div 0
24. the self complementing unweighted code is :
A. 8421
B. 2421
C. Excess 3
D. Gray code
25. AB+B((B+C')+B'C) can be simplified to
A. AB+BC
b B. B+BC
C. B+C
D. None of the above
26. DeMorgan's theorem says that a NOR gate is equivalent to -------------- gate.
A. Bubbled XOR
B. Bubbled AND
C. NOR
D. Bubbled NOR
27. The 10'; complement of 13250 is :
A. 86740
B. 86750
C. 97850
D. 97859
28. If an encoder has 2^n (or less) input files. Then output line is :
A) n/2
B) n
C) 2^n
D) n-1
29. IN SR flip-flop, if S=R=1 then q(t+1) will be:
A. Q(t)
B. 0
C. 1
D. indeterminate state
30. Managers salary details are hidden from employees. This is :
A. Conceptual level of data hiding
B. Physical level data hiding
C. External level data hiding
D. None of these
31. For each attribute of a relation , there is a set of permitted values, called the ------------- of that attribute
A. Domain
B. Relation
C. Set
D. Schema
32. The most commonly used operation in relational algebra for projecting a set of tuple from a relation is :
A. Join
B. Projection
C. Select
D. Union
33. The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match?
A. Join
B. Cartesian Product
C. Intersection
D. Set difference
34. SCTP is a --------------------- layer protocol.
A. Session Layer
B. Application Layer
C. DLL
D. Transport Layer
35. UDP is a :
A. Connection unreliable protocol
B. Reliable and connection oriented protocol
C. Connectionless reliable protocol
D. Connection oriented unreliable protocol
36. GSM is a digital cellular phone system using:
A. TDMA and Packet switching
B. CDMA and Packet switching
C. TDMA and FDMA
D. FDAM and CDMA
37. An example for cell switched network is :
A. SONET
B. ATM
C. UPSR
D. None of these
38. The IEEE standard for Wifi is :
A. 802.4
B. 802.1
C. 802.2
D. 802.11
39. one channel carries all transmissions simultaneously in
A. TDMA
B. CDMA
C. FDMA
D. PDMA
40. Encryption is done at :
A. Presentation Layer
B. Application Layer
C. Session Layer
D. Transport Layer
41. The service not provided by PPP is :
A. network address configuration
B. authentication
C. Flow Control
D. none of these
42. The bit oriented protocol for communication over point to point and multi point links is :
A. HDLC
B. Stop and Wait Protocol
C. PPP
D. PAP
43 . RG-59 category cables are used for:
A. Telephone
B. LAN
C. Cable TV networks
D. None of these
44. The digital multiplexing technique for combining several low-rate channels into high rate one:
A. TDM
B. FDM
C. CDM
D. None of these
45. Eight channels each with a 100 -kHz bandwidth are to be multiplexed together. what is the minimum bandwidthof the link if there is a need for a guard band of 10 kHz between channels to prevent interference?
A. 540 kHz
B. 870 kHz
C. 1020 kHz
D. 1080 kHz
Exp: 8*100+10*7=870 kHz
46. To send 3 bits data at a time at a bit rate of 3 Mbps with a carrier frequency of 10 MHz calculate the baud rate and bandwidth
A. 10 Mbaud and 10MHz
B. 2 Mbaud and MHz
C. 1 Mbaud and 8 MHz
D. None of these
47. What is the minimum required bandwidth to sen data at 1-Mbps rate using Manchester Encoding?
A. 10 MHz
B. 2 MHz
C. 5 MHz
D. 1 MHz
48. A system using NRZ-1 to transfer 10 Mbps data. What is the average signal rate?
A. 500 Kbaud
B. 1000 MHz
C. 500 MHz
D. 1000 Kbaud
49. A network with bandwidth of 10 Mbps can pass only an average of 12000 frames per minute with each frame carrying an average of 10,000 bits what it the throughput of this network?
A. 22 Mbps
2 B. 2 Mbps
C. 10 Mbps
D. 100 Mbps
50. Which of the following is self balancing binary search tree?
A. B- Tree
B. AVL Tree
C. B+ Tree
D. None of the above
5
51. A matrix whose must of the elements are zeroes :
A. Sparse Matrix
B. Dense Matrix
C. square matrix
D. none of the above
52. An ordered list in which insertion and deletion of node are made at one end?
A. Deque
B. Queue
C. Stack
D. None of the above
53. A list in which contains nodes of different types:
A.Homogeneous list
B. Heterogeneous list
C. Doubly linked list
D. None of the above
54. Which of the following data structure is frequently used to implement priority queue?
A. stack
B. Heap
C. Treap
D. None of the above
555. The worst case time complexity of Quick sort is:
A. O(n 2)
B. O( n log n)
C. O(n3)
D. O(2n)
56. Which of the following is linear data structures?
A. Array
B. Linked List
C. Both A and B
D. None of the above
57. A set of n ≥0 disjoint trees :
A. Tree
B. Forest
C. B Tree
D. All of the above
58. The worst case time complexity of merge sort is :
A . O(n2)
B. O(n log n)
C. O(n3)
D. O(2n)
26. DeMorgan's theorem says that a NOR gate is equivalent to -------------- gate.
A. Bubbled XOR
B. Bubbled AND
C. NOR
D. Bubbled NOR
27. The 10'; complement of 13250 is :
A. 86740
B. 86750
C. 97850
D. 97859
28. If an encoder has 2^n (or less) input files. Then output line is :
A) n/2
B) n
C) 2^n
D) n-1
29. IN SR flip-flop, if S=R=1 then q(t+1) will be:
A. Q(t)
B. 0
C. 1
D. indeterminate state
30. Managers salary details are hidden from employees. This is :
A. Conceptual level of data hiding
B. Physical level data hiding
C. External level data hiding
D. None of these
31. For each attribute of a relation , there is a set of permitted values, called the ------------- of that attribute
A. Domain
B. Relation
C. Set
D. Schema
32. The most commonly used operation in relational algebra for projecting a set of tuple from a relation is :
A. Join
B. Projection
C. Select
D. Union
33. The result which operation contains all pairs of tuples from the two relations, regardless of whether their attribute values match?
A. Join
B. Cartesian Product
C. Intersection
D. Set difference
34. SCTP is a --------------------- layer protocol.
A. Session Layer
B. Application Layer
C. DLL
D. Transport Layer
35. UDP is a :
A. Connection unreliable protocol
B. Reliable and connection oriented protocol
C. Connectionless reliable protocol
D. Connection oriented unreliable protocol
36. GSM is a digital cellular phone system using:
A. TDMA and Packet switching
B. CDMA and Packet switching
C. TDMA and FDMA
D. FDAM and CDMA
37. An example for cell switched network is :
A. SONET
B. ATM
C. UPSR
D. None of these
38. The IEEE standard for Wifi is :
A. 802.4
B. 802.1
C. 802.2
D. 802.11
39. one channel carries all transmissions simultaneously in
A. TDMA
B. CDMA
C. FDMA
D. PDMA
40. Encryption is done at :
A. Presentation Layer
B. Application Layer
C. Session Layer
D. Transport Layer
41. The service not provided by PPP is :
A. network address configuration
B. authentication
C. Flow Control
D. none of these
42. The bit oriented protocol for communication over point to point and multi point links is :
A. HDLC
B. Stop and Wait Protocol
C. PPP
D. PAP
43 . RG-59 category cables are used for:
A. Telephone
B. LAN
C. Cable TV networks
D. None of these
44. The digital multiplexing technique for combining several low-rate channels into high rate one:
A. TDM
B. FDM
C. CDM
D. None of these
45. Eight channels each with a 100 -kHz bandwidth are to be multiplexed together. what is the minimum bandwidthof the link if there is a need for a guard band of 10 kHz between channels to prevent interference?
A. 540 kHz
B. 870 kHz
C. 1020 kHz
D. 1080 kHz
Exp: 8*100+10*7=870 kHz
46. To send 3 bits data at a time at a bit rate of 3 Mbps with a carrier frequency of 10 MHz calculate the baud rate and bandwidth
A. 10 Mbaud and 10MHz
B. 2 Mbaud and MHz
C. 1 Mbaud and 8 MHz
D. None of these
47. What is the minimum required bandwidth to sen data at 1-Mbps rate using Manchester Encoding?
A. 10 MHz
B. 2 MHz
C. 5 MHz
D. 1 MHz
48. A system using NRZ-1 to transfer 10 Mbps data. What is the average signal rate?
A. 500 Kbaud
B. 1000 MHz
C. 500 MHz
D. 1000 Kbaud
49. A network with bandwidth of 10 Mbps can pass only an average of 12000 frames per minute with each frame carrying an average of 10,000 bits what it the throughput of this network?
A. 22 Mbps
2 B. 2 Mbps
C. 10 Mbps
D. 100 Mbps
50. Which of the following is self balancing binary search tree?
A. B- Tree
B. AVL Tree
C. B+ Tree
D. None of the above
5
51. A matrix whose must of the elements are zeroes :
A. Sparse Matrix
B. Dense Matrix
C. square matrix
D. none of the above
52. An ordered list in which insertion and deletion of node are made at one end?
A. Deque
B. Queue
C. Stack
D. None of the above
53. A list in which contains nodes of different types:
A.Homogeneous list
B. Heterogeneous list
C. Doubly linked list
D. None of the above
54. Which of the following data structure is frequently used to implement priority queue?
A. stack
B. Heap
C. Treap
D. None of the above
555. The worst case time complexity of Quick sort is:
A. O(n 2)
B. O( n log n)
C. O(n3)
D. O(2n)
56. Which of the following is linear data structures?
A. Array
B. Linked List
C. Both A and B
D. None of the above
57. A set of n ≥0 disjoint trees :
A. Tree
B. Forest
C. B Tree
D. All of the above
58. The worst case time complexity of merge sort is :
A . O(n2)
B. O(n log n)
C. O(n3)
D. O(2n)
59. The postfix representation of the expression (a+b*c)+((d*e+f)*g) is:
A.abc*+de*f+g*+
B. ab+c*de*f+g+*
C. ab+c*de*f+g*+
D. abc*+def*+g*+
660. Starssen's algorithm for multiplying nXn matrices runs in :
B. O(n3)
time
C. O(2n)time
D. O(n2.81)time
61. The data structre used in breadth -first search (BST) is :
A. Stack
b B. Queue
C. B-Tree
D. None of the above
62 The running time of Kruskal's algorithm for a graph G=(V,E) for finding Minimum - spanning tree is :
c
C. O(2n)time
D. O(n2.81)time
61. The data structre used in breadth -first search (BST) is :
A. Stack
b B. Queue
C. B-Tree
D. None of the above
62 The running time of Kruskal's algorithm for a graph G=(V,E) for finding Minimum - spanning tree is :
A.O(Elog2 V)
B. O(E+V log2 V)
C.O(E2)
D.O(V2)
63. Which of the following problem is NOT NP-complete?
A. Hamiltonian cycle problem
B. Clique problem
C. Traveling - salesman problem
D. None of the above
64. If any NP complete problem is in P class then:
A. P=NP
B. P!=NP
C. P≤NP
D. None of the above
65. Which is NOT a collision resolution technique in Hashing?
A. Chaining
B. Linear probing
C. Quadratic Probing
D. None of the above
66. 0-1 Knapsack problem can be solved by:
A. Greedy Method
B. Dynamic Programming method
C. Divide and conquer method
D. None of the above
67. Which of the following is NOT a method for performing amortized analysis of algorithms?
A. Aggregate method
B. Accounting method
C. Potential method
D. None of the above
68. Which of the following is a non linear data structure?
A. Tree
B. Array
C. Linked List
D. None of the above
Explnation: Array is linear data structure
For eg :
65. Which is NOT a collision resolution technique in Hashing?
A. Chaining
B. Linear probing
C. Quadratic Probing
D. None of the above
66. 0-1 Knapsack problem can be solved by:
A. Greedy Method
B. Dynamic Programming method
C. Divide and conquer method
D. None of the above
67. Which of the following is NOT a method for performing amortized analysis of algorithms?
A. Aggregate method
B. Accounting method
C. Potential method
D. None of the above
68. Which of the following is a non linear data structure?
A. Tree
B. Array
C. Linked List
D. None of the above
Explnation: Array is linear data structure
For eg :
int arr2[] = {10, 20, 30, 40, 50};
Linked list is linear data structure 1->2->3->4->NULL
69. A c++ key word, which, when used inside a member function of a class, represents a pointer
t to the particular class object that invoked it:
A. *
B. this
C. ->
D. None
70. A member function which initializes data member of an object in:A. DestructorB. ConstructorC.Inline functionD. Friend function71. Which of the package contains abstract keyword ?A. java.langB. java.utilC.java.ioD. java.system72. Which of the interface contains all the method used for handling thread related operations in java?A. Runnable interfaceB. Math interfaceC.System interfaceD. Thread handling interface
72. Which of the package contains abstract keyword ?A. java.langB. java.utilC.java.ioD. java.system72. Which of the package contains abstract keyword ?A. java.langB. java.utilC.java.ioD. java.system72. Which of the package contains abstract keyword ?A. java.langB. java.utilC.java.ioD. java.system
c
No comments:
Post a Comment