MLR Institute of Technology

Laxman Reddy Avenue, Dundigal Police Station Road,

Gandimysamma ‘X’Road, Quthbullapur (M), R.R. Dist - 500 043.
Ph: 08418 – 204066, 204088
www.mlrinstitutions.ac.in Email: principal@mlrinstitutions.ac.in

COURSE FILE
Subject : DIGITAL ELECTRONICS AND

COMPUTER ORGANIZATION
Academic Year : 2023-24

Name of the Faculty : MRS.SRILATHA

Department : COMPUTER SCIENCE &ENGG.
Branch & Year : CSE II YEAR I SEM
Section :A
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043

COURSE FILE INDEX

Task No Task Description Page No

1 Vision and Mission of the institute and department

2 Academic Calendar

3 Student Roll List

4 List of POs, PSOs and COs

5 Syllabus copy

6 CO-PO Mapping

7 Class Timetable and individual Timetable

8 Session Planner

Lecture Notes (Includes the following)

1. Application of Blooms Taxonomy
2. 20 Objective Bits with Answers
3. Student Seminar topics (if applicable)
9
4. MOOCS
5. Two Micro Projects (if applicable)
6. List of Weak Students and Remedial Actions

10 MID-I, MID-II and External Exams Schedules

11 MID-I , MID-II and External Q.papers with CO Mapping

12 Tutorials (if applicable)

13 Assignments/Class Test Qns. With CO Mapping

14 MID-1 , MID-II and Assignments Marks Award list

15 CO Attainments (MID-1, MID-II and Assignments)

16 CO Attainments (External)

17 CO Attainments Consolidated (Internal & External)

CO Attainments Corrective Measures (if any CO not attained

18
after every MID)

Inputs for Curriculum improvement for the next Academic

19
year
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043

Institutional vision and mission

VISION
Promote academic excellence, research, innovation, and entrepreneurial skills to produce
graduates with human values and leadership qualities to serve the nation.

MISSION
Provide student-centric education and training on cutting-edge technologies to make the
students globally competitive and socially responsible citizens. Create an environment to
strengthen the research, innovation and entrepreneurship to solve societal problems.

Departmental vision and mission

VISION
Promote Innovation-centric education to produce globally competent graduates in Computer
Science and Engineering education and research capable of building a strong and developed
nation.
MISSION

M1: Provide rigorous course work and State-of-the-Art laboratories for the students to make
them globally competent.
M2: Strengthen the department interaction with Multi National Companies to enhance
graduate technological advancement skills and research capabilities.
M3: Impart human values and ethics to the graduates for serving the society with highest
regard to the mother land
MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043

Student Roll List

LATERAL ENTRY:
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043

LIST OF PO’S PSO’S AND CO’S

Proficiency Bloom’s
PO Program Outcomes Level
assessed by Level
Engineering knowledge: Apply the knowledge of
mathematics, science, engineering fundamentals, and an Lectures and Apply
1 3 Problem
engineering specialization to the solution of complex Solving
engineering problems.
Identify, formulate, review research literature, and
analyze complex engineering problems reaching Design Apply
Exercises
2 substantiated conclusions using first principles of 2 and
mathematics, natural sciences, and engineering Assignments
sciences.
Design solutions for complex engineering problems and
design system components or processes that meet the Apply and
Assignments, Analyze
3 specified needs with appropriate consideration for the 3 Lectures and
public health and safety, and the cultural, societal, and Exams
environmental considerations.
Use research-based knowledge and research methods
including design of experiments, analysis and Mini and Apply
4 2 Micro
interpretation of data, and synthesis of the information Projects
to provide valid conclusions.
Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including Lectures and Apply
5 2 Problem
prediction and modeling to complex engineering activities Solving
with an understanding of the limitations.
Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and --------
6 0 -------
cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
Understand the impact of the professional engineering
solutions in societal and environmental contexts, and
7 2 Assignments Analyze and
demonstrate the knowledge of, and need for Justify
sustainable development.
Apply ethical principles and commit to professional ethics Assignments
8 2 Analyze
and responsibilities and norms of the engineering practice.
Function effectively as an individual, and as a member or Class Test &
9 2 Seminars Analyze
leader in diverse teams, and in multidisciplinary settings.
Communicate effectively on complex engineering
activities with the engineering community and with Understand
& Analyze
society at large, such as, being able to comprehend and Seminars
10 2
write effective reports and design documentation, make
effective presentations, and give and receive clear
instructions.
11 Demonstrate knowledge and understanding of the 2 Class Tests
 engineering and management principles and apply these to & Group Apply
one’s own work, as a member and leader in a team, to Activity in
manage projects and in multidisciplinary environments. class room
Recognize the need for, and have the preparation and
12 ability to engage in independent and life-long learning in 0 ------- --------
the broadest context of technological change.
The ability to understand the evolutionary changes in Text Book
PS computing and apply problem solving skills, tools, Problems as Apply
2 part of
O1 techniques to address modern computing challenges.
Assignment
The ability to develop intelligent and autonomous systems
PS to cater societal needs especially in the fields of health Design and
2 Placement Develop
O2 care, ecommerce, banking, agriculture, cyber security and
insurance.

0=None 2=Supportive 3=Highly Related

COURSE OUTCOMES:

At the end of the course students will be able to:

1. Use arrays, pointers and structures to formulate algorithms and programs.
2. Design and implement applications of Linked List.
3. Design and implement Stack ADT using Array and Linked List.
4. Design and implement Queue ADT using Array and Linked List.
5. Solve problems involving graphs and trees.
6. Analyze searching and sorting techniques based on time and space complexity.
 DEPARTMENT OF CSE

CIRCULAR Date: 19-09-2023

Sub: -Define Course Outcomes &Course Articulation Matrix for the Course –
Digital Electronics and Computer Organization (A6CS28)– Reg.

All the Course Instructors handling Digital Electronics and Computer Organization
(A6CS28) are here by informed that a meeting is scheduled on MG 003 at 3:00 PM to discuss
on the Agenda given below:

Agenda:
 Define Course Outcomes for the course Digital Electronics and Computer
Organization (A6CS28) Prepare Course Articulation Matrix.
 Justifications for the mapping of Course Outcomes to Program Outcomes.

