Computer Science National Eligibily Test Sample Papers

I want to give the CS national eligibility test. How do I prepare for this exam. Can anyone recommend me any new books and I also need new sample papers or previous year papers.

CS NET Exam:

Preparation:
You can join any good coaching centre.
You can take the help of previous years question papers.
You can also refer preparation books.
You can do your preparation with the help of solved question papers.


As you have asked for the previous years question papers so for your help here I am uploading the question papers.

Attached Files Available for Download

	UGC NET Computer Science and Applications Paper II.pdf (100.1 KB, 137 views)
	UGC NET Computer Science and Applications Paper III.pdf (114.3 KB, 144 views)

here I am giving you question paper for National Eligibily Test Computer Science examination in PDF file with it so you can get it easily..

some questions are given below :
COMPUTER SCIENCE AND APPLICATIONS
Paper – II
Note : This paper contains fifty (50) objective type questions, each question carrying two
(2) marks. Attempt all the questions.

1. Any integer composed of 3n
identical digits divisible by
(A) 2n (B) 3n
(C) 5n (D) 7n
2. The circumference of the two
concentric disks are divided into 100
sections each. For the outer disk, 100
of the sections are painted red and
100 of the sections are painted blue.
For the inner disk, the sections are
painted red and blue in an arbitrary
manner. It is possible to align the
two disks so that
(A) 100 or more
(B) 125 or more
(C) 150 or more
(D) 175 or more
of the sections on the inner disks
have their colours matched with the
corresponding section on outer disk.
3. The proposition ~ p q is equivalent
to
(A) p q
(B) q p
(C) p q
(D) p q
4. The absorption law in Boolean
algebra say that
(A) X + X = X
(B) X . X = X
(C) x + x . y = x
(D) None of the above
5. The number of 1’s present in the
binary representation of
10 × 256 + 5 × 16 + 5 is
(A) 5 (B) 6
(C) 7 (D) 8
6. The hexadecimal number equivalent
to (1762.46)8 is
(A) 3F2.89
(B) 3F2.98
(C) 2F3.89
(D) 2F3.98
7. (A + B)
–––
AB is equivalent to
(A) A B
(B) A u B
(C) (A B) u A
(D) (A u B) A
8. A latch is constructed using two
cross-coupled
(A) AND and OR gates
(B) AND gates
(C) NAND and NOR gates
(D) NAND gates

9. A multiplexer is a logic circuit that
(A) accepts one input and gives
several output
(B) accepts many inputs and gives
many output
(C) accepts many inputs and gives
one output
(D) accepts one input and gives
one output
10. 8-bit 1’s complement form of –77.25
is
(A) 01001101.0100
(B) 01001101.0010
(C) 10110010.1011
(D) 10110010.1101
11. From the point of view of the
programmer, what are the major
advantages of using a high-level
language rather than internal
machine code or assembly
language ?
(A) Program portability
(B) Easy development
(C) Efficiency
(D) None of the above
12. What features make C++ so
powerful ?
(A) Easy implementation
(B) Reusing old code
(C) Easy memory management
(D) All of the above
13. The goal of operator overloading is
(A) to help the user of a class
(B) to help the developer of a class
(C) to help define friend function
(D) None of the above
14. The scheme of which interpreter
translates the source program is
known as
(A) Paragraph by paragraph
(B) Instruction by instruction
(C) Line by line
(D) None of the above
15. Portable program means
(A) Program with wheels
(B) Independent from its authors
(C) Independent of platform
(D) None of the above
16. Which of the following is the
recovery management technique in
DDBMS ?
(A) 2PC (Two Phase Commit)
(B) Backup
(C) Immediate update
(D) All of the above
17. Which of the following is the
process by which a user’s privileges
ascertained ?
(A) Authorization
(B) Authentication
(C) Access Control
(D) None of these

