Q Sta Comp
Q Sta Comp
b) Network layer
c) Application layer
d) Transport layer
2. The communication mode which supports two way traffic but only in one direction at
a time is called as
a) Simplex mode
b) Duplex mode
d) Multiplex mode
a) Physical address
b) IP address
c) Ethernet address
d) Port address
a) 32 bit
b) 64 bit
c) 128 bit
d) 256 bit
a) Stop-and-wait
b) Go-back-n
c) Selective repeat
1
6. The following is a routing protocol:
a) FTP
b) HTTP
c) OSPF
d) TCP
a) ALOHA
b) CSMA/CD
c) CSMA/CA
d) Slotted ALOHA
8. The following is protocol used at Logical Link Control, a sub layer of Data link layer:
a) HDLC
b) RRC
c) OSPF
d) TCP
9. In Linux, the user can change the access rights of a file using the following
command:
a) pid
b) chmod
c) chown
d) top
10. To maintain the connection oriented concept the following mechanism is used:
a) Silly window
b) Sliding window
c) Flooding
2
d) Circuit switching
11. A flip-flop is a ……… element that stores a binary digit as a low or high voltage
a) chip
b) bus
c) I/O
d) Memory
a.a) 49
a.b) 64
a.c) 14
a.d) 134
3
a.d) 10110
16. Minimum number of two inputs NAND gates used to perform functions two inputs
OR gates is
a.a) 1
a.b) 2
a.c) 3
a.d) 4
a.a) log2 n + 1
a.b) [log2n]
a.c) log2(n+1)
a.d) log2(n-1)
19. If a mod 14 and mod 20 counter are cascaded, what will be the new mod number?
a.a) 34
a.b) 280
a.c) 6
a.d) will not be a counter any more
4
c) 2
d) 1
21. The process of compartmentalizing the elements of an abstraction that constitute its
structure and behavior is called as
a) Hierarchy
b) Encapsulation
c) Modularity
d) Entity Abstraction
22. In which of the following mechanisms, types of all variables and expressions are fixed
at compilation time.
a) Strong Typing
b) Weak Typing
c) Static Binding/ early binding
d) Dynamic Binding/ late binding
23. In which of the following mechanisms, types of all variables and expressions are not
known until runtime
a) Strong Typing
b) Weak Typing
c) Static Binding/ early binding
d) Dynamic Binding/ late binding
25. What is that concept in type theory in which a single name may denote objects of
many different classes that are related by some common super class referred to
a) Monomorphism
5
b) Type Checking
c) Polymorphism
d) Generalization
26. The method of design encompassing the process of object oriented decomposition
and a notation for depicting both logical and physical and as well as static and
dynamic models of the system under design is known as:
a) Object- Oriented Programming
b) Object- Oriented Design
c) Object- Oriented Analysis
d) None of the mentioned
27. What is the programming style of the object oriented conceptual model?
a) Invariant relationships
b) Algorithms
c) Classes and objects
d) Goals, often expressed in a predicate calculus.
28. The total running time of knapsack problem for a simple approach
a.a) O(n)
a.b) O( log n)
a.c) O(2n log n)
a.d) O(2n)
29. What is an optimal Huffman code for alphabet a of the following set of frequencies
a: 01, b:01, c:02, d:03, e:05, f:8, g:13, h:21
a.a) 001010
a.b) 001111
a.c) 111100
a.d) 101010
6
c) virtual private network
d) none of the mentioned
32. Which of the following method is taking overcharge for some operations in
amortized analysis?
a.a) Aggregate method
a.b) accounting method
a.c) potential method
a.d) both (a) and (c)
34. Which of the following method is taken different operations different charges in
amortized analysis?
a.a) Aggregate method
a.b) accounting method
a.c) potential method
a.d) both (a) and (b)
35. Which of the following method is computing total cost of an algorithm in amortized
analysis?
a.a) Aggregate method
a.b) accounting method
a.c) potential method
a.d) both (c) and (b)
36. Which of the following method is credit as the potential energy to pay for future
operations?
a.a) Aggregate method
a.b) accounting method
a.c) potential method
a.d) both (a) and (b)
37. If all c(i, j )’s and r(i, j)’s are calculated, then OBST algorithm in worst case takes one
of the following time.
a) O(n log n)
b) O(n3)
c) O(n2)
d) O(log n)
38. The upper bound on the time complexity of the nondeterministic sorting algorithm is
7
a) O(n)
b) O(n log n)
c) O(1)
d) O( log n)
39. The worst case time complexity of the nondeterministic dynamic knapsack algorithm
is
a) O(n log n)
b) O( log n)
c) O(n2)
d) O(n)
1. #include <stdio.h>
2. #include "test.h"
3. #include "test.h"
4. int main()
5. {
6. //some code
7. }
8
a) true
b) Compile time error
c) false
d) Depends on the compiler
1. #include <stdio.h>
2. #define foo(m, n) m ## n
3. void myfunc();
4. int main()
5. {
6. myfunc();
7. }
8. void myfunc()
9. {
10. printf("%d\n", foo(2, 3));
11. }
a) 23
b) 2 3
c) Compile time error
d) Undefined behaviour
44. Tags and test that are not directly displayed on the page are written in _____ section.
a) <html>
b) <head>
c) <title>
d) <body>
9
c) <html>
d) <document>
48. The special formatting codes in HTML document used to present content are
a) tags
b) attributes
c) values
d) None of the above
50. Some tags enclose the text. Those tags are known as
a) Couple tags
b) Single tags
c) Double tags
d) Pair tags
51. The _____ character tells browsers to stop tagging the text
a) ?
b) /
c) >
d) %
10
53. Marquee is a tag in HTML to
a) mark the list of items to maintain in queue
b) Mark the text so that it is hidden in browser
c) Display text with scrolling effect
d) None of above
54. The Boolean expression AB + AB’+AC’+AC is equivalent to
a) A
b) B
c) C
d) None of the above
55. The digital logic family which has minimum power dissipation is
a) TTL
b) RTL
c) DTL
d) CMOS
56. The output of a logic gate is 1 when all its inputs are at logic 0. the gate is either
a) a NAND or an EX-OR
b) an OR or an EX-NOR
c) an AND or an EX-OR
d) a NOR or an EX-NOR
57. Data can be changed from special code to temporal code by using
a) Shift registers
b) Counters
c) Combinational circuits
d) A/D converters.
11
60. The 2’s complement of the number 1101101 is
a.a) 0101110
a.b) 0111110
a.c) 0110010
a.d) 0010011
64. The code where all successive numbers differ from their preceding number by single
bit is
a.a) Binary code.
a.b) BCD.
a.c) Excess – 3.
a.d) Grey.
66. If the input to T-flipflop is 100 Hz signal, the final output of the three T-flipflops in
cascade is
a.a) 1000 Hz
a.b) 500 Hz
a.c) 333 Hz
a.d) 12.5 Hz.
12
a.b) RAM
a.c) PROM
a.d) EEPROM
68. How many Flip-Flops are required for mod–16 counter?
a.a) 5
a.b) 6
a.c) 3
a.d) 4
74. Which is a bottom-up approach to database design that design by examining the
relationship between attributes:
a) Functional dependency
b) Database modelling
c) Normalization
d) Decomposition
13
75. Which forms simplifies and ensures that there is minimal data aggregates and
repetitive groups:
a) 1NF
b) 2NF
c) 3NF
d) All of the mentioned
76. Which forms has a relation that possesses data about an individual entity:
a) 2NF
b) 3NF
c) 4NF
d) 5NF
79. The ______ clause allows us to select only those rows in the result relation of the
____ clause that satisfy a specified predicate.
a) Where, from
b) From, select
c) Select, from
d) From, where
81. The ________ clause is used to list the attributes desired in the result of a query.
a) Where
b) Select
c) From
14
d) Distinct
87. For a deadlock to arise, which of the following conditions must hold simultaneously?
(choose all that apply )
a) Mutual exclusion, Hold and wait
b) Starvation
15
c) No pre-emption, Circular wait
d) a) and c) only
92. To ensure that the hold and wait condition never occurs in the system, it must be
ensured that:
a) whenever a resource is requested by a process, it is not holding any other
resources
b) each process must request and be allocated all its resources before it begins its
execution
c) a process can request resources only when it has none
d) All of these
16
93. The disadvantage of a process being allocated all its resources before beginning its
execution is:
a) Low CPU utilization
b) Low resource utilization
c) Very high resource utilization
d) None of these
95. One way to ensure that the circular wait condition never holds is to :
a) impose a total ordering of all resource types and to determine whether one
precedes another in the ordering
b) to never let a process acquire resources that are held by other processes
c) to let a process wait for only one resource at a time
d) All of these
96. Which one of the following models is not suitable for accommodating any change?
a) Build & Fix Model
b) Prototyping Model
c) RAD Model
d) Waterfall Model
98. Which of the following statements regarding Build & Fix Model is wrong?
a) No room for structured design
b) Code soon becomes unfix-able & unchangeable
c) Maintenance is practically not possible
17
d) It scales up well to large projects
a) entire IP packet
b) IP header
c) IP payload
d) none of the mentioned
-*-*-*-
18