NET Exam in Computer Applications Previous year Question Papers

I am searching for the NET Exam in Computer Applications Previous year Question Papers? Please tell me from where I can get the NET Exam in Computer Applications Previous year Question Papers?

[Arun Vats]

The National Eligibility Test (NET) to be conducted by University Grants Commission (UGC), New Delhi. The applicant Candidates who have secured at least 55% marks (without rounding off) in Master’s Degree OR equivalent examination from universities/institutions recognised by UGC in Humanities (including languages) and Social Science, Computer Science & Applications, Electronic Science etc. are eligible for this Test.

The list of NET subjects is as follows:



Economics
Political Science
Philosophy
Psychology
Sociology
History
Anthropology
Commerce
Education
Social Work
Defence and Strategic Studies
Home Science
Public Administration
Population Studies
Music
Management
Maithili
Bengali
Hindi
Kannada
Malayalam
Odia
Punjabi
Sanskrit
Tamil
Telugu
Urdu
Arabic
English
Linguistics
Chinese
Dogri
Nepali
Manipuri
Assamese
Gujarati
Marathi
French
Spanish
Russian
Persian
Rajasthani
German
Japanese
Adult Education/ Continuing Education/ Andragogy/ Non Formal Education
Physical Education
Arab Culture and Islamic Studies
Indian Culture
Labour Welfare/Personnel Management/Industrial Relations/ Labour and Social Welfare/Human Resource Management
Law
Library and Information Science
Buddhist, Jaina, Gandhian and Peace Studies
Comparative Study of Religions
Mass Communication and Journalism
Performing Arts – Dance/Drama/Theatre
Museology & Conservation
Archaeology
Criminology
Tribal and Regional Language/Literature
Folk Literature
Comparative Literature
Sanskrit Traditional Subjects (including Jyotisha/Sidhanta Jyotisha/ Navya Vyakarna/ Vyakarna/ Mimamsa/ Navya Nyaya/ Sankhya Yoga/ Tulanatmaka Darsana/ Shukla Yajurveda/ Madhva Vedanta/ Dharma Sastra/ Sahitya/ Purana-itihasa/Agama/Advaita Vedanta)
Women Studies
Visual Arts (including Drawing & Painting/Sculpture/ Graphics/Applied Art/History of Art)
Geography
Social Medicine & Community Health
Forensic Science
Pali
Kashmiri
Konkani
Computer Science and Applications
Electronic Science
Environmental Sciences
International and Area Studies
Prakrit
Human Rights and Duties
Tourism Administration and Management

Bodo
Santali


You are asking for the NET Exam in Computer Applications Previous year Question Papers. This is as follows:

1. When data and acknowledgement are
sent in the same frame, this is called
as
(A) Piggy packing
(B) Piggy backing
(C) Back packing
(D) Good packing

2. Encryption and Decryption is the
responsibility of _______ Layer.
(A) Physical
(B) Network
(C) Application
(D) Datalink


NET Exam in Computer Applications Previous year Question Papers II

1. A file is downloaded in a home
computer using a 56 kbps MODEM
connected to an Internet Service
Provider. If the download of file
completes in 2 minutes, what is the
maximum size of data downloaded ?
(A) 112 Mbits (B) 6.72 Mbits
(C) 67.20 Mbits (D) 672 Mbits
2. In ______ CSMA protocol, after the
station finds the line idle, it sends or
refrains from sending based on the
outcome of a random number generator.
(A) Non-persistent
(B) 0-persistent
(C) 1-persistent
(D) p-persistent
3. Which of the following substitution
technique have the relationship
between a character in the plaintext
and a character in the ciphertext as
one-to-many ?
(A) Monoalphabetic
(B) Polyalphabetic
(C) Transpositional
(D) None of the above
4. What is the maximum length of
CAT-5 UTP cable in Fast Ethernet
network ?
(A) 100 meters (B) 200 meters
(C) 1000 meters (D) 2000 meters
5. The ______ is a set of standards that
defines how a dynamic web document
should be written, how input data
should be supplied to the program, and
how the output result should be used.
(A) Hyper Text Markup Language
(B) File Transfer Protocol
(C) Hyper Text Transfer Protocol
(D) Common Gateway Interface
6. The count-to-infinity problem is
associated with
(A) Flooding algorithm
(B) Hierarchical routing algorithm
(C) Distance vector routing
algorithm
(D) Link state routing algorithm
7. The IEEE single-precision and
double-precision format to represent
floating-point numbers, has a length
of ______ and ______ respectively.
(A) 8 bits and 16 bits
(B) 16 bits and 32 bits
(C) 32 bits and 64 bits
(D) 64 bits and 128 bits
8. Consider an undirected graph G with
100 nodes. The maximum number of
edges to be included in G so that the
graph is not connected is
(A) 2451 (B) 4950
(C) 4851 (D) 9900
9. The amortized time complexity to
perform ______ operation(s) in Splay
trees is O(Ig n).
(A) Search
(B) Search and Insert
(C) Search and Delete
(D) Search, Insert and Delete
10. Suppose that the splits at every level of
Quicksort are in proportion 1-β to β,
where 0 < β ≤ 0.5 is a constant. The
number of elements in an array is n.
The maximum depth is approximately
(A) 0.5 β Ig n
(B) 0.5 (1 – β) Ig n
(C) – (Ig n)/(Ig β)

