APPSC DL 2016 Computer Applications

APPSC-2016-DL-CA

Please wait while the activity loads. If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question 1

What are you predicting by the logic:

 ∨x:€y:loyalto(x,y)

A	Everyone is loyal to someone
B	Everyone is loyal to all
C	Everyone is not loyal to someone
D	Everyone is loyal

Engineering-MathematicsPropositional-Logic

Question 2

The field that investigates the mechanics of human intelligence is _______.

A	Artificial science
B	Cognitive science
C	Psychology
D	Sociology

Question 3

A1 computing focus on ______ and conventional computing focus on ______ and ______.

A	data, information, knowledge
B	information, data, knowledge
C	knowledge, data, information
D	None of the given options

Question 3 Explanation:

A1 computing focuses on knowledge and conventional computing focus on data and information.

Question 4

An inference rule that says, if you know x and you know that if x is true, then y is true, then you can conclude y is

A	Minmax rule
B	Modus Pones rule
C	Chain rule
D	None of the given options

Engineering-MathematicsPropositional-Logic

Question 4 Explanation:

Modus ponen rule says that "P implies Q and P is asserted to be true, therefore Q must be true."

Question 5

Which one of the following is blind search?

A	Breadth first search
B	Depth first search
C	Breadth first search and Depth first search
D	None of the given options

Data-StructuresGraphs-and-Tree

Question 5 Explanation:

Blind search algorithms have no additional information on the goal node other than the one provided in the problem definition. The plans to reach the goal state from the start state differ only by the order and/or length of actions.
Examples of blind search algorithms are:
1. Depth First Search
2. Breadth First Search
3. Uniform Cost Search

Question 6

The intelligent agents senses through _______ and take actions through _______.

A	sensors, actuators
B	remove, signals
C	sensors, actuators and remote, signals
D	None of the given options

Question 7

Local maximum Plateau, Ridge are the difficulties in which searching algorithms?

A	Hill climbing search
B	Best first search
C	Breadth first search
D	None of the given options

AlgorithmsAlgorithm-Paradigms

Question 8

A* algorithm uses ___________ heuristic function to search any goal node.

A	admissible function
B	fitness number
C	evaluation function
D	None of the given options

Question 9

An algorithm, if it is guaranteed to return an optimal solution if it exists, is known as

A	admissible
B	heuristic
C	optimistic
D	cognitive

Question 10

AO* algorithm is also known as

A	Admissible optimal algorithm
B	Accurate optimistic algorithm
C	And – or algorithm
D	None of the given options

Question 11

Raster systems display a picture from a definition in a _________

A	Display file program
B	Frame buffer
C	Display controller
D	None of the given options

Question 12

A bilinear transformation can be simulated by the transformations

A	Translation, rotation and stretching
B	Translation and rotation
C	Rotation, stretching and inversion
D	Rotation, stretching, inversion and translation

Question 13

Hue of a colour is related to its ___________

A	Luminance
B	Saturation
C	Incandescence
D	Wavelength

Question 14

If the eccentricity is less than one, then conic is a __________

A	Circle
B	Parabola
C	Ellipse
D	Hyperbola

Engineering-MathematicsCo-ordinate-Geometry

Question 14 Explanation:

If the eccentricity is zero, the curve is a circle; if equal to one, a parabola; if less than one, an ellipse; and if greater than one, a hyperbola.

Question 15

The refresh rate below which a picture flickers is ___________

A	25
B	30
C	35
D	40

Question 15 Explanation:

The refresh rate below which a picture flickers is 25.

Question 16

The physical layer of a network _________

A	Defines the electrical characteristics of signals passed between the computer and communication devices
B	Controls error detection and corrector
C	Constructs packets of data and sends them across the network
D	All the given options

Computer-NetworksOSI-TCP-layers

Question 16 Explanation:

The physical layer of a network defines the electrical characteristics of signals passed between the computer and communication devices.

