Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE357 COMBINATORIAL STUDIES 2 0 2 3 26610::Dr. Senthil Kumar J
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50

Course Outcomes :Through this course students should be able to

CO1 :: understand the fundamental computer science concepts, including data structures, algorithms, databases, operating systems, and computer networks, essential for
technical interviews.
CO2 :: assess the problem-solving skills specific to coding challenges and algorithmic problems frequently encountered in technical interviews.
CO3 :: articulate a comprehensive command of Object-Oriented Programming principles, enhancing readiness to excel in technical interviews
CO4 :: gain comprehensive strategies and techniques to effectively prepare for technical interviews, including mock interviews, resume building, and effective
communication during interviews.
CO5 :: impart the requisite knowledge and skills to confidently address technical interview inquiries posed by service-oriented IT companies, demonstrating proficiency
across diverse technical domains.
CO6 :: prepare and practice sessions including mock interviews, whiteboard coding exercises, and simulations of behavioural interview scenarios, fostering confidence
and preparedness for different stages of technical interviews.

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 IT INTERVIEW QUESTIONS NARASIMHA CAREERMONK PUBLICATIONS
KARUMANCHI
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 CRACKING THE CODING MCDOWELL GAYLE CAREERCUP
INTERVIEW LAAKMANN
R-2 CRACKING THE IT INTERVIEW M MC GRAW HILL
BALASUBRAMANIAM,
K. R BAALAJI, KIRAN.
G RANGANATH,
NANDAWAT
RAVINDRA K, M
SELVAGURU, T
COMERICA SUBASH,
RAGHAVAN S
VENKAT, S
ANBAZHAGAN
VIKRAM

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 R-3 SQL IN 10 MINUTES, SAMS BEN FORTA SAMS PUBLISHING
TEACH YOURSELF
R-4 MCQS IN COMPUTER SCIENCE TIMOTHY WILLIAMS MC GRAW HILL

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://www.tutorialspoint.com/operating_system/os_overview.htm Introduction to OS and its Basics

RW-2 https://www.javatpoint.com/operating-system Understanding Job Scheduling and Process Loading, Processor

Scheduling Algorithms, Process Synchronization
RW-3 https://www.javatpoint.com/computer-network-tutorial Basics of Computer Networking and IP

RW-4 https://www.tutorialspoint.com/data_communication_computer_network/index.htm Data Communication and Networking

RW-5 https://www.javatpoint.com/dbms-tutorial Introduction to DBMS with full concept

RW-6 https://www.tutorialspoint.com/dbms/index.htm DBMS Concepts

RW-7 https://techdevguide.withgoogle.com/paths/foundational/ Fundamentals of Programming Languages

RW-8 https://www.freecodecamp.org/news/what-is-programming-tutorial-for-beginners/ Programing Basics

RW-9 https://www.tutorialspoint.com/data_structures_algorithms/index.htm Data Structures and Algorithms Tutorial

RW-10 https://www.javatpoint.com/data-structure-tutorial Data Structures Tutorials

RW-11 https://www.boardinfinity.com/blog/advanced-algorithms-and-problem-solving- Problem Solving Techniques

techniques/
RW-12 https://www.tutorialspoint.com/design_and_analysis_of_algorithms/index.htm Design and Analysis of Algorithms