The following Course Instructors are requested to attend the meeting to discuss on the
Agenda given above.
S.No Members

1 MRS.SRILATHA

2 MRS.SWATHI

3 Mr. Sudhakar

4 Mr. T. Vinod

Course Coordinator
Copy submitted to: HOD(CSE)
 DEPARTMENT OF CSE
Minutes of Meeting

Meeting Name & CO & CAM Meeting No: MLRIT/CO/:

No.
Date of meeting 19-9-23 Time 3:00 PM
Location MG305
Meeting Objective Identify and define Course Outcomes and finalization of Course
Articulation Matrix for the course Digital Electronics and Computer
Organization (A5EC72)
Attendees Dr. Sanjai, Dr. Michael
Mr. Sudhakar, Mr. T. Vinod

Agenda & Notes, Discussions, Issues

Topic Discussions/Decision

The course instructors of Digital Electronics and Computer Organization

(A5EC72) have identified and clearly described the following Course Outcomes to
demonstrate what the student will know and be able to do by the end of a Course.

1. Able to solve from one number to another number.

Identify and 2. Able to combinational and sequential logic circuits
define 3. Identify basic components and design of the CPU: the ALU and control unit.
Course 4. Compare various types of IO mapping techniques
Outcomes - 5. Critique the performance issues of cache memory and virtual memory
Data
Structures
(A5CS03)
Preparation All the Course Instructors of Digital Electronics and Computer Organization
of Course (A5EC72) have prepared Course Articulation Matrix by mapping each Course
Articulation Outcome to Program Outcomes
Matrix by COURSE
OUTCOM PROGRAM OUTCOMES
Course ES
Instructors COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 2 3 3 2 2 2
CO2 3 3 3 3 3 3
CO3 2 2 3 3 3 3
CO4 2 3 3 2 2 3
CO5 2 3 3 3 3 2
CO6 2 3 3 3 3 3
Avg 2 3 3 3 3 3
Prepared by
Dr. Sanjai

COURSE
OUTCOM PROGRAM OUTCOMES
ES
COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 3 2 3 2 2 2
CO2 2 3 3 3 3 3
CO3 2 2 3 3 2 3
CO4 2 3 3 3 3 2
CO5 2 3 3 2 3 3
CO6 2 3 2 3 3 3
Avg 2 3 3 3 3 3
Prepared by
Dr. Michael

COURSE
OUTCOM PROGRAM OUTCOMES
ES
COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 2 3 3 2 2 3
CO2 2 2 3 3 3 3
CO3 2 3 3 2 2 3
CO4 3 3 3 3 3 3
CO5 2 3 2 3 3 2
CO6 3 3 3 2 3 3
Avg 2 3 3 3 3 3
Prepared by
Mr. Sudhakar

COURSE
OUTCOM PROGRAM OUTCOMES
ES
COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 3 3 3 2 2 3
CO2 2 2 3 3 3 3
CO3 2 3 3 2 2 3
CO4 3 3 3 3 3 3
CO5 2 3 2 3 3 2
CO6 3 3 3 2 3 3
Avg 2 3 3 3 3 3
Prepared by
Mr. T. Vinod
 It was decided by the Course Coordinator and Instructors to finalize the Course
Articulation Matrix by taking an average of Course Articulation Matrices prepared
by individual Course Instructors.
Average of Course Articulation Matrices
COURS
E
PROGRAM OUTCOMES
OUTCO
MES
COs/ PO1 PO2 PO3 PO4 P PO PO PO P PO PO11 PO12 PS PSO
POs O 6 7 8 O9 10 O 2
5 1

CO1 2.50 2.75 3 2 2 2.50

CO2 2.25 2.50 3 3 3 3
CO3 2 2.50 3 2.50 2.25 3
CO4 2.50 3 2.75 2.75 2.50 2.75
CO5 2 3 2.50 2.75 3 2.25
CO6 2.50 3 2.75 2.50 3 3
Finalization
of Course
Articulation Course Articulation Matrix for Digital Electronics and Computer
Matrix Organization (A5EC72)

COURSE
OUTCOM PROGRAM OUTCOMES
ES
COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 2 3 3 2 2 2
CO2 2 3 3 3 3 3
CO3 2 2 3 3 3 3
CO4 2 3 3 3 3 3
CO5 2 3 3 3 3 3
C06 2 3 3 3 3 3
Avg 2 3 3 3 3 3
Correlation levels 1,2 or 3 as defined below:
1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)
Justification The Course Coordinator and Instructors prepared justifications for Course
s for CO - Articulation Matrix - the mapping of Course Outcomes to Program Outcomes as
PO below .
mapping Mapping
Leve
CO-PO Justification
l
CO1- PO1
CO2- PO1
Students can use basic mathematics in solving
CO3- PO1
2 computer science problems using Digital Electronics
CO4- PO1
and Computer Organization.
CO5- PO1
CO6- PO1
CO1- PO2 3
CO2- PO2 3
Digital Electronics and Computer Organization will
CO3- PO2 2
help in designing complex engineering problems like
CO4- PO2 3
deigning compilers.
CO5- PO2 3
CO6- PO2 3
CO1- PO3 3 By analyzing time and space complexity using
CO2- PO3 Digital Electronics and Computer Organization we
CO3- PO3 design effective solutions
CO4- PO3
CO5- PO3
 CO6- PO3
CO1- PO4 2
CO2- PO4 3
Design effective solutions and draw valid
CO3- PO4 3
conclusions using Digital Electronics and Computer
CO4- PO4 3
Organization.
CO5- PO4 3
CO6- PO4 3
CO1- PO11 2
CO2- PO11 3
Designing cost effective solution by evaluating time
CO3- PO11 3
and space complexity of various Digital Electronics
CO4- PO11 3
and Computer Architectures
CO5- PO11 3
CO6- PO11 3
CO1- PO12 2
CO2- PO12 3
It helps in lifelong learning as most of the real time
CO3- PO12 3
computer science problem solving involves Digital
CO4- PO12 3
Electronics and Computer Organization.
CO5- PO12 3
CO6- PO12 3

Attendees
Signature
Mr. Sudhakar – Course Coordinator

Dr. Sanjai – Course Instructor

Dr. Michael Preetam Raj– Course Instructor

Mr. T. Vinod - Course Instructor