11. The minimum number of nodes in a
binary tree of depth d (root is at level 0)
is
(A) 2d – 1 (B) 2d + 1 – 1
(C) d + 1 (D) d
12. The efficient data structure to
insert/delete a number in a stored set
of numbers is
(A) Queue
(B) Linked list
(C) Doubly linked list
(D) Binary tree
13. The number of states in a minimal
deterministic finite automaton
corresponding to the language
L = { an | n≥4 } is
(A) 3 (B) 4
(C) 5 (D) 6
14. Regular expression for the language
L = { w ∈ {0, 1}* | w has no pair of
consecutive zeros} is
(A) (1 + 010)*
(B) (01 + 10)*
(C) (1 + 010)* (0 + λ)
(D) (1 + 01)* (0 + λ)
15. Consider the following two
languages :
L1 = {an bl ak | n + l +k>5 }
L2 = {an bl ak |n>5, l >3, k≤ l }
Which of the following is true ?
(A) L1 is regular language and L2 is
not regular language.
(B) Both L1 and L2 are regular
languages.
(C) Both L1 and L2 are not regular
languages.
(D) L1 is not regular language and
L2 is regular language.
16. LL grammar for the language
L = {an bm cn+m | m≥0, n≥0} is
(A) S → aSc | S1 ; S1 → bS1c | λ
(B) S → aSc | S1| λ ; S1 → bS1c
(C) S → aSc | S1| λ ; S1 → bS1c| λ
(D) S → aSc | λ ; S1 → bS1c| λ
17. Assume the statements S1 and S2
given as :
S1 : Given a context free grammar
G, there exists an algorithm for
determining whether L(G) is
infinite.
S2 : There exists an algorithm to
determine whether two context
free grammars generate the
same language.
Which of the following is true ?
(A) S1 is correct and S2 is not
correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is
correct.
18. The number of eight-bit strings
beginning with either 111 or 101 is
______.
(A) 64
(B) 128
(C) 265
(D) None of the above
19. Find the number of ways to paint 12
offices so that 3 of them will be
green, 2 of them pink, 2 of them
yellow and the rest ones white.
(A) 55,440 (B) 1,66,320
(C) 4.790E+08 (D) 39,91,680

20. Consider the following statements :
(i) A graph in which there is a
unique path between every pair
of vertices is a tree.
(ii) A connected graph with e = v – 1
is a tree.
(iii) A graph with e = v – 1 that has
no circuit is a tree.
Which of the above statements is/are
true ?
(A) (i) & (iii)
(B) (ii) & (iii)
(C) (i) & (ii)
(D) All of the above
21. Consider the In-order and Post-order
traversals of a tree as given below :
In-order : j e n k o p b f a c l g m d h i
Post-order : j n o p k e f b c l m g h i d a
The Pre-order traversal of the tree
shall be
(A) a b f e j k n o p c d g l m h i
(B) a b c d e f j k n o p g l m h i
(C) a b e j k n o p f c d g l m h i
(D) j e n o p k f b c l m g h i d a
22. A simple graph G with n-vertices is
connected if the graph has
(A) (n – 1) (n – 2)/2 edges
(B) more than (n – 1) (n – 2)/2
edges
(C) less than (n – 1) (n – 2)/2 edges
(D) ∑k
i=1 C(ni, 2) edges
23. Which one of the following set of
gates is best suited for ‘parity’
checking and ‘parity’ generation ?
(A) AND, OR, NOT
(B) NAND, NOR
(C) EX-OR, EX-NOR
(D) None of the above
24. The quantification ∃!x P(x) denotes
the proposition “There exists a
unique x such that P(x) is true”,
express the quantification using
universal and existential
quantifications and logical operators :
(A) ∃x P(x) ∨ ∀x∀y ((P(x) ∨ P(y))
→ x = y)
(B) ∀ x P(x) ∧ ∀x∀y ((P(x) ∨ P(y))
→ x = y)
(C) ∃x P(x) ∧ ∀x∀y ((P(x) ∧ P(y))
→ x = y)
(D) ∃x P(x) ∧ ∃x∃y ((P(x) ∨ P(y))
→ x = y)
25. If F and G are Boolean functions of
degree n. Then, which of the
following is true ?
(A) F ≤ F + G and F G ≤ F
(B) G ≤ F + G and F G ≥ G
(C) F ≥ F + G and F G ≤ F
(D) G ≥ F + G and F G ≤ F
26. Match the following identities/laws
to their corresponding name :
(a) x + x = x
x • x = x
i. Dominance
(b) x + 0 = x
x • 1 = x
ii. Absorption
(c) x + 1 = 1
x • 0 = 0
iii. Idempotent
(d) x • (x + y) = x iv. Identity
Codes :
(a) (b) (c) (d)
(A) iii iv i ii
(B) iv iii i ii
(C) iv iii ii i
(D) iii iv ii i
27. In which one of the following,
continuous process improvement is
done ?
(A) ISO9001
(B) RMMM
(C) CMM
(D) None of the above