Audio Visual Aids ( AV )

Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 https://www.youtube.com/watch? Operating System Introduction and Eploring all the topics
v=a2B69vCtjOU&list=PLyqSpQzTE6M9SYI5RqwFYtFYab94gJpWk&index=2
AV-2 https://www.youtube.com/watch?v=lnU-Zw3NEEQ&list=PLbRMhDVUMngf- Computer Networking Full course
peFloB7kyiA40EptH1up&index=2
AV-3 https://www.youtube.com/watch?v=sEaYXwmsLw0&list=PLyqSpQzTE6M- DB System Concepts and understandings
xymXgqewlzcC3U4cdRoSu
AV-4 https://www.youtube.com/watch? Programming In Modern C++
v=vmxTUhn2fBg&list=PLqu1LEUz3ju04dXn0JOgKYPHHnV2at-lG
AV-5 https://www.youtube.com/watch?v=zWg7U0OEAoE&list=PLBF3763AF2E1C572F Lecture Series on Data Structures and Algorithms
AV-6 https://www.youtube.com/watch? Problem Solving Algorithm Design Full Content
v=gY0MwGLq9W8&list=PLyqSpQzTE6M9DKhN7z2fOpKTJWu-639_P

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 LTP week distribution: (LTP Weeks)
Weeks before MTE
Weeks After MTE
Spill Over (Lecture)

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Operating System Basics T-1 RW-1 Foundations of Students will be able PPT
(Foundations of Operating R-1 Operating Systems, to understand the
Systems) R-2 Types of Operating basics of Operating
R-4 Systems, Memory systems and types,
Management brief about memory
management
Operating System Basics T-1 RW-1 Foundations of Students will be able PPT
(Types of Operating R-1 Operating Systems, to understand the
Systems) R-2 Types of Operating basics of Operating
Systems, Memory systems and types,
Management brief about memory
management
Operating System Basics T-1 RW-1 Foundations of Students will be able PPT
(Memory Management) R-1 Operating Systems, to understand the
R-2 Types of Operating basics of Operating
Systems, Memory systems and types,
Management brief about memory
management
Lecture 2 Operating System Basics T-1 RW-2 Job Scheduling and Student remembers PPT
(Job Scheduling and Process R-1 AV-1 Process Loading, and apply the concept A-V
Loading) R-2 Processor Scheduling of OS in Problem
Algorithms, Process solving
Synchronization and
Inter-process
Communication,
Operating System Basics T-1 RW-2 Job Scheduling and Student remembers PPT
(Processor Scheduling R-1 AV-1 Process Loading, and apply the concept A-V
Algorithms) R-2 Processor Scheduling of OS in Problem
Algorithms, Process solving
Synchronization and
Inter-process
Communication,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 1 Lecture 2 Operating System Basics T-1 RW-2 Job Scheduling and Student remembers PPT
(Process Synchronization R-1 AV-1 Process Loading, and apply the concept A-V
and Inter-process R-2 Processor Scheduling of OS in Problem
Communication) Algorithms, Process solving
Synchronization and
Inter-process
Communication,
Week 2 Lecture 3 Operating System Basics T-1 RW-1 Resource Management, Student will be PPT
(Resource Management) R-1 RW-2 Disc structure and knowing tne A-v
R-2 AV-1 Scheduling, Protection Resource
mechanisms Management, Disc
structure and
Scheduling,
Protection
mechanisms
Operating System Basics T-1 RW-1 Resource Management, Student will be PPT
(Disc structure and R-1 RW-2 Disc structure and knowing tne A-v
Scheduling) R-2 AV-1 Scheduling, Protection Resource
mechanisms Management, Disc
structure and
Scheduling,
Protection
mechanisms
Operating System Basics T-1 RW-1 Resource Management, Student will be PPT
(Protection mechanisms) R-1 RW-2 Disc structure and knowing tne A-v
R-2 AV-1 Scheduling, Protection Resource
R-4 mechanisms Management, Disc
structure and
Scheduling,
Protection
mechanisms
Lecture 4 Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Foundations of R-1 RW-4 Computer Networks, understand and A-V
Computer Networks,) R-2 AV-2 Elements and Types of Analyze the
R-4 Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Elements and Types R-1 RW-4 Computer Networks, understand and A-V
of Networks,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 4 Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Data and Signals,) R-1 RW-4 Computer Networks, understand and A-V
R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Network Topologies R-1 RW-4 Computer Networks, understand and A-V
and Transmission Medium,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Network Models and R-1 RW-4 Computer Networks, understand and A-V
Protocols,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Week 3 Lecture 5 Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Foundations of R-1 RW-4 Computer Networks, understand and A-V
Computer Networks,) R-2 AV-2 Elements and Types of Analyze the
R-4 Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Elements and Types R-1 RW-4 Computer Networks, understand and A-V
of Networks,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 3 Lecture 5 Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Data and Signals,) R-1 RW-4 Computer Networks, understand and A-V
R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Network Topologies R-1 RW-4 Computer Networks, understand and A-V
and Transmission Medium,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Computer Networking T-1 RW-3 Foundations of Student can PPT
Basics(Network Models and R-1 RW-4 Computer Networks, understand and A-V
Protocols,) R-2 AV-2 Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network and Basics
Topologies and
Transmission Medium,
Network Models and
Protocols,
Lecture 6 Computer Networking T-1 RW-3 Understanding OSI and Students will learn PPT
Basics(Understanding OSI R-1 RW-4 TCP/IP Models, about Understanding A-V
and TCP/IP Models,) R-2 AV-2 Working of TCP/IP OSI and TCP/IP
Model (Internet) Models, Working of
TCP/IP Model
(Internet)
Computer Networking T-1 RW-3 Understanding OSI and Students will learn PPT
Basics(Working of TCP/IP R-1 RW-4 TCP/IP Models, about Understanding A-V
Model (Internet),) R-2 AV-2 Working of TCP/IP OSI and TCP/IP
Model (Internet) Models, Working of
TCP/IP Model
(Internet)
Week 4 Lecture 7 Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Subnetting and R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
Routing,) R-2 AV-2 SMTP, POP/IMAP, knowledge about
FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 4 Lecture 7 Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Key Protocols: R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
HTTP, SMTP, POP/IMAP, R-2 AV-2 SMTP, POP/IMAP, knowledge about
FTP, DNS, DHCP,) FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping
Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Overview of R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
Traceroute and Ping) R-2 AV-2 SMTP, POP/IMAP, knowledge about
R-4 FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping
Lecture 8 Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Subnetting and R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
Routing,) R-2 AV-2 SMTP, POP/IMAP, knowledge about
FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping
Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Key Protocols: R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
HTTP, SMTP, POP/IMAP, R-2 AV-2 SMTP, POP/IMAP, knowledge about
FTP, DNS, DHCP,) FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 4 Lecture 8 Computer Networking T-1 RW-3 Subnetting and Routing, Students will PPT
Basics(Overview of R-1 RW-4 Key Protocols: HTTP, understand and gain A-V
Traceroute and Ping) R-2 AV-2 SMTP, POP/IMAP, knowledge about
R-4 FTP, DNS, DHCP, Subnetting and
Overview of Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP,
Overview of
Traceroute and Ping
Week 5 Lecture 9 Test
Lecture 10 Database Management T-1 RW-5 Introduction to Students will PPT
Systems (DBMS) R-2 RW-6 Databases and RDBMS, understand the
(Introduction to Databases R-3 AV-3 Basics of Databases and Fundamentals of
and RDBMS,) R-4 RDBMS, Data DBMS and
Definitions: Tables,
Fields, Records,
Database Management T-1 RW-5 Introduction to Students will PPT
Systems (DBMS)(Basics of R-2 RW-6 Databases and RDBMS, understand the
Databases and RDBMS,) R-3 AV-3 Basics of Databases and Fundamentals of
RDBMS, Data DBMS and
Definitions: Tables,
Fields, Records,
Database Management T-1 RW-5 Introduction to Students will PPT
Systems (DBMS)(Data R-2 RW-6 Databases and RDBMS, understand the
Definitions: Tables, Fields, R-3 AV-3 Basics of Databases and Fundamentals of
Records,) RDBMS, Data DBMS and
Definitions: Tables,
Fields, Records,
Week 6 Lecture 11 Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(SQL and R-2 RW-6 Manipulation, Database about SQL and Data A-V
Data Manipulation,) R-3 AV-3 Keys and Data Integrity, Manipulation,
Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions
Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(Database R-2 RW-6 Manipulation, Database about SQL and Data A-V
Keys and Data Integrity,) R-3 AV-3 Keys and Data Integrity, Manipulation,
Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 6 Lecture 11 Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(Database R-2 RW-6 Manipulation, Database about SQL and Data A-V
Normalization and R-3 AV-3 Keys and Data Integrity, Manipulation,
Transactions,) Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions
Lecture 12 Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(SQL and R-2 RW-6 Manipulation, Database about SQL and Data A-V
Data Manipulation,) R-3 AV-3 Keys and Data Integrity, Manipulation,
Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions
Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(Database R-2 RW-6 Manipulation, Database about SQL and Data A-V
Keys and Data Integrity,) R-3 AV-3 Keys and Data Integrity, Manipulation,
Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions
Database Management T-1 RW-5 SQL and Data Students will learn PPT
Systems (DBMS)(Database R-2 RW-6 Manipulation, Database about SQL and Data A-V
Normalization and R-3 AV-3 Keys and Data Integrity, Manipulation,
Transactions,) Database Normalization Database Keys and
and Transactions Data Integrity,
Database
Normalization and
Transactions
Week 7 Lecture 13 Database Management T-1 RW-5 Fundamentals of Students will learn PPT
Systems (DBMS) R-2 RW-6 Normalization, and apply the A-V
(Fundamentals of R-3 AV-3 Transaction Fundamentals of
Normalization,) R-4 Management in DBMS Normalization,
Transaction
Management in
DBMS.
Database Management T-1 RW-5 Fundamentals of Students will learn PPT
Systems (DBMS) R-2 RW-6 Normalization, and apply the A-V
(Transaction Management in R-3 AV-3 Transaction Fundamentals of
DBMS) R-4 Management in DBMS Normalization,
Transaction
Management in
DBMS.

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 SPILL OVER
Week 7 Lecture 14 Spill Over

MID-TERM
Week 8 Lecture 15 Fundamentals of T-1 RW-7 C/C++/Java Interview Student will learn the PPT
Programming Languages R-1 RW-8 Questions Overview, C/C++/Java
(C/C++/Java Interview R-2 AV-4 Variables, Data Types, Interview Questions
Questions Overview,) R-4 and Memory, Pointers Overview, Variables,
and Storage, Classes Data Types, and
Memory, Pointers
and Storage, Classes
Fundamentals of T-1 RW-7 C/C++/Java Interview Student will learn the PPT
Programming Languages R-1 RW-8 Questions Overview, C/C++/Java
(Variables, Data Types, and R-2 AV-4 Variables, Data Types, Interview Questions
Memory,) R-4 and Memory, Pointers Overview, Variables,
and Storage, Classes Data Types, and
Memory, Pointers
and Storage, Classes
Fundamentals of T-1 RW-7 C/C++/Java Interview Student will learn the PPT
Programming Languages R-1 RW-8 Questions Overview, C/C++/Java
(Pointers and Storage, R-2 AV-4 Variables, Data Types, Interview Questions
Classes,) R-4 and Memory, Pointers Overview, Variables,
and Storage, Classes Data Types, and
Memory, Pointers
and Storage, Classes
Lecture 16 Fundamentals of T-1 RW-7 Introduction to Object- Students will learn PPT
Programming Languages R-1 RW-8 Oriented Programming about Introduction to
(Introduction to Object- R-2 AV-4 (OOP), Compiler and Object-Oriented
Oriented Programming R-4 Interpreter Basics, Programming (OOP),
(OOP),) Understanding Process Compiler and
Loading and Linking Interpreter Basics,
Understanding
Process Loading and
Linking
Fundamentals of T-1 RW-7 Introduction to Object- Students will learn PPT
Programming Languages R-1 RW-8 Oriented Programming about Introduction to
(Compiler and Interpreter R-2 AV-4 (OOP), Compiler and Object-Oriented
Basics,) R-4 Interpreter Basics, Programming (OOP),
Understanding Process Compiler and
Loading and Linking Interpreter Basics,
Understanding
Process Loading and
Linking

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 8 Lecture 16 Fundamentals of T-1 RW-7 Introduction to Object- Students will learn PPT
Programming Languages R-1 RW-8 Oriented Programming about Introduction to
(Understanding Process R-2 AV-4 (OOP), Compiler and Object-Oriented
Loading and Linking,) R-4 Interpreter Basics, Programming (OOP),
Understanding Process Compiler and
Loading and Linking Interpreter Basics,
Understanding
Process Loading and
Linking
Week 9 Lecture 17 Fundamentals of T-1 RW-7 Techniques of Students will PPT
Programming Languages R-1 RW-8 Parameter Passing and understand and apply 1-V
(Techniques of Parameter R-2 AV-4 Binding, Storage the concepts of
Passing and Binding,) R-4 Organization and Techniques of
Storage Classes, Parameter Passing
Advanced OOP and Binding, Storage
Concepts and Data Organization and
Structures, Abstract Storage Classes,
Data Types (ADTs), Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs),
Fundamentals of T-1 RW-7 Techniques of Students will PPT
Programming Languages R-1 RW-8 Parameter Passing and understand and apply 1-V
(Storage Organization and R-2 AV-4 Binding, Storage the concepts of
Storage Classes,) R-4 Organization and Techniques of
Storage Classes, Parameter Passing
Advanced OOP and Binding, Storage
Concepts and Data Organization and
Structures, Abstract Storage Classes,
Data Types (ADTs), Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs),
Fundamentals of T-1 RW-7 Techniques of Students will PPT
Programming Languages R-1 RW-8 Parameter Passing and understand and apply 1-V
(Advanced OOP Concepts R-2 AV-4 Binding, Storage the concepts of
and Data Structures) R-4 Organization and Techniques of
Storage Classes, Parameter Passing
Advanced OOP and Binding, Storage
Concepts and Data Organization and
Structures, Abstract Storage Classes,
Data Types (ADTs), Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs),

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 9 Lecture 17 Fundamentals of T-1 RW-7 Techniques of Students will PPT
Programming Languages R-1 RW-8 Parameter Passing and understand and apply 1-V
(Abstract Data Types R-2 AV-4 Binding, Storage the concepts of
(ADTs),) R-4 Organization and Techniques of
Storage Classes, Parameter Passing
Advanced OOP and Binding, Storage
Concepts and Data Organization and
Structures, Abstract Storage Classes,
Data Types (ADTs), Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs),
Lecture 18 Fundamentals of T-1 RW-7 Data Structure Students will learn PPT
Programming Languages R-1 RW-8 Principles, Advanced and apply Data A-V
(Data Structure Principles,) R-2 AV-4 Programming Structure Principles,
R-4 Techniques, Memory Advanced
Handling in OOP Programming
Languages Techniques, Memory
Handling in OOP
Languages
Fundamentals of T-1 RW-7 Data Structure Students will learn PPT
Programming Languages R-1 RW-8 Principles, Advanced and apply Data A-V
(Advanced Programming R-2 AV-4 Programming Structure Principles,
Techniques,) R-4 Techniques, Memory Advanced
Handling in OOP Programming
Languages Techniques, Memory
Handling in OOP
Languages
Fundamentals of T-1 RW-7 Data Structure Students will learn PPT
Programming Languages R-1 RW-8 Principles, Advanced and apply Data A-V
(Memory Handling in OOP R-2 AV-4 Programming Structure Principles,
Languages) R-4 Techniques, Memory Advanced
Handling in OOP Programming
Languages Techniques, Memory
Handling in OOP
Languages
Week 10 Lecture 19 Test - Code based
Lecture 20 Algorithms and Data T-1 RW-9 Understanding Students will learn PPT
Structures(Understanding R-1 RW-10 Algorithms and about Understanding
Algorithms and Analysis,) R-2 AV-5 Analysis, Running Time Algorithms and
R-4 Analysis and Rate of Analysis, Running
Growth, Asymptotic Time Analysis and
Notation: Big-O Rate of Growth,
Notation, Asymptotic Notation:
Big-O Notation,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 10 Lecture 20 Algorithms and Data T-1 RW-9 Understanding Students will learn PPT
Structures(Running Time R-1 RW-10 Algorithms and about Understanding
Analysis and Rate of R-2 AV-5 Analysis, Running Time Algorithms and
Growth,) R-4 Analysis and Rate of Analysis, Running
Growth, Asymptotic Time Analysis and
Notation: Big-O Rate of Growth,
Notation, Asymptotic Notation:
Big-O Notation,
Algorithms and Data T-1 RW-9 Understanding Students will learn PPT
Structures(Asymptotic R-1 RW-10 Algorithms and about Understanding
Notation: Big-O Notation,) R-2 AV-5 Analysis, Running Time Algorithms and
R-4 Analysis and Rate of Analysis, Running
Growth, Asymptotic Time Analysis and
Notation: Big-O Rate of Growth,
Notation, Asymptotic Notation:
Big-O Notation,
Week 11 Lecture 21 Algorithms and Data T-1 RW-9 Data Structures and Students will PPT
Structures(Data Structures R-1 RW-10 Recursive Algorithms, understand Data
and Recursive Algorithms,) R-2 AV-5 Recursion and Structures and
R-4 Backtracking, Recursive
Algorithms,
Recursion and
Backtracking,
Algorithms and Data T-1 RW-9 Data Structures and Students will PPT
Structures(Recursion and R-1 RW-10 Recursive Algorithms, understand Data
Backtracking,) R-2 AV-5 Recursion and Structures and
R-4 Backtracking, Recursive
Algorithms,
Recursion and
Backtracking,
Lecture 22 Algorithms and Data T-1 RW-9 Linked Lists, Stacks, Students will apply PPT A-V
Structures(Linked Lists,) R-1 RW-10 and Queues, Trees and The concepts of
R-2 AV-5 Binary Search Trees Linked Lists, Stacks,
R-4 (BSTs) and Queues, Trees
and Binary Search
Trees (BSTs)
Algorithms and Data T-1 RW-9 Linked Lists, Stacks, Students will apply PPT A-V
Structures(Stacks and R-1 RW-10 and Queues, Trees and The concepts of
Queues,) R-2 AV-5 Binary Search Trees Linked Lists, Stacks,
R-4 (BSTs) and Queues, Trees
and Binary Search
Trees (BSTs)
Algorithms and Data T-1 RW-9 Linked Lists, Stacks, Students will apply PPT A-V
Structures(Trees and Binary R-1 RW-10 and Queues, Trees and The concepts of
Search Trees (BSTs)) R-2 AV-5 Binary Search Trees Linked Lists, Stacks,
R-4 (BSTs) and Queues, Trees
and Binary Search
Trees (BSTs)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 23 Advanced Algorithms and T-1 RW-11 Sorting and Searching Students will recall PPT A-V
Problem-Solving R-1 RW-12 Algorithms, and understand
Techniques(Sorting and R-2 AV-6 Classification and Sorting and
Searching Algorithms,) R-4 Comparison of Sorting Searching
Algorithms, Linear and Algorithms,
Non-Linear Searching Classification and
Techniques, Comparison of
Sorting Algorithms,
Linear and Non-
Linear Searching
Techniques,
Advanced Algorithms and T-1 RW-11 Sorting and Searching Students will recall PPT A-V
Problem-Solving R-1 RW-12 Algorithms, and understand
Techniques(Classification R-2 AV-6 Classification and Sorting and
and Comparison of Sorting R-4 Comparison of Sorting Searching
Algorithms,) Algorithms, Linear and Algorithms,
Non-Linear Searching Classification and
Techniques, Comparison of
Sorting Algorithms,
Linear and Non-
Linear Searching
Techniques,
Advanced Algorithms and T-1 RW-11 Sorting and Searching Students will recall PPT A-V
Problem-Solving R-1 RW-12 Algorithms, and understand
Techniques(Linear and Non- R-2 AV-6 Classification and Sorting and
Linear Searching R-4 Comparison of Sorting Searching
Techniques,) Algorithms, Linear and Algorithms,
Non-Linear Searching Classification and
Techniques, Comparison of
Sorting Algorithms,
Linear and Non-
Linear Searching
Techniques,
Lecture 24 Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Hashing and R-2 AV-6 Algorithms and Design and Hash Table
Hash Table R-4 Strategies, Graph Implementation,
Implementation,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 12 Lecture 24 Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Graph R-2 AV-6 Algorithms and Design and Hash Table
Algorithms and Design R-4 Strategies, Graph Implementation,
Strategies,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Graph R-2 AV-6 Algorithms and Design and Hash Table
Representation and R-4 Strategies, Graph Implementation,
Traversals,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Shortest Path R-2 AV-6 Algorithms and Design and Hash Table
Algorithms,) R-4 Strategies, Graph Implementation,
Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Week 13 Lecture 25 Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Hashing and R-2 AV-6 Algorithms and Design and Hash Table
Hash Table R-4 Strategies, Graph Implementation,
Implementation,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 13 Lecture 25 Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Graph R-2 AV-6 Algorithms and Design and Hash Table
Algorithms and Design R-4 Strategies, Graph Implementation,
Strategies,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Graph R-2 AV-6 Algorithms and Design and Hash Table
Representation and R-4 Strategies, Graph Implementation,
Traversals,) Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Advanced Algorithms and T-1 RW-11 Hashing and Hash Table Students will PPT A-V
Problem-Solving R-1 RW-12 Implementation, Graph understand Hashing
Techniques(Shortest Path R-2 AV-6 Algorithms and Design and Hash Table
Algorithms,) R-4 Strategies, Graph Implementation,
Representation and Graph Algorithms
Traversals, Shortest Path and Design
Algorithms Strategies, Graph
Representation and
Traversals, Shortest
Path Algorithms
Lecture 26 Advanced Algorithms and T-1 RW-11 Introduction to Greedy, Students will learn PPT A-V
Problem-Solving R-1 RW-12 Divide and Conquer, about Introduction to
Techniques(Introduction to R-2 AV-6 and Dynamic Greedy, Divide and
Greedy,) R-4 Programming Strategies Conquer, and
Dynamic
Programming
Strategies
Advanced Algorithms and T-1 RW-11 Introduction to Greedy, Students will learn PPT A-V
Problem-Solving R-1 RW-12 Divide and Conquer, about Introduction to
Techniques(Divide and R-2 AV-6 and Dynamic Greedy, Divide and
Conquer,) R-4 Programming Strategies Conquer, and
Dynamic
Programming
Strategies

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 Week 13 Lecture 26 Advanced Algorithms and T-1 RW-11 Introduction to Greedy, Students will learn PPT A-V
Problem-Solving R-1 RW-12 Divide and Conquer, about Introduction to
Techniques(Dynamic R-2 AV-6 and Dynamic Greedy, Divide and
Programming Strategies) R-4 Programming Strategies Conquer, and
Dynamic
Programming
Strategies
Week 14 Lecture 27 Interview