Copy to: HOD (CSE) and Course Instructors

TIMETABLE
 Department of CSE

MRS.SRILATHA (DECO for II CSE –A) A.Y :2023-24

W.E.F:19-9-2023
1 2 3 4 12.4 5 6 7
9.20-10.10 10.10- 11.00-11.50 11.50-12.40 0- 1.30-2.20 2.20-3.10 3.10-4.00
11.00 1.30
Mon

Tue DECO
L
Wed U DECO
N
Thu C DECO
H
Fri DECO

Sat DECO

MLR Institute of Technology

Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
 Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

SESSION PLANNER

Subject: Digital Electronics and Computer Organization

Year: II-ISEM
Branch: Computer Science & Engineering Section: CSE-B
Academic Year: 2023-24

S.No Unit Lecture Topic Text/Ref Date Date

No. No. book Planned Conducted

L1
1 Introduction T1,R1
Representation of numbers of different
2 L2 radix T1,R1
conversion of numbers from one radix to
3 L3 another radix T1,R1
conversion of numbers from one radix to
4 L4 another radix T1,R1
5 L5 r-1‘s complement and r‘s complement T1,R1
6 L6 r-1‘s complement and r‘s complement T1,R1
I Basic Theorems and Properties of
7 L7 Boolean algebra T1,R1
Basic Theorems and Properties of
8 L8 Boolean algebra T1,R1
9 L9 Canonical and Standard Forms T1,R1
10 L10 Canonical and Standard Forms T1,R1
11 L11 Digital Logic Gates T1,R1
12 L12 Universal Logic Gates T1,R1
13 L13 K- Map Method T1,R1
14 L14 K- Map Method T1,R1
15 L15 UNIT 2 Class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted

16 Design of Full adder

L16 T2,R1
17 L17 full subtractor T2,R1
18 L18 Decoder T2,R1
19 L19 Encoder T2,R1
20 L20 Multiplexer T2,R1
21 L21 De-multiplexer T2,R1
II
22 L22 comparator T2,R1

23
L23 Latches T2,R1
24 L24 flip-flops T2,R1
25 L25 Design of Ripple counters T2,R1
26 L26 Johnson counter T2,R1
27 L27 Ring counter,Shift register
 28 L28 UNIT 2 Class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
29 L29 Instruction codes T2,R1
30 L30 Computer Registers T2,R1
31 L31 Computer Instructions T2,R1
32 L32 Timing and Control T2,R1
33 L33 Instuction cycle T2,R1
34 L34 Memory-Reference Instructions T2,R1
35 III L35 Input-Output and interrupt
36 L36 Input-Output and interrupt T2,R1
37 L37 Stack organization T2,R1
38 L38 Instruction Formats T2,R1
39 L39 Addressing Modes T2,R1
40 L40 Data Transfer and Manipulation T2,R1
41 L40 UNIT 3 class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
Register Transfer Language, Register
42 L42 Transfer T2,R1
43 L43 Bus and Memory Transfers T2,R1
44 L44 Arithmetic Micro Operations T2,R1
45 L45 Logic Micro-Operations T2,R1
46 L46 Shift Micro-Operations T2,R1
47 L47 Pipeline and Parallel Processing T2,R1
48 L48 Parallel Processing T2,R1
IV
49 L49 Pipelining T2,R1
50 L50 Arithmetic Pipeline T2,R1
51 L51 Instruction Pipeline T2,R1
52 L52 Instruction Pipeline T2,R1
53 L53 UNIT IV class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
54 L54 I/O interface, Programmed IO T2,R1
55 L55 Memory Mapped IO, Interrupt Driven IO T2,R1
56 L56 DMA, Characteristics of multiprocessors T2,R1
57 L57 Interconnection structures T2,R1
58 L58 Inter Processor Arbitration T2,R1
Inter processor Communication and
59 L59 Synchronization T2,R1
60 V L60 Cache Coherence T2,R1

61 L61 Revision T2,R1

62 L62 Revision T2,R1
63 L63 Revision T2,R1
64 L64 Revision T2,R1
65 L65 Revision T2,R1
 66 L66 Revision T2,R1
67 L67 Revision T2,R1
68 L68 UNIT V class test

Signature of Faculty Signature of HOD

MLR Institute of Technology

Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
 Schedule for Preparation of Course File: A.Y 2022-23 (II Sem)
Task No Task Description Target Date
Course Description consisting of objective, outcomes and mapping of
1 objectives with outcomes and mapping of outcomes with six levels of
blooms taxonomy.
2 Session Planner with session objectives/Syllabus Coverage
3 Time Table
Material to be ordered unit wise
a) Class notes – as per SOP (Unit wise)
b) Application of Bloom Taxonomy. Minimum one example
relating to all levels for each unit. Bloom questions may be
framed from previous three years JNTU papers, competitive
exams and GATE.
c) i) Twenty objective bits with answer
ii) For Core subjects, two to three solved problem (objective
types) pertaining to important concepts which relate to GATE,
Competitive exam and Placement Questions. A minimum of 20
bits for each unit. Reference be made to GATE (year),
Competitive exam (name) and Placement Questions (Company).
d) Two Assignment Questions per unit. Assignment questions will
4
be framed from NPTEL Video/eLSDM
Link/Journal/Original/Standard Test books/Reference books.
Questions shall relate to Bloom Taxonomy level III and above.
The framed questions should be such that the student prepares
the answer after referring to the specified linked material.
Assignment questions will be used by the student for giving
student seminar.
e) Three Tutorials questions per unit with answers, Tutorial
questions shall pertain to problem solving. Emphases be on
GATE Questions, questions taken from previous three years.
JNTU papers and from Original/Standard Text books/Reference
Books.
f) Exam objectives
5 Student seminar topics
6 MOOCs (Massive open online courses)
Two Micro Projectors per subject for those core subjects which are
7
applied to build real-time projects
8 Mid-Term Test, Quality and Evaluation
9 List of Week students & Remedial Action
10 Lab Session Planner
Manual preparation for lab subject by lab faculty. The manual will
include ten variation experiments pertaining to each JNTU experiment.
11
The variation experiments shall be similar to Hacker Rank problems for
those concepts relevant to it.
12 Target
13 Material for Handbook
14 Sample Assignments/ Class Test
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