Question 17

End-to End connectivity is provided from host-to-host in _________

A	Session Layer
B	Network Layer
C	Data link Layer
D	Transport Layer

Computer-NetworksOSI-TCP-layers

Question 17 Explanation:

Transport layer provides end to end connectivity.
Network layer provides host to host connectivity.
Data link layer provides hop to hop connectivity.

Question 18

Which layer is not present in TCP/IP Model?

A	Internet Layer
B	Application Layer
C	Session Layer
D	Transport Layer

Computer-NetworksTCP/IP-Layers

Question 18 Explanation:

TCP/IP model contains only 5 layers:
Application layer
Transport layer
Network layer
Data link layer
Physical layer

Question 19

Nyquist Theorem to calculate maximum data rate is _______

A	2H log₂ bits/ses
B	H log₂ V bits/ses
C	H log₂ (1+S/N)
D	2H log₂ (1+S/N)

Question 19 Explanation:

Nyquist theorem to calculate maximum data rate is 2H log₂bits/sec.

Question 20

LANs can be connected by devices called _________ which operate in the data link layer?

A	Hub
B	Bridges
C	HDCL
D	Tunnel

Computer-NetworksLAN

Question 20 Explanation:

LANs can be connected by devices which have at least data link layer.So bridge is the correct option, because it has data link layer.

Question 21

Two different networks can be connected by using

A	Satellite
B	Gateway
C	Bridges
D	None of the given options

Computer-NetworksHardware-and-various-devices-in-networking

Question 21 Explanation:

Two different networks can be connected by devices which have at least a network layer. So from the given option gateway has the network layer.

Question 22

Which of the following is not a Routing Algorithm?

A	Broadcast
B	Link state
C	Traffic shaping
D	Distance vector

Computer-NetworksRouting

Question 22 Explanation:

Traffic shaping is a congestion control algorithm and not a routing algorithm.

Question 23

_________ is a device that receives a radio signal, strengthens it, and sends it on.

A	Repeater
B	WiFi
C	Hub
D	Microwave

Computer-NetworksRouting

Question 23 Explanation:

Repeater is a device that receives a radio signal, strengthens it, and sends it to the other side.

Question 24

What is the main reason for developing ISO/OSI model for networks?

A	Manufactures disliked the TCP/IP protocol suite
B	The rate of data transfer was increasing exponentially
C	Standards were needed to allow any two systems to communicate
D	None of the given options

Computer-NetworksISO-OSI-layers

Question 24 Explanation:

The main reason for developing the OSI model for networks is to create a common platform for software developers and hardware manufactures that encourage the creation of networking products that can communicate with each other over the network. To help network administrators by dividing large data exchange process in smaller segments.

Question 25

Which layer functions as a liaison between user support layers and network support layers?

A	Network layer
B	Physical layer
C	Transport layer
D	Session layer

Computer-NetworksISO-OSI-layers

Question 26

In the IPv-4 addressing format, the number of networks allowed under Class C addresses is

A	2¹⁴
B	2²¹
C	2⁷
D	2²⁴

Computer-NetworksIP-Address

Question 26 Explanation:

The number of networks allowed under Class C addresses are 2²¹ and each network contains 2⁸ IP addresses.

Question 27

Which of the following flip-flops is free from race around problem?

A	D flip-flop
B	T flip-flop
C	S-R flip-flop
D	Master-slave J-K flip-flop

Digital-Logic-DesignSequential-Circuits

Question 27 Explanation:

Master slave JK flip-flops is free from race around condition.
During high clock when ever applied input changes the output also changes. But in JK flip flop when j=k=1 , without any change in the input the output changes , this condition is called a race around condition. The circuit accepts input data when the clock signal is “HIGH”, and passes the data to the output on the falling-edge of the clock signal. In other words, the Master-Slave JK Flip flop is a “Synchronous” device as it only passes data with the timing of the clock signal.

