Go Back   2023-2024 StudyChaCha > StudyChaCha Discussion Forum > General Topics

Old April 27th, 2014, 11:07 AM
Super Moderator
Join Date: Nov 2011
Default Re: UGC NET Preparation guide for computer science and application

As you want to get the syllabus of Computer Science of UGC NET so here is the information of the same for you:

Paper II
Discrete Structures.
Computer Arithmetic.
Programming in C and C++.
Relational Database Design and SQL.
Data and File Structures.
Computer Networks.
System Software and Compilers.
Operating Systems with Case Study of Unix.
Software Engineering.
Current Trends and Technologies.

Paper III - Core Group
Digital Systems and Microprocessors.
Data Base Management Systems.
Computer Graphics.
Programming Concepts.
Data Communication and Networks.
Data Structures and Algoritms.
OOP and Web Technologies.
Advanced Software Engineering.
Operating Systems.
Artificial Intelligence.

Paper III - Elective/Optional
Finite Automata and Formal Languages.
Information Theory and Coding.
Operation Research.
Neural Networks and Fuzzy Systems.
Unix and Windows.

Contact Details:
University Grants Commission New Delhi
Bahadur Shah Zafar Marg,
Balmiki Basti,
Vikram Nagar,
New Delhi,
Delhi 110002 ‎
093 33 778791 ‎

Map Location:
Answered By StudyChaCha Member
Reply With Quote
Old January 2nd, 2015, 02:12 PM
Super Moderator
Join Date: Nov 2011
Default Re: UGC NET Preparation guide for computer science and application

As you want to get UGC NET Preparation books for computer science and application so here I am giving you some books:

UGC NET/JRF/SET Computer Science and Applications (Paper - II & III) (English) 1st Edition
Publisher: Upkar Prakashan

UGC NET Computer Science (Paper II & III) Guide (English) 2010th Edition
Publisher: Ramesh Publishing House

Trueman's UGC NET Computer Science 01 Edition

UGC NET JRF & LS Junior Research Fellowship and Lecturership: Computer Science and Applications (English)
Publisher: Arihant Publications(I)

1. Infrared signals can be used for short
range communication in a closed
area using _______ propagation.
(A) ground (B) sky
(C) line of sight (D) space
2. A bridge has access to _______
address in the same network.
(A) Physical (B) Network
(C) Datalink (D) Application
3. The minimum frame length for
10 Mbps Ethernet is _______ bytes
and maximum is _______ bytes.
(A) 64 & 128 (B) 128 & 1518
(C) 1518 & 3036 (D) 64 & 1518
4. The bit rate of a signal is 3000 bps. If
each signal unit carries 6 bits, the baud
rate of the signal is _______.
(A) 500 baud/sec
(B) 1000 baud/sec
(C) 3000 baud/sec
(D) 18000 baud/sec.
5. Match the following :
List – I List – II
a. Physical
i. Allow resources to
network access
b. Datalink
ii. Move packets from
one destination to
c. Network
iii. Process to process
message delivery
d. Transport
iv. Transmission of
bit stream
e. Application
v. Formation of
Codes :
a b c d e
(A) iv v ii iii i
(B) v iv i ii iii
(C) i iii ii v iv
(D) i ii iv iii v
6. A grammar G is LL(1) if and only if
the following conditions hold for two
distinct productions A | 
I. First () First () _ {a} where
a is some terminal symbol of the
II. First () First () _ 
III. First () Follow (A) = if 
First ()
(A) I and II (B) I and III
(C) II and III (D) I, II and III
7. Which of the following suffices to convert
an arbitrary CFG to an LL(1) grammar ?
(A) Removing left recursion alone
(B) Removing the grammar alone
(C) Removing left recursion and
factoring the grammar
(D) None of the above
8. A shift reduce parser suffers from
(A) shift reduce conflict only
(B) reduce reduce conflict only
(C) both shift reduce conflict and
reduce reduce conflict
(D) shift handle and reduce handle

Paper – II
Note : This paper contains fifty (50) objective type questions of two (2) marks each. All
questions are compulsory.
J-87-14 3 Paper-II
10. The regular grammar for the language
L = {w|na(w) and nb(w) are both even,
w {a, b}*} is given by :
(Assume, p, q, r and s are states)
(A) p aq | br | , q bs | ap
r as | bp, s ar | bq, p and s
are initial and final states.
(B) p aq | br, q bs | ap
ras | bp, sar | bq, p and s
are initial and final states.
(C) p aq | br | , q bs | ap
r as | bp, sar | bq
p is both initial and final states.
(D) p aq | br, q bs | ap
r as | bp, s ar | bq
p is both initial and final states.
11. KPA in CMM stands for
(A) Key Process Area
(B) Key Product Area
(C) Key Principal Area
(D) Key Performance Area
12. Which one of the following is not a
risk management technique for
managing the risk due to unrealistic
schedules and budgets ?
(A) Detailed multi source cost and
schedule estimation.
(B) Design cost
(C) Incremental development
(D) Information hiding
13. _______ of a system is the structure or
structures of the system which
comprise software elements, the
externally visible properties of these
elements and the relationship amongst
(A) Software construction
(B) Software evolution
(C) Software architecture
(D) Software reuse
14. In function point analysis, the number
of complexity adjustment factors is
(A) 10 (B) 12
(C) 14 (D) 20
15. Regression testing is primarily related to
(A) Functional testing
(B) Development testing
(C) Data flow testing
(D) Maintenance testing
16. How many different truth tables of the
compound propositions are there that
involve the propositions p & q ?
(A) 2 (B) 4
(C) 8 (D) 16
17. A Boolean function F is called self- dual if and only if
1, x
2, … x
n) = F(


2, …

How many Boolean functions of
degree n are self-dual ?
(A) 2n (B) (2)2
(C) (2) n
(D) (2) 2
18. Which of the following statement(s) is
(are) not correct ?
i. The 2’s complement of 0 is 0.
ii. In 2’s complement, the left most
bit cannot be used to express a
iii. For an n-bit word (2’s
complement) which includes the
sign bit, there are 2n–1 positive
integers, 2n+1 negative integers
and one 0 for a total of 2n unique
iv. In 2’s complement the significant
information is contained in the
1’s of positive numbers and 0’s
of the negative numbers.
(A) i & iv (B) i & ii
(C) iii (D) iv
19. The notation !xP(x) denotes the
proposition “there exists a unique x
such that P(x) is true”.
Give the truth values of the following
statements :
I. !xP(x) xP(x)
II. !x P(x) xP(x)
(A) Both I & II are true.
(B) Both I & II are false.
(C) I – false, II – true
(D) I – true, II – false

Here I am giving you one attachment:
Attached Files Available for Download
File Type: pdf UGC NET Computer Science and Application Question Paper.pdf (116.3 KB, 25 views)
Answered By StudyChaCha Member
Reply With Quote

Reply to this Question / Ask Another Question
Your Username: Click here to log in


All times are GMT +6. The time now is 03:19 AM.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, vBulletin Solutions Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8