I. INSTRUCTION FOR THE MAINTENANCE OF THE COURSE FILE:

1. Order the course file as per the index and keep it neat and clean.
2. Complete the formats which have been supplied as part of course file.
3. The items listed in the index, but not supplied have to be prepared by you and placed in
the course file.
4. Prepare hand written class notes as per the standard operating procedure (SOP) given at
structure II.
 5. Put up the course file for the verification of the HOD once in a fortnightly and take his
signature on the HOD Review format.
6. Course file will be audited for quality checks by outside experts and as such be in perfect
order for inspection at any time.
7. Plan Session Planner 60 periods / semester and 120 periods I-B.Tech.
8. Handover the course file to the HOD at the end of the semester or at the time of relieving
from the college.
II. STANDARD OPERATING PROCEDURE (SOP) ON PREPARATIO OF
CLASS NOTES:
1. INTRODUCTION.

The Class Notes are the most Valuable Course Material and bear the stamp of the faculty
reflecting his attitude towards the profession of teaching. The Class Notes provide confidence
to the faculty to deliver the subject matter in a systematic and effective way thus improving
the Teaching-Learning Process. It is pertinent that each and every faculty member shall
prepare the Class Notes for the subjects allocated to them.
2. PROCEDURE.
The procedure is described in succeeding paragraphs.

3. FRAME WORK: The Frame Work is given below:

MLR20 Syllabus
|
Text books, Reference Books and down loaded Material
|
Compilation of Session Planner (56 to 64 Lessons)
|
Preparation of Class Notes

4. PREPARATION OF SESSION PLANNER: The step by step procedure as described

will be followed to prepare the Session Planner.

a) A copy of the MLR20 Syllabus relevant to his/her theory subject will be collected by
the nominated faculty of the subject

b) Text Books and Reference Books mentioned in the syllabus will be gone through by
the concerned faculty to gather information that which chapter(s) of these books is
relevant for each Unit of the Syllabus. Faculty may also refer to other relevant
material including downloaded for this purpose.

c) Each Unit will be divided in to Sessions as per MLR20 Syllabus such that it can be
covered in a period of 50 minutes.

d) The Session Planner limiting to 56 to 64 Lessons will be prepared as per the enclosed
format given below.
 Session Planner
S. Unit Class Topic Text/Ref Chapter Date Date
No No book No Planned Conducted
1
2
3

64

e) The Session Planner will be pasted in the Attendance Register

5. COMPILATION OF CLASS NOTES: The class Notes will be compiled by the faculty
members the faculty members should take it as a challenge to prepare their lecture notes .He
has to refer as many books as possible, his own class notes which is prepared previously for
his reference and use, discuss with his peers, colleagues, seniors etc. The lecture notes
prepared by the faculty should be complete in all the respects and should attract the
appreciation, acclodes and satisfactory comments from every section of the people who refers
the lecture notes. It also helps the faculty members as a standard book for his reference and
delivering lectures at any time. Hence faculty members are advised to take utmost care in
preparing lecture notes after studying the text book, reference book and other relevant
material available with him/her. The guidelines related to the format and not the content are
given below:

a) Class Notes will be prepared by the faculty Lesson-Wise on A4 paper.

b) The text of the Lesson will be Hand written by the faculty and will describe the matter
maximum in point (bullet) format.

c) Each Lesson will include the course material relating to the topic mentioned in the
Session Planner. The no. of pages of material for each session be limited so that it can
be covered in 50 minutes. However, a minimum of one page material will be prepared
for one session. The material may be supported with handouts/OHP/PPT slides.

d) Each topic should be explained with reference to the following problem.

i. Definition
ii. Figures, Flowcharts, Block Diagrams, Tables
iii. Derivations, Mathematical Expressions and Graphs
iv. Examples
v. Applications
vi. Problems (with solutions)
e)
 The format of the Class Notes is given below.

Subject: Class Notes

Faculty: Unit No:
Topic: Lecture No:
Link to Session
Planner (SP):S.No….of SP
Hand Written Notes Date Conducted:
Page No:

6. CONCLUSION: The preparation of Class Notes is the most important step towards the
implementation of effective Teaching-Learning Process. It must be noted the Class Notes are
not the static document and must be revised by the faculty every year by adding new pages to
the existing Class Notes. The additional Class Note material must take into account the
charges in the MLR20 Syllabus and new trends in technologies related to the subject.

The SOP will be revised at the end of every semester for improvement. The comments
received from the Depts. will be included.
1. COURSE DESCRITPTION
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

COURSE DESCRIPTION

Name of the Dept: COMPUTER SCIENCE AND ENGINEERING

Course Title
DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION
Course Code A5EC72

Regulation MLR20

Lectures Tutorials Practical Credits

Course Structure
3 1 -- 4

Course Coordinator Mr. Sudhakar

Team of Instructors Dr. Sanjai, Dr. Michael, Mr. Sudhakar, Mr. T. Vinod

I. COURSE OVERVIEW:

This Course main objective for the student to is to understand different number systems and design
combinational and sequential logic circuits. Also, students shall understand concepts of register transfer logic
and arithmetic operations, Learn different types of addressing modes and memory organization.

II.PREREQUISITES:

Level Credits Periods/Weeks Prerequisites

UG 4 6 C Programming

III. COURSE ASSESSMENT METHODS:

a) Marks Distributions (Traditional Evaluation methods)
University End Total
Session Marks (30M)
Exam Marks Marks
Mid Semester Test
There shall be two midterm examinations.
Each midterm examination consists of subjective type
The subjective test is for 25 marks of 120 minutes duration.
First midterm examination shall be conducted for the first two and half
units of syllabus and second midterm examination shall be conducted 70 100
for the remaining portion.
Assignment
Five marks for assignments.
There shall be two assignments in every theory course. Marks shall be
awarded considering the average of two assignments in each course.

b) Expected Learning Outcomes and Methods for Assessing

 S.
Expected Learning Outcomes Assessment method (s)
No
a
Able to solve from conversion from one number CIE & SEE and Assignments
system to another
b
Able to design combinational and sequential logic CIE & SEE and Assignments
circuits
c
Identify basic components and design of the CPU: CIE & SEE and Assignments
the ALU and control unit
d Compare various types of IO mapping techniques CIE & SEE and Assignments

