Compiler design

1.Recursive descent parsing is an example of 
a)top-down parsing       b)bottom-up        
c)predictive                   d)none

2.Which of the following is the most powerful parser
a)SLR                 b)LALR
c)Canonical LR   d)operator-precedence

3.Choose the incorrect statement
a)LL(k) grammar has to be CFG.
b)LL(k) grammar has to be unambiguous
c)There are LL(k) grammars that are not context-free
d)LL(k) grammars can't have left recursive non-terminals.

4.The grammar E -->E+E| E*E | a,is
a)ambiguous             c)ambiguous or not depends on the given sentence.
b)unambiguous          d)none

Answers:
1.a
2.c
3.c
4.a

Useful e-Books you can refer

 e-books provided by techvyom.com

1.Compiler Design 

Compiler Design - Compilers Principles, Techniques and Tools - A.V. Aho & J.D.Ullman

Download

2.Theory of Computation

Introduction to Automata Theory, Languages, and Computation ( by: John E. Hopcroft
click to download


Formal Languages and Their Relation to Automata by John E. and Ullman, Jeffrey D. Hopcroft
download
clik to download

3.DBMS

Database System Concepts
by: Abraham Silberschatz, Henry F. Korth, S. Sudarshan

download here

download Solutions of Dbms korth

DBMS By Navathe

click to download 

4.Computer Networks

Computer Networks by Andrew S. Tanenbaum
download here

download solutions

Computer Networks - William Stallings
Download

data communication and networking..Forouzan
Download

5.Computer Architecture

Computer Organization and Architecture by William Stallings
Download

Digital Logic and computer design by Morris Mano
Download

Digital Logic and computer design by Morris Mano Solutions
Download


Computer Architecture by Patterson_Hennenssy
Download

http://www.ece.uic.edu/~dutt/courses/ece366/lect-notes.html

6.Data Structures and Algorithm Analysis

Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr) by: Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft
download here


Data Structures and Algorithm Analysis in C by: Mark Allen Weiss
click to download


Introduction to Algorithms by Thomas H. Cormen
download here

7.Computer Graphics

http://www.4shared.com/document/72RyTdT6/Computer_Graphics_-_Hearn__Bak.html

Practice set for Data Structures

Q.1)Which of the following sorting algorithm has the worst time complexity of (n logn)?
  A)Heap Sort           B)Quick Sort                  C)Insertion Sort              D)Selection Sort

Q.2)Which of the following algorithms solves the all-pair shortest path problem?
  A)Dijkstra's Algorithm   B)Floyd's Algo   C)Prim's    D)Warshall's

Q.3)The way a card game player arranges his cards as he picks them up one by one,is an example of 
  A)bubble Sort    B)Selection Sort    C)insertion sort    D)merge Sort

Q.4)You are asked to sort 15 randomly generated numbers.you should prefer
   A)bubble sort   B)Quick Sort  C)merge Sort   D)Heap Sort



ANSWERS:1-a
                    2-b
                    3-c
                    4-a

Dec-2009 Paper 3 based on memory

These are 5 marks questions-
Q1-Q5 were questions on UML diagram.
Q-6)implement AB'+C'D using NAND AND NOR Gates.
Q-7)Write an assembly language program for a+b*c/d
Q-8)Write a recursive function in C for reversing an integer digit.
Q-9)What are the advantages of fragmentation and replication?What are the types of fragmentation?
Q-10)Write time line for round robin scheduling.
Q-11)What is software reliability?
Q-12)DDA algorithm in graphics
Q-13)Aspect ratio etc in graphics

Dec-2009 Paper-2 based on memory

Q.1)A hash function f defined as f(key)=key mod 7,with linear probing it is used to insert the key 37,38,72,48,98,11,56 into a table index from 0 to 6.What will be the location of 11.

a)3 b)4 c)5 d)6

ANS-c

Q.2)Synthesized attribute can easily be simulated by an

a)LL grammar b)LR grammar c)ambiguous grammar d)none of these.

ANS-b

Q.3)802.11 is related to

a)wi-fi b)modem.......

ANS-a

Q.4)Hexadecimal equivalent of (10111)base 2*(1110)base 2 is:

a)150 b)241 c)142

Ans-c

Q.5)Which of the following has excellent noise immunity:

a)ECL b)TTL c)CMOS d)none

Ans-c,ECL has worst of all.

Q.6)on binary semaphore

Q.7)On absolute loader

Q.8)one output question on int main(int argc, char **argv);

UGC-NET guidelines and syllabus

With new guidelines of the University Grants Commission (UGC) making it mandatory for college teachers to clear the National Eligibility Test (NET),more and more people are preparing for the exam.

N E T Schedule
UGC conducts NET twice a year, i.e., in the months of June and December. The notifications announcing the June and December examinations are published in the months of March and September respectively in the weekly journal of nation-wide circulation, viz, Employment News.

N E T Results Declaration Schedule
The result of June, UGC-NET is declared generally in the month of October. Similarly December, UGC-NET result is usually declared in the month of April. The UGC-NET results published in the Employment News are also available on UGC website.
Guidelines
Syllabus of Test: Syllabi for all NET subjects can be downloaded from the UGC Website: www.ugc.ac.in and are also available in the libraries of all Indian universities. UGC will not send the syllabus to individual candidates.

Scheme of the Exam  

1.Test will consist of three papers-

Session      Paper       Marks            Duration                                           
----------------------------------------------------------------------------------------------
First              I             100             1¼ Hours (09.30 A.M. to 10.45 A.M.)
First              II            100             1¼ Hours (10.45 A.M. to 12.00 NOON)
Second         III           200             2½ Hours (01.30 P.M. to 04.00 P.M.)
--------------------------------------------------------------------------------------------

Paper-I   shall be of general nature, intended to assess the teaching/research
aptitude of the candidate. It will primarily be designed to test reasoning ability,
comprehension, divergent thinking and general awareness of the candidate. UGC
has decided to provide choice to the candidates from the December 2009 UGCNET
onwards. Sixty (60) multiple choice questions of two marks each will be
given, out of which the candidate would be required to answer any fifty (50). In
the event of the candidate attempting more than fifty questions, the first fifty
questions attempted by the candidate would be evaluated
Paper-II shall consist of short questions based on the subject selected by the
candidate. Each of these papers will consist of a Test Booklet containing 50
objective type questions of two marks each. The candidate will have to mark the
response for each question on the Optical Mark Reader (OMR) sheet provided
along with the Test Booklet. The detailed instructions for filling up the OMR
Sheet will be sent to the candidate along with the Admit Card.
Paper-III will consist of only descriptive questions from the subject selected by
the candidate. The candidate will be required to attempt questions in the space
provided in the Test Booklet.

Paper-III will be evaluated only for those candidates who are able to secure the
minimum qualifying marks in Paper-I and Paper-II, as per the table given in the
following:

CATEGORY	Minimum Qualifying Marks
	Paper-I	Paper-II	Paper-I+Paper-II
GENERAL/OBC	40	40	100(50%)
PH/VH	35	35	90(45%)
SC/ST	35	35	80(40%)

Questions format for Paper -2 and Paper-3
Paper-2 will cover 50 objective type questions carrying 100 marks.
Paper-3 will have 4 sections.
Go to New format for paper-3
2.Negative Marking in Paper-I & Paper-II : No Negative marking.


Old Question Papers can be downloaded from http://www.ugc.ac.in/inside/oldqpyr.php?sub=87


Anyone having any query about the exam can post their questions in the blog.