18. The basic variants of time-stampbased
method of concurrency control
are
(A) Total time stamp-ordering
(B) Partial time stamp ordering
(C) Multiversion Time stamp
ordering
(D) All of the above
19. A transaction can include following
basic database access operations :
(A) Read_item(X)
(B) Write_item(X)
(C) Both (A) and (B)
(D) None of these
20. Decomposition help in eliminating
some of the problems of bad design
(A) Redundancy
(B) Inconsistencies
(C) Anomalies
(D) All of the above
21. The number of different trees with 8
nodes is
(A) 256
(B) 255
(C) 248
(D) None of these
22. Given a binary tree whose inorder
and preorder traversal are given by
Inorder : EICFBGDJHK
Preorder : BCEIFDGHJK
The post order traversal of the above
binary tree is
(A) I E FCGJ KHDB
(B) I E FC J GKHDB
(C) I E FCGKJ HDB
(D) I E FCGJ KDBH
23. The number of disk accesses
performed by insertion operation in
B-tree of height h is
(A) 0(1)
(B) 0(1gh)
(C) 0(h)
(D) None of these
24. Consider a hash table of size
m = 10000 and the hash function
h(k) = m (kA mod 1) ' for
A =
( 5 – 1)
2
. The location to the
key k = 123456 is
(A) 46 (B) 47
(C) 41 (D) 43
25. When the priority queue is
represented by max heap, the
insertion and deletion of an element
can be performed in (queue
containing n elements)
(A) (n) and (1) respectively
(B) (n) and (n) respectively
(C) (1) and (1) respectively
(D) None of the above
26. A comparison of frequency division
and time division multiplexing
system shows that
(A) FDM requires a lower
bandwidth, but TDM has
greater noise immunity.
(B) FDM has greater noise
immunity and requires lower
bandwidth than TDM.
(C) FDM requires channel
synchronization, while TDM
has greater noise immunity.
(D) FDM requires more multiplex
while TDM requires band pass
filter.

27. If carrier modulated by a digital bit
stream, has one one of the possible
phase of 0, 90, 180 and 270 degrees,
then modulation called
(A) BPSK (B) QPSK
(C) QAM (D) MSK
28. Consider the following statement :
(i) The bandwidth of the A.M.,
wave depends on the band
width of the modulating signal.
(ii) The bandwidth of the A.M.,
wave depends on the
modulation index.
(iii) The bandwidth of the F.M,
wave for all practical purpose
depends on the amplitude of
the carrier.
Of these statements the correct
statements are
(A) (i, ii)
(B) (i, iii)
(C) (ii, iii)
(D) All of the above
29. A smart modem can dial, hangup
and answer incoming calls
automatically. Can you tell who
provides the appropriate instructions
to the modem for this purpose ?
(A) Communication software
(B) Error detection protocols
(C) Link access procedure (LAP)
(D) Telecommunications
30. Which of the following switching
techniques is most suitable for
interactive traffic ?
(A) Circuit switching
(B) Message switching
(C) Packet switching
(D) All of the above
31. Object modules generated by
assembler that contains unresolved
external references are resolved for
two or more object module by a/an
(A) Operating system
(B) Loader
(C) Linker
(D) Compiler
32. A special software that is used to
create a job queue is called
(A) Drive
(B) Spooler
(C) Interpreter
(D) Linkage editor
33. Which of the following permanent
database that has an entry for each
terminal symbol ?
(A) Literal table
(B) Identifier table
(C) Terminal table
(D) Source table

34. In which way(s) a macroprocessor
for assembly language can be
implemented ?
(A) Independent two-pass processor
(B) Independent one-pass processor
(C) Expand macrocalls and
substitute arguments
(D) All of the above
35. Which of the following can be
accessed by transfer vector approach
of linking ?
(A) External data segments
(B) External subroutine
(C) Data located in other
procedure
(D) All of the above
36. Block or Buffer caches are used to
(A) improve disk performance
(B) handle interrupts
(C) increase the capacity of main
memory
(D) speed up main memory Read
operations
37. A file organization component
VSAM file is
(A) Relative records data set
(B) Keyed sequential data set
(C) Entry sequential data set
(D) All of the above
38. A relationship between processes
such that each has some part (critical
section) which must not be executed
while the critical section of another
is being executed, is known as
(A) Semaphore
(B) Mutual exclusion
(C) Multiprogramming
(D) Message passing
39. How many states can a process be
in ?
(A) 3 (B) 4
(C) 2 (D) 5
40. Which command allows you to view
your file 24 lines at a time ?
(A) More
(B) Cat
(C) Pg
(D) None of the above
41. Which one of the items listed below
is not one of the software
engineering layers ?
(A) Process
(B) Manufacturing
(C) Method
(D) Tools

