Syllabus* of B.E. (Computer Science & Engineering)

 ( As per Dr.Babasaheb Ambedkar Marathwada University,Aurangabad)

P A R T  -  I I

Teaching scheme :                                                         Exam scheme

Theory   : 4 hrs/week                                                    theory : 100 marks,3 hrs

1. INTRODUCTION TO  COMPILAR:

Compiler & translator ,phases of compiler ,compiler construction tools, bootstrapping (2)

2. PROGRAMMING LANGUAGE:

definition of programming languages, Lexical & structure language, Data  elements ,Data structure operators, I & R values, statements program units, parameter transmission, storage  management, recursion, recursion & displays    (4)

3. LEXICAL ANALYSIS:

role of Lexical analyzer, Finite Automata as a recognize Regular expression & finite automata, Lexical analyzers-Lex, Lex programs, Implementation of a Lexical analyzer  (4)

4.  THE SYNTACTIC SPECIFICATION OF PROGRAMMING LANGUAGE:

Review of context free grammers, Derivation & percentage Ambiguity in CFG, regular expression versus cfg

5.  SYNTAX ANALYZER(OR PARSERS)

What is parser? Shift-Reduce & its stack implementaion , constructing pares tree, top down parsing, left recursion ,Recursive descaent     parsing, left fact , predictive parsers-FIRST & FOLLOW , construction of tables, LR parser, LR grammers, the canonical  collection of (0) items, CLOSURE , constructing canonical  LR parsing table.

An automatic parser generation YACC,YACC program, Error Detection & correction with YACC    

6.  SYNTAX   DIRECTED  TRANSLATION:

SDT schemes, SDT scheme for desk calculator , pares tree with      translation, Intermediate code, postfix notation, three address code   ,Quadruples ,triples ,translation schedule for assignment     statements, translation scheme for Boolean expression  control flow method’s scheme for  if-then else ,do statements, translation with top down parser, array rate in arithmetic expression, SDT schemes for procedure call, declaration ,case statements, structure declaration .

7.  SYMBOL TABLES   (2)

the contents of table ,data structures for  symbol table ,representing  scope information

8.  RUN- TIME STORAGE ADMINISTRATION (2)

implementation of a simple stack allocation schems, implementation of   Block structured languages, displays

9. ERROR  DETECTION AND RECOVERY (2)

Reporting errors, sources of errors ,syntactic  error ,semantic error ,pantic mode of recovery in YACC

10. CODE OPTIMIZATION:

Introduction to code optimization ,the principle sources of  optimization, loop optimization basic blocks, flow graphs, loop unrolling, Loop jamming, The DAG representation of basic blocks      application of DAGs ,Global data flow analysis, use definition (or ud)chaining reaching definitions ,data flow equations.

11. CODE GENERATION (3)

Object program ,problems in code  generation, A simple code generation  Register Allocation and assigment,Peepole optimization

REFERENCE  BOOKS:

1)  Principles of compiler Design .Alfred Aho & J.D.Ullaman,NAROSA

2)  Compiler construction -Principles and Prentice -D.M.Dhamdhere

3)  Compiler Design in C-Allen Holub -PHI

4)  IMPACT learning  material series on compiler design IIT,Mumbai.

PRACTICAL EXAMINATION

A minimum of eight programs/assignments should be conducted during the course based on the syllabus and a record for the same shall be submitted

   Programs using LEX and YACC should be included

   Practical examination will be based on the following basis:

1.  Performance in the oral examination

2.  Record of experiments submitted by the candidate

Teaching scheme :                                                         Exam scheme

Theory   : 4 hrs/week                                                    theory : 100 marks,3 hrs

1. Introduction to  UNIX OS ,UNIX background ,philosophy, the man command

2. The file system :

File ,structure of file system ,pwd ls,cat,mkdir,rmdir,chmod,cp,rm,mv  command general purpose utilities :more ,file ,wc,od,cmp,comm,diff,lp,banner,cal,date,who,tty,stty,commnds (2)

3. Shell programming:

The bourne & C shell,pipes,tees,shell,variables,shell script & related commands ,read if, case, while for, trap statements, study and use of Vi editor (4)

4. Filters

pr,head,tail,cut,paste,sort,uniq,nl,grep,egrep,fgrep,sed,tr,join,awk filtering (2)

5. Communication and Scheduling:

news,motd,write,mesg,mail,wall,calender,sleep,at,batch commands cron facility (2)

6. File system commands:

