(www.entrance exam.net) (www.entrance exam.net) net computer science syllabus

8/10/2019 (Www.entrance Exam.net) (Www.entrance Exam.net) NET Computer Science Syllabus

1/8

UGC-NET Computer Science Syllabus

Paper-II

1. Discrete Structure

Sets, relation, Functions, Pigeonhole Principle, inclusion -Exclusion Principle,Equivalence and Partial orderings, elementary counting techniques Probability,Measures or !n ormation and total in ormation

"ompatibility# Model o computation-Finite $utomata, Pushdo%n $utomata,&on-determinism and &FS, 'P'$ and P'$s and languages accepted by thesestructure, (rammars languages, non compatibility and example o noncomputable problems

(raph-de initions %al)s paths, trails, connected graphs, regular and bipartitegraphs, cycles and circuits, tree and rooted tree, spanning trees, eccentricity o avertex radius and diameter o a graph, central graphs, centers o a tree,*amiltonian and Eulerian graphs, planar graphs

(roup# Finite ield and error correcting + detecting codes

. Computer Arithmetic

Proportional oolean /ogic0, Predicate /ogic, ell ormed ormula FF0,

Satis actory and tautology /ogic Families# 22/, E"/ and "-M3S sates, oolean algebra and

minimi4ation o oolean unctions, Flip-Flop types race conditions andcomparison, 'esign o combinational and sequential circuits

5epresentation o !nteger# 3ctal, *ex, 'ecimal and inary, 6s "omplementand 17s complement arithmetic, Floating point representation

8. Programming in C and C

Programming in "# Element o "-2o)ens, !denti iers, 'ata types in ", "ontrol

structure in ", Sequence selection and iteration, structured data types in "-arrays, structure, union, string an pointers 3-3 Programming concepts# "lasses, 3b9ect, installation, !nheritance,

Polymorphism and overloading ":: Programming# Element o ":: 2o)ens,. identi iers, ;ariable and

constants, 'ata types, 3perator, "ontrol Statement, Function parameter passing,"lass and ob9ect, "onstructor and destructor, overloading inheritance temples ,exception handling


2/8


3/8

context ree grammar, Parsing and parse trees, representation p parsederivation0 trees as nightmare and le tmost derivation , ottom up parsers -Shi treduce, operator, precedence, and /5 . G$"" pac)age an on D&! system

2op do%n parses-/e t recursion and its removal , recursive descend pares.Predictive parses, !ntermediate codes, =uadruples, 2riples, !ntermediate codegeneration, "ode generation, "ode optimi4ation

B. 'perating System(%ith Case study o$ UNI)*

Main unction o operating system, Multiprogramming multiprocessing andmultitas)ing

Memory management# ;irtual memory, Paging, ragmentation "oncurrent processing# mutual exclusion, critical regions, loc)s ad unloc) Scheduling# "PD Scheduling. !+o Scheduling, resource scheduling, an)er7s

$lgorithm or deadloc) handling

D&! the Dnix system# File system,. process management, bourne shell shell

variables, command line programming Filters and commands# Pr, *ead , tail, cut paste. siort, uniq, tr, 9oin, etcH

(rep, egrep, grep etc, sed, a%), etc. System calls li)e0# create, open, close, read, %rite, seem lin), unlin), stat,

stat, unmas), chmos, exec, or), %air, system

I. So$t%are Engineering

System development cycle S'"/0 # Steps, %ater all model, Prototypes,Spiral model So t%are Metrics # So t%are Pro9ect Management So t%are 'esign # System 'esign , 'etailed design., unction oriented design,

3b9ect oriented design, user inter ace design, 'esign level metrics "oding and testing # testing level metrics, So t%are quality ad reliability, clean

room approach, So t%are reengineering

1C. "urrent 2rends and 2echnologies

2he topic o current interest in "omputer Science and "omputer applicationhall be recovered. 2he expert shall use their 9udgment rom time to time toinclude the topics o popular interest, %hich are expected to be )no%n or anapplication development so t%are pro essional they include

Parallel computing Parallel virtual machine P;M0, and message passing inter ace mpi0, libraries

and calls, $dvanced architecture, today7s astest computers Mobile "omputing


4/8

