Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
SEMESTER-V TEACHING & EVALUATION SCHEME
60
20
20
-
-
Th
T
P
CREDITS
Discrete Mathematics
Teachers Assessment*
-
END SEM University Exam
BTCS501
Teachers Assessment*
COURSE NAME
Two Term Exam
Category COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
-
4
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES The student will have ability to: 1. Formalize objects and objects of computations with art of proof. 2. Analyze algebraic and operational structures with relative properties. 3. Simplify and evaluate basic logic statements. 4. Know essential concepts in graph theory and related algorithms 5. Apply knowledge finite and countable discrete structures and probability. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. Understand the basic principles of sets and operations in sets. 2. Express a logic sentence in terms of predicates, quantifiers, and logical connectives. 3. Calculate probabilities and discrete distributions for simple combinatorial processes; calculate expectation. 4. Model problems in Computer Science using graphs. 5. Apply Boolean algebra to devise solutions. SYLLABUS UNIT–I Set Theory, Relation, Function, Theorem Proving Techniques : Set Theory: Definition of sets, countable and uncountable sets, Venn Diagrams, proofs of some general identities on sets Relation: Definition, types of relation, composition of relations, Pictorial representation of relation, Equivalence relation, Partial ordering relation, Job-Scheduling problem Function: Definition, type of functions, one to one, into and onto function, inverse function, composition of functions, recursively defined functions, pigeonhole principle. Theorem proving Techniques: Mathematical induction, Proof by contradiction.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
UNIT–II Algebraic Structures: Definition, Properties, types: Semi Groups, Monoid, Groups, Abelian group, properties of groups, Subgroup, cyclic groups, Cosets, factor group, Permutation groups, Normal subgroup, Homomorphism and isomorphism of Groups, example and standard results, Rings and Fields: definition and standard results. UNIT–III Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, Contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Normal Forms, Universal and existential quantifiers. Introduction to Probability Theory: Random Variables, Bernoulli Trial, Mean & Variance, Probability Density Functions, Probability Distribution Marginalization, Independence, Conditional Probability, Bayes Theorem, Expected Values. UNIT–IV Graph Theory: Introduction and basic terminology of graphs, Planer graphs, Multigraphs and weighted graphs, Isomorphic graphs, Paths, Cycles and connectivity, Shortest path in weighted graph, Introduction to Eulerian paths and circuits, Hamiltonian paths and circuits, Graph coloring, chromatic number, Isomorphism and Homomorphism of graphs. UNIT–V Posets, Hasse Diagram and Lattices: Introduction, ordered set, Hasse diagram of partially, ordered set, isomorphic ordered set, well ordered set, properties of Lattices, bounded and complemented lattices. Combinatorics: Introduction, Permutation and combination, Binomial Theorem, Multimonial Coefficients Recurrence Relation and Generating Function: Introduction to Recurrence Relation and Recursive algorithms , Linear recurrence relations with constant coefficients, Homogeneous solutions, Particular solutions, Total solutions , Generating functions , Solution by method of generating functions. TEXT BOOKS: 1. C.L.Liu, “Elements of Discrete Mathematics” Tata McGraw-Hill Edition, 4th Edition, 2012. 2. 2.Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill, 7th Edition, 2012. 3. 3. V. Krishnamurthy, “Combinatories:Theory and Applications”, East-West Press, 2nd Edition, 2008. 4. 4.Seymour Lipschutz, M.Lipson, “Discrete Mathemataics” Tata McGraw Hill, 3rd Edition, 2009. REFERENCES: 1. Trembley, J.P &Manohar; “Discrete Mathematical Structure with Application CS”, McGraw Hill. 2. Bisht, “Discrete Mathematics”,Oxford University Press, 2015. 3. Biswal,”Discrete Mathematics & Graph Theory”, PHI, 3rd Edition, 2011.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
30
20
Th
T
P
CREDITS
Operating System
Teachers Assessment*
-
END SEM University Exam
BTCS502
COURSE NAME
Teachers Assessment*
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES The student will have ability to: 1. To learn the fundamentals of Operating Systems. 2. To study the mechanisms of Operating System to handle processes and threads and their communication. 3. To gain knowledge of process management concepts that includes architecture, Mutual exclusion algorithms, deadlock detection and recovery algorithms. 4. To learn the mechanisms involved in memory management in Operating System. 5. To know the components and management aspects of disc scheduling. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. To describe the detail structure of Operating System. 2. To design and Implement Process management Techniques in Operating System. 3. To calculate CPU Scheduling criteria. 4. To understand The Memory Management of Operating System. 5. To elaborate Disc Scheduling. SYLLABUS UNIT–I Introduction to Operating System Introduction and need of operating system, layered architecture/logical structure of operating system, Type of OS(Multiprogramming , Time Sharing, Real Time ,Networked, Distributed, Clustered, Hand Held), operating system as resource manager and virtual machine, OS services, BIOS, System Calls/Monitor Calls, Firmware- BIOS, Boot Strap Loader. Threads- processes versus threads, threading, concepts, models, kernel & user level threads, thread usage, benefits, multithreading models. UNIT–II Process Management:- Process model, creation, termination, states & transitions, hierarchy, context switching, process implementation, process control block, Basic System calls- Linux & Windows.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
Basic concepts, classification, CPU and I/O bound, CPU scheduler- short, medium, long-term, dispatcher, scheduling:- preemptive and non-preemptive, Static and Dynamic Priority Criteria/Goals/Performance Metrics, scheduling algorithms- FCFS, SJFS, shortest remaining time, Round robin, Priority scheduling, multilevel queue scheduling, multilevel feedback queue scheduling. UNIT–III Interprocess communication- Introduction to message passing, Race condition, critical section problem, Peterson’s solution, semaphore, classical problems of synchronization Classical IPC Problems: Reader’s & Writer Problem, Dinning Philosopher Problem, Sleeping Barber Problem etc... Deadlock- System model, resource types, deadlock problem, deadlock characterization, methods for deadlock handling, deadlock prevention, Deadlock Avoidance: Banker’s algorithm, deadlock detection, recovery from deadlock. UNIT–IV Memory management- concepts, functions, logical and physical address space, address binding, degree of multiprogramming, swapping, static & dynamic loading- creating a load module, loading, static & dynamic linking, shared libraries, memory allocation schemes- first fit, next fit, best fit, worst fit and quick fit. Free space management- bitmap, link list/free list. Virtual Memory- concept, virtual address space, paging scheme, pure segmentation and segmentation with paging scheme hardware support and implementation details, memory fragmentation, demand paging ,working set model, page fault frequency, thrashing, page replacement algorithms- optimal, FIFO,LRU; Bleady’s anomaly; TLB ( translation look aside buffer). UNIT–V File Management- concepts, naming, attributes, operations, types, structure, file organization & access (Sequential, Direct ,Index Sequential) methods, memory mapped files, directory structures one level, two level, hierarchical/tree, acyclic graph, general graph, file system mounting, file sharing, path name, directory operations, overview of file system in Linux & windows. Input/output subsystems- concepts, functions/goals, input/output devices- block and character, spooling, disk structure & operation, disk attachment, disk storage capacity, disk scheduling algorithmFCFS, SSTF, scan scheduling, C-scan schedule. TEXT BOOKS: 1. Abraham Silberschatz, ”Operating system concepts”, 7th , John Willey & Sons. INC, 2005 2. Andrew S.Tannanbaum, “Modern operating system”, 3rd,Pearson Education, 2009 3. Dhananjay M. Dhamdhere, ”Operating Systems:A concept Based Approach”, 3rd TMH, 2012, 4. Sibsankar Haldar, Alex Alagarsamy Aravind,”Operating System”, 8th ,Pearson Education India, , 2010, REFERENCES: 1. Achyut S Godbole,”Operating System”, ,3rd TMH,2010. 2. William Stalling, “operating system” 7th , Pearson Education, ,2012. 3. Vijay Shukla, "Operating System", 3rd, Kataria& Sons ,2010.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
4. Singhal & Shivratri,”Advanced Concept in Operating Systems”, TataMc-Graw Hill Education, edition 2001. LIST OF EXPERIMENTS: (At least 10 based on Syllabus) 1. Study of BIOS, Bootstrap Program & System calls. 2. Study of Process Life Cycle. 3. Implement First Come First Serve CPU Scheduling. 4. Implement Non Preemptive Priority CPU Scheduling. 5. Implement Non Preemptive Shortest Job first CPU Scheduling. 6. Implement Preemptive Shortest Job first CPU Scheduling. 7. Implement Preemptive Priority CPU Scheduling. 8. Implement Round-Robin CPU scheduling. 9. Write a program to implement Semaphore. 10. Design and implement Deadlock Avoidance algorithm; Banker’s Algorithm. 11. Write a program for Memory Management Algorithms e.g. First Fit, Best Fit, Worst Fit. 12. Demonstrate Virtual memory Techniques like, LRU, FIFO etc. 13. Implement First Come-First Serve Disk Scheduling Algorithm. 14. Implement Shortest Seek Time First Disk Scheduling Algorithm. 15. Implement Scan Scheduling Disk Scheduling Algorithm. 16. Implement Circular Scan Disk Scheduling Algorithm. 17. Implement Look Disk Scheduling Algorithm.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
30
20
Th
T
P
CREDITS
Teachers Assessment*
Analysis and Design of Algorithms
END SEM University Exam
-
COURSE NAME
Teachers Assessment*
BTIT305
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES The student will have ability to: 1. Learn the algorithm analysis techniques. 2. Become familiar with different algorithm design techniques. 3. Understand the limitation of algorithm power. 4. Analyze the asymptotic performance of algorithms. 5. Synthesize efficient algorithms in common engineering design situations. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. Demonstrate a number of standard algorithms for problems in fundamental areas in computer science and engineering such as sorting, searching, and problems involving graphs. 2. Analyze the time and space complexity of algorithm. 3. Critically analyze the different algorithm design technique for a given problem. 4. Analyze worst-case running times of algorithms using asymptotic analysis. 5. Develop the skills of using standard algorithm design techniques to develop efficient algorithms for new problems. SYLLABUS UNIT–I Introduction - Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation, Probabilistic analysis, Amortized analysis, Mathematical background for algorithm analysis, Randomized and recursive algorithm. Comparison of various algorithms based on this technique, example binary search, merge sort, quick sort, Stassen’s matrix multiplication. UNIT–II
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
Greedy Algorithms - Greedy choice, optimal substructure property, minimum spanning trees – Prim’s and Kruskal’s algorithm, Dijkstra’s shortest path using arrays and heaps, fractional knapsack, and Huffman coding. UNIT–III Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage graph, reliability design, Floyd-Warshall algorithm, Longest increasing subsequence, matrix chain multiplication. Introduction to Internet algorithm - Strings and patterns matching algorithm, String Matching: Boyer Moore algorithm. UNIT–IV Backtracking - The general method, 8 queen problem, sum of subsets, Graph coloring, Hamiltonian cycles, Knapsack problem. Branch and Bound - The method, LC search, 15 puzzle: An example. Bounding and FIFO branch and bound, LC branch and bound, 0/1 knapsack problem, TP efficiency considerations. UNIT–V NP-completeness - reduction amongst problems, classes NP, P, NP-complete, and polynomial time reductions. Graph - Graphs, Undirected Graph, Directed Graph, Traversing Graphs, Depth First Search, Breath First Search, special tree like B tree, B+ tree and red black tree. TEXT BOOKS: 1. Ellis Horowitz, Sarataj Sahni, S. Rajsekaran, ”Fundamentals of computer Algorithms” University press. 2. Anany V. Levitin,”Introduction to the Design and Analysis of Algorithms”, Pearson Education publication, Second Edition. 3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, "Introduction to Algorithms", 2nd Edition, MIT Press/McGraw Hill, 2001 4. Michael Goodrich & Roberto Tamassia, “Algorithm design foundation, analysis and internet examples”, Second Edition, Wiley student Edition. 5. Aho, Ullman and Hopcroft, Design and Analysis of algorithms, Pearson education. REFERENCES: 1. S. Baase, S and A. Van Gelder, "Computer Algorithms: Introduction to Design and Analysis", 3rd edition. Addison Wesley, 2000 2. Kenneth Berman, Jerome Paul “Algorithm: sequential, parallel and distributed”, Cengage Learning 3. Mark Allen Weiss, “Data Structure & Algorithm Analysis in C++”, Third Edition, Pearson Education. 4. R.C.T. Lee, S. Tseng, R.C. Chang and T. Tsai, Introduction to Design and Analysis of Algorithms: A strategic approach, Mc Graw Hill. 5. Allen Weiss, Data structures and Algorithm Analysis in C++ education. 6. Richard Johnson Baugh and Marcus Schaefer, Algorithms, Pearson Education.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
LIST OF EXPERIMENTS: 1. Implement Linear Search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched. 2. Implement Recursive binary search and determine the time required to search an element. Repeat the experiment for different values of n, the number of elements in the list to be searched. 3. Sort a given set of elements using the Heapsort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted. 4. Sort a given set of elements using Merge sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted 5. Sort a given set of elements using Quick sort method and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted 6. Write a Program for Strassen's Matrix Multiplication. 7. Write a Program for Minimum Cost Spanning Tree of a given undirected graph using Kruskal’s algorithm. 8. Write a Program for Minimum Cost Spanning Tree of a given undirected graph using Prim's algorithm. 9. Implement Fractional Knapsack problem using greedy method. 10. From a given vertex in a weighted connected graph, find the shortest paths to other vertices using Dijkstra’s algorithm. 11. Implement Warshall algorithm. 12. Implement BFS and DFS Algorithm for graph. 13. Write a program for travelling salesman problem.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
0
50
Th
T
P
CREDITS
Teachers Assessment*
Microprocessors & Interfacing
END SEM University Exam
EC
COURSE NAME
Teachers Assessment*
BTEC501
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES To provide a theoretical & practical knowledge of Microprocessor architecture, interfacing and assembly language programming techniques. COURSE OUTCOMES After completion of this course the students are expected to be able to demonstrate following knowledge, skills and attitudes The students will be able to 1. Demonstrate knowledge of the architecture, organization and operation of microprocessors (8085 and 8086), peripherals and memories typically interfaced with microprocessors. 2. Execute assembly language programs efficiently for solving problems by using instruction sets of microprocessor. 3. Use an Integrated Development Environment (IDE) as a modern software tool for microprocessor and embedded systems development. (Application &Synthesis). SYLLABUS UNIT–I 8085 Microprocessor Architecture and Interfacing Introduction to microprocessor, 8085 microprocessor, 8085 Pin Functions, Architecture, Register Set, Flag Classification, ALU and control & timing unit, Memory Interfacing, Interfacing Input Output Devices, Memory-Mapped I/O. Timing diagram for I/O and memory read/write cycle. UNIT–II Addressing Modes and Instruction set Addressing Modes of 8085 Microprocessor, Instruction Format, Opcode and operand, Classification of Instructions: Data transfer, Arithmetic, Logical, Rotate, Branch and machine Control instructions. Development of 8085 assembly language programs. Concept of stack and Instruction related to stack. 8085 interrupts, RST, RIM, SIM instructions. Subroutines and conditional call instruction. Counter and Time Delay Programs.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
UNIT–III Introduction of 8086 Microprocessor Architecture of 8086 Microprocessor, BIU and EU, pin diagram, register organization, memory organization, Segments, maximum and minimum modes, Interrupts of 8086. UNIT–IV Addressing Modes and ALP Instruction formats, addressing modes, 8086 assembly language programming using Instruction set of 8086 Microprocessor: data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions shift and rotate instructions. UNIT–V Peripheral devices and Interfacing Programmable input/output ports 8255A: Configuration, Modes and Operation. Programmable interval timer 8253, keyboard/display controller 8279, Programmable communication interface 8251 USART, DMA controller 8257. TEXT BOOKS: 5. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming and application with 8085”, 6th Edition, Penram International Publishing, 2013. 6. B. Ram, “Fundamentals of Microprocessors And Microcontrollers”, Dhanpat Rai Publications, 2010. 7. Douglas V. Hall, “Microprocessors and Interfacing: Programming and Hardware”, 3rd Edition, Tata McGraw Hill Publishers, 2012. REFERENCES: 1. A. K. Ray and K. M. Burchandi, “Intel Microprocessors Architecture Programming and Interfacing”, 3rd Edition, McGraw Hill International Edition, 2012. 2. Barry B. Brey, “The Intel Microprocessors – Architecture, Programming And Interfacing”, 8th Edition, Pearson Education, 2008. 3. Adithya P Mathur, “Introduction to Microprocessor”, 3rd Edition, Tata McGraw Hill Publishers, 2001. 4. John Uffenbeck, “The 80x86 Families, Design, Programming and Interfacing”, 3rd Edition, Pearson Education, 2002. LIST OF EXPERIMENTS: 1. Develop/Execute a simple program to move data from one register to the other. 2. Develop/Execute program immediate data between different registers. 3. Develop/Execute a program for addition and subtraction 4. Develop/Execute a program for multiplication. 5. Develop/Execute a program for division. 6. Develop/Execute Assembly language program to check whether given no is odd or even.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
7. Develop/Execute a program to transfer a block of data from one memory location to another memory location. 8. Develop/Execute a program to add two 32-bit numbers. 9. Develop/Execute a program to add 2 decimal numbers in BCD format. 10. Develop/Execute a program to convert data from grey code to binary code. 11. Develop/Execute a program to convert data from binary code to grey code. 12. Develop/Execute an Assembly language programs based on 8 bit Logical instructions. 13. Develop/Execute an Assembly language program to sum integers from 0 to 9. 14. Develop a program to count negative values in given block of data. 15. Develop a program to find the smallest number from an array of N numbers. 16. Develop/Execute a Subroutine to find the square of given integer.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
-
50
Th
T
P
CREDITS
Teachers Assessment*
Information theory and coding
END SEM University Exam
-
COURSE NAME
Teachers Assessment*
BTIT512
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES 1. Students will be introduced to calculate entropy, channel capacity, bit error rate, code rate, and steady-state probability. 2. Students will be introduced to convolutional and block codes, decoding techniques. 3. Students will understand how error control coding techniques are applied in communication systems. 4. Students will be able to describe the real life applications based on fundamental theory. 5. Students will implement the encoder and decoder of one block code using any programming language. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. Derive equations for entropy mutual information and channel capacity for all types of channels. 2. Distinguish between different types error correcting codes based on probability of error and bit Energy to noise ratio. 3. Design a digital communication system by selecting an appropriate error correcting codes for a particular application. 4. Explain various methods of generating and detecting different types of error correcting codes. 5. Formulate the basic equations of linear block codes. 6. Compare the performance of digital communication system by evaluating the probability of error for different error correcting codes SYLLABUS UNIT-I Information Theory, Probability and Channel: Introduction, Information Measures, Review probability theory, Random variables, Processes, Mutual Information, Entropy, Uncertainty, Shannon's theorem, redundancy, Huffman Coding, Discrete random Variable. Gaussian random variables, Bounds on tail probabilities.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
UNIT-II Stochastic Processes: Statistical independence, Bernoulli Process, Poisson Process, Renewal Process, Random Incidence, Markov Modulated Bernoulli Process, Irreducible Finite Chains with Aperiodic States, Discrete-Time Birth-Death Processes, Markov property, Finite Markov Chains, Continuous time Markov chain, Hidden Markov Model. UNIT-III Error Control Coding: Channel Coding: Linear Block Codes: Introduction, Matrix description, Decoding, Equivalent codes, Parity check matrix, Syndrome decoding, Perfect codes Hamming Codes, Optimal linear codes. Maximum distance separable (MDS) codes. Cyclic Codes: Introduction, generation, Polynomials, division algorithm, Matrix description of cyclic codes, burst error correction, Fire Codes, Golay Codes, and CRC Codes.. UNIT-IV BCH Codes: Introduction, Primitive elements, Minimal polynomials, Generator Polynomials in terms of Minimal Polynomials, Decoding of BCH codes. Advance Coding Techniques: Reed-Solomon codes, space time codes, concatenated codes, turbo coding and LDPC codes, Nested Codes, block. Techniques for constructing more complex convolution codes with both soft and hard decoding UNIT-V Convolutional channel coding: Introduction, Linear convolutional codes, Transfer function representation & distance properties, Decoding convolutional codes( Soft-decision MLSE, Harddecision MLSE),The Viterbi algorithm for MLSE, Performance of convolutional code decoders, Soft & Hard decision decoding performance, Viterbi algorithm implementation issues: RSSE, trellis truncation, cost normalization, Sequential decoding: Stack, Fano, feedback decision decoding, . TEXT BOOKS: 1. Rajan Bose “Information Theory, Coding and Cryptography”, TMH, 2002. 2. Kishor S. Trivedi “Probability and Statistics with Reliability, Queuing and Computer Science Applications”, Wiley India, Second Edition. 3. J.C.Moreira, P.G. Farrell “Essentials of Error-Control Coding”, Willey Student Edition 4. San Ling and Chaoping “Coding Theory: A first Course”, Cambridge University Press, 2004. 5. G A Jones J M Jones, “Information and Coding Theory”, Springer Verlag, 2004. REFERENCES: 1. Cole, “Network Security”, Bible, Wiley INDIA, Second Addition 2. Proakis and Masoud, “Digital Communication” ,McGraw-Hill ,2008. 3. Principles of Digital Communications, Signal representation, Detection , Estimation &Information 4. Coding by J Das, S.K. Mullick, P.K.Chatterjee, New Age Int. Ltd. 5. Principles of Communication Systems, Taub&Schilling, 2/e, TMH Publishers LIST OF EXPERIMENTS: 1. Write a program for determination of various entropies and mutual information of a given chann
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
Test various types of channel such as a) Noise free channel. b) Error free channel c) Binary symmetric channel d) Noisy channel Compare channel capacity of above channels. 2. Write a program for generation and evaluation of variable length source coding using C/MATLAB a) Shannon – Fano coding and decoding b) Huffman Coding and decoding c) Lempel Ziv Coding and decoding 3. Write a Program for coding & decoding of Linear block codes. 4. Write a Program for coding & decoding of Cyclic codes. 5. Write a program for coding and decoding of convolution codes. 6. Write a program for coding and decoding of BCH and RS codes. 7. Write a program to study performance of a coded and uncoded communication system (Calculate the error probability). 8. Write a simulation program to implement source coding and channel coding for transmitting a text file. 9. Encoding the data bits using a Binary Cyclic block encoder in Simulink. 10. Decoding the code words using a Binary Cyclic block decoder in Simulink. 11. Encoding the data bits using a Binary Linear block encoder in Simulink. 12. Decoding the code words using Binary Linear block decoder in Simulink.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
0
50
Th
T
P
CREDITS
Analog & Digital Communication
Teachers Assessment*
EC
END SEM University Exam
BTEC509
COURSE NAME
Teachers Assessment*
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES To provide the basic fundamentals, principles, concepts of communication systems and various modulation techniques of analog and digital communication systems. COURSE OUTCOMES After completion of this course the students are expected to be able to demonstrate following attributes: 1. Ability to analyze signals in the time domain and frequency domains. 2. Ability of demonstrating various analog modulation and demodulation techniques and apply suitable modulation techniques for various applications. 3. Ability of demonstrating various digital modulation and demodulation techniques and apply suitable modulation techniques for various applications. SYLLABUS UNIT–I Signals: Classification of signals, Time Domain and Frequency Domain Representation, singularity functions for continuous time. Spectral Analysis: Fourier series analysis, Fourier Transform and their Properties, Transform of singularity functions and Periodic Signal. Energy and Power Spectral Density of various types of signals. Systems: Classification of systems, Impulse Response and Convolution integral. UNIT–II Amplitude modulation Techniques Need of modulation, Amplitude modulation: mathematical representation of AM, modulation index, frequency spectrum, single tone and multi tone AM, generation of AM (square law modulator, switching modulator), Detection of AM (Square law detector, envelope detector),
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
Power distribution, DSB-SC: generation and detection techniques, SSB: generation and detection techniques, VSB. UNIT–III Angle modulation Techniques Frequency and phase modulation, spectrum and bandwidth, Narrowband FM, Wideband FM, FM Modulators: Direct and Indirect method of frequency modulation, FM Detectors: Slope Detector, Foster Seeley Discriminators, Ratio Detectors and PLL detectors. UNIT–IV Digital conversion of Analog Signals Sampling theorem, types of sampling, signal reconstruction and reconstruction filters, Pulse Amplitude Modulation (PAM), Pulse Width Modulation (PWM), Pulse Position Modulation (PPM), Quantization, quantization error, Pulse Code Modulation (PCM), Companding, TDM-PCM, Differential PCM, Delta modulation, Adaptive Delta modulation. UNIT–V Digital Modulation Techniques Generation and Detection: Amplitude shift keying, Binary Phase shift Keying, differential PSK, Quadrature PSK, M-ary PSK. Frequency shift Keying, M-ary FSK, Quadrature Amplitude Modulation. Bandwidth, spectrum and constellation diagram of various shift keying techniques. TEXT BOOKS: 1. B.P. Lathi, Modern Digital and Analog Communication System; TMH. 2. Simon Haykins, Communication System, John Willy. 3. Singh & Sapre, Communication System, TMH. 4. Taub & Shilling, Communication System, TMH. REFERENCES: 1. Rao, Analog communication, TMH 2. P K Ghose, principal of communication of analog and digital, Universities press. 3. H P. Hsu: Schaum’s Outline Signals and Systems, TMH 4. H P. Hsu: Schaum’s Outline Analog and Digital Communications, TMH 5. Proakis, Fundamental of communication system. (Pearson edition). 6. Wayne Tomasi, Electronic Communication system. (Pearson edition). LIST OF EXPERIMENTS: 1. To Understand the Fourier Series Decomposition and Reconstruction for periodic Signals. 2. To analyze characteristics of AM modulator & Demodulators. 3. To analyze characteristics of FM modulators& Demodulators. 4. Study of sampling process and signal reconstruction and aliasing. 5. Study of PAM, PPM and PWM. 6. Study of PCM transmitter and receiver.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
7. Study of Time division multiplexing (TDM) and De multiplexing. 8. Study of Delta modulation. 9. Study of Adaptive delta modulation. 10. Study of ASK PSK and FSK transmitter and receiver.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
60
20
20
30
20
Th
T
P
CREDITS
Teachers Assessment*
Software Engineering & Project Management
END SEM University Exam
-
COURSE NAME
Teachers Assessment*
BTCS504
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
3
1
2
5
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES The student will have ability to: 1. Knowledge of basic software engineering methods and practices. 2. Define software requirements and requirement engineering. 3. Apply approaches for various designs and their principle. 4. Explore testing in various domains. 5. Development of significant teamwork and project based experience. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. Compare various software process models and identify where these models are applicable. 2. Define and analyze software project management, the framework and the dimensions of software project management. 3. Comprehend System modeling using UML. 4. Identify software testing strategies by using testing tools. 5. Analyze software risks and risk management strategies. SYLLABUS UNIT–I Nature of software, software engineering, software process, A Generic process model, process assessment and improvement, prescriptive process models-waterfall model, incremental models, evolutionary models, concurrent models, Specialized Process Model, Unified Process, Personal and team process models, process technology, Agile development. UNIT–II Functional and Non-functional requirements, Requirement Sources and Elicitation Techniques, Analysis Modeling for Function-oriented and Object-oriented software development, Use case Modeling, System and Software Requirement Specifications, Requirement Validation, Traceability.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
UNIT–III The Software Design Process, Design Concepts and Principles, Software Modeling and UML, Architectural Design, Architectural Views and Styles, User Interface Design, Function-oriented Design, SA/SD Component Based Design, Design Metrics. UNIT–IV Software testing strategies-Approach, issues, validation testing and their criteria, system testing, alphabeta testing, system testing, debugging, Testing conventional applications, Testing object oriented applications ,Testing web applications. UNIT–V Need and Types of Maintenance, Software Configuration Management (SCM), Software Change Management, Version Control, Change control and Reporting, Program Comprehension Techniques, Re-engineering, Reverse Engineering, Tool Support. Project Management Concepts, Feasilibility Analysis, Project and Process Planning, Resources Allocations, Software efforts, Schedule, and Cost estimations, Project Scheduling and Tracking, Risk Assessment and Mitigation, Software Quality Assurance(SQA). Project Metrics. TEXT BOOKS: 1. Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Tata McGraw-Hill seventh edition, 2009. 2. Richard Fairley, “Software Engineering Concepts” –, Tata Mcgraw Hill, 2008. 3. Pankaj Jalote ,”An Integrated Approach to Software Engineering”, Narosa Pub, 2005. 4. Richard H.Thayer,”Software Enginerring & Project Managements”,Willey India
REFERENCES: 1. Bernd Bruegge, Allen H. Dutoit,“ Object-Oriented Software Engineering” Using UML, Patterns, and Java, PEARSON Third Edition, 2017. 2. Waman S.Jawadekar,”Software Enginerring”, TMH 3. Ian Sommerville, “Software Engineering”, Seventh Edition, Pearson Education Asia, 2007. 4. Rajib Mall, “Fundamentals of Software Engineering” Second Edition, PHI Learning. LIST OF EXPERIMENTS: Select a topic of the project, and then make the report on following points: 1. System Analysis 1.1. Identification of Need 1.2. Preliminary Investigation 2. Feasibility Study 2.1. Technical Feasibility 2.2. Economical Feasibility 2.3. Operational Feasibility 3. Literature Survey
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
3.1. Work done by other 3.2. Benefits 3.3. Proposed Solution 3.4. Technology used 4. Technical Part 5. Software Engineering Approach 5.1. Software Engineering paradigm Applied 5.1.1. Description 5.1.2. Advantage & Disadvantages 5.1.3. Reasons for use 5.2 Requirement Analysis 5.2.1 Software Requirement Specification 5.2.1.1 Glossary 5.2.1.2 Supplementary Specifications 5.2.1.3 Use Case Model 5.2.1.4 Comparative analysis documents 5.2.2 Conceptual Level Activity Diagram 5.3 Planning Managerial Issues 5.3.1 Planning Scope 5.3.2 Project Resources 5.3.3 Team Organization 5.3.4 Project Scheduling 5.3.5 Estimation 5.3.6 Risk Analysis 5.3.7 Security Plan 5.4 Design 5.4.1. Design Concept 5.4.2. Design Technique 5.4.3. Modeling 5.4.3.1. ER Model 5.4.3.2. DFD Model 5.4.3.2.1. DFD Model Level-0 and 1 5.4.3.2.2. DFD Model Level 2 and 3 5.4.3.3. Data Dictionary 5.4.3.4. Activity Diagram 5.4.3.5. Software Architecture 5.5 Implementation Phase 5.5.1. Language Used Characteristics 5.5.2. Coding 5.6 Testing 5.6.1. Testing Objectives 5.6.2. Testing Methods & Strategies used along with test data and the error listed for each test case for each function provided by the system
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
-
-
-
-
50
Th
T
P
CREDITS
Teachers Assessment*
Technical Presentation Skills
END SEM University Exam
-
COURSE NAME
Teachers Assessment*
BTIT507
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
-
-
2
1
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS) TEACHING & EVALUATION SCHEME
-
-
-
30
20
Th
T
P
CREDITS
Unix/Linux Lab
Teachers Assessment*
-
END SEM University Exam
BTCS507
COURSE NAME
Teachers Assessment*
Category
Two Term Exam
COURSE CODE
PRACTICAL
END SEM University Exam
THEORY
-
-
2
1
Legends: L - Lecture; T - Tutorial/Teacher Guided Student Activity; P - Practical; C - Credit;
*Teacher Assessment shall be based following components: Quiz/Assignment/ Project/Participation in Class, given that no component shall exceed more than 10 marks. COURSE OBJECTIVES The student will have ability to: 1. Learn the UNIX/Linux operating system, including: task scheduling and management. 2. Learn memory management, input/output processing, internal and external commands, 3. Learn shell configuration, and shell customization. 4. Learn and explores the use of operating system utilities such as text editors. 5. Learn electronic mail, file management, scripting, and C/C++ compilers. COURSE OUTCOMES Upon completion of the subject, students will be able to: 1. Identify and use UNIX/Linux utilities to create and manage simple file processing operations, 2. Organize directory structures with appropriate security, and develop shell scripts to perform more complex tasks. 3. Effectively use the UNIX/Linux system to accomplish typical personal, office, technical, and software development tasks. 4. Monitor system performance and network activities. 5. Effectively use software development tools including libraries, preprocessors, compilers, linkers, and make files. SYLLABUS UNIT–I Overview of Unix/Linux: Concepts, Unix/Linux Installation Process, Hardware Requirements for Unix/Linux ,Advantages of Unix/Linux, Reasons for Popularity and Success of Linux/Unix Operating System, Features of Linux/Unix Operating System, Kernel, Kernel Functions, The Shell Basic Commands, Shell Programming:-Shell Variables, Branching Control Structures, Loop-Control Structure, Continue and break Statements, Sleep Command, Debugging Script. Use of Linux as webserver, file server, directory server, application server, DNS server, SMTP server, Firewall, Proxy server.
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
UNIT–II File System: Definition of File System, Defining Geometry, Disk Controller, Solaris File System, Disk Based File Systems, Network-Based File Systems, Virtual File systems, UFS File System, The Boot Block, The Super Block, The Inode, Tuning File System, Repairing File System. UNIT–III Process Control: Viewing a Process, Command to display Process, Process Attributes, Process States, Process Fields, PS Commands options, PGREP, PRSTAT, CDE Process Manager, Scheduling Process, Scheduling Priorities, Changing the Priority of a time-sharing process, Killing Process. UNIT–IV System Security: Physical Security, Controlling System Access, Restricted Shells Controlling File Access, File Access Commands, Access Control List(ACLs), Setting ACL Entries, Modifying ACL entries on a file, Deleting ACL entries on a file, Restricting FTP, Securing Super User Access, Restricting Root Access, Monitoring super user Access, TCP Wrappers. UNIT–V Dynamic Host Configuration Protocol: Introduction, DHCP Leased Time, DHCP Scopes, DHCP IP Address, Allocation Types, Planning DHCP Deployment, DHCP Configuration files, Automatic Startup of DHCP Server, Configuration of DHCP Clients, Manually Configuring the DHCP. Case Study: Installation of Linux, Customization of Linux, Installation of SAMBA, APACHE, TOMCAT, Send MAIL, Postfix, Implementation of DNS, LDAP services, Firewall, Proxy server TEXT BOOKS: 1. Venkatesh Murthy, “Introduction to Unix &Shell”, Pearson Edu. 2. Forouzan, “Unix &Shell Programming”, Cengage Learning. 3. Sumitab Das,”Unix Concept & Application”,TMH. 4. Gopalan, Shivaselvan,”Beginners Guide to Unix ” PHI Learning. REFERENCES: 1. Venkateshwavle,”Linux Programming Tools Unveil`ed”, BS Publication. 2. Richard Peterson,”Linux Complete Reference”,TMH. 3. Richard Peterson,”Unix Complete Reference”,TMH. LIST OF EXPERIMENTS: 1. To Study basic & User status Unix/Linux Commands. 2. Study & use of commands for performing arithmetic operations with Unix/Linux. 3. Create a file called wlcc.txt with some lines and display how many lines, words and characters are present in that file. 4. Append ten more simple lines to the wlcc.txt file created above and split the appended file into 3 parts. What will be the names of these split files? Display the contents of each of these files. How many lines will be there on the last file?
Shri Vaishnav Vidyapeeth Vishwavidyalaya Dual Degree(B.Tech.+M.Tech.) (Computer Science and Engineering) Choice Based Credit System (CBCS)
5. Given two files each of which contains names of students. Create a program to display only those names that are found on both the files. 6. Create a program to find out the inode number of any desired file. 7. Study & use of the Command for changing file permissions. 8. Write a pipeline of commands, which displays on the monitor as well as saves the information about the number of users using the system at present on a file called usere.ux. 9. Execute shell commands through vi editor. 10. Installation, Configuration & Customizations of Unix/Linux. 11. Write a shell script that accepts any number of arguments and prints them in the reverse order. 12. Write a shell script to find the smallest of three numbers that are read from the keyboard. 13. Write a shell script that reports the logging in of a specified user within one minute after he/she logs in. The script automatically terminates if the specified user does not login during a specified period of time. 14. Installation of SAMBA, APACHE, TOMCAT. 15. Implementation of DNS, LDAP services, 16. Study & installation of Firewall & Proxy server
