gandhi institute of technology and management …...m.tech. in information technology department of...
TRANSCRIPT
GANDHI INSTITUTE OF TECHNOLOGYAND MANAGEMENT
(GITAM)(Deemed to be University, Estd. u/s 3 of UGC Act 1956)VISAKHAPATNAM HYDERABAD BENGALURU
Accredited by NAAC with ‘A’ Grade
REGULATIONS AND SYLLABUSof
Master of Technologyin
Information Technology(w.e.f 2015-16 admitted batch)
A University Committed to ExcellenceA University Committed to Excellence
VISIONTo become a global leader in higher education.
MISSIONTo impart futuristic and comprehensive
education of global standards education of global standards with a high sense of discipline and
social relevance in a serene and invigorating environment.
GANDHI INSTITUTE OF TECHNOLOGYAND MANAGEMENT
(GITAM)(Declared as Deemed to be University U/S 3 of UGC Act, 1956)
VISAKHAPATNAM * HYDERABAD * BENGALURU
Accredited by NAAC with ‘A’ Grade
REGULATIONS AND SYLLABUSOF
Master of Technologyin
Information Technology(w.e.f 2015 -16 admitted batch)
A University Committed to Excellence
1
M.Tech. in Information TechnologyREGULATIONS
(w.e.f. 2015-16 admitted batch)
1. ADMISSION
1.1 Admission into M.Tech. in Information Technology program ofGITAM University is governed by GITAM University admissionregulations.
2. ELIGIBILITY CRITERIA
2.1 A pass in B.E./B.Tech./AMIE in any branch of Engineering or itsequivalent.
2.2 Admissions into M.Tech. will be based on the following:
(i) Score obtained in GAT (PG), if conducted.
(ii) Performance in Qualifying Examination / Interview.
2.3 The actual weightage to be given to the above items will be decidedby the authorities before the commencement of the academic year.Candidates with valid GATE score shall be exempted from appearingfor GAT (PG).
3. CHOICE BASED CREDIT SYSTEM
3.1 Choice Based Credit System (CBCS) is introduced with effect fromthe admitted Batch of 2015-16 based on UGC guidelines in orderto promote:
• Student Centered Learning• Cafeteria approach• Students to learn courses of their choice• Learning at their own pace• Inter-disciplinary learning
3.2 Learning goals/ objectives and outcomes are specified leading towhat a student should be able to do at the end of the program.
4. STRUCTURE OF THE PROGRAM
4.1 The Program Consists of
i) Core Courses (compulsory) which give general exposureto a Student in Information Technology and subject relatedarea.
ii) Programme Electives.
iii) Open electives.
2
4.2 Each course is assigned a certain number of credits depending uponthe number of contact hours (lectures/tutorials/practical) per week.
4.3 In general, credits are assigned to the courses based on thefollowing contact hours per week per semester.• One credit for each Lecture / Tutorial hour per week.• One credit for two hours of Practicals per week.• Two credits for three (or more) hours of Practicals per week.
5. MEDIUM OF INSTRUCTION
The medium of instruction (including examinations and projectreports) shall be English.
6. REGISTRATION
Every student has to register himself/herself for each semesterindividually at the time specified by the Institute / University.
7. ATTENDANCE REQUIREMENTS
7.1 A student whose attendance is less than 75% in all the courses puttogether in any semester will not be permitted to attend the end- semester examination and he/she will not be allowed to registerfor subsequent semester of study. He/she has to repeat the semesteralong with his / her juniors.
7.2 However, the Vice Chancellor on the recommendation of thePrincipal / Director of the Institute/School may condone the shortageof attendance to the students whose attendance is between 66% and74% on genuine grounds and on payment of prescribed fee.
8. EVALUATION
8.1 The assessment of the student’s performance in a Theory courseshall be based on two components: Continuous Evaluation (40marks) and Semester-end examination (60 marks).
8.2 A student has to secure an aggregate of 40% in the course in thetwo components put together to be declared to have passed thecourse, subject to the condition that the candidate must havesecured a minimum of 24 marks (i.e. 40%) in the theory componentat the semester-end examination.
8.3 Practical/ Project Work/ Industrial Training/ Viva voce/ Seminar etc.course are completely assessed under Continuous Evaluation fora maximum of 100 marks, and a student has to obtain a minimumof 40% to secure Pass Grade. Details of Assessment Procedure arefurnished below in Table 1.
3
Table 1: Assessment Procedure
S.No. Component of Marks Type of Scheme of EvaluationAssessment Allotted Assessment
1 Theory 40 Continuous i) Thirty (30) marks for midEvaluation Semester examinations. Three mid
examinations shall be conducted for15 marks each; performance in besttwo shall be taken into consideration.ii) Ten (10) marks for Quizzes,Assignments and Presentations.
60 Semester-end Sixty (60) marks for Semester-endExamination examinations
Total 100
2 Practicals 100 Continuous i) Fifty (50) marks for regularity andEvaluation performance, records and oral
presentations in the laboratory.Weightage for each component shallbe announced at the beginning of theSemester.ii) Ten (10) marks for case studies.iii)Forty (40) marks for two tests of20 marks each (one at the mid-termand the other towards the end of theSemester) conducted by theconcerned lab Teacher.
3 Project work 100 Continuous i) Forty (40) marks for periodic(III Semester ) Evaluation evaluation on originality, innovation,
sincerity and progress of the work,assessed by the Project Supervisor.ii) Thirty (30) marks for mid-termevaluation for defending the Project,before a panel of examiners.iii)Thirty (30) marks for final Reportpresentation and Viva-voce, by apanel of examiners
4 Project work 50 Continuous i) Twenty (20) marks for Periodic(IV Semester) Evaluation evaluation on originality
innovation, sincerity and progress of thework, assessed by the Project Supervisor.ii) Fifteen (15) marks for mid-termevaluation for defending the Project,before a panel of examiners*.iii) Fifteen (15) marks for interim Reportpresentation and Viva-voce.
4
50 Semester-end Fifty (50) marks for final ReportExamination presentation and Viva-voce assessed by
external examiners.Total 100
5 Comprehensive 100 Continuous Through five periodic Viva-voce exams forViva-voce Evaluation 20 marks each, conducted by a panel
(II Semester) of examiners. The course contentfor Viva exams shall be announced at thebeginning of the Semester.
*Panel of Examiners shall be appointed by the concerned Head of the Department
9. REAPPEARANCE
9.1 A student who has secured ‘F’ grade in a Theory course shall haveto reappear at the subsequent Semester end examination held forthat course.
9.2 A student who has secured ‘F’ grade in a Practical course shall haveto attend Special Instruction Classes held during summer.
9.3 A student who has secured ‘F’ Grade in Project work / IndustrialTraining etc shall have to improve his/her report and reappear forViva – voce at the time of Special Examination to be conductedin the summer vacation.
10. SPECIAL EXAMINATION
10.1 A student who has completed his/her period of study and still has“F” grade in a maximum of three theory courses is eligible to appearfor Special Examination normally held during summer vacation.
11. BETTERMENT OF GRADES
A student who has secured only a Pass or Second class and desiresto improve his/her Class can appear for Betterment Examinationsonly in Theory courses of any Semester of his/her choice, conductedin Summer Vacation along with the Special Examinations.Betterment of Grades is permitted ‘only once’ immediately aftercompletion of the program of study.
12. GRADING SYSTEM
12.1 Based on the student performance during a given semester, a finalletter grade will be awarded at the end of the semester in eachcourse. The letter grades and the corresponding grade points areas given in Table 2.
5
Table 2: Grades & Grade Points
Sl.No. Grade Grade Points Absolute Marks1 O (outstanding) 10 90 and above
2 A+ (Excellent) 9 80 to 89
3 A (Very Good) 8 70 to 79
4 B+ (Good) 7 60 to 69
5 B (Above Average) 6 50 to 59
6 C (Average) 5 45 to 49
7 P (Pass) 4 40 to 44
8 F (Fail) 0 Less than 40
9 Ab. (Absent) 0 -
12.2 A student who earns a minimum of 4 grade points (P grade) in acourse is declared to have successfully completed the course, andis deemed to have earned the credits assigned to that course, subjectto securing a GPA of 5 for a Pass in the semester.
13. GRADE POINT AVERAGE
13.1 A Grade Point Average (GPA) for the semester will be calculatedaccording to the formula:
Σ [ C X G ]GPA = ——————
Σ CWhere
C = number of credits for the course,G = grade points obtained by the student in the course.
13.2 To arrive at Cumulative Grade Point Average (CGPA), a similarformula is used considering the student’s performance in all thecourses taken, in all the semesters up to the particular point of time.
13.3 CGPA required for classification of class after the successfulcompletion of the program is shown in Table 3.
Table 3: CGPA required for award of Class
Class CGPA Required
First Class with Distinction > 8.0*
First Class > 6.5
Second Class > 5.5
Pass Class > 5.0
* In addition to the required CGPA of 8.0 or more, the student must havenecessarily passed all the courses of every semester in first attempt.
6
14. ELIGIBILITY FOR AWARD OF THE M.Tech. DEGREE
14.1 Duration of the program: A student is ordinarily expected tocomplete the M.Tech. program in four semesters of two years.However a student may complete the program in not more thanfour years including study period.
14.2 However the above regulation may be relaxed by the ViceChancellor in individual cases for cogent and sufficientreasons.
14.3 A student shall be eligible for award of the M.Tech. Degreeif he / she fulfills all the following conditions.
a) Registered and successfully completed all the coursesand projects.
b) Successfully acquired the minimum required credits asspecified in the curriculum corresponding to the branchof his/her study within the stipulated time.
c) Has no dues to the Institute, hostels, Libraries, NCC /NSS etc, and
d) No disciplinary action is pending against him / her.
15. DISCRETIONARY POWER
Not withstanding anything contained in the above sections, theVice Chancellor may review all exceptional cases, and give hisdecision, which will be final and binding.
7
M.Tech. in Information TechnologyDepartment of Information Technology
Effective from academic year 2015-2016 admitted batch
Semester II
S.No. Course Course Category L T P CCode Title
1 EIT702 Distributed OperatingSystems CE 4 0 0 4
2 EIT704 Mobile Technologies CE 4 0 0 4
3 EIT706 Middleware Technologies CE 4 0 0 4
4 EIT 75X Program Elective –II PE 4 0 0 4
5 EIT 76X Program Elective –III PE 4 0 0 4
6 EZZ 7XX Open Elective – II OE 3 0 0 3
7 EIT722 Middleware TechnologiesLab CE 0 0 3 2
8 EIT792 Technical Seminar II CE 0 0 3 2
9 EIT794 Comprehensive Viva-voce CE 2
29
Semester I
S.No. Course Course Category L T P CCode Title
1 EIT701 Advanced Data Structures& Algorithms CE 4 0 0 4
2 EES741 Advanced ComputerNetworks CE 4 0 0 4
3 EIT705 Advanced ComputerArchitecture CE 4 0 0 4
4 EIT707 Advanced Data warehouse and Data mining CE 4 0 0 4
5 ECS7XX Program Elective-I PE 4 0 0 4
6 EYYXXX Open Elective - I OE 3 0 0 3
7 EIT721 Advanced DataStructures Lab CE 0 0 3 2
8 EIT791 Technical Seminar-I CE 0 0 3 2
27
8
Semester III
S.No. Course Course Category L T P CCode Title
1 EIT891 Project Work CE 8
8
Semester IV
S.No. Course Course Category L T P CCode Title
1 EIT892 Project work-II CE 16
16
Number of Credits
Semester I II III IV Total
Credits 27 29 8 16 80
Open Elective-I
S.No. Course Course Category L T P CCode Title
1. EME781 Optimization Techniques OE 3 0 0 3
2. EEI781 Micro Processors &Interfacing OE 3 0 0 3
3. EEI783 VLSI Design OE 3 0 0 3
4. EIE783 E-commerce OE 3 0 0 3
Open Elective-II
S.No. Course Course Category L T P CCode Title
1. EEC7534 Embedded SystemDesign OE 3 0 0 3
2. EEC789 Fundamentals of DigitalSignal Processing OE 3 0 0 3
3. ECE781 Remote Sensing andGeographical Informationsystems OE 3 0 0 3
4. EIE781 Project Management OE 3 0 0 3
9
PROGRAMME ELECTIVESProgramme Elective - I
S.No. Course Course Category L T P CCode Title
1 EIT741 Cryptography & NetworkSecurity PE 4 0 0 4
2 EIT743 Pattern Recognition PE 4 0 0 4
3 EIT745 Soft Computing PE 4 0 0 4
Programme Elective-II
S.No. Course Course Category L T P CCode Title
1 EIT 752 Bioinformatics PE 4 0 0 4
2 EIT 754 Digital Image Processing PE 4 0 0 4
3 EIT 756 Internet Technologies andCyber Laws PE 4 0 0 4
Programme Elective-III
S.No. Course Course Category L T P CCode Title
1 EIT 762 Big Data Analytics PE 4 0 0 4
2 ECS751 Cloud Computing PE 4 0 0 4
3 ECS714 Social Network Analysis PE 4 0 0 4
10
EIT701 : ADVANCED DATA STRUCTURES &ALGORITHMS
L T P C 3 1 0 4
Module I 12 HoursAlgorithms, performance analysis-time complexity and space complexity, O-notation, Omega notation and Theta notation, review of basic data structures- the list ADT, stack ADT, queue ADT, implementation using template classesin C++, sparse matrix representation.
Module II 10 HoursDictionaries, linear list representation, skip list representation, operations-insertion, deletion and searching, hash table representation, hash functions,collision resolution-separate chaining, open addressing-linear probing, quadraticprobing, double hashing, rehashing, extendible hashing, comparison of hashingand skip lists.
Module III 10 HoursSearch trees - Binary search trees, definition, ADT, implementation, operations-searching, insertion and deletion.Balanced search trees- AVL trees, definition, height of an AVL tree, representation,operations-insertion, deletion and searching.Introduction to Red –Black trees and Splay Trees, B-Tree of order m, heightof a B-Tree, insertion, deletion and searching, comparison of search Trees.
Module IV 10 HoursDivide and Conquer - General method, applications – Binary search, merge sort,quick sort, Strassen’s matrix multiplication Efficient non recursive tree traversalalgorithms, bi-connected components, disjoint set operations, union and findalgorithms.
Module V 10 HoursGreedy method and Dynamic programming - General method (Greedy), minimumcost spanning trees, job sequencing with deadlines, general method (DynamicProgramming), Optimal binary search trees, 0/1 knapsack problem, ordering matrixmultiplications.
Text Book(s)
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 3/e,Pearson Education, 2009.
11
References
1. Michael T.Goodrich, R.Tamassia and D.Mount, Data structures andAlgorithms in C++, 7/e, Wiley and Sons, 2007.
2. Adam Drozdek, Data Structures and Algorithms in C++, 3/e, Thomson, 2012.3. W.Savitch , Problem solving with C++-The OOP, 4/e, Pearson
Education,2012.4. Herbert Schildt, C++-The Complete Reference, 4/e, Tata McGraw Hill, 2012.5. Langsam, Augenstein and Tanenbaum , Data structures using C and C++,
2/e, Pearson Education,1995.
12
EES741: ADVANCED COMPUTER NETWORKSL T P C3 0 0 3
Module I 12 hoursReview of Basic Network Architectures: OSI reference model, TCP/IP referencemodel, ATM reference model, applications(www, audio/video streaming, videoconference, networked games, client/server), traffic characterization (CBR, VBR),switching paradigms; multiplexing; error control; flow control, FTH, DTH, PON,ISDN, DSL, CATV, SONET, optical networks.
Module II 10 hoursLocal Area Network Technologies: MAC techniques, Ethernet, Fast Ethernet,Gigabit Ethernet, Switched Ethernet, IEEE 802.11 ,WLAN, Bluetooth, ConnectingLANs, VLANS,LAN standards: IEEE 802.3,802.4,802.5
Module III 12 hoursInternetworking: Interdomain routing, BGP, IPV6, multicast routingprotocols, multi protocol label switching, virtual private networks, high speedtransport protocols, quality of service mechanisms, improving QOS ininternet, DIFFSERV and INTSERV architectures, RSVP.
Module IV 12 hoursDistributed Systems: Naming, DNS, DDNS, paradigms for communication ininternet, caching, issues of scaling in internet and distributed systems, cachingtechniques for web, protocols to support streaming media, multimedia transportprotocols, content delivery networks, overlay and P2P networks.
Module V 10 hoursApplications and Other Networking Technologies: RTP, RTSP, SIP, VOIP,security systems, SSH, PGP, TLS, IPSEC, DDOS attack, mitigation in internet,security in MPLS, introduction to cellular, satellite and ad hoc networks.
Text Book(s)1. Behrouz A. Forouzan, Data Communications and Networking, 4/e, TMH,
2006.2. Larry L. Peterson and Bruce S. Davie, Computer Networks: A Systems
Approach, 4/e, Morgan Kaufmann, 2007.
References1. Jean Walrand and Pravin Varaiya, High Performance Communication
Networks, 2/e, MorganKauffman, 1999.1. Markus Hoffmann and Leland R. Beaumont, Content Networking:
Architecture, Protocols, and Practice, Morgan Kauffman, 2005.
13
EIT705: ADVANCED COMPUTER ARCHITECTURE L T P C 3 1 0 4
Module I 10 HoursIntroduction to Parallel Processing: Trends towards Parallel Processing,Parallelism in Uniprocessors systems, Parallel computer structures, architecturalclassification schemes, Parallel Processing applications. Memory and Input-Output Subsystem: hierarchical memory architecture, virtual memory system,memory allocation and management, cache memories and managements, input-output sub-systems.
Module II 10 HoursPrinciples of Pipelining and Vector Processing: Pipelining operations:Principles of linear pipelining, classification of pipeline processors, generalpipelines and reservation tables, interleaved memory organization, instruction andarithmetic pipe lines, principles of designing pipelined processors, vectorprocessing requirements.
Module III 10 HoursVector Processor: The architecture of CRAY-1, pipeline chaining and vectorloops, The architecture of CYBER-205, vector processing in CYBER-205.Structures and Algorithms for Array Processors:SIMD array processors, SIMDinterconnection networks parallel algorithms for array processors, Associativearray processing. Case Study: BSP system architecture.
Module IV 8 HoursMultiprocessors Architecture and Programming: Functional structures,interconnection networks, parallel memory organization, multiprocessorsoperating system, exploiting concurrency for multiprocessing.
Module V 8 HoursMultiprocessing Controls and Algorithms: Inter process communicationmechanism, system dead locks and protections, scheduling strategies. Case Study:CRAY: XMP
Text Book(s)1. Kai Hwang and Faye A. Briggs, Computer Architecture and Parallel
Processing, Tata McGraw Hill, 1984.2. K. Hwang , Scalable Parallel Computing, Tata McGraw Hill,1997.
References1. V. Carl Hamacher, Zvonko G. Vranesic, Safwat G. Zaky , Computer
Organization, Tata McGraw Hill, 20022. John L. Hennessy and David A. Patterson, Computer Architecture- A
quantitative approach, 3/e, Morgan Kufmann,2002.3. Dezso Sima, Terence Fountain, Peter Kacsuk, Advanced Computer
Architectures- A Design Space Approach, Pearson Education,1997.
14
EIT707: ADVANCED DATABASE AND DATAMINING
L T P C 3 1 0 4
Module I 8 HoursWeb Database Programming: Structured, Semi structured and unstructuredData, simple PHP example, overview of basic features of PHP and programming.XML(Extensible Markup Language): XML hierarchical data model, XMLdocuments, DTD and XML Schema, XML documents and databases, XMLquerying.
Module II 10 HoursEnhanced Data Bases for Advanced Applications: Active Database Conceptsand Triggers. Spatial Databases, Deductive databases. Data Warehousing:Introduction, definitions and terminology, characteristics of data warehouse,building a data warehouse, typical functionality of data warehouse, datawarehouse versus views, problems and open issues in data warehouse.
Module III 10 HoursData Mining Techniques: Introduction, A Statistical perspective on data mining,Similarity measures, Decision trees, Neural networks, Genetic algorithms.Classification: Introduction, Statistical based algorithms, Distance basedalgorithms, decision tree based algorithms, Neural network based algorithm, Rulebased algorithms.
Module IV 10 HoursClustering: Introduction, similarity and distance measures, outliers, hierarchalalgorithms, partitional algorithms, clustering large data bases, clustering withcategorical attributes. Association Rules: Introduction to large item sets, basicalgorithms, parallel and distributed algorithms, comparing approaches, incrementalrules, advanced association rule techniques, measuring the quality of rules.
Module V 8 HoursWeb Mining: Introduction, web content mining, web structure mining and webusage mining.Spatial Mining: Introduction, spatial data overview, spatial data mining primitives,generalization and specialization, spatial rules, spatial classification algorithms,spatial clustering algorithms.
Text Book(s)1. Ramez Elmasri and Shamkant B.Navathe, Fundamentals of Database Systems,
5/e, Pearson Education, 2009.2. Margaret H. Dunham, Data Mining: Introductory and Advanced Topics,
Pearson Education, 2004.
15
References1. Thomas M. Connolly, Carolyn E. Begg, Database Systems, A Practical
Approach to Design, Implementation, and Management, 3/e, PearsonEducation, 2003.
2. Sam Anahory, Dennis Murry, Data Warehousing in the real world, PearsonEducation 2003.
3. J.Han, M. Kamber, Data Mining: Concepts and Techniques, MorganKauffman, 2001.
16
EIT741: CRYPTOGRAPHY AND NETWORKSECURITY
L T P C 3 1 0 4
Module I 10 HoursIntroduction: Security goals, Attacks, Services and mechanism, techniques,Symmetric key encipherment -Integer arithmetic, modular arithmetic, Traditionalsymmetric key ciphers-substitution cipher, transposition cipher, stream and blockcipher, Modern symmetric key cipher- modern block cipher and stream cipher.
Module II 10 HoursDES structure , DES analysis, multiple DES, security of DES, AES,transformation, key expansion, cipher, analysis of AES, Encipherment usingmodern symmetric key ciphers-use of modern block cipher and streamcipher.RC4, key management, key generation.
Module III 8 HoursAsymmetric Key Cryptography: Introduction, RSA cryptosystem, RABINcryptosystem, ELGAMAL cryptosystem, Message integrity, messageauthentication. Cryptographic hash functions- introduction, SHA512.
Module IV 10 HoursDigital Signature: Comparison, process, services, Digital process scheme- RSAdigital signature scheme, Elgamal digital signature scheme, Digital SignatureStandards (DSS), Key management- symmetric key distribution, Kerberossymmetric key agreement, public key distribution.
Module V 10 HoursSecurity at Application Layer: E-MAIL, PGP, S/ MIME. Security at TransportLayer: SSL architecture, handshake protocols, SSL message formats, Transportlayer security. Security at Network Layer: IPsec, authentication header (AH).,ESP, IPv4,IPv6,AH versus ESP, security provided by IPsec, security association,security policy, internet key exchange, ISAKMP, Firewalls.
Text Book(s)
1. Behrouz A. Forouzan, Cryptography and Network Security, Tata McGrawHill, 2007.
2. William Stallings, Cryptography and Network Security, 3/e, PearsonEducation, 2007.
17
EIT743 : PATTERN RECOGNITIONL T P C3 1 0 4
Module I 8 HoursIntroduction: Basic concepts, applications, fundamental problems in patternrecognition system design, design concepts and methodologies, examples ofautomatic pattern recognition systems, simple pattern recognition model.
Module II 10 HoursDecisions and Probability: Linear and generalized decision functions, patternspace and weight space, geometrical properties, implementations of decisionfunctions, minimum, distance pattern classifications, random variables, jointdistributions and densities, movements of random variables, estimation ofparameter from samples.
Module III 10 HoursStatistical Decision Making: Introduction, Baye’s theorem, multiple features,conditionally independent features, decision boundaries, unequal cost of error,estimation of error rates, the leaving one out techniques, characteristic curves,estimating the composition of populations, Baye’s classifier for normal patterns.
Module IV 10 HoursClustering and Partitioning: Hierarchical Clustering- Introduction,agglomerative clustering algorithm, the single, linkage, complete linkage and averagelinkage algorithm.Ward’s method Partition clustering, Forg’s algorithm, K-meansalgorithm, Isodata algorithm.
Module V 10 HoursPattern Preprocessing and Feature Selection: Introduction, distance measures,clustering transformation and feature ordering, clustering in feature selectionthrough entropy minimization, features selection through orthogonal expansion,binary feature selection.
Text Book(s)1. Gose. Johnsonbaugh Jost , Pattern Recognition and Image Analysis ,Prentice
Hall of India, 2009.
References1. Richard O.Duda, Peter .E.Hart., David .G.Strok, Pattern Classification, 2/
e, Wiley , 2000.
18
EIT745 : SOFT COMPUTING
L T P C 3 1 0 4
Module I 10 HoursIntroduction: Neural Networks, applications,scope of Neural Networks, FuzzyLogic, Genetic algorithm, hybrid systems, soft computing. Artificial NeuralNetwork: Fundamental Concepts, evolution of Neural Networks, basic modelsof Artificial Neural Networks, important terminologies of ANNs, McCulloh,Pitt Neuron, Linear Separability, Hebb Network.
Module II 10 HoursIntroduction to Fuzzy Logic, Classical Sets and Fuzzy Sets: Introductionto Fuzzy Logic, classical Sets, Fuzzy Sets. Classical Relations and FuzzyRelations -Introduction, Cartesian Product of Relation, Classical Relation, FuzzyRelations, Tolerance and Equivalence Relations, Non interactive Fuzzy Sets.Membership Functions-Introduction, Features of the Membership functions,Fuzzification, Methods of Membership Value Assignments. Fuzzy Arithmeticand Fuzzy Measures- Introduction, Fuzzy arithmetic, Extension principle, Fuzzymeasures, Measures of Fuzziness, Fuzzy Integrals .
Module III 10 HoursFuzzy Rule Base and Approximate Reasoning: Introduction, truth values andtables in Fuzzy Logic, Fuzzy propositions, formation of rules, decompositionof rules, aggregation of Fuzzy rules, Fuzzy reasoning , Fuzzy inference systems.Fuzzy decision making-introduction, individual decision making multi persondecision making multi objective decision making, multi attribute decision making,Fuzzy bayesian decision making
Module IV 10 HoursGenetic Algorithm: Introduction, biological background, traditional optimizationand search techniques, genetic algorithm and search space, genetic algorithm vstraditional algorithm, basic terminologies in genetic algorithm, simple GA, generalgenetic algorithm operators in genetic algorithm, stopping condition for geneticalgorithm flow, constraints in genetic algorithm, problem solving using geneticalgorithm.
Module V 8 HoursHybrid Soft Computing Techniques: Introduction, Neuro, Fuzzy hybridsystems, Genetic Neuro Hybrid Systems, Genetic Fuzzy Hybrid and FuzzyGenetic Hybrid Systems, simplified Fuzzy ARTMAP.
Text Book(s)1. S.N.Sivanandam and A.N.Deepika, Principles of Soft Computing, 2/e, Wiley,
2007.
19
References1. Satish Kumar, Neural Networks-A Class Room Approach, TMH, 2004.2. Fakhreddinekarray and Clarence de silva , Soft Computing and Intelligent
Systems -Design Theory, Tools and Applications, Addison Wesley, 2004
20
EIT721 : ADVANCED DATA STRUCTURES &ALGORITHMS LAB
L T P C0 0 3 2
1. Write C++ programs to implement the following using an array. a) Stack ADT b) Queue ADT.2. Write C++ programs to implement the following using a singly linked list. a) Stack ADT b) Queue ADT3. Write C++ program to implement the deque (double ended queue) ADT using
a doubly linked list.4. Write a C++ program to perform the following operations: a) Insert an element into a binary search tree. b) Delete an element from a binary search tree. c) Search for a key element in a binary search tree.5. Write a C++ program to implement circular queue ADT using an array.6. Write C++ programs that use non,recursive functions to traverse the given
binary tree in a) Preorder b) inorder and c) postorder.7. Write a C++ programs for the implementation of bfs and dfs for a given
graph.8. Write C++ programs for implementing the following sorting methods: a) Quick sort b) Merge sort c) Heap sort9. Write a C++ program to perform the following operations a) Insertion into a B,tree b) Deletion from a B,tree10. Write a C++ program to perform the following operations a) Insertion into an AVL,tree b) Deletion from an AVL,tree11. Write a C++ program to implement Kruskal's algorithm to generate a
minimum spanning tree.12. Write a C++ program to implement Prim's algorithm to generate a minimum
spanning tree.13. Write a C++ program to implement all the functions of a dictionary (ADT)
using hashing.
21
EIT791: TECHNICAL SEMINAR-I
L T P C 0 0 3 2
22
EIT702: DISTRBUTED OPERTING SYSTEMSL T P C3 1 0 4
Module I 10 HoursIntroduction: Introduction to distributed system, goals of distributed system,hardware and software concepts, design issues. Communication in distributedsystem: layered protocols, ATM networks, client – server model, remoteprocedure calls and group communication. Middleware and distributed operatingsystems.
Module II 8 HoursSynchronization in Distributed System: Clock synchronization, mutualexclusion, election algorithm, the bully algorithm, a ring algorithm, atomictransactions, deadlock in distributed systems, distributed deadlock prevention,distributed deadlock detection.
Module III 10 HoursProcesses and Processors in Distributed Systems: Threads, system models,processors allocation, scheduling in distributed system, real time distributedsystems.
Module IV 10 HoursDistributed File Systems: Distributed file system design, distributed file systemimplementation, trends in distributed file systems. Distributed shared memory- what is shared memory, consistency models, page based distributed sharedmemory, shared variables distributed shared memory.
Module V 10 HoursFault Tolerance: Concepts, failure models, failure masking by redundancy.Case Study: MACH, process management, memory management, communication,UNIX emulation
Text Book(s)1. Andrew S. Tanenbaum, Distributed Operating Systems, Prentice Hall of
India,1992.
References1. Andrew Tannenbaum and Maarten van Steen, Distributed Systems: Principles
and Paradigms, PHI,1992.2. Pradeep K. Sinha , Distributed Operating Systems : Concepts and Design,
Wiley,1996.3. Randy Chow, Theodore Johnson, Distributed Operating Systems and
Algorithm Analysis, Pearson Education,1997.
23
EIT704: MOBILE TECHNOLOGIES L T P C 3 1 0 4
Module I 10 HoursIntroduction to Mobile Communications and Computing: Introduction toMC, novel applications, a simplified reference model, cellular systems.Introduction to adhoc and infrastructure networks and their comparison. MediumAccess Control -Motivation for a specialized MAC (Hidden and exposedterminals, near and far terminals), SDMA, FDMA, TDMA, CDMA, comparisonof S/T/F/CDMA.
Module II 10 HoursGSM : Mobile services, System architecture, radio interface, protocols,localization and calling, handover, security, and new data services. Mobile AdhocNetworks (MANETs) - Overview, properties of a MANET, spectrum ofMANET applications, routing and various routing algorithms, security inMANETs.
Module III 8 HoursMobile Network Layer: Mobile IP (goals, assumptions, requirements entitiesand terminology, IP packet delivery, agent discovery, registration, tunneling andencapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).
Module IV 10 HoursMobile Transport Layer : Traditional TCP(congestion control, slow start, Fastretransmit/fast recovery implications on mobility, classical TCP improvements(indirect TCP, snooping TCP, mobile TCP, fast retransmit/fast recovery,transmission /time out freezing, selective retransmission, transaction orientedTCP),TCP over 2.5/3G wireless networks
Module V 10 HoursWireless Application Protocols: Architecture, wireless data gram protocol,wireless transport layer protocol, wireless transaction layer protocol, wirelesssession layer protocol, wireless application environment. IEEE802.11- Systemarchitecture, protocol architecture .
Text Book(s)1. Jochen Schiller, Mobile Communications, 2/e, Pearson Education,2009.
References1. Reza Behravanfar, Mobile Computing Principles: Designing and Developing
Mobile Applications with UML and XML, Cambridge University Press,2004.
2. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden, Schwiebert, Loren,Fundamentals of Mobile and Pervasive Computing, TMH, 2005.
24
EIT706: MIDDLEWARE TECHNOLOGIES L T P C 3 1 0 4
Module I 10 HoursIntroduction to Client Server Computing: Evolution of corporate computingmodels from centralized to distributed computing, client server models, benefitsof client server computing, pitfalls of client server programming. CORBA withJava- Review of java concept like RMI, RMI API, JDBC, Client/Server CORBAstyle, the object web-CORBA with Java.
Module II 10 HoursIntroducing C# and the .NET Platform: Understanding .NET Assemblies,Object Oriented Programming with C# - callback interfaces, delegates, and events.Building C# applications - type reflection, late binding, attribute basedprogramming, serialization and the .NET Remoting Layer- data access withADO.NET, XML Web Services.
Module III 10 HoursCore CORBA / Java: Two types of Client/ Server invocations, static, dynamic,thestatic CORBA, first CORBA program, CORBlets with Applets, DynamicCORBA,the portable count, the dynamic count multicounty. Existential CORBA-CORBA initialization protocol, CORBA activation services, CORBAIDLmapping CORBA java to IDL mapping, the introspective CORBA/Java object.
Module IV 8 HoursJava Bean Component Model: Events, properties, persistency, introspectionof beans, CORBA Beans.
Module V 10 HoursEJBS and CORBA: Object transaction monitors CORBA OTM’s, EJB andCORBA OTM’s, EJB container frame work, session and entity Beans, The EJBclient/server development process, the EJB container protocol, support fortransaction EJB packing EJB design guidelines.
Text Book(s)
1. Robert Orfali and Dan Harkey, Client/Server Programming with Java andCORBA, 2/e, Wiley, 1998.
2. G.Brose, A Vogel and K.Duddy, Java programming with CORBA, 3/e, Wiley,1998.
25
EIT752: BIOINFORMATICSL T P C3 1 0 4
Module I 10 HoursIntroduction: Basic biology, genetic material, genes, what molecules code forgenes, structure of DNA, what carries information between DNA and proteins,proteins, analysis of DNA, why bioinformatics.
Module II 10 HoursExhaustive Search: Restriction mapping, impractical restriction mappingalgorithm , practical Restriction mapping algorithm, Regulatory motifs in DNAsequences, profiles, the motif finding problem, search trees, finding motifs , findinga median string.
Module III 8 HoursGreedy Algorithms: Genome rearrangement, sorting by reversals, approximationalgorithm, breakpoints, greedy approach for motif finding.
Module IV 10 HoursDynamic Programming Algorithm: Edit distance and assignments, longestcommon subsequence, global sequence alignment, scoring alignment, local sequencealignment, alignment with gap penalties, multiple alignment, gene prediction,statistical approach to gene prediction, Similarity based approach to geneprediction
Module V 10 HoursClustering and Trees: Gene expression analysis, hierarchical clustering, K-meanclustering, clustering and corrupted cliques, evolutionary tree, distance based treeconstruction, reconstructing tree for additive matrices, evolutionary tree andhierarchical clustering, character based tree clustering.
Text Book(s)
1. Jones, N. and Pevzner, P., An introduction to Bioinformatics Algorithms,MIT Press, 2004.
References
1. Durbin, R., Eddy, S., Krogh, A., Mitchison, G. , Biological Sequence Analysis:Probabilistic models of proteins and nucleic acids, Cambridge UniversityPress,1998
2. Gusfield, D., Algorithms on Strings, Trees, and Sequences.CambridgeUniversity Press,1997.
3. Waterman, M., Introduction to Computational Biology: Maps, sequences andgenomes, CRC Press,1995.
4. Aluru, S.,Handbook of Computational Molecular Biology, CRC Press,2006.
26
EIT754: DIGITAL IMAGE PROCESSING L T P C 3 1 0 4
Module I 10 HoursIntroduction: What is Digital Image Processing, Examples of fields that use digitalimage processing, fundamental steps in digital image processing, components ofimage processing system.. Digital Image Fundamentals: A simple image formationmodel, image sampling and quantization, basic relationships between pixels.
Module II 10 HoursImage Enhancement in the Spatial Domain: Basic gray, level transformation,histogram processing, enhancement using arithmetic and logic operators, basicspatial filtering, smoothing and sharpening spatial filters.
Module III 10 HoursImage Restoration: A model of the image degradation/restoration process, noisemodels, restoration in the presence of noise–only spatial filtering, Weiner filtering,constrained least squares filtering, geometric transforms; Introduction to theFourier transform and the frequency domain, estimating the degradation function.Color Image Processing- Color fundamentals, color models.
Module IV 10 HoursImage Compression: Fundamentals, image compression models, LosslessCompression- Huffman coding, Run length coding contour coding,a briefdiscussion on Lossy Compression Image compression standards. MorphologicalImage Processing: Preliminaries, dilation, erosion, open and closing, hit or misstransformation, basic morphologic algorithms.
Module V 8 HoursImage Segmentation: Detection of discontinuous, edge linking and boundarydetection, threshold, region–based segmentation.
Text Book(s)
1. Rafeal C. Gonzalez, Richard E. Woods, Digital Image Processing, 2/e, PearsonEducation, 2002.
References
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, Image Processing, Analysis,and Machine Vision, 2/e, Thomson Learning, 2007.
2. Alasdair Mc Andrew , Introduction to Digital Image Processing with Matlab-Thomson Course Technology, Brooks/Cole,2004.
3. Adrian Low , Computer Vision and Image Processing, , 2/e, B.S.Publications,2008.
4. Rafeal C.Gonzalez, Richard E.Woods, Steven L. Eddins, Digital ImageProcessing using Matlab, Pearson Education,2003.
27
EIT756: INTERNET TECHNOLOGY ANDCYBER LAWS
L T P C3 1 0 4
Module I 10 HoursCrimes of this millennium, checks and balances against arbitrary arrests, conceptof cyber crime and the it act, hacking, teenage web vandals ,cyber fraud and cybercheating ,virus on the internet, other IT act offences ,network service providers,criminal justice in India and implications.
Module II 10 HoursContracts in the InfoTech world, click wrap and shrink wrap contracts, contractformation under the Indian context, contract formation on the internet, termsand conditions of the contract, jurisdiction and information technology act, foreignjudgments in India, IPR disputes – misuse of the law of jurisdiction, jurisdictionaldisputes with respect to the internet in USA.
Module III 10 HoursConcept of domain name and reply to cyber squatters, meta-tagging, copyrightownership and assignment, license of copyright, copyright term and respect forforeign works, copyright infringement remedies and offences, copyright protectionof content on the internet, computer software piracy.
Module IV 10 HoursConcept of permanent Establishment, PE in cross border E-Commerce , themoduled nations model tax treaty, law of double taxation avoidance agreements,tax Agents of non residents under the income tax act and the relevance to E-Commerce, impact of the internet on customs duties, taxation policies in India.
Module V 10 HoursDigital signatures, digital signature certificate, certifying authorities and liabilityin the event of digital signature compromise ,status of electronic records asevidence ,proving digital signatures, proof of electronic agreements, provingelectronic messages, goods and services, consumer complaint, defect in goodsand deficiency in services, restrictive and unfair trade, practices, reliefs underCPA ,consumer forums, jurisdictions and implications on cyber consumers inIndia.
Text Book(s)1. Vivek Sood, Cyberlaw Simplified, Tata McGraw Hll, 2001.
References1. Godbole, Information Systems Security, Wiley, 2008.2. Merkov, Breithaupt, Information Security, Prentice Hall of IndiaHI, 2005.3. Yadav, Foundations of Information Technology, 3/e, New Age, 2006.
28
EIT762: BIGDATA ANALYTICS
L T P C3 1 0 4
Module I 10 HoursINTRODUCTION TO BIG DATA: What is big data ,why big data , convergenceof key trends ,unstructured data ,industry examples of big data ,web analytics,big data and marketing, fraud and big data , risk and big data ,credit riskmanagement , big data and algorithmic trading ,big data and healthcare , big datain medicine , advertising and big data , big data technologies , introduction toHadoop - open source technologies , cloud and big data.
Module II 10 HoursHDFS : Hadoop distributed file system, HDFS design and architecture, HDFSconcepts, interacting HDFS using command line, interacting HDFS using JavaAPIs, dataflow, blocks, replica, Hadoop processes, name node, secondary namenode, job tracker, task tracker, data node.
Module III 10 HoursMAPREDUCE APPLICATIONS : MapReduce workflows ,MODULE testswith MRMODULE, test data and local tests ,anatomy of MapReduce job run,classic MapReduce, YARN, failures in classic Map reduce and YARN, jobscheduling, shuffle and sort, task execution, MapReduce types, input formats,output.
Module IV 10 HoursMAP REDUCE PROGRAM: Introduction to writing a MapReduce program,the MapReduce flow, examining a sample MapReduce program, basicMapReduce API concepts, the Driver Code, the Mapper, the Reducer, Hadoop’sStreaming API, using Eclipse for Rapid Development, Hands on exercise, theNew MapReduce API, Word Co-Occurrence, Hands on Exercise.
Module V 10 HoursHADOOP TOOLS : HIVE -Introduction and interacting HDFS using HIVE,MapReduce programs through HIVE,HIVE commands, sample programs inHIVE,PIG basics, commands, NOSQL Databases Concepts, Pig – Grunt – pigdata model,Pig Latin, developing and testing Pig Latin scripts. Hive – data typesand file formats, HiveQL data definition, HiveQL data manipulation, HiveQLqueries, SQOOP,FLUME
Text Book(s)1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, Big Data, Big
Analytics: Emerging Business Intelligence and Analytic Trends for Today'sBusinesses, Wiley, 2013
2. Tom Plunkett, Mark Hornick, Using R to Unlock the Value of Big Data:Big Data Analytics with Oracle R Enterprise and Oracle R Connector forHadoop, Oracle Press,2013.
29
References1. Tom White, Hadoop: The Definitive Guide, 3/e, O'Reilley, 20122. David Loshin, BigDataAnalytics: From Strategic Planning to Enterprise
Integration with Tools, Techniques, NoSQL and Graph, Morgan KaufmannPublishers, 2013
3. Lars George, HBase: The Definitive Guide, O'Reilley, 2011.4. Alan Gates, Programming Pig, O'Reilley, 2011.
30
EIT764: CLOUD COMPUTINGL T P C3 1 0 4
Module I 8 HoursCentralized and Distributed Computing: Overview of Distributed Computing,cluster computing, grid computing, utility computing technologies for networkbased systems, system models for distributed and cloud computing, softwareenvironments for distributed systems and clouds.
Module II 10 HoursIntroduction to Cloud Computing: History of Cloud Computing, Cloud issuesand challenges, properties, characteristics, service models, deployment models.Cloud resources- Network and API , virtual and physical computationalresources, data storage. Virtualization concepts- Types of Virtualization,introduction to various Hypervisors, High Availability (HA)/Disaster Recovery(DR) using virtualization, moving VMs .
Module III 10 HoursService models: Infrastructure as a Service (IaaS)-Resource Virtualization- Server,storage and network, Case studies. Platform as a Service (PaaS) - Cloud platform& Management Computation, Storage, Case studies. Software as a Service (SaaS)- Web services, Web 2.0 ,Web OS, case studies, Anything as a service (XaaS).
Module IV 10 HoursCloud Access: authentication, authorization and accounting, Cloud provenanceand meta data, Cloud reliability and fault tolerance. Cloud Security- NetworkLevel Security, Host Level Security, Application Level Security.
Module V 10 HoursCloud Programming and Software Environments: Parallel and DistributedProgramming paradigms, programming on Amazon AWS and Microsoft Azure,programming support of Google App Engine, Emerging Cloud softwareenvironment.
Text Book(s)1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, Distributed and cloud
computing from Parallel Processing to the Internet of Things, MorganKaufmann, Elsevier, 2012.
References1. Barrie Sosinsky, Cloud Computing Bible, Wiley, 2010.2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, Cloud Security and
Privacy-An Enterprise Perspective on Risks and Compliance, O'Reilly, 2009.
31
EIT766: SOCIAL NETWORK ANALYSIS
L T P C 3 1 0 4
Module I 10 HoursIntroduction to Social Networks: Fundamental concepts in Network analysis,features.Social Network Data: Network data, boundary specification and sampling, typesof networks, network data, measurement and collection.
Module II 8 HoursMathematical Representations of Social Networks: Notations for SocialNetwork data, sociometric notation, algebraic notation, two sets of actors, graphsand matrices.
Module III 10 HoursNetwork Centrality and Prestige: Prominence, non directional relations,directional relations, structural balance and transitivity, structural balance,clusterability.
Module IV 10 HoursCohesive Subgroups: Sub Groups based on complete mutuality, reachabilityand diameter, Subgroups based on nodal degree, measures of Subgroup cohesion,directional relations, valued relations, interpretation of cohesive Subgroups.
Module V 10 HoursOverlapping Subgroups: Affiliation networks, representing affiliation networks,one mode networks, properties of affiliation networks, analysis of actors andevents. Roles and Positions: Structural equivalence, positional analysis, measuringstructural equivalence, representation of network positions.
Text Book(s)1. Stanley Wasserman and Katherine Faust ,Social Network Analysis: Methods
and Applications , Cambridge University Press,1984.2. Robert A. Hanneman, Introduction to Social Network Methods , University
of California,2005.
References1. Freeman, L. C, The Development of Social Network Analysis: A study in
the sociology of science , Empirical Press,1994.
32
EIT722: MIDDLEWARE TECHNOLOGY LAB
L T P C0 0 3 2
PART A: RMI PROGRAMMING1. Communication: Create a server that accepts the requests from client and
client displays the server system information2. File transfer: Create a server that asks for a password, then opens a file and
sends the file over the network connection. Create a client that connects tothis server, gives the appropriate password, then captures and saves the file.
3. Calculator: Create a remote server that implements a calculator with basicfunctionalities like addition, subtraction, division, multiplication and client,which uses the remote calculator.
4. Stockmarket: Create a remote stock server that accepts the company nameand gives the share value. Stock client that retrieves the company share valueand displays by giving the company name.
5. Phone book server: Create a remote phone book server the maintains namesand phone numbers. Phone book client should provide a user interface thatallows the user to scroll through entries, add a new entry, modify an existingentry and delete an existing entry. The client and the server should provideproper error handling.
PART B1. Working with callbacks and delegates in C# : Demonstrates the use of
delegates, callbacks, and synchronous and asynchronous method invocation,including how Microsoft .NET Framework classes provide explicitasynchronous support using the Begin XXXX and End XXXX namingconventions and how you can make use of this support in your own code.
2. Code access security with C# : Demonstrates the use of .NET Frame workCode Access Security, in which code can have permissions independent ofthe person executing the code.
3. Creating a COM+ component with C# : Demonstrates how to create aCOM+ component, that takes advantage of Transaction management servicewithin COM+ , then assign a strong name to the assembly, register theassemble in the Global Assembly Cache, and register the component withCOM+.
4. Creating a Windows Service with C# : Demonstrates how to create aMicrosoft Windows Service that uses a File System Watcher object to monitora specific directory for changes in files.
33
EIT793: TECHNICAL SEMINAR-II
L T P C0 0 3 2
34
EME781 : OPTIMIZATION TECHNIQUESL T P C3 0 0 3
Module I 10 hoursIntroduction to Optimization: Introduction, engineering applications ofoptimization, statement of an optimization problem-design vector, designconstraints, constraint surface, objective function, classification of optimizationproblems, optimization techniques. Classical optimization techniques:Introduction, single variable optimization, multi variable optimization with noconstraints, multi variable optimization with equality and inequality constraints-Kuhn-tucker conditions, constraint qualification.
Module II 8 hoursNon-linear programming I: Introduction, unimodal function, eliminationmethods- unrestricted search, exhaustive search, dichotomous search, intervalhalving method, Fibonacci method, golden section method, interpolation method,cubic interpolation method, direct root method-Newton method, secant method.
Module III 8 hoursNon linear programming II: Introduction, classification of unconstrainedminimization methods, random search methods, univariate method, patterndirection, Hooke and Jeeves method, Powell’s method, indirect search methods-steepest descent method (Cauchy’s method).
Module IV 8 hoursNon linear programming III: Introduction, Characteristics of a constrainedproblem, direct methods - Random search methods, Complex method, Sequentiallinear programming, Basic approach in the methods of feasible directions, indirectmethods-Transformation techniques, Basic approach of the penalty functionmethod.
Module V 8 hoursInteger Programming: Introduction, Graphical Representation, Gomory’scutting plane method, Bala’s algorithm for zero-one programming, Branch-and-bound method, generalized penalty function method.
Text Book(s)
1. Singiresu S. Rao, Engineering Optimization, theory and practice, New AgeInternational Pvt. Ltd., 3rd Edition, 2013.
References
1. Kalyan Moy Deb., Optimization for Engineering Design, 2/e, Prentice Hallof India, 2012.
2. Gupta P K., & Hira D.S., Operation Research, 6/e, S Chand Publishers, 2006.
35
EEI781 : MICROPROCESSORS AND INTERFACINGL T P C3 0 0 3
Module I 8 hours8085 Microprocessors and ArchitectureMicroprocessors historical perspective, 8085 pin diagram, architecture, addressingmodes, Overview of 8085 instruction set, microprocessor communication andbus timings, 8085 functional block diagram.
Module II 8 hoursThe Processor 8086:Register organization of 8086, architecture, signal description of 8086, physicalmemory organization, I/O addressing capability, Minimum mode 8086 systemand timings, Maximum mode 8086 system and timings.
Module III 8 hoursInstruction Set and Programming: Machine language instruction format, addressingmodes of 8086, instruction set of 8086, assembler directives and example programs(assembly programs).
Module IV 8 hoursInterrupts and Programming: Interrupts and interrupt service routines, interruptcycle of 8086, Non mask able interrupt, maskable interrupt (INTR), interruptprogramming. Programmable Interrupt Controller 8259A.
Module V 10 hoursInterfacing of Peripherals to 8086: Interfacing I/O ports,PIO 8255, [ProgrammableI/O ports], modes of operation of 8255, Interfacing Digital to Analog converters-DAC 0800, Interfacing Analog to Digital Data converters- ADC0808/0809,Programmable Interval Timer 8253, Programmable Communication interface 8251USART.
Text Book(s)1. AK Ray, KM Bhurchandi, Advanced Microprocessors and Peripherals, 2nd
edition, TMH publications, 2009.2. Douglas V Hall, Microprocessors and Interfacing: Programming and Hardware,
2nd edition, Tata McGraw Hill Publications, 2006
References1. Barry B. Brey, The Intel Microprocessors: Architecture, Programming and
Interfacing, 8th edition, pearson, 2008.2. Kenneth J. Ayala, 8086 Micro Processor: Programming and Interfacing the
PC, 1st edition, Delmar Cengage learning, 2007.3. Ramesh .S. Gaonkar, Microprocessors, Architecture, Programming and
Applications with the 8085, 5th edition, Penram Publications, 2011.
36
EEI783: VLSI Design L T P C 3 0 0 3
Module I 8 hoursIntroduction to MOS Technology: Semiconductor Materials, Enhancementmode MOS transistor, Depletion mode MOS transistor, nMOS fabrication,CMOS fabrication, Comparison of NMOS, CMOS, BICMOS, GaAsTechnologies.
Module II 10 hoursBasic Electrical Properties of MOS and BiCMOS Circuits: Drain-to-SourceCurrent vs Voltage relationships, Aspects of MOS transistor threshold voltage,MOS transistor transconductance and output conductance, The Pass Transistor,The NMOS inverter, Determination of Pullup to Pulldown ratio of NMOStransistor driven by another nmos transistor. Alternate forms of Pullup.The CMOSinverter.MOS transistor circuit model. Latch up in CMOS circuits.
Module III 10 hoursMOS and BICMOS circuit design process: MOS layers, stick diagrams, designrules and layout, 2µ.meter, 1. 2µ.meter CMOS rules. Layout diagrams, Symbolicdiagrams. Basic circuit concepts: Sheet resistance, Area capacitance of layers,delay Module, wiring capacitances, choice of layers. Scaling of MOS circuits:Scaling models, Scaling function for device parameters, Limitation of Scaling
Module IV 8 hoursSub system design and Layout: Architectural issues, switch logic, Gate logic,examples of structural design (Combinational logic), Some clocked sequentialcircuits. Memory Register and Aspects of System Timing: Some commonly usedstorage/memory elements. Subsystem Design Process: General Arrangement of4-bit arithmetic processor, Regularity. Design of an ALU subsystem.
Module V 8 hoursTest and Testability: System Partitioning, Layout and Testability, Reset/Initialization, Design for Testability, Testing Combinational Logic, TestingSequential Logic, Practical Design for Test (OFT) Guidelines, Scan DesignTechniques, Built-In-Self-Test (BIST). CMOS Design Projects: Incrementer/Decrementer, Comparator for two n-bit numbers.
Text Book(s)1. Douglas A, Pucknell, Kamran Eshraghian, Basic VLSI design, 3/e, Prentice-
Hall, 1996.2. Gary S May, Simon M Sze, Fundamentals of Semiconductor Fabrication”
Wiley Publications, 2004.
37
References1. Douglas A, Pucknell, Kamran Eshraghian, Essentials of VLSI Circuits and
Systems, Prentice Hall Publications.2. Kang, Leblibici, CMOS Digital Integrated Circuits, Tata McGraw Hill
Publications, 20013. Jan M. Rabaey, Digital Integrated Circuits, Second Edition, Pearson Education,
2002.4. Jackson, Hodges, Analysis and Design of Digital Integrated Circuits, Tata
McGraw Hill, New Delhi, 2010
38
EIE783 : ECOMMERCEL T P C3 0 0 3
Module I 10 HoursElectronic commerce, Frame work, anatomy of e-commerce applications, e-commerce consumer applications, e-commerce organization applications,consumer oriented electronic commerce , mercantile process models.
Module II 10 HoursElectronic payment systems, digital token based smart cards, credit cards, risksin electronic payment systems, inter organizational commerce, EDI, EDIimplementation, value added networks.
Module III 10 HoursIntra organizational commerce, work flow, automation customization and internalcommerce, supply chain management, corporate digital library, document library,digital document types, corporate data warehouses, advertising and marketing, information based marketing, advertising on internet, online marketing process,market research.
Module IV 10 HoursConsumer search and resource discovery , information search and retrieval,commerce catalogues, information filtering.
Module V 10 HoursMultimedia, key multimedia concepts, digital video and electronic commerce,desktop video processing, desktop video conferencing.
Text Book(s)1. Kalakata, Whinston, Frontiers of electronic commerce , Pearson
Education,1996.
References1. Hendry Chan, Raymond Lee, Tharam Dillon, Ellizabeth Chang, E-Commerce
Fundamentals and Applications, Wiley, 2001.2. Efrain Turbon, Jae Lee, David King, H. Michael Chang,E-Commerce,3/e,
Pearson Education, 2011.3. Kenneth, Taudon, Carol Guyerico Traver, E-Commerce – Business,
Technology, Society, 11/e, Prentice Hall of India, 2014.
39
EEC753: EMBEDDED SYSTEM DESIGN L T P C 3 0 0 3
Module I 8 HoursIntroduction: Features of embedded systems, design metrics, embedded systemdesign flow, ARM microcontroller, structure of ARM7, ARM pipeline, instructionset architecture, thumb instructions, exceptions in arm, programming examples.
Module II 8 HoursDigital Signal Processors: Architecture of digital signal processors, high speeddata access, fast computation, higher accuracy, C6000 family of DSPs. Fieldprogrammable gate arrays: Field programmable devices, programmability ofFPGAs, FPGA logic block variations, FPGA design flow, modern FPGAs.
Module III 8 HoursInterfacing: Serial peripheral interface (SPI), inter integrated circuit (IIC), RS232c,RS422, RS485, universal serial bus, infrared communication, controller areanetwork, bluetooth.
Module IV 8 HoursReal-Time Operating System: Type of real-time tasks, task periodicity, taskscheduling, classification of scheduling algorithms, clock driven scheduling, eventdriven scheduling, resource sharing, features of RTOS, commercial RTOS.
Module V 8 HoursSpecification Techniques: State chart, specification description language (SDL),petri nets, unified modeling language. Hardware software co-simulation:dimensions in co-simulation, co-simulation approaches, typical co-simulationenvironment.
Text Book(s)1. Santanu Chattopadhyay, Embedded System Design, 2/e, Prentice Hall of India,
2013
References1. David Simon, An Embedded Software Primer, Pearson Education, India, 20072. Arnold S Burger, Embedded System design by, CM Publications, Steve Heath,
Embedded Systems Design: Real world design Newton Mass USA 2002
40
EEC789: FUNDAMENTALS OF DIGITAL SIGNALPROCESSING
L T P C3 0 0 3
Module I 8 HoursDiscrete-Time Signals And Systems - Discrete-Time Signals, Discrete-TimeSystems, Analysis of Discrete-Time Linear Time-Invariant systems, Discrete-Time Systems Described by Difference Equations, Implementation of Discrete-Time Systems.
Module II 8 HoursFrequency Analysis Of Signals And Systems: The z-Transform, Properties ofthe z-Transform, Analysis of Linear Time Invariant Systems in the z-Domain,Frequency Analysis of Continuous-Time Signals, Frequency Analysis of Discrete-Time Signals, Frequency-Domain Characteristics of Linear Time-InvariantSystems, Frequency Response of LTI Systems.
Module III 8 HoursThe Discrete Fourier Transform: Its Properties And Applications - FrequencyDomain Sampling, The Discrete Fourier Transform, Properties of the DFT, LinearFiltering Methods Based on the DFT, Frequency Analysis of Signals Using theDFT, Efficient Computation of the DFT: FFT Algorithms, Applications of FFTAlgorithms.
Module IV 8 HoursImplementation Of Discrete-Time Systems: Structures for the Realization ofDiscrete-Time Systems, Structures for FIR Systems, Structures for IIR Systems
Module V 8 HoursDesign Of Digital Filters: General Considerations, Design of FIR Filters, Designof IIR Filters From Analog Filters, Frequency Transformations.
Text Book(s)1. Proakis, J.Gard and D.G.Manolakis , Digital Signal Processing : Principles,
Algorithms and Applications , 4/e, PHI, 2011.
References1. Discrete Time Signal Processing – A.V. Oppenheim and R.W. Schaffer, PHI,
1989.2. Fundamentals of Digital Signal Processing – Robert J. Schilling & Sandra L.
Harris, Thomson, 20053. Digital Signal Processing – Thomas J. Cavicchi, WSE, John Wiley, 2004.4. Digital Signal Processing by A.V.Opperheim & R.W.Schafer, PHI Publications.
41
ECE781 : REMOTE SENSING AND GEOGRAPHICINFORMATION SYSTEM
L T P C3 0 0 3
Module I 8 hoursFundamentals of GIS, Functions and Features of Components, Data Type,Analysis and Modelling, Role of GIS and Applications
Module II 10 hoursConcepts and Foundation of Remote Sensing, Electromagnetic Spectrum, Energy,Basic Principles of Photogrammetry, Geometrical Characteristics of AerialPhotographs, image parallax, remote sensing platforms and sensors.
Module III 9 hoursSatellite System Parameters, Sensor Parameters, Imaging Sensor Systems, EarthResources and Meteorological Satellites, Microwave Sensors, Data Acquisitionand interpretation
Module IV 7 hoursVisual Image Interpretation, Fundamentals, Visual Image InterpretationEquipment, Digital Image Processing.
Module V 8 hoursApplications of Remote Sensing in Survey, Mapping, Landuse and TransportationPlanning
Text Book(s)1. Basudeb Bhatta, Remote Sensing and GIS, 2nd edition, Oxford Press, 2011.2. Campbell, J.B., Introduction to Remote Sensing, 5th edition, The Guilford
Press, London, 1986.3. Paul A. Longley, Mike Goodchild, David J. Maguire and David W. Rhind,
Remote Sensing and Geographic Information Systems,3rd edition, WileyPublishers, 2010.
References1. Peter A. Burrough and Rachael A. McDonnell, Principles of Geographical
Information Systems (Spatial Information Systems), 2ndedition, OxfordUniversity Press, 1998.
2. Engaman, E.T. and Gurney, R.J, Remote Sensing in Hydrology, Springer; Softcover reprint of the original 1st ed. 2000 edition, October 8, 2011.
42
EIE781 :PROJECT MANAGEMENTL T P C3 0 0 3
Module IProject Planning: Analysis and Appraisal Generation of project ideas, Scoutingfor project ideas, Preliminary screening, Project rating index, Cost of project.Investment Appraisal: Social cost benefit analysis, UNIDO approach, Net benefitin terms of economic prices, Measurement of impact on distribution, Savingsimpact and its value, Income distribution impact, Adjustment for merit and demeritgoods Little Mirrless approach, Shadow prices.
Module IIProject Implementation: Development of project network, Dummy activities,Activity on node networks, Cyclic network, Forward pass and backward passcomputations, Algorithm for critical path, Total slacks, free slacks and theirinterpretations.Time-cost Trade off Procedure: Schedule related project costs,Time cost trade off, lowest cost schedule.PERT Network: Three time estimatesfor activities, Estimation of mean and variance of activity times, Event orientedalgorithm for critical path, Probability of meeting a schedule date.
Module IIINetwork Analysis: Algorithms for shortest route problems-Dijkstra's, Flyod's,and Dantzig's algorithms; Algorithms for minimal spanning tree- Kruskal'salgorithm and Prim's algorithm; Algorithms for maximal flow problems. Maximumflow minimum cut explanation.
Module IVLinear Programming Formulation of Network Problems: A flow networkinterpretation for determination of critical paths, Time cost trade off and maximalflow, Chance constrained linear programming for probabilistic durations ofactivities in PERT network.
Module VProject Scheduling with Limited Resources: Complexity of project schedulingwith limited resources, leveling the demands on key resources, A simple heuristicprogram for resource allocation
Text Book(s)1. Parameshwar P. Iyer. Engineering Project Management with Case Studies,
Vikas Publishing House. New Delhi, 2005.2. Prasanna Chandra, Projects Planning, Implementation and Control, McGraw
Hill, New Delhi, 1995.
43
References1. Project Management Institute (PMI), A Guide to the Project Management
of Knowledge Newton Square , PA, 19962. J.R. Meredith and S.J. Mantel. Project Management: A Managerial Approach.
John Wiley and Sons, New York, 1995.3. L.S. Srinath, PERT & CPM Principles & Applications, 3/e, East west
Press,2001.
Chandrahas Bhavan - Institute of Technology, Visakhapatnam Campus
Institute of Technology, Hyderabad Campus
Sir Visweswaraiah Bhavan - Institute of Technology, Bengaluru Campus
Gandhi Nagar Campus, Rushikonda,Visakhapatnam-530 045, A.P. INDIAPhones: 91-0891-2795311,2840501 EPABX:91-891-2790101 Fax:91-891-2795311
A Publication of GITAM University Press
GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT (GITAM)