Mobile "onnectivity-"ells, Frame%or), %ireless delivery technology ands%itching methods, mobile in ormation access devices , mobile datainternet%or)ing standards, cellular data communication protocols , mobilecomputing application, Mobile database-Protocol, scope, tools, and technology,M- usiness

E-2echnology Electronic "ommerce# Frame%or) , Media convergence o $pplication,

"onsumer application , 3rgani4ation application Electronic payment System# 'igital Sy2o)en, Smart "ards, "redit "ards,

5is)s in Electronics Payment system 'esigning electronic payment system Electronic 'ata !nterchange E'!0# concept, $pplication legal security and

privacy0, !ssues, E'! and Electronic commerce Standardi4ation and E'!, E'!So t%are implementation, E'! , envelope or message 2ransport, !nternet-basedE'!

'igital /ibraries and 'ata %arehousing# "oncept , 2ypes o 'igital

'ocuments , !ssues behind document in rastructure, "ooperate data %arehouses So t%are $gents# "haatetstics and Properties o $gents 2echnology behind

so t%are agents $pplets, ro%ser and So t%are $gents0 road band 2elecommunication# "oncept, Frame relay, "ell relay, S%itched

Multimegabite 'ata Services, $synchronous, 2rans er Mode Main "oncepts in geographical !n ormation System (!S0, E-"ash E-

usiness, E5P pac)ages 'ata are housing# 'ata are housing environments, $rchitecture o a data

%arehouses methodology, $nalysis design, "onstruction and administration 'ata Mining# Extraction models and pattern orm large database , data

miming techniques , classi ication regression, clustering summari4ation,dependency modeling, lin) analysis, sequencing analysis, mining scienti ic andbusiness data

indo%s Programming !ntroduction to indo%s programming# in8 Microso t Foundation "lasses

MF"0, 'ocuments and vie%s, 5esources message handling n %indo%s Simple $pplication in %indo%s0 Scrolling. splitting vie%s. doc)ing toolbars status bar, common dialogue $dvanced indo%s Programming Multiple document !nter ace M'!0, Multiplex threading, 3b9ect lin)ing and

Embedding 3/E0, $ctive control $ctive template /ibrary $2/0, &et%or)programming Paper-!!! $0 "ore (roupDnit-!

"ombinational circuit design, Sequential "ircuit design, *ard%are ad Microprogrammed processor design, !nstruction ormats, $ddressing models Memorytypes and organi4ation, !nter acing peripheral devices, !nterrupts

Microprocessor architecture, !nstruction set and Programming BCB>. P-!!!+P-!;0, Microprocessor applications Dnit-!!


5/8

'atabase concepts, E5 diagrams, 'ata model, 'esign o 5elational 'atabase,&ormali4ation, S=/ and = E, =uery Processing and 3ptimi4ation, "entrali4edand 'istributed 'atabase, Security, "oncurrency an recovery in centrali4ed and'istributed 'atabase System, 3b9ect oriented 'atabase Management System"oncept, composite ob9ect , !ntegration %ith 5' MS application0, 35$"/E

