NTA-NET (Based on NTA-UGC) Computer Science (Paper-II): Questions 683 - 687 of 2012

Access detailed explanations (illustrated with images and videos) to 2012 questions. Access all new questions we will add tracking exam-pattern and syllabus changes. Subscription can be renewed yearly absolutely FREE! View Sample Explanation or View Features.

Rs. 550.00 or

How to register?

Question number: 683

» Neural Networks and AI » Perceptron Model, Linear Separability and XOR Problem

Edit

Appeared in Year: 2013

MCQ▾

Question

In a single perceptron, the updation rule of weight vector is given by (September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 684

» Microprocessor » Hardwired and Micro Programmed Processor Design

Edit

Appeared in Year: 2013

MCQ▾

Question

A given memory chip has 14 address pins and 8 data pins. It has the following number of locations. (September Paper-III)

Choices

Choice (4) Response

a.

b.

c.

d.

Question number: 685

» Computer Graphics » Animation

Edit

Appeared in Year: 2013

MCQ▾

Question

An actor in an animation is a small program invoked ________ per frame to determine the characteristics of some object in the animation. (June Paper III)

Choices

Choice (4) Response

a.

once

b.

twice

c.

30 times

d.

60 times

Question number: 686

» Relational Database Design and SQL » Fundamentals of Database » Keys

Edit

Appeared in Year: 2013

MCQ▾

Question

Data Integrity control uses ________ (December Paper-II)

Choices

Choice (4) Response

a.

Upper and lower limits on numeric data.

b.

Passwords to prohibit unauthorised access to files.

c.

Data dictionary to keep the data

d.

Data dictionary to find last access of data

Question number: 687

» Analysis and Design of Algorithms » Introduction, Types, & Design of Algorithms

Edit

Appeared in Year: 2013

MCQ▾

Question

Which one of the following is not an informed search technique? (June Paper III)

Choices

Choice (4) Response

a.

Hill climbing search

b.

Best first search

c.

A * search

d.

Depth first search

Developed by: