Syllabus* of B.E. (Computer Science & Engineering)
( As per Dr.Babasaheb Ambedkar Marathwada University,Aurangabad)
Teaching scheme : Exam scheme
Theory : 4 hrs/week theory : 100 marks,3 hrs
INTRODUCTION:
Uses of computer networks, Networks hardware, Network software, and Reference models: OSI & TCP/IP Models, their comparison, example Networks, Novell network, ARPANET,The Internet, Example of Data communication Services: SMDS, X.25 Networks Broadband ISDN & ATM, comparison on of services Network standardization: Who's who in telecom, International standards & Internet standards world (6)
THE PHISICAL LAYER:
The theoretical basis for data communication, transmission media, the Telephone system,: The structure the local loop ,trunks & multiplexing , circuit & packet switching ,cellular Radio : Paging ystems Cordless telephones, analog & digital cellular telephones, personal communication services
DATA LINK LAYER :
data link layer design issues, error detection & correction, elementary data link protocol, sliding window protocol, example data link protocol : HDLC, DL layer in internet
THE MEDIUM ACCESS SUBLAYER:
The channel allocation problem, multiple access protocol: ALOHA, CSMS protocols, collission free protocols, IEEE standard 802 for LANS & MANS, IEEE 802.3 for Ethernet, 802.4 for token bus, 802.5 for token ring, comparision of 802.3 ,802.4, 02.5 ,Bridges (4)
THE NETWORK LAYER
N/w layer design issues, routing algorithms: the optimality principles,shortest path routing ,flooding, flow based routing, broadcast routing.Congestion control algorithms :General principles, congestion prevention policies, traffic shaping, flow specifications, congestion control in virtual circuit subnet, choke packets, internetworking the network layer in the internet: The IP protocol, IP,subnets,Internet control protocols (8)
THE TRANSPORT LAYER (4)
The transport service the internet transport protocols(TCP & UDP)
THE APPLICATION LAYER
Network security: Traditional cryptography, two fundamental cryptographic principles, secret key algorithms,DSN-Domain Name system/Network management protocols(NMP),electronic mail, USENET news, the world wide web surfing the net,telnet,FTP,RPC(remote procedure call)
Reference books:
1. computer networks - Andrew S Tandenbaum,PHI.
2. internet-networking with TCP\IP volume-1,(principles, protocols & architecture)-Douglas E comer, PHI.
3. Data & computer communications-William Stalling, PHI.
Term Work:
Term work should consist of record of at least 8 programs/assignments based on the syllabus.
1. Simulation of algorithms at different layers of OSI or TCP/IP model.
2. Installation & system administration of Novell Netware/windows NT.
3. Study & use of internet
4. HTML program’s
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%)
4602 DIGITAL SIGNAL & IMAGE PROCESSING
Teaching scheme : Exam scheme
Theory : 4 hrs/week theory : 100 marks,3 hrs
Introduction:
signals, system & signal possessing basic elements of digital signal processing system. Advantages of digital over analog signal processing.
classification of signals-
Multi channel & multidimensional signals.
Continuous-Time Vs Discrete -time signals,
continuous valued vs. discrete-valued signals,
deterministic Vs random signals (3)
The concept of frequency in continuous- time & discrete time signals-(4)
continuous -time sinusoidal signals,
discrete-time sinusoidal signals,
analog to digital & digital to analog convertion,sampling of analog
signals,
analysis of digital signal & systems Vs discrete time signals & systems.
Discrete Time signals & Systems : (4)
Discrete -time signals-
Some elementary discrete time signals,
Classification of Discrete time signals,
Simple manipulation of Discrete time signals,
Discrete time system,
i/p & o/p description of system,
Block diagram representations of of Discrete time signal,
Classification of discrete time systems,
Interconnection of Discrete time systems,
Analysis of discrete time linear time Invariant system,
Technique for the analysis of linear system,
Resolution of discrete time signals into impulses,
Response ofLT1 system to arbitrary Inputs : The Convolution
sum, Properties of convolution & Interconnection of LTI systems
THE Z-TRANSFORM: (6)
The discrete Z-transform
The inverse Z-transform
Properties of Z-transform
Relational Z-transform
Poles & Zeros, Pole Location & Time-domain Behavior for casual
signals the system function of a linear time invariant system
Inversion of Z-transform
The inverse Z-transform by contour integration
The inverse Z-transform by power series Expansion
The inverse Z-transform by partial -Fraction Expansion,
Decomposiontion of Rational Z-Transforms
The one-side Z-transform
Definition & properties,
solution of difference Equations.
FREQUENCY ANALYSIS OF SIGNAL & SYSTEM :(3)
Frequency analysis of continuous -Time signals
Frequency analysis of Discrete -Time signals
Properties of Fourier transform for Discrete -Time signals
Frequency -Domain Characteristics of LTI systems
Linear Time -Invariant system as Frequency-selective filters
THE DISCRETE FOURIER TRANSFORM (4)
frequency-domain sampling
Properties of DFT
Linear Time-Invariant systems as Frequency-selective Filters
ALGORITHMS(4)
Direct computation of DFT, Divide & Conquer approach to computation of DFT,Raddix-2 ,FFT Algorithms.
A linear filtering approach to computation of DFT.
7. Implementation Of Discrete -time systems.(2)
structures of FIR, structure of IIR
8. Design of filters(4)
General consideration ,Design of FIR filters, Design of IIR filters from analog filters.
9. Introduction to digital image processing(DIP)(2)
Digital image representation ,elements of digital image processing systems, image processors, digitizers.
10. Digital image fundamentals(4)
Elements of visual perception, Brightness adaptation &
discrimination, An image model, sampling & quantization-Unifrom & no uniform ,Some basis relationship between pixeles,neighbours of pixels,connectivity,distance measures ,arithmetic / logic operation ,image enhancement by histogram equalization, image sharping.
Reference books:
1. Digital signal processing -Prokis,Manolakis(3rd Ed.)
2. Digital Image Processing - Fafael C.Gonzalez,Richrd E. Woods. Addison Wesley Pub. Company.
3. Digital Signal Processing -Oppenheim & Schaffer ,PHI.
4. Fundamentals of Digital Image Processing -Anil Kumar Jain,PHI,
Practical Exam:
Practical work should consist of record of at least 8 programs/assignments based on the syllabus.
Practical exam should be on the following basis:
1.Continuous assessment (40% weightage)
2.Performing programs & completing assignments (30%)
3.Oral exam(external)on syllabus(30%)
Teaching scheme : Exam scheme
Theory : 4 hrs/week theory : 100 marks,3 hrs
1. Introduction: (4)
What is OS,OS as extended machine ,OS as resource manager ,History of OS:-first to fourth generation ,simple batch system ,time - sharing systems, Real-time systems, parallel systems, distributed system.
2. Process Management : (8)
The process model, process states,PCB(process control block)
Intercrosses communication(IPC),race condition ,critical sections, mutual exclusion with busy wating,sleep & wake-up ,semaphores, event counters,monitors,message passing, classical IPC problems :Dining philosophers problem, readers & writers problems.
Process scheduling:
Round Robin scheduling ,priority scheduling ,multiple queues ,shortest job first ,policy driven scheduling ,two level scheduling .
3. I/p - O/p Management: (6)
principles of I/p Hardware:I/O devices, Device controlling.
principle of I/O software: Goals of I/O software, Interrupt handles ,Device drives,device-independendent I/O software, user space I/O software.
Deadlocks:Resources, deadlock modeling. The ostrich algorithms, detection & recovery, deadlock prevention, deadlock avoidance.
RAM disks:RAM disks H/W & S/W ,overview of ramdisk driver.
Disks:Disk H/W disk S/W (disk scheduling algorithms)
Terminals: Terminal H/W & S/W
clocks/W & clocks S/W
4. Memory management :(8)
Memory management without swapping or paging ,use of multiprogramming.
Swapping: Multiprogramming with variable partition, memory management with bitmaps, linked lists, buddy system.
Allocation of swap space,Virtual Memory :Paging ,segmentation.
Page Replacement Algorithms: Optimal page replacement ,Not-Recently used page replacement, First-in-first -out ,least recently used random page replacement.
Design issues for paging systems : Working set model, page size,imlementation issues.
5. File System : (8)
The user view of the file system: File basics,directories,file system design:diskspace management, file storage ,Directory structures ,shared files, file system reliability & performance.
File Servers:Interface level, atomic update, concurrency control,transactions,replicated files.
security:security environment ,flaws generic security attacks, user authentication,desidn principles of security.
Protection Mechanism:
Protection domains, access control lists,capabilities,protection models.
6. Case studies: (2)
i)Netware :Introduction,history,architecture,features.
ii)Windows NT: Introduction ,MS-Windows & windows NT,History Architecture, features.
Reference books:
1) Operating systems: Design & implementation-Andrew S. Tanenbaum,PHI.
2) Operating system concepts: Abrahm Silberschaz,peter Galvin,Addison Wesley Publication .
3) Operating Systems : Achyut Godbole,TMH Publication.
4) Operating System : Concepts & design -Milan Milenkovic TMH publication
5) Operating system : William Stallings-PHI Publication
Practical Exam:
Practical work should consist of record of at least 8 programs/assignments based on the syllabus.
Practical exam should be on the following basis:
1.Continuous assessment (40% weightage)
2.Performing programs & completing assignments (30%)
3.Oral exam(external)on syllabus(30%)
4604 PARALLEL PROCESSING (ELECTIVE-I)
Teaching scheme : Exam scheme
Theory : 4 hrs/week theory : 100 marks,3 hrs
1. Introduction to parallel processing: (8)
a) Evolution of computer systems, Generation of computer systems , trends towards parallel processing.
b) Parallelism in unprocessed or systems:
ASIC unprocessed architecture, parallel processing mechanism, balancing of subsystem bandwidth,multiprogamming & time sharing.
c) Parallel computer structures:popeline structure, parallel computers, multiprocessor systems, performance of parallel computers,date flow & new concepts.
d) Parallel processing application: Modeling & simulation ,engineering design & automation,medical,military & research.
2. Parallelism (6)
Representing parallelism ,classification of parallelism ,vector parallelism ,pipeline parallelism-dimensional parallelism ,detection parallelism ,implementing parallelism .
3. Principles of pipelining & vector processing (8)
a) Pipelining: An overlapped parallelism ,principles of linear pipelining ,classification of pipeline processors, general pipelines & reservation tables, interleaves memory organization.
b) Instruction & Arithmetic pipeline :
Design of pipelined instruction units,arithmatic pipeline design examples,multification & array pipelines.
c) Principles of designing pipelined processors:
Instruction prefect & branch handling ,data buffering & busing structures, internal forwarding & register tagging ,hazard detection & resolution, job sequencing & collision presentation, dynamic pipelines.
d) Vector processing requirements:
characteristics of vector processing ,multiple vector task dispatching ,pipelined vector processing methods.
4. Multi Processor Architecture & Programming (8)
a)Functional structure: Loosely coupled multiprocessor ,tightly coupled multiprocessor ,processor characteristics for multiprogramming.
b)Interconnection networks: time shared on common buses ,crossbar switch & multipart movies ,multistage networks for multiprocessor ,performance of interconnection networks.
c)Parallel memory organization :Interleaved memory configuration
multicache problems & solutions.
d)Multiprocessor operating system: Classification of multiprocessor
operating system, software requirements for multiprocessor. operating system requirement.
e)Exploiting concurrency for multiprocessing :
Language features to exploit parallelism in programes,program & algorithms restructuring .
5. Multiprogramming control & algorithms : (8)
a)Intercrossing communication mechanism :Process synchronization
mechanism, synchronization with semaphores, conditional critical sections & monitors.
b)System deadlocks & protection: system deadlock problems, deadlock prevention & avoidance, deadlock detection & recovery, protection schemes.
c)Multiprocessing scheduling strategies: Dimensions of multiple processor managment,deterministic scheduling models, stochastic scheduling models.
d) Parallel algorithm for multiprocessor: Classification of parallel algorithms, asynchronous parallel algorithms, performance of parallel algorithms.
6. Threading :Principles of multi threading (2)
threading issues & solutions, multiple context of processors, multidimensional architecture.
Reference books:
1. computer architecture & parallel processing :Kai Hwang & F.A.Brigss-MCGraw Hill.
2. Advance computer architecture:Kai Hwang-McGraw Hill.
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%)
4604 ARTIFITIAL NEURAL NETWORKS(ELECTIVE I)
Teaching scheme : Exam scheme
Theory : 4 hrs/week theory : 100 marks,3 hrs
1. Introduction to neural n/w:
biological & artificial neuron, why is the brain so faster?,parallism & reductionism, memory & learning, history of artificial neural network(ANN).
2 .Neural n/w models:
neurons, basic hopfield model, basis concepts of neural n/w,single layer perceptron, multilayer perceptron, Boltzamann machine, self organization models-Kohonen n/w, competitive learning, Hebbian learning.
3. Learning : Supervised & unsupervised.
Introduction ,Supervised & unsupervised learning, statistical learning ,neural n/w learnig:Back propagation(BP),Generalization methodes,reinforcement learnig,adaptive resonance theory (ART)n/w,genetic algorithms.
4. The delta rule: Mathematics of the delta rule ,examples using the delta rules.
5. XOR problem ,linear separability,parity problem
6.Boltzamann machine: Relaxation ,noise in a Hopfield net, hidden units,traning the boilzmann machine ,applications.
7.Back Propagation: General models, forward pass, backward pass, gradient descent ,learning rate, problems solved:simulations,solutions of XOR problems, parity problems, text to speech problem, examples of BP rules & its mathematics .
8. competitive learning:
basis model,training,features of competitive learning model, application ,Grossberg's models ,Adaptive resonance theory.
9.Hardware like the brain:
The Von Newman principle/w of electronic device’s/w of analog chips.
Designing chips: silicon retina, see hear,transputer,the connection machine ,programmable systolic chips(PSC),using RAM:RAM neurons, wivards,logical memory neurons, probabilistic logic nodes. Optics & Holography
10.Slugs,Frogs,schemas:
Developing schemas, memory & schemas, Frog.
11.Words & speech
general models, using the delta rule-ambiguous words, role processing in sentences,NETTALK & DECTALK,TRACE,features in speech signals, word perception model.
12. IMAGE
consideration ,MAP estimation ,cognition & neocognitron ,selective attention ,shape from shading,bars & edges.
References books:
1.Introduction neural networks-Alison carling Golgotha publication
2.Neural networks in computer-intelligence-Limin Fu,McGraw Hill.
3.Neuralnetworks & fuzzy system-Bart Kosko,PHI
4.An introduction to neural n/w=James A. Anderson ,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%)
The seminar will consist of a typewritten report covering the topic selected for the seminar. The candidate shall delivery the seminar on the topic which will be judged internally in the department & the marks will be given accordingly
© 2003 k.skumar &Group. All rights reserved.