42. What is the first stage in program
development ?
(A) Specification and design
(B) System Analysis
(C) Testing
(D) None of the above
43. By means of a data flow diagram,
the analyst can detect
(A) Task duplication
(B) Unnecessary delays
(C) Task overlapping
(D) All of the above
44. Which of these are the 5 generic
software engineering framework
activities ?
(A) Communication, planning,
modelling, construction,
deployment
(B) Communication, risk
management, measurement,
production, reviewing
(C) Analysis, designing,
programming, Debugging,
maintenance
(D) Analysis, planning, designing,
programming, testing
45. Many causes of the software crisis
can be traced to mythology based on
(A) Management Myths
(B) Customer Myths
(C) Practitioner Myths
(D) All of the above
46. Data warehousing refers to
(A) storing data offline at a
separate site
(B) backing up data regularly
(C) is related to data mining
(D) uses tape as opposed to disk
47. Virtual memory is
(A) related to virtual reality
(B) a form of ROM
(C) a form of RAM
(D) None of the above
48. “M-Commerce” refers to
(A) a myth which does not exist in
reality
(B) the ability of business to reach
potential customers wherever
they are
(C) the ability to have large
capacity of memory storage
dealing trade and commerce
(D) None of the above
49. The principal electronic payment
systems for electronic commerce is
(A) Credit Card
(B) Digital Wallet
(C) Electronic Cheque
(D) All of the above

50. Which is the most valuable
electronic commerce to the
individual customer in long run ?
(A) Business to Customer
(B) Business to Business
(C) Customer to Customer
(D) None of the above


COMPUTER SCIENCE AND APPLICATIONS
PAPER – III
Note : This paper is of two hundred (200) marks containing four (4) sections. Candidates
are required to attempt the questions contained in these sections according to the
detailed instructions given therein.

Answer to all questions must be written in English only.

SECTION – I
Note : This section consists of two essay type questions of twenty (20) marks each, to be
answered in about five hundred (500) words each. (2 20 = 40 marks)
1. (a) Design an algorithm to reverse a singly linear linked list without using any
temporary memory location.
(b) Construct a binary tree representing the infix expression(a + b) k 
(g – m) | f * p – 5 * t and make it a post order threaded binary tree. (10 + 10)
OR
(a) Give an O(n2) time algorithm to find the longest monotonically increasing
subsequence of a sequence of n numbers.
(b) Write Floyd-Warshall algorithm to solve the all-pairs shortest path
problems on a directed graph G. Compute its time complexity. (10 + 10)
__________________________________________________ _____________________________________________
__________________________________________________ ______________
2. (a) Given the set of functional dependencies
{A BCD, CD E, E CD, D AH, ABH BD, DH BC}
Find the non-redundant cover.
(b) Given the relation R(ABCDE) with the FD’s
{A BCDE, B ACDE, C ABDE}
Give the lossless decomposition of R. (10 + 10)
OR
Why is frequency modulation superior to amplitude modulation ? Give
comparative study between encoding and modulation. (20)
__________________________________________________ _____________________________________________
_______________________________
SECTION – II
Note : This section contains three (3) questions from each of the electives/specializations.
The candidate has to choose only one elective/specialization and answer all the
three questions contained therein. Each question carries fifteen (15) marks and is to
be answered in about three hundred (300) words. (3 15 = 45 marks)

Elective – I
3. Let G be the grammar with productions
S AACD
A aAb |
C aC | a
D aDa | bDb | (15)
Convert the grammar G into Chomsky Normal Form.
4. Design Turing Machine which accepts language (15)
L = {an bn cn | n > 0 }

5. Give deterministic finite automata accepting the set of strings of length five or
more in which the fourth symbol from the right end is different from the left most
symbol defined over the alphabet {a, b}. (15)

Elective – II
3. Describe the construction of a typical parity check matrix for Hamming code over
GF(2) give its code words and error correction capability. (15)
4. Explain different components of a typical image processing system with a diagram.(15)

5. Mention various techniques of video files and explain any one technique in detail. (15)

