Search Your Paper

Sunday, January 11, 2015

punjabtechnicaluniversity.blogspot.in



September 2013 Paper 2

Re-conduct of UGC-NET at Delhi / Rachi Centre on 8th September

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

 Answer: B


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

 Answer: D


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


 Answer: B


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

 Answer: A


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

 Answer: D


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

 Answer: C


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

 Answer: C


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

 Answer: C


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

 Answer: D


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 β)
(D)          – (Ig n)/Ig (1 – β)

 Answer: D


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

 Answer: C


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

 Answer: C


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

 Answer: C


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 + λ)

 Answer: D


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.


 Answer: A


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| λ

 Answer: C


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.

 Answer: A


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

 Answer: A


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

 Answer: B


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

 Answer: D


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

 Answer: C


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)          Σki=1 C(ni, 2) edges

 Answer: B


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

 Answer: C

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) xy ((P(x) P(y)) → x = y)
(B)          x P(x) xy ((P(x) P(y)) → x = y)
(C)          x P(x) xy ((P(x) P(y)) → x = y)
(D)          x P(x) xy ((P(x) P(y)) → x = y)

 Answer: C


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

 Answer: A


26.         
Match the following identities/laws to their corresponding name :
List – I   List – II
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
                a              b             c              d
(A)          iii             iv             i               ii
(B)          iv             iii             i               ii
(C)          iv             iii             ii              i
(D)          iii             iv             ii              i

 Answer: A


27.         
In which one of the following, continuous process improvement is done ?
(A)          ISO9001
(B)          RMMM
(C)          CMM
(D)          None of the above

 Answer: C


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

 Answer: C


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

 Answer: A


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

 Answer: B


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)

 Answer: D


32.         
Linked Lists are not suitable for _____.
(A)          Binary Search
(B)          Polynomial Manipulation
(C)          Insertion
(D)          Radix Sort

 Answer: A


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

 Answer: B


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

 Answer: C


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

 Answer: B


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

 Answer: *


37.         
Usage of Preemption and Transaction Rollback prevents ______.
(A)          Unauthorised usage of data file
(B)          Deadlock situation
(C)          Data manipulation
(D)          File preemption

 Answer: B


38.         
The _____ language was originally designed as the Transformation Language for Style Sheet facility.
(A)          XSTL
(B)          XML
(C)          XQuery
(D)          XPath

 Answer: A


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

 Answer: A


40.         
The decision tree classifier is a widely used technique for ______.
(A)          Classification
(B)          Association
(C)          Partition
(D)          Clustering

 Answer: A


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

 Answer: B


42.         
A method to provide secure transmission of email is called ____.
(A)          TLS
(B)          SA
(C)          IPSec
(D)          PGP

 Answer: D


43.         
Thoma’s-write rule is ______.
(A)          Two phase locking protocol
(B)          Timestamp ordering protocol
(C)          One phase locking protocol
(D)          Sliding window protocol

 Answer: B


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.
                a              b             c              d
(A)          iii             i               ii              iv
(B)          iv             i               iii             ii
(C)          iv             iii             i               ii
(D)          iii             iii             ii              i

 Answer: A


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

 Answer: B


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

 Answer: B


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

 Answer: *


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

 Answer: C


49.         
What type of logic circuit is represented by the figure shown below ?

(A)          XOR
(B)          XNOR
(C)          XAND
(D)          XNAND

 Answer: B