e
Critique the performance issues of cache memory CIE & SEE and Assignments
and virtual memory

IV. EVALUATION SCHEME:

S. No Component Duration Marks
1 I Mid Examination 120 minutes 25
2 I Assignment 5
3 II Mid Examination 120 minutes 25
4 II Assignment 5
5 External Examination 3 hours 70

V. Course Objectives and Course Outcomes

Blooms
Course Objectives Course Outcomes
Level
1. Understand different number
A. Able to solve from conversion from one
systems.
number system to another
BL-3

2. Design combinational and sequential B. Able to design combinational and

logic circuits sequential logic circuits
BL-4
3. Understand concepts of register C. Identify basic components and design of
transfer logic and arithmetic operations. the CPU: the ALU and control unit
BL-5
4. Learn different types of addressing D. Compare various types of IO mapping
modes and memory organization techniques
BL-6
E. Critique the performance issues of
cache memory and virtual memory
BL-6
BLOOMS LEVEL (BL)
BL 1: Remember / knowledge BL2: Understanding BL3: Apply
BL 4: Analyze BL 5: Evaluate BL 6: Create

VII. HOW PROGRAM OUTCOMES ARE ASSESSED:

Proficiency Bloom’s
PO Program Outcomes Level
assessed by Level
Engineering knowledge: Apply the knowledge of
mathematics, science, engineering fundamentals, and an Lectures and Apply
1 3 Problem
engineering specialization to the solution of complex Solving
engineering problems.
2 Identify, formulate, review research literature, and 2 Design
analyze complex engineering problems reaching Exercises Apply
and
substantiated conclusions using first principles of Assignments
mathematics, natural sciences, and engineering
 sciences.
Design solutions for complex engineering problems and
design system components or processes that meet the Apply and
Assignments, Analyze
3 specified needs with appropriate consideration for the 3 Lectures and
public health and safety, and the cultural, societal, and Exams
environmental considerations.
Use research-based knowledge and research methods
including design of experiments, analysis and Mini and Apply
4 2 Micro
interpretation of data, and synthesis of the information Projects
to provide valid conclusions.
Create, select, and apply appropriate techniques,
resources, and modern engineering and IT tools including Lectures and Apply
5 2 Problem
prediction and modeling to complex engineering activities Solving
with an understanding of the limitations.
Apply reasoning informed by the contextual
knowledge to assess societal, health, safety, legal and --------
6 0 -------
cultural issues and the consequent responsibilities
relevant to the professional engineering practice.
Understand the impact of the professional engineering
solutions in societal and environmental contexts, and
7 2 Assignments Analyze and
demonstrate the knowledge of, and need for Justify
sustainable development.
Apply ethical principles and commit to professional ethics Assignments
8 2 Analyze
and responsibilities and norms of the engineering practice.
Function effectively as an individual, and as a member or Class Test &
9 2 Seminars Analyze
leader in diverse teams, and in multidisciplinary settings.
Communicate effectively on complex engineering
activities with the engineering community and with Understand
& Analyze
society at large, such as, being able to comprehend and Seminars
10 2
write effective reports and design documentation, make
effective presentations, and give and receive clear
instructions.
Demonstrate knowledge and understanding of the Class Tests
engineering and management principles and apply these to & Group Apply
11 2 Activity in
one’s own work, as a member and leader in a team, to
manage projects and in multidisciplinary environments. class room
Recognize the need for, and have the preparation and
12 ability to engage in independent and life-long learning in 0 ------- --------
the broadest context of technological change.
The ability to understand the evolutionary changes in Text Book
PS computing and apply problem solving skills, tools, Problems as Apply
2 part of
O1 techniques to address modern computing challenges.
Assignment
The ability to develop intelligent and autonomous systems
PS to cater societal needs especially in the fields of health Design and
2 Placement Develop
O2 care, ecommerce, banking, agriculture, cyber security and
insurance.
0=None 2=Supportive 3=Highly Related
IX. COURSE PLAN:
 At the end of the course, the students are able to achieve the following Course Learning Outcomes. The
course plan is meant as a guideline. There may probably be changes
Lectu Course Topics to be covered Reference Blooms Level
re Learning
No. Outcomes

1 A,B T1 /Ch1 1&2

2 A,B, T1 /Ch1 1, 2,3 & 4

3 A,B,C T1 /Ch4 1, 2,3, 4,5 & 6

4 A,B T1 /Ch3 1,2 & 3

5 A,B T1 /Ch3 1,2 & 3

6 A,C T1 /Ch3 1,2

7 A T1 /Ch3 1,2 & 3

8 A,C T1 /Ch3 1,2 & 3

9 A,B T1 /Ch3 1,2 & 3

10 B,C T1 /Ch4 1,2

11 B,C T1 /Ch4 1,2

12 A,C,D T1 /Ch5 1,2

13 A,B T1 /Ch5 1,2

14 A,B T1 /Ch5 1,2

15 A,B T1 /Ch5 1,2

16 A T1 /Ch5 1,2,3

17 A,B T1 /Ch8 1,2

18 A,B,C T1 /Ch8 1,2

19 A,B,E T1 /Ch8 1,2

20 A,B,E T1 /Ch8 1,2,3

21 A,B.E T1 /Ch8
1,2
22 A,B,E T1 /Ch7 1,2,3,4
23 A,B,E T1 /Ch7 1,2,3

24 T1 /Ch7 1,2

25 A,C,D T1 /Ch7 1,2,3,4,5 & 6

26 A,C,D T1 /Ch7 1,2,3,4,5 & 6

27 A,C T1 /Ch10 1,2,3

28 A,B T1 /Ch10 1,2,3

29 A,D T1 /Ch10 1,2,3

30 B,C,E T1 /Ch10 1,2,3

31 A,C T1 /Ch10 1,2,3

32 C,D T1 /Ch10 1,2,3

33 C,D T1 /Ch12 1,2

34 B,C,D T1 /Ch12 1,2,3

35 B,C,D T1 /Ch12 1,2,3

36 D,E T1 /Ch12 1,2

37 D,E T1 /Ch12 1,2,3

38 D,E T1 /Ch12 1,2,3,4

39 D,E T1 /Ch12 1,2,3

