Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-sep2013-paper3
2
votes
2
answers
61
UGC NET CSE | September 2013 | Part 3 | Question: 10
Which of the following is an bit rate of an 8-PSK signal having 2500 Hz bandwidth? 2500 bps 5000 bps 7500 bps 20000 bps
Which of the following is an bit rate of an 8-PSK signal having 2500 Hz bandwidth?2500 bps5000 bps7500 bps20000 bps
go_editor
3.7k
views
go_editor
asked
Jul 22, 2016
Computer Networks
ugcnetcse-sep2013-paper3
computer-networks
modulation
+
–
1
votes
4
answers
62
UGC NET CSE | September 2013 | Part 3 | Question: 9
Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged? TCP header length Window size Acknowledgement number Urgent pointer
Which of the following field of the TCP header tells how many bytes may be sent starting at the byte acknowledged?TCP header lengthWindow sizeAcknowledgement numberUrgent...
go_editor
2.5k
views
go_editor
asked
Jul 22, 2016
Computer Networks
ugcnetcse-sep2013-paper3
computer-networks
tcp
+
–
2
votes
2
answers
63
UGC NET CSE | September 2013 | Part 3 | Question: 8
Which of the following is the size of Network bits and Host bits of Class A of IP address? Network bits 7, Host bits 24 Network bits 14, Host bits 16 Network bits 15, Host bits 16 Network bits 16, Host bits 16
Which of the following is the size of Network bits and Host bits of Class A of IP address?Network bits 7, Host bits 24Network bits 14, Host bits 16Network bits 15, Host b...
go_editor
8.5k
views
go_editor
asked
Jul 22, 2016
Computer Networks
ugcnetcse-sep2013-paper3
computer-networks
ip-addressing
+
–
2
votes
1
answer
64
UGC NET CSE | September 2013 | Part 3 | Question: 7
Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead of 48 bits per frame. Using synchronous transmission, the total overhead time is 0.05 second 0.1 second 0.2 second 2.0 seconds
Suppose a file of 10,000 characters is to be sent over a line at 2400 bps. Assume that the data is sent in frames. Each frame consists of 1000 characters and an overhead ...
go_editor
3.9k
views
go_editor
asked
Jul 22, 2016
Computer Networks
ugcnetcse-sep2013-paper3
computer-networks
data-link-layer
+
–
1
votes
1
answer
65
UGC NET CSE | September 2013 | Part 3 | Question: 6
Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the difference one applies a forward search that can ... can reduce the difference a bidirectional search that can reduce the difference an operator that can reduce the difference
Means-Ends Analysis process centres around the detection of difference between the current state and the goal state. Once such a difference is found, then to reduce the d...
go_editor
3.6k
views
go_editor
asked
Jul 22, 2016
Artificial Intelligence
ugcnetcse-sep2013-paper3
artificial-intelligence
means-end
analysis
+
–
1
votes
1
answer
66
UGC NET CSE | September 2013 | Part 3 | Question: 5
The Blocks World Problem in Artificial Intelligence is normally discussed to explain a Search technique Planning system Constraint satisfaction system Knowledge base system
The Blocks World Problem in Artificial Intelligence is normally discussed to explain aSearch techniquePlanning systemConstraint satisfaction systemKnowledge base system
go_editor
4.3k
views
go_editor
asked
Jul 22, 2016
Artificial Intelligence
ugcnetcse-sep2013-paper3
artificial-intelligence
blocks-world-problem
+
–
3
votes
1
answer
67
UGC NET CSE | September 2013 | Part 3 | Question: 4
Which of the following is not a part of an expert system shell? Knowledge base Interference engine Explanation facility None of the above
Which of the following is not a part of an expert system shell?Knowledge baseInterference engineExplanation facilityNone of the above
go_editor
4.2k
views
go_editor
asked
Jul 22, 2016
Others
ugcnetcse-sep2013-paper3
unix
linux
shell
+
–
1
votes
2
answers
68
UGC NET CSE | September 2013 | Part 3 | Question: 3
Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problem Which of the following statements is true? No two alphabets can have the same numeric value Any two alphabets can have the same numeric value D=0 D=1 I and III I and IV II and III II and IV
Assume that each alphabet can have a value between 0 to 9 in a cryptoarithmetic problemWhich of the following statements is true?No two alphabets can have the same numeri...
go_editor
3.0k
views
go_editor
asked
Jul 22, 2016
Others
ugcnetcse-sep2013-paper3
cryptography
crypt-arithmetic
+
–
1
votes
1
answer
69
UGC NET CSE | September 2013 | Part 3 | Question: 2
$\alpha - \beta$ cutoffs are applied to Depth first search Best first search Minimax search Breadth first search
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search
go_editor
1.7k
views
go_editor
asked
Jul 22, 2016
Algorithms
ugcnetcse-sep2013-paper3
algorithms
graph-search
tree-search-algorithm
+
–
2
votes
1
answer
70
UGC NET CSE | June 2012 | Part 3 | Question: 70, UGCNET-Sep2013-III: 52
Assume that we have constructor functions for both base class and derived class. Now consider the declaration in main() Base *P=New Derived; In what sequence will the constructor be called? Derived class ... by Derived class constructor Base class constructor will not be called Derived class constructor will not be called
Assume that we have constructor functions for both base class and derived class. Now consider the declaration inmain()Base *P=New Derived;In what sequence will the constr...
go_editor
2.7k
views
go_editor
asked
Jul 8, 2016
Object Oriented Programming
ugcnetcse-june2012-paper3
ugcnetcse-sep2013-paper3
object-oriented-programming
java
programming-in-c
+
–
0
votes
1
answer
71
UGC NET CSE | September 2013 | Part 3 | Question: 40
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is $\text{O(n)}$ $\text{O(n Ig n)}$ $\text{O(n$^2$)}$ None of the above
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is$\text{O(n)}$$\text{O(n Ig n)}$$\text{O(n$^2$)}$None...
im.raj
1.9k
views
im.raj
asked
Jun 16, 2016
Algorithms
algorithms
time-complexity
ugcnetcse-sep2013-paper3
+
–
1
votes
0
answers
72
UGC NET CSE | September 2013 | Part 3 | Question: 67
The tracing model in Prolog describes program execution in terms of certain events. These events are call and exit call and fail call, exit and redo call, exit, redo and fail
The tracing model in Prolog describes program execution in terms of certain events. These events arecall and exitcall and failcall, exit and redocall, exit, redo and fail...
Sanjay Sharma
835
views
Sanjay Sharma
asked
Jun 1, 2016
Mathematical Logic
ugcnetcse-sep2013-paper3
+
–
0
votes
1
answer
73
UGC NET CSE | September 2013 | Part 3 | Question: 38
How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year? At least 23 At least 183 At least 366 At least 730
How many people must there be in a room before there is a 50% chance that two of them were born on the same day of the year?At least 23At least 183At least 366At least 73...
Sanjay Sharma
2.2k
views
Sanjay Sharma
asked
May 4, 2016
Probability
probability
ugcnetcse-sep2013-paper3
+
–
0
votes
1
answer
74
UGC NET CSE | September 2013 | Part 3 | Question: 54
A program contains the following declarations and initial assignments. int i=8, j=5; double x =0.005, y=-0.1; char c=’c’, d=’d’; Determine the value of the following expressions which involve the use of library functions: abs(1-2*j); log(exp(x)); toupper(d) 2; 0.005; D 1; 0.005; D 2; 0.005; E 1; 0.005; e
A program contains the following declarations and initial assignments.int i=8, j=5;double x =0.005, y=-0.1;char c=’c’, d=’d’;Determine the value o...
Sanjay Sharma
1.5k
views
Sanjay Sharma
asked
May 3, 2016
Programming in C
ugcnetcse-sep2013-paper3
programming-in-c
+
–
1
votes
1
answer
75
UGC NET CSE | September 2013 | Part 3 | Question: 1
Which of the following is a correct predicate logic statement for Every Natural number has one successor ? $\forall x \exists y (succ(x,y) \wedge (\exists z\; succ(x, z) \Rightarrow equal (y,z)))$ ... $\forall x \exists y (succ(x,y))$
Which of the following is a correct predicate logic statement for “Every Natural number has one successor”?$\forall x \exists y (succ(x,y) \wedge (\exists z\; succ(x,...
Sanjay Sharma
2.4k
views
Sanjay Sharma
asked
Apr 19, 2016
Mathematical Logic
first-order-logic
ugcnetcse-sep2013-paper3
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register