Unit-III'isplay system , input devise, ', geometry, (raphics operation, 8' (raphics,

$nimation (raphic Standard, $pplication concepts, Storage 'evices, !nput 2ools, $uthoring 2ools, $pplication iles

Unit-I+

Programming language , concepts, Paradigm and models 'ata , 'ata types, 3perators, Expressions, $ssignments , Flo% o control-

"ontrol Structure, !+3 Statement, Dser 'e ined and uilt in Function parameterpassing

Principles , "lasses, !nheritance, "lass hierarchies, Polymorphism, 'ynamicbinding, re erence semantics and their implementation

Principles, unctions, lists, types and polymorphism, higher order unctionsla4y evaluation equations and pattern matching

Principles , horn clauses and their execution, logical variables relations, datastructure, "ontrolling the search order, programme development in prologimplementation o prolog, example programme in prolog

Principle o parallelism co routines, "ommunication and execution, Parallel

virtual Machine P;M0 and message passing inter ace MP!0, routine an calls ,Parallel programmes in P;M paradigm a s%ell as MP!, paradigm or simpleproblems li)e matrix multiplication

Preconditions , post conditions, axiomatic approaches or semantic,correction7s denotation semantics

"omplier structure, "ompiler construction tools, coalition phases Finite $utomata, Pushdo%n $utomata, &on-'eterminations, and &F$, 'P'$

and P'$s and language accepted by these structure, (rammars, language-2ypes o grammar-type,C, type 1, tope , type 8, 2he relationship bet%een typeso grammars, and inite machine, Pushdo%n automata and context ree Framers,/exical $nalysis-regular express and regular languages./E pacema)er onD&! , "onversion o &F$ to 'F$ minimi4ing the number o states in a 'F$,"ompilation an interpretation ootstrap "ompilers

"ontext ree grammars, Parsing and parse trees, representation o parsetrees as rightmost ma le tmost derivation. ottom up parsers-shi t reduce,operator precedence an /5, G$"" pac)age on D&! , system, 2op do%nparsers-/e t recursion and its removal , recursive descent Parsers, Predictive


6/8

parser !ntermediate codes-=uadruples, triples, !ntermediate code generation,"ode generation , "ode optimi4ationDnit-;

$nalogue and 'igital 2ransmission, $synchronous and Synchronoustransitions 2ransmission media, Multiplexing and "oncentration S%itch itechniques Polling

2opologies m &et%or)ing devices, 3S!, 5e erence Model Protocol or - i0'ata lin) layer, ii0 &et%or) layer and iii0 2ranspire layer , 2"P+!P Protocol&et%or) security, &et%or) $dministration Dnit-;!

'e inition , simple and composite structure, $rraue lists, stac)s queues,Priority =ueues, inary trees , -2rees (raphs

Sorting searching $lgorithms, $nalysis o algorithms, !nterpolation and inarysearch, $symmetric notation, ih ohm, 3mega and 2heta, $verage case caseanalysis o simple programmes li)e inding o maximum o n elements, recursionand its systematic removal, =uic)sort-&on-recurive implementation %ith minimalsta)e storage, 'esign o algorithm divide and "onquer, greedy method, 'ynamic

programming ac) trac)ing, rach and ound 0, /o%er bound theory, &on-deterministic algorithm &on-'eterministic algprogramming, construct, Simplenon-deterministic programs, &P-hard and &P-complete problemsDnit-;!!3b9ect, message, classed, encapsulation, inheritance, polymorphism,aggregation, abstract, lasses, generali4ation and extension and restriction m3b9ect oriented design, Multiple, inheritance metadata*2M/, '*2M/, M/, Scripting, J$;$, Sevelets, $ppletsDnit-;!!!So t%are development models, 5equirement analysis and speci ication so t%aredesign Programming techniques and tools so t%are validation and qualityassurance techniques, So t%are maintenance and advanced concepts , So t%are

management

Dnit-!!ntroduction, memory management, Support or concurrent process Scheduling,System deadloc), Multiplexing system , !+3 Management distributes operatingsystem Study o D&! and indo% &2

Dnit-

de inition, $! approach oe sloping problems $utomated 5easoning %ith propositional logic and predicate logic-

Fundamental proo procedure, 5e utation , resolution re inement to resolutionordering+Pruning+5estriction strategies0

State solace representation o problems, ounding unctions, breadth irstdepth irst, $, $

, $3 etc per ormance, comparison o various techniques


7/8

Frame, scripts, Semantic nets, production systems, Procedururalrepresentation , Prolog programming

"omponents o an expert system, @no%ledge representation and acquisitiontechniques, uilding expert system and shell

52&s. $2 &S. Parsing o $mbiguous, "F(s 2ree $d9oining (rammars2$(s0

Systems approach to planning , designing, 'evelopment, !mplementation andevaluation o M!S

'ecision ma)ing process, evaluation o ''S, (roup decision support system $nd case studies, $daptive design approach to 'SS development, "ognitivestyle in 'SS, !ntegrating experts and decision support systemsPaper-!!! 0KElective+3ptionalLElective-!

2heoory o computation# Formal language, need or ormal computationalmodel, &on-"omputational model on computational problems, 'iagonal

argument and 5ussell7s paradox 'eterministic Finite $utomata 'F$0, &on deterministic inite $utomaton

&F$0,'igital languages ad regular sets Equivalence, o 'F$, and &F$ Minimi4ing the numbers o state o a 'F$, non regulate language m, and