Question 28

The number of full and half adders required to add 16-bit numbers are

A	8 half adders, 8 full adders
B	1 half adder, 15 full adders
C	16 half adders, 0 full adders
D	half adders, 12 full adders

Digital-Logic-DesignCombinational-Circuit

Question 28 Explanation:

For the first 15 bits we need 15 full adders and for LSB we need 1 half adder.

Question 29

An example of a tautology is

A	x ∨ y
B	x ∨ (¬ y)
C	x ∨ (¬ x)
D	(x →y) ^ (x ← y)

Engineering-MathematicsPropositional-Logic

Question 29 Explanation:

Question 30

The idempotent law in the Boolean algebra says that

A	¬ (¬ x) = x
B	x + x = x
C	x + xy = x
D	x(x + y) = x

Engineering-MathematicsPropositional-Logic

Question 30 Explanation:

The idempotent law in the Boolean algebra says that a op a = a, where op is any operator.

Question 31

The proposition (p→q) ^ (¬ q ∨ (p ∨ p) is equivalent to

A	q → p
B	p → q
C	(q → p) ∨ (p → q)
D	(p → q) ∧ (q → p)

Engineering-MathematicsPropositional-Logic

Question 31 Explanation:

(p→q) ^ (¬ q ∨ (p ∨ p) = (p->q) ^ (¬ q v p) (since pvp = p)
= (p->q) ^ (q ->p) (since ¬ q v p = q->p)

Question 32

How many flip-flops are required mod – 16 counters?

A	5
B	6
C	3
D	4

Digital-Logic-DesignSequential-Circuits

Question 32 Explanation:

No. of flip flops required for the mod N counter is log₂ N.
So log₂ 16=4.

Question 33

The number of control lines for a 8 to 1 multiplexer is

A	2
B	3
C	4
D	5

Digital-Logic-DesignCombinational-Circuit

Question 33 Explanation:

No. of control lines for 8 to 1 multiplexer is log₂ 8 = 3.

Question 34

The gray code for decimal number 6 is equivalent

A	1100
B	1001
C	0101
D	0110

Digital-Logic-DesignNumber-Systems

Question 34 Explanation:

The binary value of 6 is 0110.
The binary value b3, b2, b1, b0 and find the gray code g3, g2, g1, g0 based on the below concept, g3 = b3 = 0
g2 = b3 XOR b2 = 0 xor 1 = 1
g1 = b2 XOR b1 = 1 xor 1 = 0
g0 = b1 XOR b0 = 1 xor 0 = 1

Question 35

The gates required to build a half adder are

A	Ex-OR gate and NOR gate
B	Ex-OR gate and OR gate
C	Ex-OR gate and AND gate
D	Four NAND gates

Digital-Logic-DesignCombinational-Circuit

Question 35 Explanation:

In half adder for sum value we need 1 XOR gate and for carry value we need 1 AND gate.

Question 36

In order to implement an n-variable switching function, a MUX must have

A	2ⁿ inputs
B	2ⁿ + inputs
C	2^n-1 inputs
D	2ⁿ – 1 inputs

Digital-Logic-DesignCombinational-Circuit

Question 36 Explanation:

In order to implement an n-variable switching function, a MUX must have 2^n-1 inputs, where we can give n-1 variables and remaining 1 we can give to the select lines.

Question 37

The worst case time complexity of Quick Sort is __________

A	O(n²)
B	O(log n)
C	O(n)
D	O(n logn)

AlgorithmsSorting

Question 37 Explanation:

The worst case time complexity of Quick Sort is O(n²).
The worst case quicksort happens only 2 times
1. Elements are already in sorted order.
2. All elements having the same weight.

There are 37 questions to complete.

Access quiz wise question and answers by becoming as a solutions adda PRO SUBSCRIBER with Ad-Free content

If you have registered and made your payment please contact solutionsadda.in@gmail.com to get access