Download M.Tech in IT - Karnataka State Open University

DETAILED SYLLABUS
FOR
MASTER OF TECHNOLOGY
(M.TECH)
COURSE STRUCTURE & SYLLABUS OF
MASTER OF TECHNOLOGY (M.TECH)
M.Tech(IT)
Program Duration :
Minimum Duration - 2 years
Maximum Duration – 4 years
Eligibility Criteria :
A candidate seeking admission in MTech(IT) programme should have passes
BE/BTech/AMIE/ in any discipline or MCA/MSc(CS)/Msc(IT)/MIT/MCM or
MSc in any discipline with Mathematics as a major component in BSc from a
recognized University or DOEACC B Level.
Program Structure
MTech(IT)
Subject
Code
MT11
MT12
MT13
MT14
Subject Name
1st Semester
Interactive Computer Graphics
Advanced Computer Architecture
Algorithm Analysis and Design
Advanced DBMS
Total Credits
Credits
4
4
4
4
16
MT21
MT22
MT23
MT24
2nd Semester
OO Software Engg. With UML
Al and Neural Networks
Elective Paper – I
Elective Paper – II
Total Credits
4
4
4
4
16
MT31
MT32
MT33
3rd Semester
Elective Paper – III
Elective Paper – IV
Dissertation - Part I
Total Credits
4
4
8
16
MT41
4th Semester
Dissertation - Part II
Total Credits
16
16
MT23A
MT24A
Electives for Mtech (IT)
Group A
Automata
Parallel Computing
4
4
MT31A
MT32A
Logic and Functional Programming
Natural Language Processing
4
4
MT23B
MT24B
MT31B
MT32B
Group B
Embedded System
VLSI Design
Simulation and Modeling
Compiler Design
4
4
4
4
MT23C
MT24C
MT31C
MT32C
Group C
E-Commerce, M-Commerce and
Network Security
Network Programming
Wireless and Mobile Network
ERP and CRM
4
4
4
4
MT23D
MT24D
MT31D
MT32D
Group D
Multimedia Systems
Document Analysis and Pattern
Recognition
Intelligent Databases
Biometrics
4
4
4
4
MT-11
INTERACTIVE COMPUTER GRAPHICS
BLOCK-1 BASIC OF COMPUTER GRAPHICS
UINT-1:
INTRODUCTION , APPLICATION AREAS OF COMPUTER GRAFHICS OVERVIEW
GRAPHICS SYSTEM, VIDEO-DISPLAY DEVICES, RASTER –SCA SYSTEM
RANDEM SCAN SYSTEM, GRAPHICS MONITORS AND WORK STATIONS AND
INPUT DEVICES
UINT-2:
OUTPUT PRIMITIVE:PIONT AND LINES, LINE DRAWING ALGORITHMS, MIDPOINT CIRCLE AND ELLIPSE ALGORITHMS . FILLED AREA PRIMITVE : SCAN
LINE POLYGON FILL ALGORITHM BOUMDARY-FILL AND FLOOD-FILL
ALGORITHMS
UINT-3:
2-D GEOMATRICAL TRASFORMS:TRASLATION ,SCALING, ROTATION
,REFLACTION AND SHEAR TRANSFORMATION , NATRIX REPESENTATION
AND
HOMOGEEOUS
COORDINATES,
COMPOSITE
TRANSFORMS
TRANSFORMATION BETWEEN COORDINATE SYSTEM
BLOCK-2: OPERATION ON COMPUTER GRAPHICS
UINT-1:
2-D VIEWING:THE VIWING PIPELINE VIWING COORDINATE REFERANCE
FRAME,WINDOW TO VIEW-PORT COORDIATE TRANSFORMATION, VIWING
FUCTION .COHEN-SUTHERLAND AMD CYRUS-BECK LINE CILPPING
ALGORITHM SUTHERLAND- HODGEMAM POLYGON CLIPPING ALGORITHM
UINT-2:
3-D OBJECT REPERASNTATION
POLYGO SURFACE ,QUADRIC SURFACE ,SPLINE REPERASANTATION
,HERMITE CURVE AND BEZIER AND B-SPLINE SURFACE .BASIC
ILLUMINATION MODEL, POLYGON RENDERING METHODS
UINT-3: 3-D GEOMATRIC TRASFORMATION
TRANSLATION ,ROTAION,SCALING, REFLECTION AND SHEAR
TRANSFORMATIION ,COMPOSITE TRANSFORMATIONS
3-D VIWING:
VIWING PIPLINE, VIWING COORDINATES ,VIEW VOLUME AND GENRAL
PROJECTION TRANSFORMS AND CLIPPING
BLOCK-III ADVANCED COMPUTER GRAPHICS
UNIT I:
VISIBLE SURFACE DETECTION METHODS:CLASSIFICATION, BACK-FACE
DETERECTION ,DEPTH –BUFFER ,SCA-LINE , DEPTH SORTING , BSP-TREE
METHODS, AREA SUB-DIVISION AND OCTREE METHODS
UNIT 2: COMPUTER ANIMATION
DESIGN OF AIMATION SEQUENCE, GENRAL COMPUTER ANIMATION
FUNCTIOS, RESTER ANIMATION ,COMPUTER ANIMATION LANGUAGE, KEY
FRAME SYTEM , MOTIO SPECIFICATION
SEMEATER -2
SYLLABUS
OO SOFTWARE ENGG. WITH UML(MT21)
UNIT 1. SOFTWARE ENGINEERING CONCEPTS
S/W ENGINERENING CONCEPTS S/W ENGINEERING DEVOLPMENT
ACTIVITES , SOFTWARE RESUABILITY AND RE-ENGIEERING CONCEPTS ,
STANDARDS FOR DEVLOPMENT LIFE CYCLE MODEL , MANAGING
ACTIVITIES AND PRODUCTS SOFTWARE PROCESSS AND PROJECT
MANAGEMENT
UNIT 2. OBJECT METHDOLOGY AND REQUIREMENT ELICITATION
INTRODUCTION TO OO METHODOLOGY , OVERVIEW OF REQUIREMENT
ELICITATION , REQUIREMENT , MODEL-ACTORS AND USE CASES
REQUIREMENT ELICITATION ACTIVITIES.
UNIT 3.OOA AND DESIGN MODEL
ANALYSIS CONCEPTS AND ACTIVITES ANALYSIS MODEL ,CONCEPTS AND
ACTIVITES DESIGN MODEL & IMPLIMEMANTATION PROCESS
UNIT 4. DESIGN WITH UML
MODEL AND MODLIG , METHODOLOGIES BASIC STRUCTRAL MODLING
,CLASS DIAGRAMS AND RELATIO SHIP ,PACKAGE OBJECT DIAGRAMS AND
REPERASENTATION
USE-CASE
AND
INTERACTION
DIAGRAMS
COMPONENTS PATTERNS FRAMEWORKS
UINT 5.TESTING OO SYSTEMAND QUALITY ASSURENCE
A OVERVIEW OF TESTING , TESTING ACTIVITES AND TECHNIQUES ,
MANAGING TESTING OO METRICS and QUALITY MODELS ,SOFTWARE
RELIABILITY
UNIT 6. SOFTWARE AGENTS
AGENTS-ORIENTED VS OO SOFTWARE DEVELOPMENT , DESIGN METHODS ,
MULTI AGENT SYSTEM ,USE OF UML AGENT METHODOLOGIES IN THE
IDUSTRY ,COMPONENT BASED SOFTWARE ENGINEERING.
MT12
ADVANCED COMPUTER ARCHITECTURE
1. Introduction
2. Central Processing Unit-CISC Characteristics, RISC Characteristics
3. Pipeline and Vector Processing-Pipelining, Arithmetic Pipeline,
Vector Processing, Array Processors, SIMD Array Processor
4. Multiplication algorithms: Introduction, addition & subtraction,
multiplication algorithms, hardware implementation for signedmagnitude data, hardware algorithm, Booth multiplication
algorithm, array multiplier, divide overflow, floating-point
arithmetic operation multiplication , division, floating-point
operations
5. Asynchronous Data Transfer-Strobe Control, Handshaking, Direct
Memory Access (DMA)- DMA Controller, DMA Transfer
6. Memory Organization-Memory Hierarchy, Cache MemoryAssociative Mapping, Direct Mapping, Set Associative Mapping,
Virtual Mapping, Memory Management Hardware
7.
Multiprocessors-Interconnection structures- Time Shared
Common Bus; Multiport Memory; Crossbar Switch; Multistage
Switching Network; Hypercube Interconnection, Dynamic
Arbitration
Algorithms,
Cache
Coherence-Conditions
for
Incoherence, Solutions to the Cache Coherence Problem, problems
MT13
ALGORITHM ANALYSIS AND DESIGN
1. INTRODUCTION
2. THE BASIC STEPS IN THE DEVELOPMENT OF AN ALGORITHM
The Problem-Solving Aspect, Implementation Of Algorithms,
Program Verification, The Efficiency Of Algorithms, The Order
Notation
3. SOME DATA STRUCTURE
Stacks and queues, trees, binary trees, heaps and heapsort,
graphs, hashing.
4.
ELEMENTARY
NOTIONS
FROM
PROBABILITY
AND
STATISTICS
Probability, Axioms Of Probability, Discrete Probability
Distributions, Bayes's Theorem, District Random Variables,
Statistics,Linearity, Arithmetic Series
5. HEURISTICS: TRAVELING SALESPERSON PROBLEM
Traveling Saleperson Problem, Efficiency Considerations
6. BRANCH AND BOUND PROBLEM
The Method, Lc-Search, Control Abstractions For Lc-Search,
Properties Of Lc-Search, Bounding, Lc Branch-And-Bound
7. RECURSION AND BACKTRACK PROGRAMMING
Introduction, When Not To Use Recursion, Two Examples Of
Recursive Programs,
Backtrack Programming, The Eight
Queens Problem, The Stable Marriage Problem, The Optimal
Selection Problem
8. SHORTEST PATHS PROBLEM
Unweighted Shortest Paths, Dijkstra’s Algorithm, Acyclic Graphs,
Prim’s Algorithm, Kruskal’s Algorithm
9. SORTING
General Background, Efficiency Consideration, Efficiency Of
Sorting, Exchange Sorts, Quicksort, Efficiency Of Quick Sort,
Binary Tree Sorts, Heapsort, Insertion Sorts, Shell Sort
10. SEARCHING
Basic Search Techniques, Algorithmic Notation, Sequential
Searching, Efficiency Of Sequential Searching, Reordering A List
For Maximum Search Efficiency, Indexed Sequential Search,
Binary Search, Interpolation Search
11. ARITHMETIC AND LOGICAL EXPRESSIONS
The General Method, Evaluation And Interpolation, Interpolation
12. SETS AND SOME BASIC SET ALGORITHMS
Sets, Relations, Functions, Sets And Disjoint Set Union
.
MT14
ADVANCED DBMS
UNIT-1
INTRODUCTION TO DATA BASE SYSTEMINTERODUCTION ,OBJECTIVES
,TRADITIONAL FILE ORIANTED APPROCH ,MOTIVATIO FOR DATABASE
APPROCH ,DATA BASIC ,THREE VIEWS OF DATA AND THREE LEVEL
ARCHITECTURE OF DBMS EXTERNAL LEVEL OR SUBSCHEMA,COCEPTUAL
LEVEL OR CONCEPTUAL SCHEMA,ITERAL LEVEL OR PHYSICAL SCHEMA
,MAPPING BETWEEN DIFFERENT LEVELS ,DATAB BASE MANAGEMENT
SYSTEM FACILITES ,DATA DEFINATION LANGUAGE ,DATA MANIPULATION
LANGUAGE ELEMENTS OF A DATA BASE MANAGEMENT SYSTEM ,DMT
PRECOMPILED
,DDL
COMPILER
,FILE
MANAGER,DATABASE
MANAGER,QUERY PROCESSOR,DATABASE ADMINIATRATION
STRECTURE QUREY LANGUAGE
INTERDUCTION OF SQL, DDL STATEMENTS,DML STATEMENTS,VIEW
DEFIATION, CONSTRAINTS AND TRIGGERS ,KEYS AND FOREIGN KEYS
CONSTRAINTS ON ATTRIBUTES AND TUPLES, , MODIFICATIO OF
COSTRAINTS,CURSORS,DYNAMIC SQL
UNIT-2
INTERODUCTION
,OBJECTIVES,FILE
MANAGEMENY
SYSTEM.ENTRY
RELATIONSHIP(E-R)DIAGRAM, INTERODUCTION, ENTRY RELATIONSHIP(ER)DIAGRAM,GENERALIZATION AND AGGREGATION ,AGGREGATION ,THE
HIERARCHIAL
MODEL,THA
NETWORK
MODEL,THE
RELATION
MODEL,ADVANTAGE AND DISADVATAGE OF RELATION APPROACH,AND
EXAMPLE OF RELATION MODEL
UNIT-3
NORMALIZATION FUNCTIONAL DEPENNDANCY.ORMALIZATION ,FIRST
NORMAL FORM,SECOND NORMAL FORM,THIRD NORMAL FORM,BOYCECODD NORMAL FORM MULTI-VALUAED DEPANDANCY,FIFTH NORMAL
FORMMANAGEMENTCONSIDRATIONINTERODUCTION,OBJECTIVE,ORGANIZ
ATIONAL RESISTANCE TO DBMS TOOLS, COVERSION FORM AN OLD SYSTEM
TO A NEW SYSTEM ,EVALUATION OF A DBMS,ADMINISTRATION OF A
DATABASE MANAGEMENT SYSETM
MT 22
SYLLABUS
AI AND NEURAL NETWORKS
1. BIOLOGICAL NEURAL NETWORK:
NEURON PHYSIOLOGY ; FECTOR AFFACTING POTASSIUM-ION FLOW
NEURONAL DIVERSITY ,SPECFICATION OF THE BRAIN ; THE EYE ‘S NEURAL
NETWORK; RETINA STRUCTURE , IMAGE PROCESSING IN THE RECTINA
2. ARTIFICIAL NEURAL TEWORKS
NEURAL ATTRINUTES : ARTIFICIAL NEURAL NETWORKS , LEARING IN
ARTIFICAL NEURAL NETWORK :DATA RULE , ARTIFICIAL NEURAL
NETWORK TOPOLOGIUES ,ALOGRITHMS: ANN ADAPTABILITY
3. FUZZY LOGIC
PROPOSITINAL LOGIC , FUZZY,TIME-DEPANDANT FUZZY LOGIC :CRISP
LOGICS, TEMPORAL FUZZY LOGIC (TFL), APPLIYING TEMPORAL FUZZY
OPERATIO N DEFUZZIFICASTION OF TEMPORAL FUZZZY LOGIC ,EXAMPLE :
APPLICABILITY OF TEL I N COMMUNICATION SYSTEM
5. FUZZY NEURAL NETWORKS:
FUZZY ARTIFICIAL NEURAL NETWORKS (FANN), FUZZY NEURAL EXAMPLE ,
NEURAL FUZZY COTROL :TRADITIOAL CONTROL : NEURAL CONTROL :FUZZY
CONTOL :FUZZY NEURAL CONTROL
6. APPLICATION:
SINGNAL PROCESSIG IMAGE DATA PROCESSING : HANDWRITTEN
CHARATER
RECOGNITION
:VISUAL
IMAGE
RECOGNITION
,
COMMUNICATION SYSTEM :CALL PROCESSING ; SWITCHING TRAFIC
COTROL ; PECKET RADIO ETWORK ROUTING , INTELLIGENT CONTROL ,
TOOL AND COMPANIES
MTECH IT 3RD
GROUP-C
ERP AND CRM
1. HELLO, GOODBYE: THE NEW SPIN ON CUSTOMER LOYALTY
THE COST OF ACQUIRING CUSTOMER, FROM CUSTOMER ACQUISITION TO
CUSTOMER LOYALTY TO OPTIMIZING THE CUSTMOURE EXPERIENCE, HOW
THE INTERNET CHANGED THE RULE S, WHAT’S IN A NAME , CRM AND
BUSINESS INTELLIGENCE, THE MANAGER ,S BOTTOM LINE
2. CRM IN MARKETING
FROM PRODUCT TO CUSTOMER : A MARKITING RETROSPECTIVE CAMPAIGN
MANAGEMENT CRM MARKITING INITIATIVES, CROSS-SELLING AND UPSELLING CUSTOMER RETENATIO , BEHAVIOUR PREDICTIO . CUSTOMER
PROFITABILTY AND VALUE MODLING .CHENNEL OPTIMIZATION ,
PRESONALIZATION , EVENT BASED MARKITING . CUSTOMER PRIVACY –
ONE-TO-ONE,S SABOTEUR . MARKITING AUTOMATION CHECKLIST FOR
SUCCESS
3. CRM AND CUSTOMER SERVICE
THE CALL CENTER AND CUSTOMER CARE . THE CONTECT CETER GATS
AUTOMATED
4.SALES FORCE AUTOMATION
SALES FORCE AUTOMATION :THE CRADLE OF CRM , TODAY SFA, SFA AND
MOBILE CRM FROM CLIENT /SERVER TO THE WEB SFA GOES MOBILE ,FIELD
FORCE AUTOMATION ,AN SFA CHECKLIST FOR SUCCESS
5. CRM IN BUSINESS
E-CRM EVOLVING , MULTI CHANNEL CRM , CRM IN B2B , ENTERPRISE
PLANNIG SUPPLY CHAIN MANAGEMENT , SUPPLIER RELATIONSHIP
MANAGEMENT ,PETTREN RELATIONSHIP MANAGEMENT , AN E- BUSINESS
,S BOTTEM LINE
6.ANALYTICAL CRM
THE CASE FOR INTERGRATED DATA , A SINGLE VARSION OF THE CUSTOMER
TRUTH , CRM AND DATA WAREHOUSE ENTERPRISE CRM COME HOME TO
ROOST . THE MAJOR TYPES OF DATA ANALYSIS ,OLAP WAHRE THEORY
MEETS PRACTICE : DATA MINING IN CRM ,CLICK STREAM ANALYSIS .
PERASANTATION
AND COLLABORATIVE FILTERING AN ANYLISIS
CLECKLIST FOR SUCCESS
7.PLANNING YOUR CRM PROGRAM
DEFININGB CRM SUCCESS PREPARING THE CRM BUSINESS PLAN
.UNDERSTANDINGBUSINESS PROCCESS . BPR REDUX : MODLING CUSTOMER
INTERACTIONS. ANALYZING YOUR BUSINESS PROCESSES
8.ERP- AN INTRODUCTION
WHAT IS ERP .THE FULL POTENTIAL OF EPR .WHAT WILL ERP FIX I MY
BUSINESS ENTERPRISE SYSTEMS SHOW RESULTS
9. RELATED COSTS
WILL EPR FIT THE WAYS I DO BUSINESS .,WHAT ARE THE HIDDEN COSTS
OF ERP ,WHY DO ERP PROJECT FAIL SO OFTEN ,HOW DO I CONFIGURE ERP
SOFTWARE
10. ORGANISATION OF ERP PROJECTS
HOW DO COMPANIES ORGANIZE THEIR ERP PROJECT? HOW DOES ERP FIT
WITH E-COMMERCE ?CASE STUDY ,AN OVERVIEW OF CHANGE
.MANAGEMENT WHAT IS CHANGE MANAGEMENT ? ACLOSER LOOK WHAT
WILL THIS CHANGE MEAN TO ME CRITICAL ELEMENTS FOR MANAGING
CHANGE
11. BENCHMARKING
OVER VIEW .THE CODE OF CONDUCT TYPES OF BENCHMARKIG SOURCES OF
INFORMATION ,A BENCHMARKING PROCESS
12 BUSINESS PROCESS REENGINEERING
PURPOSE OF THIS MODULE , CONTINUOUS PROCESS IMPROVMET MEDEL
,BUSINESS PROCESS REENGINEERING (BPR) , BREAK-THROUGH REENGINEERIG MODEL
MTECH IT (ELECTIVE)
GROUP-C
NETWOK PROGRAMMIG (MT 24C)
UNIT-1
INTERDUCTION TO ETWORK PROGRAMMING CONCEPTS,FUDAMENTAL
LIMITATIONS OF COMPUTER NETWORKS ,STANDERAD ETWORK
PROTOCOLS ,BERKELEY (BSD) SOCKETS – THE STANDERD NETWORK API
APPLICATIO NETWORK TOPOLOGIES , SECURITY AND ENCRYPTION ,
SYMMETRIC ENCRYPTION .MASSAGE AUTHENTICATION ,PUBLIC KEY
CRYPTOGRAPHY AND KEY EXCHANGE, ADDITIONAL CHALLENGES FACING
NETWORK PROGRAMMERS , FIREWALLS AND NETWORK ADDRESS
TRANSLATION (NAT) ROUTERS, UNIX STANDERDS ,STANDERDS AND THE
UNIX WARS ,THE GHOST AT THE VICTORY BANQUET, UNIX STANDERD IN
THE
OPEN
–SOURCE
WORLD
.,INTERNET
ACCESS,
AVAILABILITY,TECHNOLOGIES ,LOCAL AREA NETWORK,TCP,SUMMARY
UNIT-11
ADDRESS STRUCTURES, GEERIC SOCKET ADDRESS STRUCTURE, IPV6 SAS,
COPMARISON OF SOCKET ADDRESS STRUCTURE , VALUE- RESULT
ARGUMENTS ,BYTE ORDERIG FUCTIO, MANIPULATIO FUCTIO AND RELATED
FUCTIONS ,ELEMENTARY TCP SOCKETS-SOCKET,CONNECT, BIND FUNCTION
,LISTEN FUNCTION, ACCEPT FUCTION, FORK FUNCTIUON, EXEC FUNCTION
,CONCURRET SERVERS, CLOSE FUNCTION AND RELATED FUNCTION
UNIT-III :TCP CLIENT SERVER
TCP CLIET SERVER COMMUNICATION ,TCP ECHO SERVER,TCP ECHO CLIENT
, SIGNALS- INTRODUCTION ,POSIX SIGNAL HANDLING,SIGNAL FUNCTION
,POSIX SIGNAL SEMANTICS:HADLING SINCHLD SIGALS: INTERRUPTED
SYSTEM CALLS:HADLING THE INTERRUPTED SYSTEM CALLS: DEFFERENCE
BETWEEN WAIT AND WAITPID,CONNECTION ABOUTB BEFORE
ACCEPTBRETURNS: TERMINATION OF SERVER PROCESS: SINPIPE SIGNAL
:CRASHIG OF SERVER HOST: SHUTDOWN OF SERVER
UNIT-1V
WHAT IS I/O MULTIPEXING? NON FORKING CONCURRENT SERVER,FIVE I/O
MODELS ,COMPARISON OF FIVE I/O MODELS,BLIOCKING I/O, NON
BLOCKINGI/O,I/OMULTIPLEXING ,SIGNAL DRIVEN I/O, ASYNCHRONOUS I/O,
SYNCHRONOUS I/O VERSUS ASYNCHRONOUS I/O,IPV4 SOCKET
OPTIONS,IPV6 SOCKET OPTIONS,TCP SOCKETS OPTIIONS ,FCNTL FUNCTIO
UNIT-V
ITRODUCTION ,RECVFROM AND SENDTO FUNCTION ,UDP ECHO
SERVER,UDP ECHO CLIENT.LOST DATAGRAME,VERIFYING RECEIVED
RESPONCSE,SEVER NOT RUNNIG, CONNECT FUNCTION WITH UDP LACK OF
FLOW CONTROL WITH UDP,DETERMIING OUTGOING INTETFACE WITH UDP,
TCP AND UDP ECHO SERVER USING SELECT
UNIT-VI
DOMAIN NAME SYSTEM ,GETHOSTBYNAME FUNCTION ,RES_USE_INET6
FUNCTION AND IPV6 SUPPORT,GETHOSTBYADDR FUNCTIONS ,UNAME AND
GETHOSTNAME FUNCTIONS,GETSERVBYNAME AND GETSERVBYPORT
FUNCTIOS ,OTHER NETWORKING INFORMATION
MTIT 3RD
GROUP-B
UNIT-1
NUMBER SYSTEM AND GATE LEVEL MINIMIZATION
INTRODUCTION OF ANLOG AND DIGITAL SIGALS,NUMBER SYSTEM,
INTERCONVERSION OF NUMBER,SIGNED BINARY NUMBER,COMPLEMENT
REPRESATATION,ARITHMETIC OPERATION USING COMPLEMENTS,BINERY
CODES, ERROR DETECTING AND CORRECTING CODES, FLOATING POINT
REPRESANTATION MIIMIZATIO OF BOOLEAN EXPRESSION, KARNAUGH –
MAP SIMPLIFICATION,SIMPLIFICATION OF SOP USING K-MAP,NAND AND
NOR IMPLEMENTATION ,QUINE MCCLUSKY METHOD,
UNIT-2
INTRODUCTION ,BINERY ADDER,N-BIT PARALLEL ADDER,(CLA),BCD
ADDER,BINERY SUBTRACTOR, BINERY PARALLEL SUBTRECTOR ,BINERY 4BIT PARALLEL ADDER –SUBTRACTOR,BINERY MAULTIPLIER, MAGNITUDE
COMPARATOR,DECODERS,ENCODERS,MALTIPLIEXERS, DEMALTIPLIEXERS,
UNIT-3
SYCHRONOUS SEQUENTIAL LOGIC ,LATCHES,FLIP-FLOP ,CLOCKED S-R FLIPFLOP, J-K FLIP-FLOP LIMITATIONS OF J-K FLIP-FLOP, MASTER SLAVE J-K
FLIP-FLOP,T-FLIP-FLOP ,FLIP-FLOP CONVERSION,ANALYSIS OF CLOCKED
SEQUENTIAL CIRCUITS,STATE REDUCTION AND STATE ASSGNMENT,DESIGN
PROCEDURE,SHIFT REGISTER AND ITS CLASSIFICATION,BIDIRECTIONAL
SHIFT REGESTER UNIVERSAL SHIFT REGSETER ,APPLICATION SHIFT
REGISTER,COUNTERS , MODULUS OF COUNTER,(2 BIT UP COUNTER) UP
DOWN COUNTER RIPPLE COUNTER, ,MODULUS COUNTER, SYNCHRONOUS
COUNTERS, COUTER APPLICATION ,
UNIT-4
MEMORY PROGRAMMING LOGIC AND DESIGN AT RTL(ASM)
INTRODUCTION, CLASSIFICATION OF MEMORY, RAM,SRAM ,DRAM, NVRAM,
ROM,,FLASH MOMERY,ALGORITHMIC STATE MACHINE (ASM)
UNIT-5
ASYNCHORONOUS SEQUENTIAL LOGIC AND HAZARDS
INTRODUCTION, MODEL OF ASYNCHRONOUS SEQUENTIAL SYSTEM ,RACE
CONDITION, STABLITY CONSIDRATION, DESIGN PROCEDURE ,RACE FREE
STATE ASSIGNMENT ,HAZARDS, HAZARDS IN SEQUENTIAL CIRCUITS
VLSI DESIGN
MTIT (ELECTIVE)
SYLLBUS
UNIT-1
ITRODUCTION TO ITEGRATION CIRCUIT TECHOLOGY, CMOS FABRICATIO
THE P-WELL PROCESS,N-WELL PROCESS. BI-CMOS TECHNOLOGY,BASIC
ELECTRICAL PROPERTIES OF MOS CIRCUITS IDS -VDS
RELATIONSHIP,MOS
TRANSISTER THRESHED VOLTAGE VT TRANS CODUCTANC AND OUTPUT CONDUCTANCE
MOS TRASISTER FIGURE OF MARIT
UNIT-2
THE N-MOS INVERTER ,PULL UP
TO PULL-DOW RATIO ,CMOS INVERTER AND ITS
CHARACTERSTICS LATCH –UP I CMOS CIRCUTIS ,STICS DIAGRAMES N-MOS DESIG STYLE
,CMOS DESIGN STYLE, LAMBDA BASED DESIGN RULE , BODY EFFECT,SHEET RESISTANCE
,CAPACITANCES OF LAYERS , GATE DELAYS ESTIMATION ,LOGICAL EFFORTS ,SCALING
MODELS AND SCALING FECTORS ,LIMITATION OF SCALING ,LIMITS OF MATURATIONS,
UNIT-3
N-MOS,CMOS NAND GATES, N-MOS NOR GATES , COMBINATIONAL CIRCUITS DESIGN
,SQUENTIAL CIRCUITS DESIGN DESIGN COSIDRATIONS ,PROBLEMS ASSOCIATED WITH
VLSI DESIGN .DESIG METHDOLOGY AD TOOLS ,STANDERDS CELL BASED DESIGN DESIGN
FLOW , AUTTOMATED LAYOUT GENERATION , PLACEMENT,FLOOR PLANNING ROUTING
,PARASITIC EXTRACTION TIMING ANALYSIS,
UNIT-4
FULL CUSTOM DESIGN SEMI CUSTOM DESIGN PROGRAMMABLE LOGIC STRUCTURE ,FIELD
PROGRAMMABLE GATE ARRAYS (FPGA) COFIGURABLE LOGIE BLOCK (CLB)APPLICOTION –
SPECIFIC INTEGRATED CIRCUITS (ASICS)
UNIT-5
DESIGN FOR TESTABILITY FAULTS TYPES AND MODELS ,CONTROLLABILITY AND
OBSERVABILTY ,AD HOC DESIGN TECHNIQUES SCAN BASED TECHNIQUES , BULIT-I TEST
(BIST)TECHNIQUES,CURRET MONITORIG IDDQ TEST .PACKAGING ,PACKEGE PARASITIC
,HEAT DISSIPATION, DESIGN ECONOMICS ,PARAMETRIC YIELD.
MTIT
(ELECTIVE)
EMBEDEDED SYSTEMS
1. EMBEDDED SYSTEM BASICS
EMBEDDED
SYSTEM
SYSTEM,HISTORY,DESIGN
INTRODUCTION
,INTRODUCTION
CHALLENGES,OPTIMIZING
DESIGN
TO
METRICS,
EMBEDDED
TIME
TO
MERKET.APPLICATION OF EMDEDDED DESIGN SYSTEMS AND RECENT TRENDS IN
EMBEDDED SYSETMS, MEMORY MANAGEMENT , HARDWARE AND SOFTWARE DESIGN
TESTING ,COMMUNICATION PROTOCOLS LIKE SPI,12C, CAN,
2. EMBEDDED SYSETM ARCHITECTURE
INTRODUCTION TO ARM CORE ARCHITECTURE,ARM EXTENSIO FAMILY, INSTRUCTION SET
THUMB INSTRUCTION SET PIPLINE , MEMORY MANAGEMENT ,BUS ARCHITECTURE , STUDY
OF ON-CHIP PERIPHERALS LIKE I/O PORYS ,TIMES, COUNTERS,INTERRUPTS,ON-CHIP
ADC,DAC,RTC MODULES, WDT, PLL, PWM, USB
3.INTERFACING DIFFERENT MODULES FOR ARM/ARM BORDERS
INTERFACING AND PROGRAMMING ,BASIC EMBEDDED C PROGRAMES FOR ON-CHIP
PERIPHERALS STUDIED IN SYSETM ARCHITECTURE.NEED OF INTERFACING .INTERFACIG
TECHNIQUES,
INTERFACING
OF
DIFFERENT
DISPLAYS
INCLUDINGS
GRAPHIC
LCD(320X240),INTERFACING OF INPUT DEVICES ICLUDING TOUCH SCREEN ,INTERFACING
OF OUTPUT DEVIECS LIKE THERMAL PRINTER ,EMBEDDED COMMUNOCATION USING CAN
AND ETHERNET, RF MODULES, GSM MODE FOR AT COMMAND STUDY
UNIT-4 REAL TIME OPERATINGB SYSTEM CONCEPT
ARCTITECTURE OF KERNEL ,TASK SCHEDULER, KERMEL OBJECTS: SEMAPHORES ,MAILBOX,
MASSAGE
,QUEUES,PIPES,EVENTS,TIMER.MOMERY
ANAGEMENT
ROTS
SERVICES
IN
CONTRAST WITH TRADITIONAL OS,INTRIDUCTION TO UCOSII RTOS,STUDY OF KERNEL
STRUCTURE OF UCOSLL OF UCOSLL,MEMORY MANAGEMET IN UCOSLL, PORTING OF RTOS,
UNIT-5 EMBEDDED LINUX
INTRODUCTION TO THE LINUX KERNEL ,CONFIGURARING AND BOOTING THE KERNEL, THE
ROOT FILE SYSTEM, ROOT FILE DIRECTORRIES, /DISK,RAM, FLASH,AND NETWORK, SOME
DEBUG
TECHNIQUES-SYSLOG
CONFIGURATION,DEVICE
AND
CONTROL
STRACE,GDB,
FROM
DIRECTLY,MULTI PROCESSING ON LINIUX
USER
TCP/IP
NETWORKIG
–NETWORK
SPACE
ACCESSING
HARDWARE
MTIT(ELECTIVE)
WIRELESS AND MOBILE NETWORK
RADIO,ETYMOLOGY,PROCESSES,TRASMITTER
PROPAGATION,ERESONACE,RADIO
BAND,
AND
MODULOGY,
COMMUNICATION
SYSTEM
,USES
OF
RADIO,TELEPHOY,VIDEO,NAVIGATION, RADERV ,HEATING,ULICENSED RADIO SERVICES,
RADIO CANTROL ,BEEFITS OF RADIO COMMUNICATIONS,COMPONENT OF WRIELESS SYSTEM
WRIELESS SYSTEM CAPACITY ENGINEERING,CELL SPLINTTING .OVERLATY/UDERLAY
ENGINEERINEG ,DRIECTED ENTRY,SECTORIZATION,THE GRIDE ANGLE,TOWER MOUMTING
OF DRIECTIONAL TRANSMIT AD RECIVE ANTENNAS ,DIRECTIOAL CHAIN ,SECTORIZATIONAL
IMPORT ON SYSTEM DESIGN FRONT –TO-BACK RADIO IN SECTORZED CELLS ,SWITCHED
BEAM
SYSETMS,
ADAPTIVE
TECHNOLOGY,INTRODUCTION
ARRAY
TO
SYSTEM
QAM,QAM
,TYPES
OF
WITH
WIRELESS
DFE,SPREAD
SPECTRUM,FHHS,FDM,OFDM,VOFDM, BENEFITS OF USING WIRELESS SOLUTIONS ,EXAMPLE
IMPLIMEATION
,MULTIPATH,IP
WIRELESS
SYSTEM
ADVANTAGE,MULTIPLE
SCCESS
TECHNIQUES ,REAL TIME POLLING SERVISES ,BESTB EFFORT SERVICES COMMITTED
INFORMATION RATE, POWER CONTROL,ADMMISION CONTROL,SYSTEM
METRICS,SUPERCELL
NETWORK
PRODUCTS,WLAN
PROPAGATION
MTIT (GROUP-C)
UNIT-1
E-COMMERCE M-COMMERCE &NETWORK SECURITY
STANDARDS
PERFORMANCE
COMPRISON,RADIO
INTRODUCTION
OF
E-COMMERCE,FEATURES
OF
E-COMMERCE,EVOLUTION
OF
E-
COMMERCE,DIFFERENCE BETWEEN EARLY E-COMMERCE & TODAY ‘ E-COMMERCE,FECTORS
OF
E-COMMERCE
ITRODUCTIO
OF
M-COMMERCE,APPLICATIO
OF
E-COMMERCE,M-
COMMERCE SECURITY CONCERN
UNIT-2 MODEL OF NETWORK SECURITY
INTRIDUCTIO OF NETWORK SECURITY MODEL ,NEED FOR NETWORK SECURITY
MODEL,PHYSICAL
LAYER,VLAN
LAYER,ADMINISTATIVE LAYER,
LAYER,
ACL
LAYER,
SOFTWARE,LAYER,USER
IT DEPARTMENT,LAYER,WORKING
WITH NETWORK
SECURITY MODEL,
UNIT-3 OSI SECURITY ARCHIYECTURE
INTRODUCTION
OF
OSI
SECURITY
ARCHITECTURE
,SECURITY
MECHANISM,SECURITY SERVICES
UNIT-4 GOALS OF NETWORK SECURITY
INTRODUCTION OF GOALS OF NETWORK
SECURITY,CONFIDENTIALITY,INTEGRATY,AVAILABILTY ,NONREPUDIATION,AUTHENTICATION ACCESSSIBILITY
UNIT-5SIMPLIFICATIO OF BOOLEA FUNCTIONS
INTERODCTION ,METHODS OF BOOLEAN FUNCTION ,KARNAUGH MAP
METHOD,EXAMPLE,ADVANTAGE OF KARNAUGH MAP METHOD
BLOCK-2: FIREWALL
UNIT-1: INTRODUCTION OF FIREWALLS
ATTECKS,SECURITY
BLOCK-3: THREATS IN NETWORKS
UNIT-1: ITRODUCTIO OF THREATS I NETWORKS
BLOCK-4: SECURITY PRACTICE
UNIT-1: INTRODUCTIO OF SECURITY PRACTICE