pumping lemma Pushdo%n $utomaton P'$. 'eterministic, Pushdoam $utomaton 'P'$0,

&o equivalence o P'$ and 'P'$ "ontext ree grammars# greenbac) &ormal orm (&F0 ad "homs)y &ormal

Form "&F0, $mbiguity , Parse 2ree, representation o derivation, Equivalence o P'$7s and "F(6s Parsing techniques or parsing o general "F(7 -Early7s "oo)-

@assami-GD&(er "@G0 and 2omitta parsing /inear ounded $utomaton / $0# Po%er o / $ , "losure Properties 2uring Machine 2M0 # 3ne tape, Multiple, the notion o time and space

complexity in terms o 2M, "onstruction o 2M or simple problems,"omputational "omplexity

"homs)y *ierarchy o /anguages# 5ecursive and 5ecursively enumerablelanguageElective-!!

Model or in ormation "hannel# 'iscrete Memory less channel, inarySymmetric "hannel S"0, urst channel, it-error rates, Probability, entropy and

Shannon7s measure o in ormation, Mutual in ormation, channel capacitytheorem, rate and optimally o in ormation trans orm mission ;ariable /ength codes# Pre ix "odes, *uman "odes, lempel - ie% / 0

"odes, 3ptimally o these cases !n ormation content o these codes Error "orrecting and detecting "odes# Finite ields, *amming 'istance,

ounds o "odes, /inear Party chec)0 "odes, Parity chec) matrix, generatorMatrix, 'ecoding o linear codes, *amming "odes


8/8

!mage Processing# !mage Processing, Spatial Fourier, 2rans orm 'iscreteSpatial Fourier 2rans orm 5estoration , /oss compression o image s pictures0

'ata compression techniques #representation and compression o text,sound, picture, and video iles based o MPE( and JPE( standardsElective-!!!

/inear programming Problem /PP0 in the standard orm, /PP in canonicalorm, conversion o /PP in Standard orm to /PP in "anonical orm

Simplex-Prevention o cyclic computation in simplex and 2ableau,. ig-Mmethod, 'ual Simplex and revie%ed simplex

"omplexity o simple $lgorithm s0, Exponential behaviors o simplex Ellipsoid method and @arma)ar7s Method or solving /PPs . Solving simple

//Ps through theses methods, comparison o complexity o theses methods $ssignment and 2ransportation Problems# Simple algorithm li)e *ungarian

method etc Shortest Path Problems# 'i9)stra7a and Moore7s method "omplexity

&et%or) Flo% problem# Formulation, Max Flo% min-"ut 2heorem. Ford andFul)erson6s algorithm,. Exponential behavior o rod and ul)erson6s alorithim,Malhotra-Promod @DMar-Mahes%ari MPM0, Polynomial Method or solvingnet%or) problem, ipartite (raphs and Matching, Solving matching usingnet%or) lo% problems

Matriods# 'e inition, (raphic and co graphic matriods, Matriods intersectionproblem

&on-/inear programming# @uhn-2uc)er conditions, "onvex unction and"onvex region, "onvex programming problems, $lgorithms or solving convexprogramming problems-5ate o convergence o iterative method or solving

theses problemsElective-!;

&eural net%or)# Perception Model, /inear Severability and 35 problem,2%o and three layered neural net%or), ac)prpaogation-"onvergence, *op ieldnets, &eural net /earning, $pplication

Fu44y System# 'e inition o a Fu44y ste, u44y relation, u44y unctions, Fu44ymeasures, Fu44y reasoning, $pplication o Fu44y systemsElective-;

D&! # 3perating system, Structure o D&! , 3perating system, D&!"ommands, !nter acing %ith D&! , Editors and "ompliers or D&! , /E and

G$"" , File System, System calls, Filters, Shell programming indo%s# indo%s environment,. Dnicode, 'ocuments and ;ie%s, 'ra%ingin %indo%, Message handing, Scrolling and Splitting vie%s, 'oc)ing toolbar andstatus bar, "ommon dialogue and control, M'!, Multithreading , 3/E, $ctive "ontrol, $2/, 'atabase, access, &et%or) programming.

(www.entrance exam.net) (www.entrance exam.net) net computer science syllabus

Documents