Computer science NET Question paper

[Diwaker]

Can any person send me model question papers (2nd & 3rd) of computer science NET, my email_id diwaker.twr@gmail[/color].com

[priyanka1647]

here i am sending u the iii paper of net december 2008. me mail id is priyankash79@gmail.com. anybody who has theory of computation descriptive questions and any idea how to crack ugc-net , please tell me? which book to refer for theory of computation section?

Paper-III
Ø Section I 5x5 = 25 marks; 30 words each
a university has several departments. Every department runs several programs. They conduct exams on these programs at different times during the year and date and timings of these exams are also different. Design a system that will take care of automatic scheduling of exams and the management tasks during a special period of the year.
1) Draw ER diagram
2) UML Diagram
3) DFD up to second level
4) Design the database with data dictionary
5) Comment on the security concerns and information reporting

Ø Section II 5x15 = 75 marks; 30 words each

6) what are the steps to create frame based animation. Briefly explain the steps.
7) Write an 8085 assembly language program to find the largest of three numbers.
8) URN protocol, 200 users, 40, 40
9) How will you evaluate x^29 using divide and conquer? [Hint: x^29 = x^14*x^15]
10) Functions of data link layer. Compare OSI data link layer with IEEE specification for data link layer.
11) Compare contiguous memory allocation with paging and segmentation systems on the ground of 1) External fragmentation 2) Internal fragmentation 3) Capability to share code among various processes.
12) What memory allocation scheme is used by UNIX? How is performance maintained by UNIX using only a particular type of memory allocation scheme?
13) Are <> all and not in identical in SQL? In either case justify with examples.
14) Why is hill climbing only used in AI?
15) What is partitioning in Oracle? What are its benefits or uses?
16) With reference to the average case describe the linear search algorithm.
17) What is XML parser? How is data extracted from a XML file and supplied to an application?
18) What is coupling? Discuss three of its different types. [Software engineering]
19) What is prototyping? What are its advantages and disadvantages?
20) What are the different ways in which arguments are passed to functions in procedural programming?



Ø Section III 12x5 = 60 marks; 200 words each

Elective-I: Theory of Computer Science

21) Show that a finite state automaton cannot accept the language palindrome.
22) Proof question to show that a given grammar is ambiguous.
23) Design a TM for the language 0^n 1^n when n>=1.
24) Question Based on Chomsky Languages.
25) Problem On Push down Automata.

Elective-III: Operation Research

21) Ford Fulkerson's Maximum Flow Problem.
22) Ellipsoid Method and Karmekars Method for LPP and Complexity Comparisons.
23) Dijkstra's Shortest Path Problem.
24) Matroids.
25) Kuhn Tucker Condition and problem on it.

Elective-IV: Neural Networks

21) Distinguish between randomness and fuzziness.
22) Show that EX-OR switching function is not linearly separable.
23) Explain the following – “Fuzzy system are shallow but fully interactive
24) State and explain differential Hebbian Learning Law.
25) What are fuzzy cognitive maps? What are its uses?

Elective-V: Windows and UNIX

UNIX
-----------
21) Structure of UNIX.
22) Shell program to print the login names of users who are logged in for the last five mins and who are logged out in the past five if the no. of users currently logged in is > 50.
23) Explain the data type of processes and how it will affect it exit, fork command

Windows
-----------
24) Explain following:
· WM_Command
· WM_TIMER
· SCROLL BAR
· Status Bar
· Multithreading.
Ø Section IV 40x1 = 40 marks; 1000 words.

26 a) Describe a PDA with an example drawing a neat diagram.
b) Show that the capability of a PDA lies between that of a TM and a finite state machine.
26 a) Windows 2000 NT architecture with neat diagram.
b) Windows XP multithreading and architecture.
26 a) The Question Were From Neural Network and Numerical Associated with it, Windows NT architecture, Huffman Coding, PDA/ Turing Machine, Image compression Techniques etc..

[singhnisha15]

Hi Priyanka,
Thanks a lot for the questions. I have some of the TOC question of June 2009 as I appeared for it. Besides looking at this inconsistant pattern of the questions I really dont have any idea which book to refer for this elective?

1) Theory of Computation

1) Show that grammer S->aSb | a is LR1
2) Rev(x), show that it is a primitive recursive function
3) 0^n | 0^n show that it is not a finite state language
4) Distiguish between Moore and Melay machine
5) Write an algorithm for converting tranitian graph into RE with an example.

[taruna_kapoor]

hi frnds,
hav you found the algo for x^29 divide and conquer?
reply soon..