40 A,B T1 /Ch12 1,2,3,4,&5

41 B,C T1 /Ch12 1,2,3,4,&5

42 A,C,D T1 /Ch12 1,2

43 A,C T1 /Ch12 1,2

44 A,C T1 /Ch12 1,2,3

45 A,B T1 /Ch12 1,2,3 & 4

46 A,B,D T1 /Ch11 1,2

47 A,B,D T1 /Ch11 1,2

48 B,C T1 /Ch11 1,2

49 B,C T1 /Ch11 1,2

50 C,D T1 /Ch11 1,2

51 C,D T1 /Ch11 1,2

52 A,C,D,E T1 /Ch11 1,2

53 A,C,D,E T1 /Ch11 1,2

54 A,B T1 /Ch11 1,2,3

55 A,C T1 /Ch11 1,2,3,4,&5

56 A,C T1 /Ch11 1,2,3,4,&5

57 A,C T1 /Ch11 1,2,3,4,&5

X. MAPPING COURSE OBJECTIVES LEADING TO THE ACHIEVEMENT OF

COURSE OUTCOMES:
Course Outcomes
Course Objective
CO1 CO2 CO3 CO4 CO5 CO6
I 3
II 3
III 2 2
IV 3
V 3
2=Supportive 3=Highly Related

XI. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF PROGRAM

OUTCOMES:
COURSE
OUTCOM PROGRAM OUTCOMES
ES
COs/ PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PS PSO
POs 1 2 3 4 5 6 7 8 9 0 1 2 O 2
1
CO1 2 3 3 2 2 2
CO2 2 3 3 3 3 3
CO3 2 2 3 3 3 3
CO4 2 3 3 3 3 3
CO5 2 3 3 3 3 3
C06 2 3 3 3 3 3
Avg 2 3 3 3 3 3

Correlation levels 1,2 or 3 as defined below:

1. Slight (Low) 2. Moderate (Medium) 3. Substantial (High)

XII. MAPPING OF BLOOM TAXONOMY WITH COURSE OUTCOMES

6. Creating /
Synthesis :
4. Analyzing / 5. Evaluating /
Builds a structure or
Analysis : Evaluation:
pattern from diverse
2. Understanding / 3. Applying / Separates material or Make judgments
elements. Put parts
Comprehension : Application: concepts into about the value of
together to form a
Comprehending the Use a concept in a component parts so ideas or materials.
whole, with emphasis
1. Remembering / meaning, translation, new situation or that its organizational
on creating a new
Blooms Taxonomy  Knowledge: interpolation, and unprompted use of an structure may be Key Words:
meaning or structure.
Recall or retrieve interpretation of abstraction. Applies understood. Agree, Appraise,
previous learned instructions and what was learned in Distinguishes between Assess, Award,
Key Words:
information. problems. State a the classroom into facts and inferences. Choose, Compare,
Adapt, Build, Change,
problem in one's own novel situations in the Conclude, Criteria,
Choose, Combine,
Key Words: words. work place. Key Words: Criticize, Decide,
Compile, Compose,
Choose, Define, Find, Analyze, Assume, Deduct, Defend,
Construct, Create,
How, Label, List, Key Words: Key Words: Categorize, Classify, Determine, Disprove,
Delete, Design,
Match, Name, Omit, Classify, Compare, Apply, Build, Compare, Conclusion, Estimate, Evaluate,
Course Outcomes Develop, Discuss,
Recall, Relate, Select, Contrast, Demonstrate, Choose, Contrast, Discover, Explain, Importance,
Elaborate, Estimate,
Show, Spell, Tell, Explain, Extend, Construct, Develop, Dissect, Distinguish, Influence, Interpret,
Formulate, Happen,
What, When, Where, Illustrate, Infer, Experiment, with, Divide, Examine, Judge, Justify, Mark,
Imagine, Improve,
Which, Who, Why Interpret, Outline, Identify, Interview, Function, Inference, Measure, Opinion,
Invent, Make up,
Relate, Rephrase, Make use of, Model, Inspect, List, Motive, Perceive, Prioritize,
Maximize, Minimize,
Show, Summarize, Organize, Plan, Relationships, Prove, Rate,
Modify, Original,
Translate Select, Solve, Utilize Simplify, Survey, Recommend, Rule
Originate, Plan,
Take, part, in, Test on, Select, Support,
Predict, Propose,
For, Theme value
Solution, Solve,
Suppose, Test, Theory
a) Apply
b) Design
c) Design
d) Design
e) Solve
f) Analyze
 2. SESSION PLANNER/
SYLLABUS COVERAGE
(Session Planner/Syllabus Coverage of the Subject to be prepared by the
faculty member as per the proforma according to syllabus, assignments,
class tests, tutorials & Mid Exams)
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

SESSION PLANNER

Subject: Data Structures

Branch& SEM: CSE- II/I Academic Year: 2022-23
Faculty : DR. P. MICHAEL PREETAM RAJ Section :

S.No Unit Lecture Topic Text/Ref Date Date

No. No. book Planned Conducted

Introduction to Structures: Structure

L1 definition, initialization, accessing
1 structures T1,R1
2 L2 Nested structures T1,R1
3 L3 arrays of structures T1,R1
4 L4 structures and functions T1,R1
5 L5 structures and functions T1,R1
6 L6 self-referential structures T1,R1
7 L7 Pointer – Basics, Pointer to Structure T1,R1
8 L8 Introduction to Data Structures T1,R1
I Linear Data Structures, Non-Linear
L9
9 Data Structures T1,R1
Array: Representation of single
L10
10 dimensional arrays T1,R1
Representation of two dimensional
L11
11 arrays T1,R1
12 L12 Array Operations T1,R1
sparse matrices and their
13 L13 representation T1,R1
ACTIVITY: Flipped Class Room
Topic: Structures and Functions
14 L14 UNIT 1 Class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
Introduction to Single Linked List,
15 node structure and Representations of
L15 SLL T2,R1
16 L16 Representation & Traversing T2,R1
II Insertion operation: Insertion at
17
L17 beginning T2,R1
Insertion at ending, at specified
18
L18 position. T2,R1
19 L19 Deletion Operation: Deletion at front T2,R1
 Deletion at last and at specified