SPILL OVER
Week 14 Lecture 28 Spill Over
Week 15 Lecture 29 Spill Over
Lecture 30 Spill Over

Scheme for CA:

CA Category of this Course Code is:A0203 (2 best out of 3)

Component Weightage (%) Mapped CO(s)

Interview 50 CO1, CO2,
CO3, CO4,
CO5, CO6
Test - Code based 50 CO3, CO4
Test 50 CO1, CO2

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Interview To test answering Technical Questions based on Service based companies(Proficiency Individual Online 30 4 / 13
skills and abilities of in Technical Skills,Effective use of Technical Terminologies,
students in interview Engagement and Confidence and Problem Solving Approach)
Test To test the 30 MCQ based on Operating System(Each Question one mark) Individual Online 30 4/6
knowledge of the
students
Test - Code based To test Based on Database Management System(2 Question ,Each Carries Individual Online 30 9 / 11
implementation 15 marks)
skills of the students
based on SQL

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)

Sr. No. Topic

1 OS DSA

Detailed Plan For Practicals

Practical No Broad topic Subtopic Other Readings Learning Outcomes

Practical 1 List of Practicals 1. Introduction to Linux Commands RW-1 Basic Linux Commands
RW-2
AV-1

Practical 2 List of Practicals 2. Shell Programming RW-1 Shell Programming

