6th Sem Syllabus

BIKANER TECHNICAL UNIVERSITY, BIKANER
बीकानेर तकनीकी विश्वविद्यालय, बीकानेर

OFFICE OF THE DEAN ACADEMICS
VI Semester
B. Tech. (Computer Science & Engineering)
6CS4-01: Compiler Design
Credit: 3 Max. Marks: 100 ( IA:30, ETE:70)
3L+0T+ 0P End Term Exams: 3 Hours
Course Objectives:
As a result of successfully completing this course, students will:
• Familiar with basic ideas and the working of the compiler.
• Learn about syntax analysis.
• Learn about representation in the form of DAG.
• Learn about theory knowledge of Parsing, Code generation, and optimization.
Course Outcomes:
Upon successful completion of the course, students will be able to
CO-1: Acquire knowledge of different phases and passes of the compiler and use compiler tools like LEX and
YACC.
CO-2: Understand the Top-Down and Bottom-up parsers and construction of LL, SLR, CLR, and LALR
parsing tables.
CO-3: Acquire knowledge about runtime data structure, like symbol table organization and different
techniques.
CO-4: Understand the target machine’s run time environment, its instruction set for code generation, and
techniques for code optimization.
S. No. Contents Hours
1 Introduction: Objective, scope, and outcome of the course. Compiler, Translator, Interpreter 6
definition, Phase of compiler, Bootstrapping, Review of Finite automata lexical analyzer,
Input, Recognition of tokens, Idea about LEX: A lexical analyzer generator, Error handling.
2 Review of CFG Ambiguity of grammars: Introduction to parsing. Top-down parsing, LL 10
grammars & passers error handling of LL parser, Recursive descent parsing predictive
parsers, Bottom-up parsing, Shift reduce parsing, LR parsers, Construction of SLR, Conical
LR & LALR parsing tables, parsing with ambiguous grammar. Operator precedence parsing,
Introduction of automatic parser generator: YACC error handling in LR parsers.
3 Syntax-directed translation: Construction of syntax trees, S-Attributed Definition, L- 10
attributed definitions, Top-down translation. Intermediate code forms using postfix notation,
DAG, Three address code, TAC for various control structures, Representing TAC using
triples and quadruples, Boolean expression, and control structures.
4 Runtime environments: Storage allocation, Strategies, heap management, Activation 8
records, Accessing local and non-local names in a block structured language, Parameters
passing, Symbol table organization, Data structures used in symbol tables.
5 Definition of basic block control flow graphs: DAG representation of basic block, 6
Advantages of DAG, Sources of optimization, Loop optimization, Loop invariant
computation, Peephole optimization, Issues in the design of code generator, A simple code
generator, Code generation from DAG. Machine Independent Optimization: Idea about
global data flow analysis, constant propagation, liveness analysis, and common
subexpression elimination.
Total 40
Approved by …….. academic council meeting held on ……….

