Page 31 - B.Tech IT Curriculum and Syllabus R2017 - REC

Department of IT, REC

9. Searching Techniques
10. Mini Project on Application of Data Structures
(Printing Tasks, Hot Potato Game, Palindrome Checker, Push Down Automata)

TOTAL: 60 PERIODS
OUTCOMES:
On successful completion of this course, the student will be able to:
1. Design and implement stacks, queues and linked lists.
2. Work with various data structures and map its applications to appropriate scenarios.
3. Apply good programming design methods for program development.
4. Design and implement trees and graph concepts.
5. Idealize new sorting and searching algorithms.

PLATFORM NEEDED:
Hardware: PC with 4 GB RAM, i3 Processor
Software: Python 3 interpreter for Windows/Linux

IT17211 DIGITAL LABORATORY L T P C
0 0 4 2
OBJECTIVES:
The student should be made to:
 Understand the various logic gates.
 Be familiar with various combinational circuits.
 Understand the various components used in the design of digital computers.
 Be exposed to sequential circuits
 Learn to use HDL

LIST OF EXPERIMENTS:
1. Verification of Boolean Theorems Using Basic Gates.
2. Design and Implementation of Combinational Circuits Using Basic Gates for Arbitrary
Functions, Code Converters.
3. Design And Implementation Of Combinational Circuits Using MSI Devices:
 4 – Bit Binary Adder / Subtractor
 Parity Generator / Checker
 Magnitude Comparator
 Application Using Multiplexers
4. Design And Implementation Of Sequential Circuits:
 Shift –Registers
 Synchronous And Asynchronous Counter
5. Coding Combinational / Sequential Circuits Using HDL
6. Design and Implementation of a Simple Digital System (Mini Project).

TOTAL: 45 PERIODS
OUTCOMES:

Curriculum and Syllabus | B.Tech. Information Technology | R2017 Page 31