ultimit,mkfs,mount,unmount,in,chown,chgrep,touch,file permission (2)

7. System Administration:

root login,passwd, commands, su commands,/etc/passed file ,profile   usage ,sysadsh command for system administration, printer control with  lashed and lshut,lpstate,floppy disk managment:copying    diskettes,doscp,doscat,dosdir etc commands,backups.dump & restore  commands,cpio command , tar commands ,make utility. (4)

Design Aspect of UNIX:

8. Architecture of UNIX OS ,UNIX Kernel, Kernel data structures (2)

9. The buffer Cache:

buffer header, structure of the buffer pool, Scenarios for retrieval of  buffer, reading & writing disk blocks,Advantages & disadvantages of the buffer cache, (4)

10. Internal Representation of files:

Inodes,direcopris,Algorithm for releasing an inode &  assigning an incode,structure of a regular file, direct & indirect blocks in  incode,algorithm  for conversion of a pathname to an inode,super  block & its structure, File system calls open,creat,read,write,lseek,close,pipe,dup,chdir,chdown,& change       mode, state & fstate (6)

11.The structure of Processor:

Process  states & transitions, layout of system memory, the context of   a process, components of the contex, saving the context, context switch, duplicating a region with fork (6)

12.Process control:

process creation with fork, handling signals with signal command ,kill  & exit call system, boot & the in it process  (4)

13.Network communication:

Introduction to sockets,soc system calls, socket programming examples    (2)

Reference books:

1) UNIX concepts & application ,2nd edition-Sumicarl Das,TMH.

2) The designing pf the UNIX Operating system -Maurice J Batch,PHI

3) Advanced programmers guide to UNIX-Stephen Pratan SAMS Publication.

4) Unix n/w programming-W Richard Stevens , PHI

Practical Exam:

A minimum of eight programs/assignments should be conducted during the course based on the syllabus and a record for the same shall be submitted

   Practical examination will be based on the following basis:

1.  Performance in the oral examination

2.  Record of experiments submitted by the candidate

Suggestive list of practical:

1)Study of UNIX commands.

2)Shell programming

3)Socket programming

4)study of system administration

5)program on process synchronization.

6)simulation of system algorithms of UNIX.

  (releasing inode,assigning inode,conversion of pathname to inode   etc.)

Teaching scheme :                                                         Exam scheme

Theory   : 4 hrs/week                                                    theory : 100 marks,3 hrs

1. Introduction ,definition of AI,AI problems,AI technique, level of     model,criteria for success  (4)

2.Problems ,problem space & search, defining problem space, production system, problem characteristics, production system  characteristics ,issues in the design of search process  (4)

3.Heuristic search technique

generate & test, hill clibing,best first search, problem  reduction, constraint satisfaction, means-ends analysis.    (4)

4.AI programming language  (4)

Prolog, introduction to prolog, concepts & programming.

5.Knowledge Representation (KR)  (4)

representation & mapping ,approaches to KR,issues in the frame problem

6.Predicate logic      (4)

Representing simple facts, its relationship.propositional logic, predicate logic,quantities,resulating natural deductions

7.Knowledge Representation using rules     (4)

procedural vs declarative Knowledge ,logic programming, forward vs backward searching, matching, control Knowledge  

8.symbolic reasoning under uncertainty      (4)

Non monotonic reasoning, logic for non-monotonic reasoning,implimentation issue, augmenting a problem  solves, implimentation by (1)depth-first search,(2)breadth search

9.Statistical reasoning        (4)

probability & Bayer thm,certainty factors & rule systems, Bayessian   n/w ,dempstr shafer threory,logic.

10.slot & filter structures     (4)

sementic net,frames,concepual dependency, scripts

Reference books:

1)Artificial intelligences - Elaine Rich,Keirn Knight, TMH.

2)Introduction to Artificial intelligence & expert system - Dan W.   Paltorson-PHI

3)Introduction to Artificial intelligence-E charniak &   McDermott,Adison-Weseey publication

Term Work:

Term work should consist of record of at least 8 programs/assignments based on the syllabus.

The assessment of the term work should be on the following basis:

1.Continuous assessment (40% weightage)

2.Performing programs & completing assignments (30%)

3.Oral exam(internal)on syllabus(30%)

Teaching scheme :                                                         Exam scheme

Theory   : 4 hrs/week                                                    theory : 100 marks,3 hrs

1.Introduction to OR          (2)

Introduction ,historical background,objective,scope of OR, phases of    OR models, classification of OR,models,advantages & disadvantages of OR