28. The ______ of a program or
computing system is the structure or
structures of the system, which
comprise software components, the
externally visible properties of these
components, and the relationship
among them.
(A) E-R diagram
(B) Data flow diagram
(C) Software architecture
(D) Software design
29. Working software is not available
until late in the process in
(A) Waterfall model
(B) Prototyping model
(C) Incremental model
(D) Evolutionary Development
model
30. Equivalence partitioning is a ______
testing method that divides the input
domain of a program into classes of
data from which test cases can be
derived.
(A) White box (B) Black box
(C) Regression (D) Smoke
31. Consider the following characteristics :
(i) Correct and unambiguous
(ii) Complete and consistent
(iii) Ranked for importance and/or
stability and verifiable
(iv) Modifiable and Traceable
Which of the following is true for a
good SRS ?
(A) (i), (ii) and (iii)
(B) (i), (iii) and (iv)
(C) (ii), (iii) and (iv)
(D) (i), (ii), (iii) and (iv)
32. Linked Lists are not suitable for
_____.
(A) Binary Search
(B) Polynomial Manipulation
(C) Insertion
(D) Radix Sort
33. What is the size of the following
Union ? Assume that the size of
int = 2, size of float = 4, size of
char = 1
union tag {
int a;
float b;
char c;
};
(A) 2 (B) 4
(C) 1 (D) 7
34. What is the output of the following
program segment ?
sum(n)
{
if ( n < 1 ) return n;
else return (n + sum(n–1));
}
main()
{
printf(“%d”, sum(5));
}
(A) 10 (B) 16
(C) 15 (D) 14
35. Assume that x and y are non-zero
positive integers. What does the
following program segment perform ?
while (x!=0)
{
if (x>y)
x = x-y
else
y=y-x;
printf(“%d”,x);
(A) Computes LCM of two
numbers
(B) Computes GCD of two
numbers
(C) Divides large number with
small number
(D) Subtracts smaller number from
large number

36. Consider the following program
segment :
d=0;
for(i=1; i<31, ++i)
for(j=1; j<31, ++j)
for(k=1; k<31, ++k)
if ((i+j+k)%3)= = 0);
d = d + 1;
printf(“%d”, d);
The output will be
(A) 9000 (B) 3000
(C) 90 (D) 2700
37. Usage of Preemption and Transaction
Rollback prevents ______.
(A) Unauthorised usage of data file
(B) Deadlock situation
(C) Data manipulation
(D) File preemption
38. The _____ language was originally
designed as the Transformation
Language for Style Sheet facility.
(A) XSTL (B) XML
(C) XQuery (D) XPath
39. Views are useful for _____ unwanted
information, and for collecting
together information from more than
one relation into a single view.
(A) Hiding
(B) Deleting
(C) Highlighting
(D) All of the above
40. The decision tree classifier is a
widely used technique for ______.
(A) Classification (B) Association
(C) Partition (D) Clustering
41. Cross_tab displays permit users to
view ______ of multidimensional
data at a time.
(A) One dimension
(B) Two dimensions
(C) Three dimensions
(D) Multidimensions
42. A method to provide secure
transmission of email is called ____.
(A) TLS (B) SA
(C) IPSec (D) PGP
43. Thoma’s-write rule is ______.
(A) Two phase locking protocol
(B) Timestamp ordering protocol
(C) One phase locking protocol
(D) Sliding window protocol
44. Match the following :
List – I List - II
Process state
transition
Reason for
transition
a Ready→
Running
i. Request made
by the process
is satisfied or
an event for
which it was
waiting occurs.
b Blocked→
Ready
ii. Process wishes
to wait for
some action by
another
process.
c Running→
Blocked
iii. The process is
dispatched.
d Running→
Ready
iv. The process is
preempted.
Codes :
a b c d
(A) iii i ii iv
(B) iv i iii ii
(C) iv iii i ii
(D) iii iii ii i
45. The hit ratio of a Translation Look
Aside Buffer (TLAB) is 80%. It
takes 20 nanoseconds (ns) to search
TLAB and 100 ns to access main
memory. The effective memory
access time is ______.
(A) 36 ns (B) 140 ns
(C) 122 ns (D) 40 ns

