December 2009 Key
Explanation:
1. If she is my friend and you are her friend, then we are friends. Given this,
the friend relationship in this context is : (D) None
2. Circle has ------
(A) No vertices
3. If in an error detection and correction code a message M : “You are good students” is
stored as M' : Youare areyou aregood goodare goodstudents studentsgood. What is the
space required to store M' in general ? (assume that ‘n’ is the length of M)
(A) 2n (B) 3n (C) 4n (D) less than 4n
4. P : “Program is a step by step execution of the instructions”. Given P, which of the
following is true ?
(A) Program is a subset of an instruction set.
(B) Program is a sequence of a subset of an instruction set.
(C) Program is a partially ordered set of an instruction set.
(D) All of the above
5. In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production
rules are given below :
R1 : U ® IU
R2 : M.x ® M.x.x where
. .
. is string concatenation operator. Given this, which of the
following holds for
(i) MIUIUIUIUIU (ii) MIUIUIUIUIUIUIUIU
(A) Either (i) or (ii) but not both of these are valid words.
(B) Both (i) and (ii) are valid words and they take identical number of
transformations for the production.
(C) Both (i) and (ii) are valid words but they involve different number of
transformations in the production.
(D) None of these
6. The simplified form of Boolean Expression (X+y+Xy) (X+Z)
(C) X+yZ)
7. Identify the logic function performed by the circuit shown
(A) exclusive OR (B) exclusive NOR
(C) NAND (D) NOR
8.The highest noise margin is offered by :
(B) TTL
9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is
(A) 150 (B) 241 (C) 142 (D) 101011110
10.How many 1's are present in binary representation of
3*512+7*64+5*8+3
(B) 9
11.Recursive functions are executed in:
(B) LIFO
12. What would be the output of the following program, if run from the command line as "myprog 1 2 3"?
main(int argc,char *argv[])
int i;
i=argv[1]+argv[2]+argv[3];
printf("%d",i);
}
(C) Error
13. A ------ is a special method used to initialize the instance variable of a class:
(C) Constructor
14. Encapsulation is
(A) Dynamic binding
(B) A mechanism to associate the code and data.
(C) Data abstraction
(D) Creating new class
15. Which of the statements are true?
(D)
16. The ER model is expressed in terms of :
(B)
17. Specialization is ----------- process.
(A) top down
18. Match the following :
(1) Determinants (a) No attribute can be added
(2) Candidate key (b) Uniquely identified a row
(3) Non-redundancy (c) A constraint between two attribute
(4) Functional dependency (d) Group of attributes on the left hand side of
arrow of function dependency.
(A) 1 – d, 2 – b, 3 – a, 4 – c
(B) 2 – d, 3 – a, 1 – b, 4 – c
(C) 4 – a, 3 – b, 2 – c, 1 – d
(D) 3 – a, 4 – b, 1 – c, 2 – d
19. A function that has no partial functional dependencies is in ------- form :
(B) 2NF
20. Which of the following statement is wrong ?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
(A) I, II, II (B) II, III, IV (C) III, IV, V (D) II, IV, V
21. If no. of leaves in a strictly binary tree is an odd no., then what can you say with full conviction about total no.of nodes in the tree.
(A) Its an odd number (there are 2n-1 nodes)
22. The number of edges in a complete graph is:
(B) n(n-1)/2
23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive
in and park right behind the car in front of them, one behind another. A car can’t leave
until all the cars in front of it have left. Is the parking lot more like
(C) queue
24. With regard to linked list, which of the following statement is false ?
(A) An algorithm to search for an element in a singly linked list requires 0(n)
operations in the worst case.
(B) An algorithm for deleting the first element in a singly linked list requires 0(n)
operations in the worst case.
(C) An algorithm for finding the maximum value in a circular linked list requires 0(n)
operations.
(D) An algorithm for deleting the middle node of a circular linked list requires 0(n)
operations.
25. A hash function f defined as f(key) = key mod 7, with linear probing used to resolve
collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6.
What will be the location of 11 ?
(A) 3 (B) 4 (C) 5 (D) 6
26. Device on one network can communicate with devices on another network via a
(D) Gateway
27. What is the maximum window size in sliding window protocol used in a computer
network ?
(A) 4
28. Which of the following are Data Link Layer standard ?
1. Ethernet 2. HSSI 3. Frame Relay
4. 10 – Base T 5. Token Ring
(C) 1,3,4,5
29. In case of Bus/Tree topology signal balancing issue is overcome by
(C) Segmentation
30. Match the following :
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
(A) 1-d,2-a,3-b,4-c
30. Match the following :
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
Codes :
(A) i – d, ii – a, iii – b, iv – c (B) i – a, ii – d, iii – b, iv – c
(C) i – d, ii – d, iii – c, iv – b (D) i – d, ii – c, iii – b, iv – a
31. In an absolute loading scheme which loader function is accomplished by assembler ?
(A) Reallocation (Allocation and linking are done by a programmer)
32. Which of the following grammar is LR (1) ?
(D) Both A and B
33. A shift-reduce parser carries out the actions specified within braces immediately after
reducing with the corresponding rule of the grammar.
S → x x W [ print “1”]
S → y [print “2”]
W → S2[print “3”], what is the translation of “x x x x y z z” ?
(C) 2 3 1 3 1
34. Contex-free Grammar (CFG) can be recognized by
(D) Both B and C
35. Synthesized attribute can be easily simulated by a
(C) LR Grammer
36. In the process management Round-robin method is essentially the pre-emptive version
of _________
(B) FIFO
37. A page fault
(B) is an access to page not currently in memory
38. A semaphore count of negative n means (s = – n) that the queue contains ________
waiting processes.
(B) n
39. A program is located in the smallest available hole in the memory is _________
(A) Best fit
40. The Unix command used to find out the number of characters in a file is
(B) wc
41. Software Engineering is a discipline that integrates _________ for the development of
computer software.
(D) ALL
42. Any error whose cause cannot be identified anywhere within the software system is
called ________
(A) Internal error (B) External error
(C) Inherent error (D) Logic error
43. Recorded software attributes can be used in the following endeavours :
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where
Codes :
(A) (i) (ii) (iv)
(B) (ii) (iii) (iv)
(C) (i) (ii) (iii)
(D) (i) (ii) (iii) (iv)
44. Black Box testing is done
(A)
45. The name of the transaction file shall be provided by the operator and the file that
contains the edited transactions ready for execution shall be called
(C) opt.exe
46. The single stage network is also called
(C) Recirculating Network
47. Analysis of large database to retrieve information is called
(B) Olap
48. Which technology is sometime referred to as wireless cable ?
(A) MMDS
49. Another name of IEEE 802.11 a is ____________
(C) Wi-fi
50. The unlicensed National Information Infrastructure band operates at the _________
frequency
(B) 5 Ghz
----------------------------------------------------------------------------------------------------------
Description:
UGC NET Solved Sample Question Paper, ugc net solved question papers 2008, ugc net guide, ugc net papers, ugc net, ugc india, ugc payscale, ugc 6th pay comission, ugc pay revission, ugc syllabus, ugc exam, ugc result, ugc pay calculator, ugc india, ugc india website, ugc india new pay scale, ugc education, ugc net result, ugc net 2009, ugc net 2008, ugc net result, ugc net question papers, ugc net december 2008, ugc net june 2008 result, ugc net application form, ugc net result, ugc net application, ugc net in computer science, ugc net in india,
tags:
net solved papers computer science, net computer science question paper , ugc net computer science solved papers, free net solved papers computer science, net computer science study material, net computer science books, net computer science syllabus, net solved papers for computer science, net solved papers 2011, net solved papers free download, December 2009 solved paper,apset 2012, apset previous question papers, apset computer science question papers, previous question papers,apset previous question papers,apset previous question papers 2012, apset previous question papers 2011, previous question papers of apset, apset syllabus, apset syllabus 2012, apset syllabus 2012 paper 1, syllabus for apset 2012, apset computer science model papers, apset computer science material, apset syllabus for computer science
-------------------------------------------------------------------------------------------------------------------------------------------------------------------
1
|
2
|
3
|
4
|
5
|
6
|
7
|
8
|
9
|
10
|
|
1 to 10
|
D
|
A
|
D
|
C
|
C
|
B
|
B
|
C
|
B
|
|
11 to20
|
B
|
C
|
C
|
B
|
D
|
D
|
A
|
A
|
B
|
C
|
21 to30
|
A
|
B
|
C
|
B
|
C
|
D
|
A
|
C
|
C
|
A
|
31 to40
|
A
|
D
|
C
|
D
|
C
|
B
|
B
|
B
|
A
|
B
|
41 to50
|
D
|
B
|
C
|
A
|
C
|
C
|
B
|
A
|
C
|
B
|
Explanation:
1. If she is my friend and you are her friend, then we are friends. Given this,
the friend relationship in this context is : (D) None
2. Circle has ------
(A) No vertices
3. If in an error detection and correction code a message M : “You are good students” is
stored as M' : Youare areyou aregood goodare goodstudents studentsgood. What is the
space required to store M' in general ? (assume that ‘n’ is the length of M)
(A) 2n (B) 3n (C) 4n (D) less than 4n
4. P : “Program is a step by step execution of the instructions”. Given P, which of the
following is true ?
(A) Program is a subset of an instruction set.
(B) Program is a sequence of a subset of an instruction set.
(C) Program is a partially ordered set of an instruction set.
(D) All of the above
5. In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production
rules are given below :
R1 : U ® IU
R2 : M.x ® M.x.x where
. .
. is string concatenation operator. Given this, which of the
following holds for
(i) MIUIUIUIUIU (ii) MIUIUIUIUIUIUIUIU
(A) Either (i) or (ii) but not both of these are valid words.
(B) Both (i) and (ii) are valid words and they take identical number of
transformations for the production.
(C) Both (i) and (ii) are valid words but they involve different number of
transformations in the production.
(D) None of these
6. The simplified form of Boolean Expression (X+y+Xy) (X+Z)
(C) X+yZ)
7. Identify the logic function performed by the circuit shown
(A) exclusive OR (B) exclusive NOR
(C) NAND (D) NOR
8.The highest noise margin is offered by :
(B) TTL
9. The answer of the operation (10111)2 * (1110)2 in hex equivalence is
(A) 150 (B) 241 (C) 142 (D) 101011110
10.How many 1's are present in binary representation of
3*512+7*64+5*8+3
(B) 9
11.Recursive functions are executed in:
(B) LIFO
12. What would be the output of the following program, if run from the command line as "myprog 1 2 3"?
main(int argc,char *argv[])
int i;
i=argv[1]+argv[2]+argv[3];
printf("%d",i);
}
(C) Error
13. A ------ is a special method used to initialize the instance variable of a class:
(C) Constructor
14. Encapsulation is
(A) Dynamic binding
(B) A mechanism to associate the code and data.
(C) Data abstraction
(D) Creating new class
15. Which of the statements are true?
(D)
16. The ER model is expressed in terms of :
(B)
17. Specialization is ----------- process.
(A) top down
18. Match the following :
(1) Determinants (a) No attribute can be added
(2) Candidate key (b) Uniquely identified a row
(3) Non-redundancy (c) A constraint between two attribute
(4) Functional dependency (d) Group of attributes on the left hand side of
arrow of function dependency.
(A) 1 – d, 2 – b, 3 – a, 4 – c
(B) 2 – d, 3 – a, 1 – b, 4 – c
(C) 4 – a, 3 – b, 2 – c, 1 – d
(D) 3 – a, 4 – b, 1 – c, 2 – d
19. A function that has no partial functional dependencies is in ------- form :
(B) 2NF
20. Which of the following statement is wrong ?
I. 2-phase locking protocol suffer from dead lock.
II. Time stamp protocol suffer from more aborts.
III. A block hole in a DFD is a data store with only inbound flows.
IV. Multivalued dependency among attribute is checked at 3 NF level.
V. An entity-relationship diagram is a tool to represent event model.
(A) I, II, II (B) II, III, IV (C) III, IV, V (D) II, IV, V
21. If no. of leaves in a strictly binary tree is an odd no., then what can you say with full conviction about total no.of nodes in the tree.
(A) Its an odd number (there are 2n-1 nodes)
22. The number of edges in a complete graph is:
(B) n(n-1)/2
23. At a hill station, the parking lot is one long drive way snaking up a hill side. Cars drive
in and park right behind the car in front of them, one behind another. A car can’t leave
until all the cars in front of it have left. Is the parking lot more like
(C) queue
24. With regard to linked list, which of the following statement is false ?
(A) An algorithm to search for an element in a singly linked list requires 0(n)
operations in the worst case.
(B) An algorithm for deleting the first element in a singly linked list requires 0(n)
operations in the worst case.
(C) An algorithm for finding the maximum value in a circular linked list requires 0(n)
operations.
(D) An algorithm for deleting the middle node of a circular linked list requires 0(n)
operations.
25. A hash function f defined as f(key) = key mod 7, with linear probing used to resolve
collisions. Insert the keys 37, 38, 72, 48, 98 and 11 into the table indexed from 0 to 6.
What will be the location of 11 ?
(A) 3 (B) 4 (C) 5 (D) 6
26. Device on one network can communicate with devices on another network via a
(D) Gateway
27. What is the maximum window size in sliding window protocol used in a computer
network ?
(A) 4
28. Which of the following are Data Link Layer standard ?
1. Ethernet 2. HSSI 3. Frame Relay
4. 10 – Base T 5. Token Ring
(C) 1,3,4,5
29. In case of Bus/Tree topology signal balancing issue is overcome by
(C) Segmentation
30. Match the following :
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
(A) 1-d,2-a,3-b,4-c
30. Match the following :
(i) Ethernet (a) Deterministic
(ii) Token Ring (b) Utilize the full wire speed
(iii) Cut-through switch (c) Prevent looping
(iv) Spanning tree (d) Checking valid address
Codes :
(A) i – d, ii – a, iii – b, iv – c (B) i – a, ii – d, iii – b, iv – c
(C) i – d, ii – d, iii – c, iv – b (D) i – d, ii – c, iii – b, iv – a
31. In an absolute loading scheme which loader function is accomplished by assembler ?
(A) Reallocation (Allocation and linking are done by a programmer)
32. Which of the following grammar is LR (1) ?
(D) Both A and B
33. A shift-reduce parser carries out the actions specified within braces immediately after
reducing with the corresponding rule of the grammar.
S → x x W [ print “1”]
S → y [print “2”]
W → S2[print “3”], what is the translation of “x x x x y z z” ?
(C) 2 3 1 3 1
34. Contex-free Grammar (CFG) can be recognized by
(D) Both B and C
35. Synthesized attribute can be easily simulated by a
(C) LR Grammer
36. In the process management Round-robin method is essentially the pre-emptive version
of _________
(B) FIFO
37. A page fault
(B) is an access to page not currently in memory
38. A semaphore count of negative n means (s = – n) that the queue contains ________
waiting processes.
(B) n
39. A program is located in the smallest available hole in the memory is _________
(A) Best fit
40. The Unix command used to find out the number of characters in a file is
(B) wc
41. Software Engineering is a discipline that integrates _________ for the development of
computer software.
(D) ALL
42. Any error whose cause cannot be identified anywhere within the software system is
called ________
(A) Internal error (B) External error
(C) Inherent error (D) Logic error
43. Recorded software attributes can be used in the following endeavours :
(i) Cost and schedule estimates.
(ii) Software product reliability predictions.
(iii) Managing the development process.
(iv) No where
Codes :
(A) (i) (ii) (iv)
(B) (ii) (iii) (iv)
(C) (i) (ii) (iii)
(D) (i) (ii) (iii) (iv)
44. Black Box testing is done
(A)
45. The name of the transaction file shall be provided by the operator and the file that
contains the edited transactions ready for execution shall be called
(C) opt.exe
46. The single stage network is also called
(C) Recirculating Network
47. Analysis of large database to retrieve information is called
(B) Olap
48. Which technology is sometime referred to as wireless cable ?
(A) MMDS
49. Another name of IEEE 802.11 a is ____________
(C) Wi-fi
50. The unlicensed National Information Infrastructure band operates at the _________
frequency
(B) 5 Ghz
----------------------------------------------------------------------------------------------------------
Description:
UGC NET Solved Sample Question Paper, ugc net solved question papers 2008, ugc net guide, ugc net papers, ugc net, ugc india, ugc payscale, ugc 6th pay comission, ugc pay revission, ugc syllabus, ugc exam, ugc result, ugc pay calculator, ugc india, ugc india website, ugc india new pay scale, ugc education, ugc net result, ugc net 2009, ugc net 2008, ugc net result, ugc net question papers, ugc net december 2008, ugc net june 2008 result, ugc net application form, ugc net result, ugc net application, ugc net in computer science, ugc net in india,
tags:
net solved papers computer science, net computer science question paper , ugc net computer science solved papers, free net solved papers computer science, net computer science study material, net computer science books, net computer science syllabus, net solved papers for computer science, net solved papers 2011, net solved papers free download, December 2009 solved paper,apset 2012, apset previous question papers, apset computer science question papers, previous question papers,apset previous question papers,apset previous question papers 2012, apset previous question papers 2011, previous question papers of apset, apset syllabus, apset syllabus 2012, apset syllabus 2012 paper 1, syllabus for apset 2012, apset computer science model papers, apset computer science material, apset syllabus for computer science
-------------------------------------------------------------------------------------------------------------------------------------------------------------------
Why A is the Answer of 44?
ReplyDeleteits should be None of the Above that is D
Hi virk,
DeleteI read somewhere in software engineering textbook by pressman.. Let me check tomorrow in my library and get back to you..
Hi virk,
DeleteI read somewhere in software engineering textbook by pressman.. Let me check tomorrow in my library and get back to you..