20
L20 position. T2,R1
21 L21 Concatenation of two SLL T2,R1
Double Linked List , Representation
22
L22 of DLL, node structure T2,R1

23 Double linked list Operations:

L23 Traversing(Forward and Backward) T2,R1
Insertion at beginning, Insertion at
24
L24 ending T2,R1
25 L25 Insertion at specified position T2,R1
Circular Single Linked List
26
L26 Operations T2,R1
Circular Single Linked List
27
L27 Operations T2,R1
Circular Double Linked List
28
L28 Operations T2,R1
Circular Double Linked List
29
L29 Operations T2,R1
ACTIVITY: In class teams
Topic: Double Linked List operations
30 L30 UNIT 2 Class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
31 L31 Introduction to stack and operations T2,R1
Stack program by using Array
32 L32
Implementation T2,R1
Stack program by using linked list
33 L33
Implementation T2,R1
34 L34 Infix to postfix evaluation T2,R1
35 L35 Infix to postfix evaluation T2,R1
36 III L36 Post fix Evaluation T2,R1
37 L37 Post fix Evaluation T2,R1
38 L38 Recursion implementation T2,R1
39 L39 Recursion implementation T2,R1
ACTIVITY: Think Aloud pair
problem solving
Topic: Infix to postfix evaluation
40 L40 UNIT 3 class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
41 L41 Introduction to Queue and Operations T2,R1
Queue program using array
L42
42 Implementation T2,R1
Queue program using linked
L43
43 Implementation T2,R1
IV
44 L44 Circular Queue T2,R1
45 L45 Circular Queue Array Implementation T2,R1
 Circular Queue Linked list
L46
46 Implementation T2,R1
Double ended Queue Array
47 L47 Implementation (Dequeue ) T2,R1
Double ended Queue Linked list
48 L48 Implementation (Dequeue ) T2,R1
ACTIVITY: Group Writing
Assignment
Topic: Double ended queues
49 L49 UNIT IV class test
S.No Unit Lecture Topic Text/Ref Date Date
No. No. book Planned Conducted
50 L50 Searching:Linear Search T2,R1

4.
51 L51 Binary Search T2,R1
52
53
L52
L53
Material to be ordered unit wise
Sorting:Bubble sort and selection sort
Insertion sort
T2,R1
T2,R1
54 a. Class notes
L54 – asQuick sort
per SOP T2,R1
55 b. Application
L55 ofMerge
Bloomsort Taxonomy. Minimum one example T2,R1relating to first three
56 L56 Comparison of Sorting Methods T2,R1
levels for Unit. I, II & III and all levels for Units IV and V. Bloom questions may
be framed fromNon-Linear Datayears
previous three structures
MLR papers.
Trees:Introduction, Definition,
c. i) Twenty objective bits with answer
57 L57 Terminology ,Applications T2,R1
ii) For Core subjects, two to three
Tree Representations-Listsolved problem (objective types) pertaining to
V
important
58 L58 concepts which relate to GATE, Competitive
Representation T2,R1exam and Placement
Questions. A minimum of 20 sibling
Left child-Right bits for each unit. Reference be made to GATE
59 L59 Representation
(year), Competitive exam (name) and Placement Questions T2,R1
(Company).
Graphs: Introduction,
d. Two Assignment Questions per unit. Assignment questions will be framed from
60 NPTELL60Video/eLSDM
Definition ,Terminology
Link/Journal/Original/Standard T2,R1
Test books/Reference
61 L61 Applications T2,R1
books. Questions shall relate to Bloom Taxonomy level III and above. The framed
Graph Representations: Adjacency
questions should be such that the student prepares the answer after referring to the
62 L62 matrix T2,R1
specified
L63 linked material. Assignment questions will be used by the student for
63 Adjacency lists T2,R1
giving student ACTIVITY:
seminar. Collaborative Learning
e. Three TutorialsTopic:
questions sorting
per unit with answers, Tutorial questions shall pertain to
64 problem solving.
L64 Emphases
UNIT V classbetest
on GATE Questions, questions taken from previous
three years. JNTU papers and from Original/Standard Text books/Reference Books.
f. Exam Objectives
 CLASS NOTES
Unit No -1
(Lecture wise class notes to be filed by the faculty member with
minimum of one application or real time example in each unit.)
BLOOMS TAXONOMY
Unit No -1
Twenty Objective
bits with answers
UNIT-1
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088
 4. D) ASSIGNMENT
QUESTIONS
(Two Assignment Questions per unit. Assignment questions will be
framed from NPTEL. Video/eLSDM Link/Journal/Original/Standard Test
books/Reference books. Questions shall relate to Bloom Taxonomy
level III and above. The framed questions should be such that the
student prepares the answer after referring to the specified linked
material. Assignment questions will be used by the student for giving
student seminar.)

(Unit No - …)
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

___________________________________________________________________________

ASSIGNMENTS, QUALITY AND EVALUATION

Subject: Data Structures

Branch: II CSE-D
Academic Year: 2022-23 Semester: I
Faculty: DR. P. MICHAEL PREETAM RAJ

UNIT-1 ASSIGNMENT QUESTIONS

Unit Assignment Course

Topic Blooms
No No/Set Outcome
Level

1. a) Explain the following :

i) Structure definition ii) Initialization and accessing L-2
of structures with syntax and example. CO-1
L-3
1 b)Develop a C Program to read time in hours,
minutes, and seconds using structures and perform
Addition of two time periods

I 1/Set-1 L-2
2. a) Explain array and representation of 1D array
b) What is a nested structure? Develop a program CO-1
L-3
for nested structures.
L-3
3. Write a C program to read name, roll number,
year and marks of three subjects of a student and
print the student the name, roll number, average CO-1
marks of the student using structures.

I 1. a)Explain basics of pointer with syntax and

example L-2
1/Set-2 b) Develop a C Program to read time in hours,
minutes, and seconds using structures and perform CO-1
subtraction of two time periods L-3

2.a)Explain the sparse matrices and their CO-1 L-2

representation?
 i) using array ii)Linked List

3. Distinguish between array of structures and array

within structure. CO-1 L-3

1. Define Data structure. Differentiate between L-4