Office: Bikaner Technical University, Bikaner
Karni Industrial Area, Pugal Road, Bikaner-334004; Website:https://btu.ac.in Page 26
VI Semester
6CS4-02: Design and Analysis of Algorithms
Credit: 3 Max. Marks: 100 ( IA:30, ETE:70 )
Course Objectives:
• Able to analyze asymptotic runtime complexity of algorithms including formulating recurrence relations.
• Able to understand and design algorithms using greedy strategy, divide and conquer approach, dynamic
programming.
• Demonstrate a familiarity with major algorithms and data structures and Synthesize efficient algorithms in
common engineering design situations
Course Outcomes:
Upon successful completion of the course the students will be able to
CO-1: The ability of how to design an algorithm which solves the current problem in hand.
CO-2: To Write efficient algorithms for given problems.
CO-3: To focus on Deriving the complexities of any given algorithm.
CO-4: Learning the programming of various algorithms through assignments
1 Introduction: Concept of algorithmic efficiency, run time analysis of algorithms, 5
Asymptotic Notations. Growth of Functions, Master’s Theorem,
2 Searching and Sorting: Structure of divide-and-conquer algorithms; examples: binary 7
search, quick sort, Strassen Matrix Multiplication; merge sort, heap sort and Analysis of
divide and conquer run time, recurrence relations.
3 Greedy Method: Overview of the greedy paradigm examples of exact optimization solution: 8
minimum cost spanning tree, approximate solutions: Knapsack problem, Kruskal’s algorithm
and Prim’s algorithm for finding Minimum cost Spanning Trees, Dijkstra’s and Bellman
Ford Algorithm for finding Single source shortest paths, Huffman coding, Activity Selection
Problem.
4 Dynamic programming: Principles of dynamic programming. Applications: Rod cutting 7
problem, Floyd-Warshall algorithm for all pair shortest paths. Matrix multiplication,
travelling salesman Problem, Longest Common sequence, Back tracking: Overview, 8-queen
problem, and Knapsack problem, Traveling Salesman problem.
5 Branch and bound: LC searching Bounding, FIFO branch and bound, LC branch and bound 6
application: 0/1 Knapsack problem
6 Computational Complexity: Polynomial Vs non-polynomial time complexity; NP-hard and 7
NP-complete classes, examples: Circuit Satisfiablity, Vertex cover, Subset Sum problem,
Randomized Algorithms, String Matching, NP-Hard and NP Completeness, Introduction to
Approximation Algorithms,
Total 40
Suggested Books:
1. T .H .Cormen, C .E .Leiserson, R .L . Rivest “Introduction to Algorithms”, 3rd Ed.,PHI, 2011 ( reprint)
2. E. Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,”Galgotia Publication
3. Sara Basse, A. V. Gelder, “ Computer Algorithms,” Addison Wesley
4. Aho ,Ullman “Principles of Algorithms ”
5. S.K Basu- Design Methods and Analysis of Algorithms, 2nd Ed., PHI

VI Semester
6CS4-03: Information Security Systems
Course Objectives:
• Understand security attacks in a digital system.
• Understand basic concept of cryptography
• Understand how to protect information.
• Use theoretical and practical knowledge in securing data transfer and authentication.
Course Outcomes:
CO-1: Identify the security attacks and type of malicious programs
CO-2: Analyze the vulnerabilities in any computing system and hence be able to design a security solution.
CO-3: Evaluate security mechanisms using rigorous approaches by cryptography and Hash functions.
CO-4: To understand various network security applications, IPSec, Firewall, IDS, Web Security, Email
Security and Malicious software
1 Introduction: Objective, scope and outcome of the course. 1
2 Security Attacks, Security Services, Security Mechanisms and Principles, Security goals, 7
Malicious software, Worms, Viruses, Trojans, Spyware, Botnets, Classical encryption
techniques- substitution ciphers and transposition ciphers, cryptanalysis, stream and block
ciphers.
3 Basic of Cryptography: Symmetric and asymmetric cryptography, Data Encryption 9
standard (DES) with example, strength of DES, Design principles of block cipher, AES with
structure, its transformation functions, key expansion, example and implementation. RSA
cryptosystem
4 Cryptographic Hash Function: Simple hash functions, its requirements and security, Hash 9
functions based on Cipher Block Chaining, Secure Hash Algorithm (SHA). Authentication
and key establishment, Message Authentication Codes (MACs), digital signatures.
Security Vulnerabilities: DoS attacks, Buffer Overflow, Race Conditions, Access Control
Problems, Spoofing and Sniffing attacks.
5 Internet Security: TCP/IP Security, Secure Sockets Layer (SSL), Transport Layer Security 7
(TLS), HTTPS, Secure Shell (SSH), IPsec, Email Security, DNS Security, Authentication
Protocols
6 Web Security: Phishing attack, SQL Injection, Securing databases and database access, 7
Cross Site Scripting Attacks, Cookies, Session Hijacking, E-commerce security
System Security: Firewalls, Types: Packet filter (stateless, stateful), Application layer
proxies, Firewall Location and Configurations, Intruders, Intrusion Detection System.
Total 40
Suggested Books:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson Education,
6th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition

VI Semester
6CS4-04: Digital Image Processing
Credit: 3 Max. Marks: 100 ( IA:30, ETE:70)
Course Objectives: As a result of successfully completing this course, students will:
• To learn the fundamental concepts of Digital Image Processing.
• Able to Understand basic image processing operations.
• To understand image analysis algorithms.
• Exposure to current applications in the field of digital image processing.
Course Outcomes: Upon successful completion of the course, students will be able to
CO-1: Review the fundamental concepts of digital image processing systems.
CO-2: Analyze images in the frequency domain using various transforms.
CO-3: Evaluate the techniques for image enhancement, image restoration, and Morphological Operation.
CO-4: Categorize various compression techniques.
CO-5: Interpret image segmentation and representation techniques.
2 Introduction to Image Processing: Digital Image representation, Sampling & 7
Quantization, Steps in image Processing, Image acquisition, color image representation.
3 Image Transformation & Filtering: Intensity transform functions, histogram 8
processing, Spatial filtering, Fourier transforms and its properties, frequency domain
filters, colour models, Pseudo colouring, colour transforms, Basics of Wavelet
Transforms.
4 Image Restoration: Image degradation and restoration process, Noise Models, Noise 8
Filters, degradation function, Inverse Filtering, Homomorphism Filtering.
5 Image Compression: Coding redundancy, Interpixel redundancy, Psychovisual 8
redundancy, Huffman Coding, Arithmetic coding, Lossy compression techniques, JPEG
Compression.
6 Image Segmentation & Representation: Point, Line and Edge Detection, 8
Thresholding, Edge and Boundary linking, Hough transforms, Region Based
Segmentation, Boundary representation, Boundary Descriptors.
Total 40
Suggested Books:
1. Gonzalez C. R., Woods E. R., Digital Image Processing, Pearson Education (2008) 3rd ed.
2. A.K.Jain, “ Fundamentals of Digital Image Processing”, PHI,1995
3. Sonka M., Hlavac V. and Boyle R., Image Processing, Analysis and Machine Vision, Thomson
Learning, (1993)1st ed.
4. McAndrew A., Introduction to Digital Image Processing with Matlab, Thomson Course
Technology (2004)
5. Low A., Introductory Computer Vision and Image Processing, McGraw-Hill (1991), 1st ed.
6. Boyle and Thomas: Computer Vision - A First Gurse 2nd Edition, ISBN 0-632-028-67X, Blackwell
Science 1995.
7. Pakhera Malay K: Digital Image Processing and Pattern Recogination, PHI.