50.         
The speed up of a pipeline processing over an equivalent non-pipeline processing is defined by the ratio :
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
(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


Answer: A

0 comments:

Popular

Download All Type Papers Android App

Get it on Google Play

Archive

Powered by Blogger.

Welcome to North India Campus

Google+ Followers

Labels

1st & 2nd Semester BE 1st Semester B.Com 1st Semester BBA 1st Semester BCA (D) 1st Semester Bsc. IT (D) 1st Semester Bsc. IT 1 1ST Semester M.SC IT(D) 1st Semester M.Tech 1ST Semester MBA 1st Semester MCA 1st Semester MCA (D) 2nd Sem B.Com 2nd Sem BB 2nd Sem BBA 2nd Sem BCA 2nd Sem BCA (D) 2nd Sem BSC IT(D) 2nd Sem BSC(IT) 2nd Semester MBA A Foundation Course in Human Values and Professional Ethics Accounting and Financial Management Accounting and Financial Managementm ACCOUNTING FOR MANAGEMENT Adolescence and Family Education B.Ed (2012) Adolescence And Family Education B.Ed (Dec 2013) Adolescence And Family Education B.Ed (Dec 2014) ADVANCE SOFTWARE ENGINEERING Advanced Accounting 2 ADVANCED COMMUNICATION SYSTEMS ADVANCED MATHEMATICS FOR ENGINEERS Aligarh Muslim University Applied Physics 1 B.Ed (Dec 2008) B.Ed (Dec 2009) B.Ed (Dec 2011) B.Ed (Dec 2012) B.Ed (Dec 2013) B.Ed (Dec 2014) B.Ed (June 2008) B.Ed (June 2009) B.Ed (June 2015) BA 1 Syllabus Bachelor in Science Fashion and Technology Basic Accounting Basic Chemistry Basic Electrical Engineering Basic Electronics Basic Mathematics BSC 1 Basoc Accounting BBA 1 BBA 2 BCA Question Papers BCA Syllabus 1 Bridge Course in Mathematics Bsc.IT Business Communication-1 Business Communication-2 Business Communication-I 2 Business Environment 2 Business Laws 1 Business Mathematics Business Organisation and Management Business Statistics 2 C C Programming C Programming Bsc IT 1 C Programming Lecture Videos CADM 1st Semester Communication 2 Communication and Soft Skills Communication Skills Communication Skills 1 Communicative English Computer and Education B.Ed (Dec 2011) Computer and Education B.Ed (Dec 2012) Computer Applications Computer Fundamental Computer Graphics Video Lecture Computer in Education B.Ed (Dec 2008) Computer in Education B.Ed (Dec 2009) Computer In Education B.Ed (Dec 2013) Computer in Education B.Ed (Dec 2014) Computer Mathematical Foundation MCA D Computer Networks 1st Semester Computer Operating System Computer Organization and Assembly Language Computer System Architecture 2 Corporate Accounting Curriculum and Instruction B.Ed (Dec 2009) Curriculum and Instruction B.Ed (Dec 2011) Curriculum and Instruction B.Ed (Dec 2012) Curriculum and Instruction B.Ed (Dec 2013) Curriculum and Instruction B.Ed (Dec 2014) Curriculuman and Instruction B.Ed (Dec 2008) DATA COMMUNICATION NETWORK Data Structure 2 Data Structures 2 data structures 2 BCA D Data Structures Through C 2 Database Management with Microsoft Access Bsc IT 1 Delhi University News Desktop Publishing Tools 2 Digital Circuits and Logic Design 2 Digital Circuits and Logic Design 2 BCA D Digital Electronics 2 Digital Electronics Fundamentals 2 Distance Education B.Ed (Dec 2008) Distance Education B.Ed (Dec 2009) Distance Education B.Ed (Dec 2011) Distance Education B.Ed (Dec 2012) Distance Education B.Ed (Dec 2013) Distance Education B.Ed (Dec 2014) Dot Net Interview Questions & Answers. Education and Evaluation B.Ed (Dec 2009) Education and Society B.Ed (Dec 2008) Education and Society B.Ed (Dec 2009) Education and Society B.Ed (Dec 2011) Education and Society B.Ed (Dec 2012) Education and Society B.Ed (Dec 2013) Education and Society B.Ed (Dec 2014) Education Technology B.Ed (Dec 2009) Educational Evaluation B.Ed (Dec 2008) Educational Evaluation B.Ed (Dec 2011) Educational Evaluation B.Ed (Dec 2012) Educational Evaluation B.Ed (Dec 2013) Educational Evaluation B.Ed (Dec 2014) Educational Technology B.Ed (Dec 2008) Educational Technology B.Ed (Dec 2011) Educational Technology B.Ed (Dec 2012) Educational Technology B.Ed (Dec 2013) ELECTRONICS SYSTEM DESIGN Engineering Drawing and Graphics Engineering Mathematics Engineering Question Paper set 1 Engineering Syllabus English and Communication Skills English and Communication Skills 2 Environmental Science 2 Finaicial Accounting Financial Accounting Financial Management 2 Sem Fundamentals of Information Technology Bsc 1 Guidance and Counseling B.Ed (Dec 2008) Guidance and counseling B.Ed (Dec 2009) Guidance and Counseling B.Ed (Dec 2011) Guidance and Counseling B.Ed (Dec 2012) Guidance and Counseling B.Ed (Dec 2013) HIV and Aids Education B.Ed (Dec 2011) HIV and Aids Education B.Ed (Dec 2012) HIV and Aids Education B.Ed (Dec 2013) Hotel Management and Air Lines Syllabus HP University News Human Resource Management Human Resource Management 2 Information Management Information Technology for Management Intoduction to microprocessor 2 BCA D Introduction of Computers BBA1 Introduction to Computers 2 Introduction to I.T MCA D Introduction to Information Technology Introduction to Information Technology(BCA) Kurukshetra University News Lecture 20 Clipping -- Lines And Polygons Macro Economics 2 Management Syllabus Managerial Economics Marketing Management 2 Master Of Technology M-Tech Syllabus MBA Papers MCA Notes MCA Question Papers Mercantile Law 2 Metal Cutting Question Paper Metal Forming Question Paper Micro Economics Network Security NEURAL NETWORKS & FUZZY LOGIC Object Oriented Programming in C++ Object Oriented Programming in Cpp OOP CPP 2 Operating system (BCA) Operating System Bsc IT 1 Organisational Behaviour Organization Behaviour 2 Other Universities Others Panjab University News PCM 2 BCA D PGDCA Pharmacy Syllabus Principles and Practices of Management principles of management 2 Production and Operations Management 2 Programming in C Programming in C MCA D Programming Logic Development with C Psychology of Learning and Development B.Ed (Dec 2013) Psychology of Learning and Development B.Ed (Dec 2008) Psychology of Learning and Development B.Ed (Dec 2009) Psychology of Learning and Development B.Ed (Dec 2011) Psychology of Learning and Development B.Ed (Dec 2012) PTU Affiliated Colleges of Integerated College PTU Affiliated Colleges of Management College PTU Affiliated Colleges of Architecture PTU Affiliated Colleges of Engineering PTU Affiliated Colleges of Pharmacy College PTU Forms Download PTU News and Events Quantitative Techniques RDBMS 2 RDBMS-I 2 Relational Database Management System Research Methodology 2 SAD 2 BCA D Syllabus of Computer Applications Syllabus of Journalism and Mass Communication Syllabus of Medical Laboratory Science System Analysis and Design System Analysis and Design 2 System Analysis and Design MCA D Teacher and School B.Ed (Dec 2008) Teacher and School B.Ed (Dec 2009) Teacher and School B.Ed (Dec 2011) Teacher and School B.Ed (Dec 2012) Teacher and School B.Ed (Dec 2013) Teacher of English B.Ed (Dec 2009) Teaching of English B.Ed (Dec 2008) Teaching of English B.Ed (Dec 2011) Teaching of English B.Ed (Dec 2012) Teaching of English B.Ed (Dec 2013) Teaching of Mathematics B.Ed (Dec 2009) Teaching of Mathematics B.Ed (Dec 2011) Teaching of Mathematics B.Ed (Dec 2012) Teaching of Mathematics B.Ed (Dec 2013) Teaching of Science B.Ed (Dec 2008) Teaching of Science B.Ed (Dec 2009) Teaching of Science B.Ed (Dec 2011) Teaching of Science B.Ed (Dec 2012) Teaching of Science B.Ed (Dec 2013) Teaching of Social Studies B.Ed (Dec 2008) Teaching of Social Studies B.Ed (Dec 2011) Teaching of Social Studies B.Ed (Dec 2012) Teaching of Social Studiess B.Ed (Dec 2013) Teaching of Social Study B.Ed (Dec 2009) Technical Communication UGC NET Computer Science Question Paper Uttarakhand Open University Video Lecture Web Technologies 1st Semester Web Technologies 2 Welding Technology Question Paper Workshop on IT and E-Commerce 2