2.Linear programming problems       (12)

formulation of LPP,standard & matrix form of  LPP.,basic,basic-feasible ,basic-feasible-optimal, unbounded solutions  to lPP ,A two variable model& its graphical solution, simplex  method, slack & artificial variables, Big-M method, two phase  method,degeneracy,alternate optimal solution  Non-basic-feasible-optimal solution,LPP with restricted &  unrestricted variables

3.Assignment problem:              (4)

Mathematical formulation of assignment problem, reduce matrix    

Hungarian method for obtaining solutions to assignment production. various types of assignment problems,set-up problem,travalls salesman problem

4.Transportation problem:          (6)

Mathematical formulation of transportation problem, different methods   used for obtains initial basic-feasible-solution such as   row\column,minima,matrix minima-W corner rule & Vogel's   approximation method, use of Modi's method(U-V method)for testing   ,obtaining all possible basic-feasible-optimal   solutions, feasible-optimal solutions,various types of transportation problems such as balanced-unbalanced, problem involving maximization etc 

5.Project management:            (12)

Introduction to CPM & PERT tech,comparison between CPM & PERT ,representing& project with the help of a new. rules for drawing & labeling a n/w.drawing a n/w the given inter-dependent activities   ,forward-pass & backward-pass ,calculation for finding duration of the project & obtaining critical path Crashing different activities & finding normal, optimal & minimal duration of the project & corresponding project costs Resource management, resource travelling,updating & controlling a   n/w,time-sealed n/w diagrams.

PERT: computation for estimated time ,estimated project duration   variance deviates & probability of project completion during specific  duration.

6.Elementary  Inventory models:                 (4)

Introduction, advantages& disadvantages of maintaining  inventory.differnt deterministic models of   inventory. buffer-stock,lead   time, E.O.Q ,introduction to simple probabilistic models.

Reference books:

1)Operation Research-an introduction:Hamdy A.Taha (Prentice-Hall   international publication (EEE).

2)Operation research:S.D.Sharma

3)Operation Research:B.S.Goel,S.K.Mittal(Pragati Park Han,meerat)

4)Operation research: Hira & gupta

Term Work:

Term work should consist of record of at least 8 programs/assignments based on the syllabus.

The assessment of the term work should be on the following basis:

1.Continuous assessment (40% weightage)

2.Performing programs & completing assignments (30%)

3.Oral exam(internal)on syllabus(30%)

Teaching scheme :                                                         Exam scheme

Theory   : 4 hrs/week                                                    theory : 100 marks,3 hrs

1.Intel 80386 ,block diagram, byte ordering, data tyoes,register   set, instruction set, memory segmentation         (6)

2.Memory segmentation, definition of segments, segment selector, local   descriptor tables segment aliasing over lapping     (4)

3.Privilege levels: defining privilege levels, changing privilege   levels(4)

4.reset & real mode,reseting 80386,real mode opearation,preparing for  protected mode, returning to real mode testing TLB  (6)

5.Multitasking, fault & interrupt handling  (6)

6.Study of IBM PC architecture   (8)

study of mother board h/w,clock generation,DMA controller, interrupt   controller, keyboard controller 8048,testing methods & different types   of keys, disk driving, monitor controll,dot matrix printer   controller,Rs..ports

7.Micro controller

micro-controller, comparison with 8051/31 architecture, instruction   set,microcontrollers in data acquisition system, temperature controller  system.

Reference books:

1)IBM PC & clones-Govindrajalu

2)8051 microprocontroller:Keneth Ayla

3)80386 Intel manual

4)The microprocessors(8086\88 to Pentium pro) B.B Bry,PHI.

Term Work.

Term work should consist of record of at least 8 programs/assignments based on the syllabus.

The assessment of the term work should be on the following basis:

1.Continuous assessment (40% weightage)

2.Performing programs & completing assignments (30%)

3.Oral exam(internal)on syllabus(30%)

list of practical is:

1)study of IBM PC motherboard

2)experiments on 8051\31 microconroller

3)assembly language programming using 80386 instruction set switching   to protected mode

4)Interfacing using 8051\31 controller

5)waveform generation

6)stepper motor interfacing.

Term work:

submit the project report

The assessment of the term work should be done the following basis:

1) Actual project work done & the project report

2) Oral exam(internal)

Practical exam:

Practical exam will consist of an oral exam along with the demonstration of the project.

© 2003  k.skumar &Group. All rights reserved.