June 2006
----------------------------------------------------------------------------------------------------------
Description:
UGC NET Solved Sample Question Paper, ugc net solved question papers 2006, 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 2006, 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 2006, net solved papers free download, June 2006 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
|
B
|
C
|
error
|
B
|
C
|
D
|
C
|
D
|
||
11 to20
|
D
|
C
|
C
|
C
|
C
|
C
|
A
|
|||
21 to30
|
B
|
A
|
B
|
A
|
A
|
B
|
C
|
|||
31 to40
|
B
|
A
|
A
|
B
|
B
|
B
|
B
|
C
|
||
41 to50
|
A
|
B
|
B
|
A
|
----------------------------------------------------------------------------------------------------------
Description:
UGC NET Solved Sample Question Paper, ugc net solved question papers 2006, 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 2006, 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 2006, net solved papers free download, June 2006 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
-------------------------------------------------------------------------------------------------------------------------------------------------------------------
Hello Sir,
ReplyDeleteQ 10. Upto how many variables, can the Karnaugh map be used ?
here i found answer as option D that is. 6
Book name-Modern Digital Electronics 4E
By Jain
page number 225.
If this answer is correct then please update answer key.
yes .. you are right.. i found 5 as answer in some books...
Deletei think, karnaugh map can be used for 6 variables also...
thanks. i will updated the answer key.
Simplification of Logic Expressions using Karnaugh Map (page 503 sec11.8)
DeleteUsing a K-map, expressions with two to four variables can be easily minimized. Expressions with five to six variables are difficult but achievable, and expressions with seven or more variables are extremely difficult (but, not impossible) to minimize using a K-map.
-Elements of Discrete Mathematics, A Computer Oriented Approach; 3rd Edn -by C L Liu, D P Mohapatra
Tata Mc-Graw Hill Publications,
FOR OLD SOLVED PAPER OF CSE .PLZ VISIT WWW.DOTCOMSHARE.BLOGSPOT.IN
ReplyDeletePAPER1 IS ALSO THERE.............
DeleteDoing splendid job Bhanu.
ReplyDelete