46. Consider the input/output (I/O)
requests made at different instants of
time directed at a hypothetical disk
having 200 tracks as given in the
following table :
Serial
No.
1 2 3 4 5
Track
No.
12 85 40 100 75
Time of
arrival
65 80 110 100 175
Assume that :
Current head position is at track no.
65
Direction of last movement is
towards higher numbered tracks
Current clock time is 160
milliseconds
Head movement time per track is
1 millisecond.
“look” is a variant of “SCAN” diskarm
scheduling algorithm. In this
algorithm, if no more I/O requests
are left in current direction, the disk
head reverses its direction. The seek
times in Shortest Seek First (SSF)
and “look” disk-arm scheduling
algorithms respectively are :
(A) 144 and 123 milliseconds
(B) 143 and 123 milliseconds
(C) 149 and 124 milliseconds
(D) 256 and 186 milliseconds
47. Assume that an implementation of
Unix operating system uses i-nodes
to keep track of data blocks allocated
to a file. It supports 12 direct block
addresses, one indirect block address
and one double indirect block
address. The file system has 256
bytes block size and 2 bytes for disk
block address. The maximum
possible size of a file in this system is
(A) 16 MB (B) 16 KB
(C) 70 KB (D) 71 KB
48. Which of the following set of Unix
commands will always display
“WELCOME” ?
(A) export title=WELCOME; Echo
$title
(B) title = WELCOME; export $
title ; sh –c “echo $title”
(C) title = WELCOME; export title ;
sh –c “echo $title”
(D) title = WELCOME; echo $title
49. What type of logic circuit is
represented by the figure shown
below ?
(A) XOR (B) XNOR
(C) XAND (D) XNAND
50. The speed up of a pipeline processing
over an equivalent non-pipeline
processing is defined by the ratio :
(A) S =
n tn
(k + n – 1)tp
(B) S =
n tn
(k + n + 1)tp
(C) S =
n tn
(k – n + 1)tp
(D) S =
(k + n – 1)tp
n tn
Where n → no. of tasks
tn
→ time of completion of
each task
k → no. of segments of
pipeline
tp
→ clock cycle time
S → speed up ratio

I should get question papers of UGC NET Computer Applications Examination. So any one provides me previous years question papers of UGC NET Computer Applications?

[Quick Sam]

Here you should get previous years question papers of UGC NET Computer Applications Exam, so I am giving following question papers:

UGC NET Computer Applications Question Paper II
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.
(A) ABFCDE
(B) ADBFEC
(C) ABDECF
(D) None of the above
3. The branch logic that provides making
capabilities in the control unit is known
as
(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
using
(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
by
(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
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
marks. Attempt all the questions.
9. What deletes the entire file except the
file structure ?
(A) ERASE
(B) DELETE
(C) ZAP
(D) PACK
10. Which command is the fastest among
the following ?
(A) COPY TO <NEW FILE>
(B) COPY STRUCTURE TO <NEW
FILE>
(C) COPY FILE <FILE 1> <FILE 2>
(D) COPY TO MFILE-DAT
DELIMITED
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
rate
(D) Disks are more reliable than
memory
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
control
(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
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
rate).
(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-Tx
(B) 100 Base-Fx
(C) 100 Base-T4
(D) 100 Base-T1
20. Main aim of software engineering is to
produce
(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
coupling
(B) maximize cohesion and minimize
coupling
(C) maximize cohesion and
maximize coupling
(D) minimize cohesion and minimize
coupling
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
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
functions.
(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
process
(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
35. If an integer needs two bytes of
storage, then the maximum value of a
signed integer is
(A) 216 – 1
(B) 215 – 1
(C) 216
(D) 215
36. Which of the following logic families
is well suited for high-speed operations ?
(A) TTL
(B) ECL
(C) MOS
(D) CMOS
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 ?
(A) OSPF
(B) Link-state
(C) Dynamic
(D) Dijkestra vector
42. Identify the incorrect statement :
(A) The overall strategy drives the
E-Commerce data warehousing
strategy.
(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
server.
(D) E-Commerce security threats can
be grouped into three major
categories.
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
application.
(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
more paper detail to attached pdf file;