Linear and Non-Linear data structures with suitable CO-1
examples.
I 1/Set-3
2. Write a C Program to read real and imaginary L-2
parts of a complex number using structures and CO-1
perform the addition operations on complex numbers. L-3
L-2
3. Explain in detail about structures and functions CO-1
 ___________________________________________________________________________

ASSIGNMENTS, QUALITY AND EVALUATION

Subject: DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION

Branch: II CSE-D
Academic Year: 2022-23 Semester: II
Faculty: DR. P. MICHAEL PREETAM RAJ

UNIT-II ASSIGNMENT QUESTIONS

Unit Assignment Course

Topic Blooms
No No/Set Outcome
Level

1. Explain the following operations of singly

linked list with appropriate code:
a) Insertion at beginning CO-2 L-2
b) Deletion at specific position
c) Traversal of singly linked list
2. Develop a c program to concatenate two
II 1/Set-1 CO-2 L-6
singly linked lists
3. Explain why doubly linked list is more L-2
efficient than singly linked list in detail and
also give the disadvantages of doubly linked CO-2 L-5
list and justify if you can overcome the
disadvantages or not? Explain.
4. Differentiate singly, doubly and circular
linked lists and justify which linked list is CO-2 L-4
more efficient?
1. Develop a c program to implement doubly
CO-2 L-6
II linked list
2. Analyze the following operations of circular
1/Set-2 linked list in detail with a suitable pictorial
and code representation.
CO-2 L-4
i) Insertion of a node at end.
ii) Deletion of a node at end
 1. Develop a c program to implement singly CO-2 L-6
linked list?
2. How can be the operations of singly linked
II 1/Set-3 list can differ with the doubly linked list CO-2 L-5
operations? Justify.
3. Develop a c program to implement circular CO-2 L-6
linked list?
 4. E) TUTORIAL
QUESTIONS
(Three Tutorials questions per unit with answers, Tutorial questions
shall pertain to problem solving. Emphases be on GATE Questions,
questions taken from previous three years. JNTU papers and from
Original/Standard Text books/Reference Books)

(Unit No - …)
 ______________________________
TUTORIAL
Subject: Data Structures
Branch: II CSE-D
Academic Year: 2022-23 Semester: II
Faculty: DR. P. MICHAEL PREETAM RAJ
S. Date
Unit No Tutorial topic
No. conducted
Explain self-referential structure? Develop a c program
to create a self- referential structure for student data?
Differentiate sparse matrices with normal matrices.
1 I Develop a c program to implement sparse matrix and
mention whether the given matrix is a sparse matrix or
not
Summarize the linear and nonlinear data structures in
detail.
Explain the operations used in doubly linked list in detail?
2 II Differentiate singly, doubly and circular linked lists and
justify which linked list is more efficient?
Develop a c program to implement singly linked list?
Define ADT? Develop a c program to implement stack ADT
using array representation
Consider the following expression and evaluate the result
and convert the expression into postfix and prefix
3 III expressions:
5+9*3/7*(6+1)-(8*7)/2

Develop a c program to evaluate postfix expressions,

implement using recursion.
Discuss in detail about operations of circular queue
Differentiate stacks and queues in detail and with example
4 IV programs also
Develop a c program to implement dequeue using linked
list.
Compare different sorting techniques and justify which
sorting methodology is pre- eminent technique
5 V Distinguish between adjacency matrix and adjacency lists?
Explain non linear data structures in detail with real time
examples?
5. STUDENT SEMINAR
TOPICS
 6. MOOCs
(Massive open online
courses)
7. Two Micro Projects per subject
for those core subjects which are
applied to build real-time
projects.
8. MID-TERM TEST,
QUALITY AND
EVALUATION
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

MID-TERM TEST, QUALITY AND EVALUATION

Subject: Data Structures
Branch: CSE Section :
Academic year: 2022-23 Semester: II/I
Faculty: DR. P. MICHAEL PREETAM RAJ

Marks
Mid Date Date of
Questions entered
term conducted distribution
in register

II

Quality verified by HOD: Good/Average/Poor

 9. LIST OF WEAK
STUDENTS AND
REMEDIAL ACTION
a. Weak students as per JNTU Result
b. Weak students as per Mid-term test result
c. Remedial action

(List of weak students and remedial action to be prepared as per

proforma)
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

WEAK STUDENTS AS PER JNTU

Subject: DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION
Branch: CSE Section : D
Academic year: 2022-23 Year/Semester: II/II
Faculty: DR. P. MICHAEL PREETAM RAJ
S.
Hall Ticket No. Name %
No.

Note: Weak students are the students who secure less than 50% marks in
Previous MLR External examinations
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

LIST OF WEAK STUDENTS AS PER MID TERM TEST RESULT

Subject: DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION

Branch: CSE Section : D
Academic year: 2022-23 Year/Semester: II/I
Faculty: DR. P. MICHAEL PREETAM RAJ Mid Term Test I/II
S.
Hall Ticket No. Name %
No.

Note: Weak students are the students who get <=10.0 marks out of 20.0 in Mid-term test.
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

SCHEDULE OF REMEDIAL CLASSES

Branch: CSE Section :

Academic year: 2022-23 Year/Semester: II/II
Faculty: DR. P. MICHAEL PREETAM RAJ Mid Term Test I/II

TIME TABLE

No. of students
Date Day Period Theory / Retest
attended

Performance of Weak students in Additional make-up Test

Roll No. Name Marks obtained

 12.TARGET (%)
(Target of the Subject Result to be prepared by the faculty member as
per the proforma)
 MLR Institute of Technology
Laxma Reddy Avenue, Dundigal, Quthbullapur (M), Hyderabad – 500 043
Phone Nos: 08418 – 204066 / 204088, Fax : 08418 – 204088

TARGET (%)

Subject: DIGITAL ELECTRONICS AND COMPUTER ORGANIZATION

Branch: CSE
Academic Year: 2022-23 Semester: II/I
Faculty: DR. P. MICHAEL PREETAM RAJ

1. Pass Percentage: 90%

2. First class with distinction (>=75): 50%
3. First class (60-69): 25%
4. Pass Class (40-49): 10%

Signature of Faculty
13.MATERIAL FOR
HANDBOOK
 14. SAMPLE
ASSIGNMENTS / CLASS
TESTS
(One sample assignment of the student for each unit to be filed by the
faculty member)