RW-2
AV-1

Practical 3 List of Practicals 3. System Calls (File / Directory/ RW-1 System Calls
Process) RW-2
AV-1

List of Practicals 4. Multi Thread Process using Pthread RW-1 System Calls
Library RW-2
AV-1

Practical 4 List of Practicals 4. Multi Thread Process using Pthread RW-1 System Calls
Library RW-2
AV-1

List of Practicals 3. System Calls (File / Directory/ RW-1 System Calls

Process) RW-2
AV-1

Practical 5 List of Practicals 5. SQL Commands ( DDL/DML/ RW-5 SQL/ PL-SQL

TCL) RW-6
AV-3

List of Practicals 6. PL/SQL Triggers, Procedures, RW-5 SQL/ PL-SQL

Functions RW-6
AV-3

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Practical 6 List of Practicals 6. PL/SQL Triggers, Procedures, RW-5 SQL/ PL-SQL
Functions RW-6
AV-3

List of Practicals 5. SQL Commands ( DDL/DML/ RW-5 SQL/ PL-SQL

TCL) RW-6
AV-3

Practical 7 List of Practicals 7. Subnetting RW-3 Sub Netting

RW-4
AV-2

Practical 8 List of Practicals 8. Arrays and Linked List RW-9 Problem Solving
RW-10
RW-11
RW-12
AV-4
AV-5

List of Practicals 10. Trees and Binary Search Trees RW-9 Problem Solving
RW-10
RW-11
RW-12
AV-4
AV-5

List of Practicals 9. Stacks and Queues RW-9 Problem Solving

RW-10
RW-11
RW-12
AV-4
AV-5

Practical 9 List of Practicals 9. Stacks and Queues RW-9 Problem Solving

RW-10
RW-11
RW-12
AV-4
AV-5

List of Practicals 10. Trees and Binary Search Trees RW-9 Problem Solving
RW-10
RW-11
RW-12
AV-4
AV-5

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Practical 9 List of Practicals 8. Arrays and Linked List RW-9 Problem Solving
RW-10
RW-11
RW-12
AV-4
AV-5

Practical 10 Test - Code based

SPILL OVER
Practical 11 Spill Over

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.