Elective – III
3. The diagram represents a network and the numbers on the arcs are their capacities.
A flow is defined as follows :
(x, y) : (s, a) (s, b) (s, c) (a, b) (a, d) (b, c)
f(x, y) : 5 6 0 0 5 1
(x, y) : (b, d) (b, e) (c, e) (d, t) (e, t)
f(x, y) : 2 3 1 7 4
(i) What is the value of f ?
(ii) Find an f–augmented path and compute the value of augmented flow.
(iii) Find the cut, which can justify the statement “Max flow = Minimum Cut”.
(3 × 5 = 15)
4. Use revised simplex-method to solve the following linear programming problem :
Maximize Z = x
1 + 2x
2
Subject to the constraint : x
1 + x
2 < 3, x
1 + 2x
2 < 5
3x
1 + x
2 < 6 and x
1, x
2 > 0 (15)
5. Derive the Kuhn Tucker conditions for the following quadratic programming
problem and find the value of x
1, x
2 and x
3.
Maximize Z = – x
2
1 – x
2
2 – x
2
3 + 4x
1 + 6x
2 subject to the constraints :
x
1 + x
2 < 2, 2x
1 + 3x
2 < 12, x
1, x
2 > 0 (15)

Elective – IV
3. Explain the concept of feed forward Neural Network with an example. (15)
4. How unsupervised learning is different from supervised learning ? Which is more
complex ? Justify with an example. (15)
5. Prove that fuzzy set A on, IR is convex if and only if
A(X2 + (1 – )X 2) > min (A(X1), A(X2) for all X1, X2 IR and all [0, 1]
where min denotes the minimum operator. (15)

Elective – V
3. List out any 8 features of UNIX and explain any two of them. (15)
4. What is syntax of “create” system call in UNIX ? Write an algorithm for creating a
file. (15)
5. How object library, dynamic linking library and import library works in
WINDOWS environment ? (15)
__________________________________________________ _____________________________________________
__________________________________________________ ______________
__________________________________________________ _____________________________________________
SECTION – III
Note : This section contains nine (9) questions of ten (10) marks, each to be answered in
about fifty (50) words. (9 10 = 90 marks)
6. Construct a logic circuit diagram for the exclusive – OR function using only NOR
gates. (10)
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________
7. Consider the following graph-based locking protocol, which allows only exclusive
lock modes, and which operates on data graphs that are in the form of a rooted
directed acyclic graph :
– A transition can lock any vertex first.
– To lock any other vertex, the transaction must be holding a lock on the
majority of the parents of the vertex.
Show that the protocol ensures serializability and dead lock freedom. (10)
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________
__________________________________________________ ______________
8. Explain terms Aspect Ratio, Refresh Rate and Resolution of a Graphics Display
System. (10)
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________
9. Let w = {11, 13, 24, 7} and m = 31. Find all possible subsets of w that sum to m.
Draw the portion of the state space tree that is generated. (10)
__________________________________________________ _____________________________________________
__________________________________________________ ______________
__________________________________________________ ______________
10. Explain under what circumstances asynchronous and synchronous transmission
technique are employed. Why asynchronous communications require additional
standard stop bits ? What is wrong with letting the first-bit in a transmission act as
a start bit and last one act as a stop bit ? (10)
__________________________________________________ _____________________________________________
__________________________________________________ ______________
11. Write an algorithm to compute maximum and minimum of a given set of n
elements. (10)
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________
12. Discuss any two constraints imposed while designing an object model. (10)
__________________________________________________ _____________________________________________
13. Define the role of “prototyping” and “4GT” paradigm in software engineering. (10)
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________

14. Discuss characteristics of deadlock in an operating system. (10)
__________________________________________________ _____________________________________________

SECTION – IV
Note : This section contains five (5) questions of five (5) marks each based on the following
passage. Each question should be answered in about thirty (30) words.

(5 5 = 25 marks)
M/s Greenlay Bank has just ventured into a retail banking system with the following
function (sub processes) at the beginning :
– Saving Bank accounts
– Current Bank accounts
– Fixed deposits
– Loans
– Demat Account
With reference to above, answer the following questions :
15. Explain Requirement Definition & Analysis.
__________________________________________________ _____________________________________________
__________________________________________________ _____________________________________________
16. Make Conceptual Design : (Entity-Relationship diagram)
__________________________________________________ _____________________________________________
__________________________________________________ ______________
17. Explain Logical Database Design : (Table Definition)
__________________________________________________ _____________________________________________
18. Logical Database design : (Sample Table Contents)
__________________________________________________ _____________________________________________
19. Explain Functional Dependency with diagram.
__________________________________________________ _____________________________________________

__________________
Answered By StudyChaCha Member