VI Semester
6CS4-05: Introduction to Internet of Things
Course Objectives: As a result of successfully completing this course, students will:
• Able to Understand the fundamentals about IoT
• Able to Understand about IoT Access technologies
• Able to Understand the design methodology and different IoT hardware platforms.
• Able to Understand the basics of IoT Data Analytics and supporting services.
• Able to Understand about various IoT case studies and industrial applications.
Course Outcomes: Upon successful completion of the course, students will be able to
CO-1: Understand the basics and Architecture of IoT
CO-2: Understand design methodology and hardware platforms involved in IoT
CO-3: Analyze the challenges in IoT based design and development
CO-4: Understand IOT Applications in Industrial & real world.
2 Introduction to IoT: Definition and characteristics of IoT, Design of IOT: Physical design 7
of IOT, Logical Design of IOT- Functional Blocks, communication models, communication
APIs, IOT enabling Technologies- Wireless Sensor Networks, Cloud computing, big data
analytics, embedded systems. IOT Levels and deployment templates
3 IoT Hardware and Software: Sensor and actuator, Humidity sensors, Ultrasonic sensor, 8
Temperature Sensor, Arduino, Raspberry Pi, LiteOS, RIoTOS, Contiki OS, Tiny OS.
4 Architecture and Reference Model: Introduction, Reference Model and architecture, 8
Representational State Transfer (REST) architectural style, Uniform Resource Identifiers
(URIs). Challenges in IoT- Design challenges, Development challenges, Security challenges,
Other challenges.
5 IOT and M2M: M2M, Difference and similarities between IOT and M2M, Software 8
defined networks, network function virtualization, difference between SDN and NFV for
IoT.
6 Case study of IoT Applications: Domain specific IOTs- Home automation, Cities, 8
environment, Energy, Retail, Logistics, Agriculture, Industry, Health and Lifestyles.
Total 40
Suggested Books:
1. IoT Fundamentals: Networking Technologies, Protocols and Use Cases for Internet of Things, David
Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry, Cisco Press, 2017
2. Internet of Things – A hands-on approach, Arshdeep Bahga, Vijay Madisetti, Universities Press, 2015
3. Internet of Things: Architecture, Design Principles And Applications, Rajkamal, McGraw Hill
HigherEducation
4. “From Machine-to-Machine to the Internet of Things Introduction to a New Age of Intelligence” Jan
Höller, Vlasios Tsiatsis, Catherine Mulligan, Stamatis Karnouskos, Stefan Avesand, David Boyle,
Elsevier, 2014.

VI Semester
6CS5-11: Artificial Intelligence
Credit:2 Max. Marks: 100 ( IA:30, ETE:70 )
Course Objectives:
• Able to Understand the foundations of Artificial Intelligence in today's environment
• To understand the concepts of state space representation, exhaustive search, heuristic search together
with the time and space complexities
• To understand the applications of AI, such as game playing, theorem proving, and machine learning.
Course Outcomes:
CO-1: Understand the core concepts of artificial intelligence and applications
CO-2: Apply knowledge representation with artificial intelligence using FOL and Predicate logic
CO-3: Possess the ability to apply AI techniques to solve problems of game playing, and machine learning.
CO-4: Possess the skill for representing knowledge using the appropriate technique for a given problem.
2 Introduction to AI and Intelligent agent: Different Approach of AI, Problem Solving : 3
Solving Problems by Searching, Uninformed search, BFS, DFS, Iterative deepening, Bi
directional search, Hill climbing, Informed search techniques: heuristic, Greedy search, A*
search, AO* search, constraint satisfaction problems.
3 Game Playing: Minimax, alpha-beta pruning, jug problem, chess problem, tiles problem 6
4 Knowledge and Reasoning: Building a Knowledge Base: Propositional logic, first order 6
logic, situation calculus. Theorem Proving in First Order Logic. Planning, partial order
planning. Uncertain Knowledge and Reasoning, Probabilities, Bayesian Networks.
5 Learning: Overview of different forms of learning, Supervised base learning: Learning 7
Decision Trees, SVM, Unsupervised based learning, Market Basket Analysis, Neural
Networks.
6 Introduction to Natural Language Processing: Different issue involved in NLP, Expert 5
System, Robotics.
Total 28
Suggested Books:
1. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, 2nd edition.
2. Herbert A. Simon, The Sciences of the Artificial, MIT Press, 3rd Edition (3rd printing), 1999.


6th Sem Syllabus

Uploaded by

Copyright:

Available Formats

6th Sem Syllabus

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

6th Sem Syllabus

Uploaded by

Copyright:

Available Formats

BIKANER TECHNICAL UNIVERSITY, BIKANER

बीकानेर तकनीकी विश्वविद्यालय, बीकानेर

Approved by …….. academic council meeting held on ……….

Approved by …….. academic council meeting held on ……….

Approved by …….. academic council meeting held on ……….

Approved by …….. academic council meeting held on ……….

Approved by …….. academic council meeting held on ……….

Approved by …….. academic council meeting held on ……….

You might also like