Professional Documents
Culture Documents
Cse Question Bank
Cse Question Bank
UNIT I
PART-A
1. Define data structure.
The data structure can be defined as the collection of elements and all the possible
operations which are required for those set of elements. Formally data structure can be defined as
a data structure is a set of domains D, a set of domains F and a set of axioms A. this triple
(D,F,A) denotes the data structure d.
The non-linear data structure is the kind of data structure in which the data may be
arranged in hierarchical fashion. For example- Trees and graphs.
The linear data structure is the kind of data structure in which the data is linearly
arranged. For example- stacks, queues, linked list.
4. What is abstract data type? What are all not concerned in an ADT?(NOV/DEC 2019)
The abstract data type is a triple of D i.e. set of axioms, F-set of functions and A-Axioms
in which only what is to be done is mentioned but how is to be done is not mentioned. Thus ADT
is not concerned with implementation details.
5. What is a linked list?(NOV/DEC 2019)
A linked list is a set of nodes where each node has two fields ‘data’ and ‘link’. The data
field is used to store actual piece of information and link field is used to store address of next
node.
Doubly linked list is a kind of linked list in which each node has two link fields. One link
field stores the address of previous node and the other link field stores the address of the next
node.
In circular list the next pointer of last node points to head node, whereas in doubly linked
list each node has two pointers: one previous pointer and another is next pointer. The main
advantage of circular list over doubly linked list is that with the help of single pointer field we
can access head node quickly. Hence some amount of memory get saved because in circular list
only one pointer is reserved.
8. What are the advantages of doubly linked list over singly linked list?
The doubly linked list has two pointer fields. One field is previous link field and another
is next link field. Because of these two pointer fields we can access any node efficiently whereas
in singly linked list only one pointer field is there which stores forward pointer.
The circular linked list is a kind of linked list in which the last node is connected to
the first node or head node of the linked list.
This node is useful for getting the starting address of the linked list.
➢ Change: the implementation of the ADT can be changed without making changes in
the client program that uses the ADT.
➢ Understandability: ADT specifies what is to be done and does not specify the
implementation details. Hence code becomes easy to understand due to ADT.
➢ Reusability: the ADT can be reused by some program in future.
PART-B
1. Explain the insertion operation in linked list. How nodes are inserted after a specified
node.(NOV/DEC 2019)
2. Write an algorithm to perform add, delete and display operation using LIST ADT?
(NOV/DEC 2018)
6. How polynomial expression can be represented using linked list for addition? (NOV/DEC
2018,NOV/DEC 2019)
PART-A
1. Define Stack
A Stack is an ordered list in which all insertions (Push operation) and deletion (Pop
operation) are made at one end, called the top. The topmost element is pointed by top. The top is
initialized to -1 when the stack is created that is when the stack is empty. In a stack S = (a1,an),
a1 is the bottom most element and element a is on top of element ai-1. Stack is also referred as
Last In First Out (LIFO) list.
A+B*(C-D)/(P-R)
5. Define Queue.
A Queue is an ordered list in which all insertions take place at one end called the rear, while
all deletions take place at the other end called the front. Rear is initialized to -1 and front is
initialized to 0. Queue is also referred as First In First Out (FIFO) list.
PART-B
1. Write an algorithm for Push and Pop operations on Stack using Linked list.(NOV/DEC
2019)
2. Explain the array implementation of stack ADT in detail?
3. Explain in detail about circular queue.
4. Write the algorithm for converting infix expression to postfix (polish)
expression?(NOV/DEC 2019)
5. Explain in detail about priority queue ADT in detail?
6. What is Queue? Explain its operation and implement it using array.(NOV/DEC 2019)
7. Explain linked list implementation of queue ADT in detail?
UNIT III
PART-A
1. Define tree?
Trees are non-liner data structure, which is used to store data items in a shorted sequence.
It represents any hierarchical relationship between any data Item. It is a collection of nodes,
which has a distinguish node called the root and zero or more non-empty sub trees T1,
T2,….Tk. each of which are connected by a directed edge from the root
The height of n is the length of the longest path from root to a leaf. Thus all leaves have
height zero. The height of a tree is equal to a height of a root.
A Binary tree is a finite set of data items which is either empty or consists of a single
item called root and two disjoin binary trees called left sub tree max degree of any node is two.
Expression tree is also a binary tree in which the leafs terminal nodes or operands and
non-terminal intermediate nodes are operators used for traversal.
2. Preorder traversal
Binary search tree is a binary tree in which for every node X in the tree, the values of all the keys
in its left sub tree are smaller than the key value in X and the values of all the keys in its right
sub tree are larger than the key value in X.
AVL stands for Adelson-Velskii and Landis. An AVL tree is a binary search tree which has the
following properties:
A B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and
deletions in logarithmic amortized time. Unlike self-balancing binary search trees, it is optimized
for systems that read and write large blocks of data. It is most commonly used in database and
file systems.
PART-B
1. Explain the AVL tree insertion and deletion with suitable example.(APRIL/MAY 2019)
2. Describe the algorithms used to perform single and double rotation on AVL tree.
3. Explain about B-Tree with suitable example.(NOV/DEC 2018)
PART-A
2. Define Graph?
A graph G consist of a nonempty set V which is a set of nodes of the graph, a set E which
is the set of edges of the graph, and a mapping from the set of edges E to set of pairs of elements
of V. It can also be represented as G=(V, E).
Out degree: Number of edges having the node v as root node is the outdegree of the node v.
a. Adjacency matrix
b. Adjacency list
4. Finished.
PART-B
1. Explain the various representation of graph with example in detail?
2. Explain Breadth First Search algorithm with example?(APRIL/MAY 2019,NOV/DEC 2019)
3. Explain Depth first traversal?(APRIL/MAY 2019,NOV/DEC 2019)
4. What is topological sort? Write an algorithm to perform topological sort?(8) (NOV/DEC
2018)
5. (i) Write an algorithm to determine the bi connected components in the given graph.
(ii)Determine the bi connected components in a graph.
6. Explain the various applications of Graphs.(NOV/DEC 2019)
7. Explain in detail about Adjacency matrix and List
UNIT V
PART-A
• Bubble sort
• Selection sort
• Insertion sort
• Shell sort
• Quick sort
• Radix sort
• Heap sort
• Merge sort
The bubble sort repeatedly compares adjacent elements of an array. The first and second
elements are compared and swapped if out of order. Then the second and third elements are
compared and swapped if out of order. This sorting process continues until the last two
elements of the array are compared and swapped if out of order.
Insertion sort as there is no movement of data if the list is already sorted and
complexity is of the order O(N).
Merge sort performance is much more constrained and predictable than the performance of
quick sort. The price for that reliability is that the average case of merge sort is slower than the
average case of quick sort because the constant factor of merge sort is larger.
8. Define Searching.
Searching for data is one of the fundamental fields of computing. Often, the difference
between a fast program and a slow one is the use of a good algorithm for the data set. Naturally,
the use of a hash table or binary search tree will result in more efficient searching, but more often
than not an array or linked list will be used. It is necessary to understand good ways of searching
data structures not designed to support efficient search.
A binary search, also called a dichotomizing search, is a digital scheme for locating a specific
object in a large set. Each object in the set is given a key. The number of keys is always a power
of 2. If there are 32 items in a list, for example, they might be numbered 0 through 31 (binary
00000 through 11111). If there are, say, only 29 items, they can be numbered 0 through 28
(binary 00000 through 11100), with the numbers 29 through31 (binary 11101, 11110, and
11111) as dummy keys
PART-B
7. Show the result of inserting the keys 2,3,5,7,11,13,15,6,4 into an initially empty
extendible hashing data structure with M=3. (NOV/DEC 2018)
JAYARAJ ANNAPACKIAM C.S.I COLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi and Affiliated to Anna University)
MARGOSCHIS NAGAR, NAZARETH – 628 617
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
OBJECT ORIENTED PROGRAMMING
QUESTION BANK
UNIT 1
Unit 1
1) Define Encapsulation (Apr/May 2012) (Apr 2017)
The wrapping up of data and functions into a single unit is known as data encapsulation.
Here the data is not accessible to the outside the class. The data inside that class is accessible
by the function in the same class. It is normally not accessible from the outside of the
component
7) What is array? How to declare array and how to allocate the memory to for array?
Java array contains elements of similar data type. It is a data structure where we store
similar elements. We can store only fixed set of elements in a java array. Array in java is index
based, first element of the array is stored at 0 index.
data_type array_name []; and to allocate the memory-
array_name=new data_type[size];where array_name represent name of the array, new is a
keyword used to allocate the memory for arrays, data_type specifies the data type of array elements
and size represents the size of an array. For example:int a=new int[10];
PART B
1) Explain the various features of the Object Oriented Programming Language
NOV/DEC 2018
2) Explain the features and the characteristics of JAVA? Explain each of them with
example. NOV/DEC 2018,NOV/DEC 2019
3) What is method ? How method is defined? Give example NOV/DEC 2018
4) State the purpose of finalize () method in java?with an example explain how
finalize () method can be used in java program? NOV/DEC 2018
5) What is JVM?Explain the internal architecture of JVM with neat sketch.
NOV/DEC 2019
6) Discuss in detail the access specifiers available in Java.
7) Explain Packages in detail.
8) Explain Constructors with examples.
9) Explain in detail the various operators in Java.
10) Explain the concepts of arrays in Java and explain its types with examples?
UNIT 2
1) What is meant by Inheritance and what are its advantages?
Inheritance is a relationship among classes, wherein one class shares the structure or behavior
defined in another class. This is called Single Inheritance. If a class shares the structure or
behavior from multiple classes, then it is called Multiple Inheritance. Inheritance defines “is-a”
hierarchy among classes in which one subclass inherits from one or more generalized super
classes. The advantages of inheritance are reusability of code and accessibility of variables and
methods of the super class by subclasses
PART B
UNIT 3
PART B
1) Define Thread?
A thread is a single sequential flow of control within program. Sometimes, it is called an
execution context or light weight process. A thread itself is not a
program. A thread cannot run on its own. Rather, it runs within a program. A program can be
divided into a number of packets of code, each representing a thread having its own separate
flow of control.
2) What is Multi-threading?
Multithreading is a conceptual programming concept where a program(process) is divided into
two or more subprograms(process), which can be implemented at the same time in parallel. A
multithreaded program contains two or more parts that can run concurrently. Each part of such
a program is called a thread, and each thread defines a separate path of execution.
1) What is an Applet?
Applet is a Java application, which can be executed in JVM, enabled web browsers.
3) What is AWT?
A collection of graphical user interface (GUI) components that were implemented using native-
platform versions of the components. These components provide that subset of functionality
which is common to all native platforms. Largely supplanted by the Project Swing component
set.
5) Name the listener methods that must be implemented for the key listener interface. (NOV
2013)
void keyTyped(KeyEvent e)
void keyPressed(KeyEvent e)
void keyReleased(KeyEvent e)
7) What is a layout manager and what are different types of layout managers available in
java AWT?
A layout manager is an object that is used to organize components in a container. The
different layouts are available are FlowLayout, BorderLayout, CardLayout, GridLayout and
GridBagLayout.
PART B
1) Use graphics objects to draw an arc and semicircle inside a rectangular box.APRIL/MAY
2019
2) Sketch the hierarchy of java AWT classes and methods.create a check box using these
classes and methods. APRIL/MAY 2019
3) State the differences between AWT and swing. APRIL/MAY 2019
4) Describe in details about the different layout in Java GUI.Which layout is the default
one?NOV/DEC 2018,NOV/DEC 2019
5) Discuss mouse listener and mouse motion listener. Give an example program NOV/DEC
2019
6) Explain the layout managers in Java also describe the concept of menu creation.
7) What is an adapter class? Describe about various adapter classes in detail?
UNIT I
OPERATING SYSTEM
PART-A
1. List and briefly define the four main elements of a computer?
Processor – Controls the operation of the computer & performs its data processing functions
Main memory – Stores data & programs. It is volatile.
I/O modules – Move data between the computer & its external environment such as
disks, communication equipment &terminals.
System Bus – Provides for communication among processors, main memory & I/O modules.
2. What is an Operating system?
An operating system is a program that manages the computer hardware. It also provides a basis for
application programs and act as an intermediary between a user of a computer and the computer hardware. It
controls and coordinates the use of the hardware among the various application programs for the various
users.
3. What are the objectives of operating system? (April/May 2010, May/June 2012, April/May 2017)
Convenience – An OS makes a computer more convenient to use
Efficiency -- An OS allows the system resources to be used in efficient manner
Ability to Evolve – An OS Constructed in such a way as to permit the effective development,
testing & introducing new function.
4. What are the advantages of peer-to-peer systems over client-server systems? (May/June 2016)
The main advantage of peer to peer network is that it is easier to setup
In peer-to-peer networks all nodes are act as server as well as client therefore no need of dedicated
server.
The peer to peer network is less expensive.
Peer to peer network is easier to set up and use this means that you can spend less time in the
configuration and implementation of peer to peer network.
It is not require for the peer to peer network to use the dedicated server computer.
5. Define Kernel
The kernel is a software code that resides in the central core of a operating system. It has complete
control over the system.
6. What do you mean by system calls?
System calls provide the interface between a process and the operating system. When a system call
is executed, it is treated as by the hardware as software interrupt.
7. What is the purpose of system programs/system calls? (May/June 2016) (Apr/May 2018)
System programs can be thought of as bundles of useful system calls. They provide basic
functionality to users so that users do not need to write their own programs to solve common problems.
8. Can traps be generated intentionally by a user program? If so, for what purpose? (Nov/Dec 2018)
A trap is a software‐generated interrupt. An interrupt can be used to signal the completion of an I/O
to obviate the need for device polling. A trap can be used to call operating system routines or to catch
arithmetic errors.
9. How does an interrupt differ from a trap? (Nov/Dec 2016, Apr/May 2018)
Interrupt Trap
An interrupt is a hardware-generated
A trap is a software-generated
signal that changes the flow within the
interrupt.
system.
An interrupt can be used to signal the
completion of I/O so that the CPU A trap can be used to catch arithmetic
doesn't have to spend cycles polling errors or to call system routines
the device.
10. Some computer systems do not provide a privileged mode of operation in hardware. Is it possible
to construct a secure operating system for these computer systems? (Nov/Dec 2018)
An operating system for a machine of this type would need to remain in control (or monitor mode)
at all times. This could be accomplished by two methods:
Software interpretation of all user programs (like some BASIC, Java and LISP systems, for
example). The software interpreter would provide, in software, what the hardware does not provide.
Require meant that all programs be written in high‐level languages so that all object code is
compiler‐produced. The compiler would generate the protection checks that the hardware is
missing.
PART-B
1. With neat sketch, discuss about computer system overview. (Nov/Dec 2015)
2. Discuss the functionality of system boot with respect to an operating system. (Nov/Dec2018)
3. Discuss about direct memory access. (April/May’17)
4. Explain cache memory and its mapping. (Nov/Dec’17)
5. Explain the concept of multiprocessor and multicore organization. (April/May’17)
6. Describe evolution of OS. (Nov/Dec’17)
7. Discuss in detail about operating system structure. (Nov/Dec’15, April/May’17, April/May’18)
8. Describe the various types of system calls in detail. (Nov/Dec’15, April/May’17)
UNIT II
PROCESS MANAGEMENT
PART – A
1. Compare and contrast Single-threaded and multi-threaded process. (Apr/May 2017)
Single-threading is the processing of one command/ process at a time. Whereas multi threading is a
widespread programming and execution model that allows multiple threads to exist within the context of one
process. These threads share the process's resources, but are able to execute independently.
2. Priority inversion is a condition that occurs in real time systems – Analyzing on this statement.
(Apr/May 2017)
Priority inversion is a problem that occurs in concurrent processes when low-priority threads hold
shared resources required by some high-priority threads, causing the high priority-threads to block
indefinitely. This problem is enlarged when the concurrent processes are in a real time system
where high- priority threads must be served on time.
Priority inversion occurs when task interdependency exists among tasks with different priorities.
3. Distinguish between CPU bounded, I/O bounded processes. (Nov/Dec 2016)
CPU bound process, spends majority of its time simply using the CPU (doing calculations).
I/O bound process, spends majority of its time in input/output related operations.
4. What resources are required to Creating threads? (Nov/Dec2016)
When a thread is created the threads does not require any new resources to execute. The thread
shares the resources of the process to which it belongs to and it requires a small data structure to hold a
register set, stack, and priority.
5. Under what circumstances user level threads are better than the kernel level threads? (May/June
2016) (Nov/Dec 2015)
User threads: User threads are supported above the kernel and are implemented by a thread library
at the user level. Thread creation & scheduling are done in the user space, without kernel
intervention. Therefore they are fast to Creating and manage blocking system call will cause the
entire process to block
Kernel threads: Kernel threads are supported directly by the operating system. Thread creation,
scheduling and management are done by the operating system. Therefore they are slower to Creating
& manage compared to user threads. If the thread performs a blocking system call, the kernel can
schedule another thread in the application for execution.
6. What is the meaning of the term busy waiting? (May/June 2016)(Nov/Dec2018)
Busy-waiting, busy-looping or spinning is a technique in which a process repeatedly checks to see if
a condition is true.
7. List out the data fields associated with process control blocks. .(April/May 2015)
Process ID, pointers, process state, priority, program counter, CPU registers, I/O information,
Memory management information, Accounting information, etc.
8. Define the term ‘Dispatch Latency”. (April/May 2015)
The term dispatch latency describes the amount of time it takes for a system to respond to a request
for a process to begin operation.
9. What is the concept behind strong semaphore and spinlock? (Nov/Dec2015)
Strong semaphores specify the order in which processes are removed from the queue (FIFO order),
which guarantees avoiding starvation.
Spinlock is a lock which causes a thread trying to acquire it to simply wait in a loop ("spin") while
repeatedly checking if the lock is available.
10. What is aprocess?
A process is a program in execution. It is an active entity and it includes the process stack, containing
temporary data and the data section contains global variables.
PART - B
1. What is a process? Discuss components of process and various states of a process with the help of a
process state transition diagram. (Nov/Dec’17)
2. Describe the difference among short-term, medium-term and long-term scheduling with suitable
examples. (April/May’18)
3. Consider the following set of processes, with the length of the CPU burst given in milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, and P5 all at time 0. Draw
Gantt charts that illustrate the execution of these processes using the scheduling algorithms FCFS,
SJF, Priority (smaller priority number implies higher priority) and RR (quantum = 1). What is the
waiting time of each process for each of the scheduling algorithms? (Nov/Dec’15, April/May’18)
4. What is the average turnaround time and average waiting time for the following processes using
a) FCFS
b) SJF non-preemptive
c) Preemptive SJF (Nov/Dec’17)
Process Arrival time Burst Time
P1 0.0 8
P2 0.4 4
P3 1.0 1
5. Consider the following set of processes, with the length of the CPU-burst time given in ms:
Process Arrival time Burst Time
P1 0.00 8
P2 1.001 4
P3 2.001 9
P4 3.001 5
P5 4.001 3
Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF and RR
(quantum=2) scheduling. Also calculate waiting and turnaround time for each scheduling algorithms.
(April/May’17)
6. Discuss in detail about the concept of multithreading. (May/June’16)
7. Discuss about the issues to be considered with multithreaded programs. (April/May’15)
UNIT III
STORAGE MANAGEMENT
PART – A
1. What is the difference between user-level instructions and privileged instructions? (April/May
2017)
A non-privileged (i.e. user-level) instruction is an instruction that any application or user can
execute. A privileged instruction, on the other hand, is an instruction that can only be executed in kernel
mode. Instructions are divided in this manner because privileged instructions could harm the kernel.
2. Define Belady’s anomaly? (April/May 2017)
Belady's anomaly is the phenomenon in which increasing the number of page frames results in an
increase in the number of page faults for certain memory access patterns. This phenomenon is commonly
experienced when using the first-in first-out (FIFO) page replacement algorithm.
3. What is the purpose of paging the page table? (Nov/Dec 2016)
In certain situations the page tables could become large enough that by paging the page tables, one
could simplify the memory allocation problem (by ensuring that everything is allocated as fixed-size pages
as opposed to variable-sized chunks) and also enable the swapping of portions of page table that are not
currently used.
4. Why page sizes are always power of 2? (Nov/Dec 2016)
Paging is implemented by breaking up an address into a page and offset number. It is most efficient
to break the address into X page bits and Y offset bits, rather than perform arithmetic on the address to
calculate the page number and offset. Because each bit position represents a power of 2, splitting an address
between bits results in a page size that is a power of 2.
5. List two differences between logical and physical addresses. (May/June 2016)
Logical Address Physical Address
An address seen by memory unit that is,
An address generated by CPU is referred the one loaded into the memory address
to us a logicaladdress. register of the memory is referred to as
physical address.
The set of all physical address
The set of all logical address generated
corresponding to these logical addresses
by a program is a logical address space.
is a physical address.
The user program deals with logical
These are generated by memory
address or these are generated by user
management unit (MMU).
(program).
6. Define demand paging in memory management. (Nov/Dec 2015)
In virtual memory systems, demand paging is a type of swapping in which pages of data are not
copied from disk to RAM until they are needed.
7. What is pure demand paging?
When starting execution of a process with no pages in memory, the operating system sets the
instruction pointer to the first instruction of the process, which is on a non-memory resident page, the
process immediately faults for the page. After this page is brought into memory, the process continues to
execute, faulting as necessary until every page that it needs is in memory. At that point, it can execute with
no more faults. This schema is pure demand paging.
8. Define lazy swapper.
Rather than swapping the entire process into main memory, a lazy swapper is used. A lazy swapper
never swaps a page into memory unless that page will be needed.
9. What are the steps required to handle a page fault in demand paging? (Nov/Dec 2015)
Operating system looks at another table to decide:
o Invalid reference -abort
o Just not in memory
Find free frame
Swap page into frame via scheduled disk operation
Reset tables to indicate page now in memory Set validation bit =v
Restart the instruction that caused the page fault
10. Tell the significance of LDT and GDT in segmentation.(May/June 2015)
The LDT is supposed to contain memory segments which are private to a specific program, while
the GDT is supposed to contain global segments.
In order to reference a segment, a program must use its index inside the GDT or the LDT. Such an
index is called a segment selector or selector in short.
PART -B
1. Draw the diagram of paging memory management scheme and explain its principle. (Nov/Dec’17)
2. Explain the basic concepts of segmentation. (Nov/Dec’17)
3. Discuss in detail about demand paging.
4. Discuss in detail about various page replacement algorithms. (April/May’15)
5. Consider the following page reference string 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 4, 5, 3. How
many page faults would occur for the following replacement algorithms? Assume four frames and all frames
are initially empty. (Nov/Dec’15, April/May’15)
i. LRU replacement
ii. FIFO replacement
iii. Optimal replacement
6. Discuss the concept of buddy system and slab allocation with neat sketch. (April/May’17)
7. Explain the concept of thrashing. (Nov/Dec’15)
UNIT IV
FILE SYSTEMS AND I/O SYSTEMS
PART – A
1. Distinguish file from dictionary. (Apr/May2017)
File Directory
It is a collection of different kind of
It is used to sore different files or
data like text files, picture files,
subdirectory
document etc.,
Each file has its own file extension It does not have any extension
After creating files, we can easily
After creating directory, we can
open, save, print and modify the file
rename, move, delete the directory
contents
2. Why it is important to scale up system bus and device speed as CPU speed increases? (Nov/Dec
2016)
Consider a system which performs 50% I/O and 50% computes. Doubling the CPU performance on
this system would increase total system performance by only 50%. Doubling both system aspects would
increase performance by 100%. Generally, it is important to remove the current system bottleneck, and to
increase overall system performance, rather than blindly increasing the performance of individual system
components.
3. Define C-SCAN scheduling. (Nov/Dec 2016)
The elevator algorithm (also SCAN) is a disk scheduling algorithm to determine the motion of the
disk's arm and head in servicing read and write requests. This algorithm is named after the behaviour of a
building elevator, where the elevator continues to travel in its current direction (up or down) until empty,
stopping only to let individuals off or to pick up new individuals heading in the same direction.
4. How does DMA increase system concurrency? (May/June 2016)
DMA increases system concurrency by allowing the CPU to perform tasks while the DMA system
transfers data via the system and memory buses.
5. Why rotational latency is not considered in disk scheduling? (May/June2016)
Most disks do not export their rotational position information to the host. Even if they did, the time
for this information to reach the scheduler would be subject to imprecision and the time consumed by the
scheduler is variable, so the rotational position information would become incorrect. Further, the disk
requests are usually given in terms of logical block numbers, and the mapping between logical blocks and
physical locations is very complex.
6. What is HSM? Where it is used? (Apr/May2015) Ans:
Hierarchical storage management (HSM) is a data storage technique, which automatically moves
data between high-cost and low-cost storage media. HSM systems exist because high- speed storage devices,
such as solid state drive arrays, are more expensive (per byte stored) than slower devices, such as hard disk
drives, optical discs and magnetic tape drives.
7. List out the major attributes and operations of a file. (April/May’15)
Attributes:
Name
Identifier
Type
Location
Size
Protection
Time, date and user identification
Operations:
Creating a file
Writing a file
Reading a file
Repositioning with a file
Deleting a file
Truncating a file
8. What are the functions of Virtual File System (VFS) layer in file system implementation? (Nov/Dec
2015)
A virtual file system (VFS) or virtual file system switch is an abstraction layer on top of a more
concrete file system. The purpose of a VFS is to allow client applications to access different types of
concrete file systems in a uniform way. A VFS can, for example, be used to access local and network
storage devices transparently without the client application noticing the difference.
9. What is a file?
A file is a named collection of related information that is recorded on secondary storage. A file
contains either programs or data. A file has certain "structure" based on its type.
10. What are the different accessing methods of a file?
Sequential access: Information in the file is accessed sequentially.
Direct access: Information in the file can be accessed without any particular order.
Other access methods: Creating index for the file, indexed sequential access method (ISAM) etc.
PART - B
1. On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to
satisfy the entire request in the disk queue. Assume the last received was at track 345 and the head is moving
towards track 0. The queue in FIFO order contains requests for the following tracks. 123, 874, 692, 475, 105
and 376. Find the seek length for the following scheduling algorithm. (April/May’15, April/May’17,
April/May’18)
(1)FCFS (2)SSTF (3)SCAN(4)CSCAN (5)LOOK
2. Briefly discuss about the various directory structures. (April/May’15, April/May’17)
3. Explain in detail about disk space allocation methods. (April/May’18)
4. Discuss the concept of buddy system allocation with neat sketch. (April/May’17)
5. Discuss the function of files and file implementation. (Nov/Dec’15)
6. Discuss about various file access methods. (April/May’17)
7. Discuss about free space management on I/O buffering and blocking. (April/May’17)
UNIT V
CASE STUDY
PART – A
1. What are the features of Linux file system? (Apr/May 2017)
Specifying paths
Partition, drives/devises and Directories
Mounting and Unmounting
Case sensitivity
File Extensions
Hidden files
File system permissions
2. What is the use of kernel modules in Linux? (Apr/May2017)
Kernel modules are pieces of code that can be loaded and unloaded into the kernel upon demand.
They extend the functionality of the kernel without the need to reboot the system.
3. Define the components of LINUX system. (May/June 2016)
Kernel
System Library
System Utility
4. What are the main supports for the Linux modules?
Module Management
Driver Registration.
Conflict Resolution mechanism
5. Define the function of caching-only serves. (May/June2016)
A cache server is a dedicated network server or service acting as a server that saves Web pages or
other Internet content locally. By placing previously requested information in temporary storage, or cache, a
cache server both speeds up access to data and reduces demand on an enterprise's bandwidth.
6. What is virtualization? (Nov/Dec2016)
Virtualization is the creation of a virtual -- rather than actual -- version of something, such as an
operating system, a server, a storage device or network resources.
7. What is meant by System Libraries?
System Libraries define a standard set of functions through which applications can interact with the
kernel and that implement much of the operating -system functionality that doesn’t need the full privileges
of kernel code.
8. What is meant by System Utilities?
System Utilities are system programs that perform individual, specialized management tasks. Some
of the System utilities may be invoked just to initialize and configure some aspect of the system and others
may run permanently, handling such tasks as responding to incoming network connections, accepting logon
requests from terminals or updating log files.
9. What is the function of Module management?
The module management allows modules to be loaded into memory and to talk to the rest of the
kernel.
10. What is the function of Driver registration?
Driver Registration allows modules to tell the rest of the kernel that a new driver has become
available.
PART - B
1. With neat sketch, discuss in detail about Android architecture.
2. Explain in detail about Linux OS.
3. With neat sketch, discuss in detail about ios architecture.
4. Explain about Linux kernel and virtualization with neat sketch.(Apr/May 2017, Nov/Dec 2016)
5. Discuss about the steps involved in the installation of the Linux multi-function server. (Apr/May
2015, May/June 2016)
6. Explain the components of linux system in detail.
7. Explain about Kernel I/O subsystem and transforming I/O to hardware operations.(April/May’17)
JAYARAJ ANNAPACKIAM C.S.I COLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi and Affiliated to Anna University)
COMPUTER ARCHITECTURE
QUESTION BANK
UNIT 1
2) What is a bus? What are the different buses in a CPU? [ APR/MAY 2011]
A group of lines that serve as a connecting path for several devices is called bus.The
different buses in a CPU are 1] Data bus 2] Address bus 3] Control bus.
If 2 Two's Complement numbers are subtracted, and their signs are different, thenoverflow occurs if and
only if the result has the same sign as the subtrahend.
Overflow occurs if
(+A) − (−B) = −C
(−A) − (+B) = +C
PART B
UNIT III
1) What is meant by pipeline bubble?(NOV/DEC 2016)
To resolve the hazard the pipeline is stall for 1 clock cycle. A stall is commonly called a
pipeline bubble, since it floats through the pipeline taking space but carrying no useful work.
2) What is data path?(NOV/DEC 2016,APR/MAY2018)
As instruction execution progress data are transferred from one instruction to another, often
passing through the ALU to perform some arithmetic or logical operations. The registers, ALU,
and the interconnecting bus are collectively referred as the data path.
3) Define exception and interrupt. Dec 2012,NOV/DEC 14,MAY/JUNE
2016,APR/MAY2018))
Exception:
The term exception is used to refer to any event that causes an interruption.
Interrupt:
An exception that comes from outside of the processor. There are two types of interrupt.
1. Imprecise interrupt and 2.Precise interrupt
4) Why is branch prediction algorithm needed? Differentiate between the static and
dynamic techniques. (May 2013,APR/MAY 2015,NOV/DEC 15)
The branch instruction will introduce branch penalty which would reduce the gain in performance
expected from pipelining. Branch instructions can be handled in several ways to reduce their
negative impact on the rate of execution of instructions. Thus the branch prediction algorithm is
needed.
Static Branch prediction
The static branch prediction, assumes that the branch will not take place and to continue to fetch
instructions in sequential address order.
Dynamic Branch prediction
The idea is that the processor hardware assesses the likelihood of a given branch being taken by
keeping track of branch decisions every time that instruction is executed. The execution history
used in predicting the outcome of a given branch instruction is the result of the most recent
execution of that instruction.
5) Define pipeline speedup. [ APR/MAY 2012] (A.U.NOV/DEC 2012) Speed up is the
ratio of the average instruction time without pipelining tothe average instruction time
with pipelining. Average instruction time without pipelining Speedup= Average
instruction time with pipelining
6) Define Pipeline speedup. (Nov/Dec 2013)
The ideal speedup from a pipeline is equal to the number of stages in the pipeline.
One of the most important methods for finding and exploiting more ILP is speculation. It is
an approach whereby the compiler or processor guesses the outcome of an instruction to remove
it as dependence in executing other instructions. For example, we might speculate on the outcome
of a branch, so that instructions after the branch could be executed earlier.
Speculation (also known as speculative loading ), is a process implemented in Explicitly Parallel
Instruction Computing ( EPIC ) processors and their compiler s to reduce processor-memory
exchanging bottlenecks or latency by putting all the data into memory in advance of an actual
load instruction
10) What are the advantages of pipelining?MAY/JUNE 2016
The cycle time of the processor is reduced; increasing the instruction throughput.Some
combinational circuits such as adders or multipliers can be made faster by adding more
circuitry. If pipelining is used instead, it can save circuitry vs. a more complex
combinational circuit.
PART B
1) Explain the basic MIPS implementation with binary multiplexers and control lines(16)
NOV/DEC 15
2) What is hazards ?Explain the different types of pipeline hazards with suitable
examples.(NOV/DEC2014,APRIL/MAY2015,MAY/JUNE 2016,NOV/DEC2017)
3) Explain how the instruction pipeline works. What are the various situations where an
instruction pipeline can stall? Illustration with an example?
NOV/DEC 2015,NOV/DEC 2016.
4) Explain data path in detail(NOV/DEC 14,NOV/DEC2017)
5) Explain in detail How exceptions are handled in MIPS architecture.(APRIL/MAY2015) .
6) Explain in detail about building a datapath(NOV/DEC2014
7) Explain in detail about control implementation scheme(APR/MAY 2018)
8) What is pipelining?Discuss about pipelined datapath and control(16)MAY/JUNE2016
9) Why is branch prediction algorithm needed?Differentiate between static and dynamic
techniques?NOV/DEC 2016
10) Design a simple path with control implementation and explain in detail(MAY/JUN 2018)
11) Discuss the limitation in implementing the processor path. Suggest the methods to
overcome them(NOV/DEC 2018)
UNIT 4
Strong scaling
Speed-up achieved on a multi-processor without increasing the size of the problem.
Weak scaling.
Speed-up achieved on a multi-processor while increasing the size of the problem proportionally
to the increase in the number of processors.
3) Define multithreading.(NOV/DEC2014,NOV/DEC 2016) Multithreading is the ability
of a program or an operating system to serve more than one user at a time and to manage
multiple simultaneous requests without the need to have multiple copies of the
programs running within the computer. To support this, central processing units have
harware support to efficiently execute multiple threads
PART B
1) Explain Instruction level parallel processing state the challenges of parallel
processing.(NOV/DEC2014,APR/MAY2018)
2) Explain the difficulties faced by parallel processing programs(APR/MAY
2018)
3) Explain shared memory multiprocessor with a neat diagram?NOV/DEC 2016
4) Explain in detail Flynn’s classification of parallel hardware
(NOV/DEC 2015,MAY/JUNE 2016,NOV/DEC2016,NOV/DEC2017)
5) Explain in detail about hardware Multithreading(NOV/DEC2015,MAY/JUNE2016)
6) Explain Multicore processors(NOV/DEC2014,MAY/JUNE2016)
7) What is hardware Multithreading?compare and contrast Fine grained Multi-Threading
and coarse grained multithreading(APRIL/MAY2015,APR/MAY 2018)
8) Discuss about SISD,MIMD,SIMD,SPMD and VECTOR SYSTEM
APRIL/MAY2015
UNIT 5
3) How cache memory is used to reduce the execution time. (APR/MAY’10) If active
portions of the program and data are placed in a fast small memory, the average memory
access time can be reduced, thus reducing the total execution time of the program. Such a
fast small memory is called as cache memory.
9) What is the necessary of virtual memory? State the advantages of virtual memory?
MAY/JUNE 2016
Virtual memory is an important concept related to memory management. It is used to
increase the apparent size of main memory at a very low cost. Data are addressed in a virtual
address space that can be as large as the addressing capability of CPU.
Virtual memory is a technique that uses main memory as a “cache” for
secondary
storage. Two major motivations for virtual memory: to allow efficient and safe sharing of
memory among multiple programs, and to remove the programming
burdens of a small, limited amount of main memory
10) Distinguish between isolated and memory mapped I/O? (May 2013)
The isolated I/O method isolates memory and I/O addresses so that memory address values
are not affected by interface address assignment since each has its own address space.
In memory mapped I/O, there are no specific input or output instructions. The CPU can
manipulate I/O data residing in interface registers with the same
instructions that are used to manipulate memory words
PART B
PART – A (2 mark)
2 marks
UNIT – I
1.Define Algorithm.
Time Efficiency-How fast your algorithm runs? Space Efficiency-How much extra
memory your algorithm needs?
• Sorting
• Searching
• String Processing
• Graph Problem
• Combinatorial Problem
• Geometric Problem
• Numerical Problem
• To group algorithms according to underlying design techniques they are based upon 8.
What is Sorting Problem? Sorting algorithm is rearrange the items of given list
descending/ascending order. Sorting algorithms classified into
• Non-Stable Algorithm
Finding a given value, called search key given set. Searching Algorithms needs more
memory space and sorted array.
UNIT-II
• Consistent
• Interactive
5. Define O-Notation.
A function t(n) is said to be O (g(n)), denoted t(n) Є O (g(n)), if t(n) is bounded above by
some constant multiple of g(n) for all large n, ie ., if there exist some positive constant c and
some nonnegative integer 0 such that t(n) <= cg(n) for all>=0
It is defined as the use of images to convey some useful information about algorithms.
The Fibonacci numbers are an important sequence of integers in which every element is
equal to the sum of its two immediate predecessors. There are several algorithms for computing
the Fibonacci numbers with drastically different efficiency.
UNIT III
It is a partition method using the particular key the given table is partitioned into 2 sub
tables so that first, the original key will be its position the sorted sequence and secondly, all keys
to the left of this key will be less value and all keys to the right of it will be greater values
The binary search algorithm some of the most efficient searching techniques which
requires the list to be sort descending order. To search for an amount of the list, the binary search
algorithms split the list and locate the middle element of the list. First compare middle key K1,
with given key K . If K1=K then the element is found.
• Instance simplification
• Representation change
• Problem reduction
Spanning tree has many applications. Any connected graph with n vertices much have
atleast-1 edges and connected graphs with n-1 edges are trees. If the nodes of G represent cities
and edges represent possible communication links connecting 2 cities, then the minimum number
of links needed to connect the cities is -1. Therefore, it is necessary for finding minimum
spanning tree.
Let G={V,E} be an undir cted connected graph. A sub graph t={V,E} of G is a spanning
tree of G, if it is tree.
UNIT-IV
1.Define mode?
A mode is a value that occur often in a given list of numbers. For example, the list is
5,1,5,7,6,5,7,5 .. the mode is 5.
2.Define rotation?
A rotation in an AVL tree is a local transformation of its subtree rooted at a node, which
is performed, when the balance factor of a node either +2 or -2.If an insertion or deletion of a
new node in AVL Tree creates a tree with a violated balance requirement, then the tree is
restructured by performing special transformation called rotation, that restore the balance
required.
• Right rotation
• Left rotation
1) Frequent rotations are needed to maintain balances from the tree’s nodes.
A 2-3 tree is tree have 2 kinds of nodes. They are 2 nodes and 3 nodes. A 2 nodes
contains single key k and has 2 children A 3 nodes contains two ordered key K1 and K2(K1
6. Define Heap Heap is partially ordered data structure that is especially suitable for
implementing priority queues A heap is said to be a max heap, then the children of every node
have a value less than that node. A heap is said to be a min heap, then the children of every node
have a value greater than node
Priority queue is a data structure in which the intrinsic ordering of the elements does
determine the results of its basic operations Ascending and descending priority queue are the 2
types of priority queue.
Prim’s algorithm is greedy and efficient algorithm, which is used to find the minimum
spanning tree of weighted connected graph
UNIT-V
1. Define backtracking?
Depth first node generation with bounding function is called backtracking. The
backtracking algorithm has its virtue the ability to yield the answer with far fewer than m
trials.
2. What is Hamiltonian cycle in an undirected graph?
A Hamiltonian cycle is round trip along n edges of G that visits every vertex once and
returns to its starting position.
3. What is Feasible solution?
It is obtained from given n inputs Subsets that satisfies some constraints are called
feasible solution. It is obtained based on some constraints
4. What is optimal solution?
It is obtained from feasible solution. Feasible solution that maximizes or minimizes a
given objective function. It is obtained based on objective function.
5. List the application of backtracking technique?
8-Qeens problem
6. Given an application for knapsack problem?
The knapsack problem is problem combinatorial optimization. It derives its name from
the maximum problem of choosing possible essential that can fit too bag to be carried on
trip. A similar problem very often appears business, combinatory, complexity theory,
cryptography and applied mathematics.
7. Define subset sum problem?
Subset sum problem is problem, which is used to find a subset of a given set
S={S1,S2,S3,…….Sn} of positive integers whose sum is equal to given positive integer
d.
8. What is heuristic?
A heuristic is common sense rule drawn from experience rather than from mathematically
proved assertion. For example, going to the nearest un visited city in the travelling
salesman problem is good example for heuristic.
9. State the concept of branch and bound method?
The branch and bound method refers to all state space search methods in which all
children of the E-Node are generated before any other live node can become the E-node.
10. Give the upper bound and lower bound of matrix multiplication algorithm?
Upper bound: The given algorithm does n*n*n multiplication hence at most n*n*n
multiplication are necessary. Lower bound: It has been proved in the literature that at
least n*n multiplication are necessary.
UNIT I
3. Discuss important problem types that you face during Algorithm Analysis.
UNIT – II
7. (i) Explain the necessary steps for analyzing the efficiency of recursive algorithms.
UNIT - III
6. Find the optimal binary search tree for the key and probabilities given below.
KEY A B C D
PROBABLITIES 0.1 0.2 0.4 0.3
8 . Solve all pairs shortest path problem for the digraph. 16 b to a -2,a to c-3,c to d-1,c to b-7,d to a- 6
UNIT IV
5. Define functional dependency. (Nov 2009, Nov 2010, Nov 2011, Nov 2012, Nov 2013, May 2014,
Nov 2020, May 2021)
Functional dependency requires that the value for a certain set of attributes determines uniquely
the value for another set of attributes. In a given relation R, X and Y are attributes. Attribute Y is
functionally dependent on attribute X if each value of X determines exactly one value of Y which is
represented as X -> Y. ie) X determines Y or Y is functionally dependent on X. X -> Y does not
imply y -> X.
6. Give the properties of decomposition. (May 2019)
i. Lossless join
ii. Dependency Preservation
iii. Repetition of information
7. State the various pitfalls in relational database design. (Nov 2002, Nov 2009, May 2010)
A bad design may lead to
i. Repetition of information- that leads to insertion, deletion, updation problems.
ii. Inability to represent certain information.
8. What is normalization? Write the types of all normal forms. (May 2013, May 2014)
Normalization is a process of analyzing the given relation schema based on the functional
dependencies and primary keys to achieve the desirable properties of
Minimizing redundancy
Minimizing insert, delete and update anomalies.
Improving consistency
Types
- First Normal Form
- Second Normal Form
- Third Normal Form
- Boyce Codd Normal Form
- Fourth Normal Form
- Fifth Normal Form
9. Prove that any relation schema with two attributes is in BCNF (Nov 2011)
Consider a relation schema R = {A, B} with two attributes. The only possible non-trivial FDs are
{A} -> {B} and {B} -> {A}. There are four possible cases:
i. No FD holds in R. In this case, the key is {A, B} and the relation satisfies BCNF.
ii. Only {A} -> {B} holds. In this case, the key is {A} and the relation satisfies BCNF.
iii. Only {B} -> {A} holds In this case, the key is {B} and the relation satisfies BCNF.
iv. Both {A} -> {B} and {B} -> {A} hold. In this case, there are two keys {A} and {B} and the
relation satisfies BCNF.
10. Consider a relation R = {A, B, C, D, E} with the following dependencies:
AB -> C CD -> E DE -> B
Is AB a candidate key of this relation? If not, is ABD? Explain your answer. (May 2010)
No, AB+ = {A, B, C}, a proper subset of {A, B, C, D, E}
Yes, ABD+ = {A, B, C, D, E}
PART B
1. Construct an ER diagram for a Car insurance company whose customers own one or more cars
each. Each car has associated with it zero to any number of recorded accidents. Convert the
designed ER into a relational design. (Nov 2018, Nov 2020, Nov 2021, May 2022)
2. A university registrar’s office maintains data about the following entities:
(1) courses, including number, title, credits, syllabus, and prerequisites;
(2) course offerings, including course number, year, semester. section number, instructor, timings,
and classroom;
(3) students, including student-id, name, and program; and
(4) instructors, including identification number, name, department, and title. Further, the
enrollment of students in courses and grades awarded to students in each course they are
enrolled for must be appropriately modeled. Model an entity relationship diagram for the
registrar’s office. (May 2018, Nov 2021)
3. Consider the following information about a university database:
i. Professors have an SSN, a name, an age, a rank, and a research specialty.
ii. Projects have a project number, a sponsor name (e.g., NSF), a starting date, an ending date, and
a budget.
iii. Graduate students have an SSN, a name, an age, and a degree program (e.g., M.S. or Ph.D.).
iv. Each project is managed by one professor (known as the project’s principal investigator).
v. Each project is worked on by one or more professors (known as the project’s co-investigators).
vi. Professors can manage and/or work on multiple projects.
vii. Each project is worked on by one or more graduate students (known as the project’s research
assistants).
viii. When graduate students work on a project, a professor must supervise their work on the
project. Graduate students can work on multiple projects, in which case they will have a
(potentially different) supervisor for each one.
ix. Departments have a department number, a department name, and a main office.
x. Departments have a professor (known as the chairman) who runs the department.
xi. Professors work in one or more departments, and for each department that they work in, a time
percentage is associated with their job.
xii. Graduate students have one major department in which they are working on their degree.
xiii. Each graduate student has another, more senior graduate student (known as a student advisor)
who advises him or her on what courses to take.
Design and draw an ER diagram that captures the information about the university. Use only the
basic ER model here, that is, entities, relationships, and attributes. Be sure to indicate any key and
participation constraints. (Nov 2019)
4. i) State the Armstrong axioms.
(ii) Define BCNF and justify a relation R with two attributes is in BCNF. (Nov 2021)
5. Explain the following terms briefly : attribute, domain, entity relationship, entity set, relationship
set, one-to-many relationship, many-to-many relationship, participation constraint, overlap
constraint, covering constraint, weak entity set, aggregation and role indicator. (Nov 2020, May
2021)
6. Discuss in detail the steps involved in ER-to-Relational Mapping in the process of relational
database design. (Nov 2019)
7. i) Write an algorithm to find closure of functional dependents. (5)
ii) Compute the closure of the following set F of functional dependencies for relation schema R =
{A, B, C, D, E}.
A -> BC
CD -> E
B -> D
E -> A
List the candidate keys for R. (Nov 2020, May 2021)
8. (i) Consider the following relation:
R(U, V, W, X, Y, Z)
All the attributes of relation R are atomic. The primary key of relation R is combination of U and V.
The following functional dependencies hold:
UV → W
U→X
V→Y
Y→Z
Is relation R normalized? If yes, justify the relation is normalized. If no, state reasons and normalize
the same.
(ii) Consider the following relation:
STUDENT (ROLLNUMBER, NAME, DOB, GENDER, BRANCH_CODE, BRANCH_NAME)
The primary key of the relation is ROLLNUMBER. The following functional dependencies hold:
ROLLNUMBER → NAME, DOB, GENDER, BRANCH_CODE
BRANCH CODE → BRANCH_NAME
Is relation STUDENT normalized? If yes, justify the relation is normalized. If no, state reasons and
normalize the same. (Nov 2021)
9. Consider the table User_Personal and answer to queries given below.
UserID U_email Fname Lname City State Zip
MA12 Mani@ymail.com MANISH JAIN BILASPUR CHATISGARH 458991
PO45 Pooja.g@gmail.co POOJA MAGG KACCH GUJRAT 832212
LA33 Lavle98@jj.com LAVLEEN DHALLA RAIPUR CHATISGARH 853578
CH99 Cheki9j@ih.com CHIMAL BEDI TRICHY TAMIL NADU 632011
DA74 Danu58@g.com DANY JAMES TRICHY TAMIL NADU 645018
i. Is this table in First Normal Form – 1NF? Justify and normalize to 1NF if needed.
ii. Is this table in Second Normal Form – 2NF? Justify and normalize to 2NF if needed.
iii. Is User_Personal in Third Normal Form - 3NF? Justify and normalize to 1NF if needed. (Nov
2019)
10. What is normalization? Justify the need for normalization with example. (Nov 2009, May 2011,
Nov 2011, May 2012, Nov 2012, May 2019, Nov 2019)
UNIT 3
PART A
1. List down the various states of a transaction. (May 2011, May 2019)
The states of a transaction are
i. Active
ii. Partially Committed
iii. Failed
iv. Aborted
v. Committed
2. List the ACID properties and its usefulness. (Nov 2006, Nov 2007, Nov 2008, Nov 2009, May
2010, May 2011, May 2012, Nov 2012, May 2013, Nov 2020, May 2021)
A – Atomicity
C – Consistency
I – Isolation
D - Durability
3. What are serializable schedules? (Nov 2021)
Consistency of the database ensured under concurrent execution by making sure that any schedule
that is executed has the same effect as a schedule that could have occurred without any concurrent
execution. That is, the schedule should, in some sense, be equivalent to a serial schedule. Such
schedules are called serializable schedules.
4. Write notes on starvation. (May 2011)
If a transaction never gets a lock that is currently hold by some other transaction then the
transaction is said to be starved or starvation or livelock.
5. What do you mean by concurrency control? (Nov 2009)
The database system must control the interaction among the concurrent transactions to prevent them
from destroying the consistency of the database. This mechanism is called concurrency control.
6. List the commonly used concurrency control techniques. (Nov 2011)
i. Lock based protocol
ii. Timestamp based protocol
iii. Validation based protocol
iv. Multiple granularity
v. Serializability
vi. Deadlock handling
7. What benefit does strict two-phase locking provide? What are the disadvantages of it? (Nov 2020,
May 2021)
Benefits
Ensures conflict serializability
Prevents any other transaction from reading the uncommitted data
Recovery is very easy.
Disadvantages
Does not ensure freedom from deadlock
Cascading rollback may occur.
8. Define deadlock. (May 2008)
Deadlock is a situation, in which two or more transactions are in a simultaneous wait state, each of
them waiting for one of the others to release a lock before it can proceed.
9. Name the four conditions for deadlock. (Nov 2021)
The four necessary conditions for a deadlock situation are mutual exclusion, no preemption, hold
and wait and circular set.
10. List the SQL statements used for transaction control. (May 2009, Nov 2011)
Commit, Rollback, Savepoint, Set Transaction
PART B
1. What is a transaction? Draw the state diagram corresponding to a transaction and present an outline
of the same. (Nov 2019, Nov 2021, May 2022)
2. Discuss in detail about the ACID properties of a transaction. (Nov 2019, Nov 2021, May 2022)
3. Discuss in detail about the testing of serializability. (May 2019)
4. Discuss elaborately the two phase locking protocol that ensures serializability. (Nov 2019, May
2022)
5. Narrate the actions that are considered for deadlock detection and the recovery from deadlock. (Nov
2019)
6. What are the two approaches of deadlock prevention? Explain in detail with suitable example. (Nov
2020, May 2021)
7. Explain deferred and immediate modification versions of the log based recovery scheme. (May
2019)
8. (i) Outline the isolation levels specified by the SQL standard with an example.
(ii) Outline the SQL statements used for transaction control. (Nov 2021)
9. State and explain the transaction isolation level. (Nov 2020, May 2021)
UNIT 4
PART A
1. List the different levels in RAID technology and specify its feature. (Nov 2010, May 2013)
i. RAID level 0 – Non redundancy block striping
ii. RAID level 1 – Disk mirroring with block striping
iii. RAID level 2 – Memory style error correcting code with bit striping
iv. RAID level 3 – Bit interleaved parity
v. RAID level 4 – Block interleaved parity
vi. RAID level 5 – Block interleaved distributed parity
vii. RAID level 6 – P + Q redundancy scheme
2. What are the advantages of file organization? (Nov 1999, May 2000)
i. The ability to access any location in a storage medium without having to access prior location.
ii. Provide faster access
3. How do you organize the records in files? (Nov 2006, Nov 2009, Nov 2011, May 2014, Nov 2021)
i. Physical database organization
ii. Heap file organization
iii. Sequential file organization
iv. Hashing file organization
v. Clustering file organization
vi. Indexing
- Ordered Indices
Dense Index
Sparse Index
Multilevel Index
- Hash Indices
4. What is ordered index? Give example. (May 2009, Nov 2011)
Files ordered sequentially based on some search key is known as ordered index.
Eg.: Primary Index
5. What are the factors needed to evaluate the technique of ordered indexing and hashing? (Nov 2020,
May 2021)
i. Access types
ii. Access time
iii. Insertion time
iv. Deletion time
v. Space Overhead
6. Differentiate dense index and sparse index. (May 2007, May 2008, May 2009, May 2010, Nov
2010, Nov 2011, May 2019)
Dense index – An index record appears for every search - key value in the file.
Insertion and deletion is very difficult.
Sparse index - An index record appears for only some of the search - key values.
It requires less space and less maintenance overhead for insertion and deletion.
7. List out the mechanisms to avoid collision during hashing. (Nov 2016)
Open addressing – Linear probing
Chaining
Multiple hashing
8. What is Metadata? (Nov 2021)
Metadata is "data that provides information about other data", but not the content of the data, such
as the text of a message or the image itself.
9. What are the steps involved in query processing? (May 2011)
i. Parsing and translation
ii. Optimization
iii. Evaluation
10. Which cost components contribute to query execution? (Nov 2019)
i. Access cost to secondary storage.
ii. Disk storage cost.
iii. Computation cost.
iv. Memory usage cost
v. Communication cost.
PART B
1. What is RAID? List the different levels in RAID technology and explain its features. (Nov 2010,
May 2011, Nov 2011, May 2019, Nov 2019, May 2022)
2. Describe the procedure for index update for single level indices with example. (Nov 2020, May
2021)
3. a) What is an index record? Outline dense index and sparse index with an example.
b) Outline the factors used to evaluate indexing and hashing techniques. (Nov 2021)
4. Describe the structure of B+ tree and give the algorithm for search in the B+ tree with example.
(May 2003, Nov 2003, Nov 2006, Nov 2007, May 2008, Nov 2010, May 2011, May 2019)
5. Construct a B+ tree for the following set of key values (2, 3, 5, 7, 11, 17, 19, 23, 29, 31). Assume
that the tree is initially empty and values are added in ascending order. Construct B+ tree for the
cases where the number of pointers that will fit in one node is as follows:
i. Four
ii. Six
iii. Eight (Nov 2020, May 2021)
6. Explain about static and dynamic hashing with example. (May 2002, May 2003, Nov 2006, May
2007, May 2008, Nov 2008, May 2009, Nov 2009, Nov 2010, Nov 2011, Nov 2020, May 2021)
7. What is query processing? Outline the steps involved in processing a query with a diagram. (May
2002, May 2003, Nov 2004, May 2007, Nov 2007, May 2008, Nov 2008, Nov 2011, Nov 2019,
Nov 2021)
8. With simple algorithms, explain the computing of Nested-loop join and Block nested-loop join.
(Nov 2019)
UNIT 5
PART A
1. Define a distributed database management system. (May 2018)
A distributed database system consists of loosely coupled sites (computer) that share no physical
components and each site is associated a database system.
2. Specify the types of fragmentation in distributed databases. (May 2022)
i. Horizontal Fragmentation
ii. Vertical Fragmentation
3. Outline the motivation of Replication in a distributed database environment. (Nov 2021)
The system maintains several identical replicas (copies) of the relation, and stores each replica at a
different site. The alternative to replication is to store only one copy of relation r.
4. State the storage device hierarchy. (May 2011, Nov 2020, May 2021)
i. Magnetic tapes
ii. Optical disk
iii. Magnetic disk
iv. Flash memory
v. Main memory
vi. Cache memory
5. Mention two features of multimedia databases. (May 2019)
i) The multimedia database systems are to be used when it is required to administrate huge
amounts of multimedia data objects of different types of media (optical storage, video, tapes,
audio records, etc.) so that they can be used (that is, efficiently accessed and searched) for as
many applications as needed.
ii) The objects of Multimedia Data are: text, images, graphics, sound recordings, video recordings,
signals, etc. that are digitalized and stored.
6. Compare sequential access devices versus random access devices with an example. (May 2019)
Sequential access devices Random access devices
Must be accessed from the beginning. It is possible to read data from any location.
Eg:-Tape storage Eg:-Disk storage
Data is faster Access to data is much slower
Cheaper than disk Expensive when compared with disk
7. List information types of documents necessary for relevance ranking of documents in IR. (Nov
2019)
Unstructured data, images, audio recordings, video – strips, maps.
8. What one could understand from allocation schema? (Nov 2019)
An allocation schema describes the allocation of fragments to sites of the DDBS, hence, it is a
mapping that specifies for each fragment the sites at which it is stored. If a fragment is stored at
more than one site, it is said to be replicated.
9. What are Ontologies? (Nov 2021)
Ontologies are hierarchical structures that reflect relationships between concepts.
The most common relationship is the is-a relationship; for example, a leopard is-a mammal, and a
mammal is-a animal.
Ontologies have been defined for specific areas to deal with terminology relevant to those areas.
For example, ontologies have been created to standardize terms used in businesses; this is an
important step in building a standard infrastructure for handling order processing and other inter-
organization flow of data.
It is also possible to build ontologies that link multiple languages. For example, WordNets have
been built for different languages, and common concepts between languages can be linked to each
other. Such a system can be used for translation of text. In the context of information retrieval, a
multilingual ontology can be used to implement a concept-based search across documents in
multiple languages.
10. What is the difference between a false positive and false drop? (Nov 2020, May 2021)
Each keyword may be contained in a large number of documents; hence, a compact representation
is critical to keep space usage of the index low. Thus, the sets of documents for a keyword are
maintained in a compressed form. So that storage space is saved, the index is sometimes stored such
that the retrieval is approximate; a few relevant documents may not be retrieved (called a false
drop or false negative), or a few irrelevant documents may be retrieved (called a false positive).
False drop or false negative
i. False negatives may occur when documents are ranked, as a result of relevant documents
receiving a low ranking.
ii. False negative depends on how many documents are examined.
iii. Measure the recall as a function of the number of documents fetched.
False positive
i. False positives may occur because irrelevant documents get higher rankings than relevant
documents.
ii. This too depends on how many documents are examined.
iii. One option is to measure precision as a function of number of documents fetched.
PART B
1. Explain the architecture of distributed databases. (May 2016, May 2017, May 2022)
2. a) Outline the two basic types of fragmentation and replication in a distributed database
environment with an example.
b) Compare the features of Object based and Object-relational databases. (Nov 2021)
3. State and explain the persistent programming languages. (Nov 2020, May 2021)
4. Present an outline of Document Type Declaration, XML schema, path expressions and XQuery
language. (Nov 2021, May 2022)
5. Explain in detail about the deductive DB and spatial DB. (May 2019)
6. a) Illustrate the usage of OQL, the DMG’s query language.
b) Brief on the methods to store XML documents. (Nov 2019)
7. Explain in detail about the deductive DB and spatial DB. (May 2019)
8. How effectiveness of retrieval is measured? Discuss. (Nov 2019)
9. Give the DTD or XML Schema for an XML representation of the following nested-relational
schema:
Emp = (ename, ChildrenSet setof(Children), SkillsSet setof(Skills))
Children = (name, Birthday)
Birthday = (day, month, year)
Skills = (type, ExamsSet setof(Exams))
Exams = (year, city) (Nov 2016)
10. Suppose that you have been hired as a consultant to choose a database system for your client’s
application. For each of the following applications, state what type of database system (relational,
persistent programming language–based OODB, object relational; do not specify a commercial
product) you would recommend. Justify your recommendation.
a. A computer-aided design system for a manufacturer of airplanes.
b. A system to track contributions made to candidates for public office.
c. An information system to support the making of movies. (Nov 2016)
11. A car-rental company maintains a vehicle database for all vehicles in its current fleet. For all
vehicles, it includes the vehicle identification number, license number, manufacturer, model, date of
purchase, and color. Special data are included for certain types of vehicles:
Trucks: cargo capacity
Sports cars: horsepower, renter age requirement
Vans: number of passengers
Off-road vehicles: ground clearance, drivetrain (four- or two-wheel drive)
Construct an object-oriented database schema definition for this database. Use inheritance where
appropriate. (Nov 2015)
SOFTWARE ENGINEERING
PART-A
&
PART-B
UNIT – 1
PART–A
1. Write down the generic process framework that is applicable to any software project/relationship
between work product, task, activity and system(NOV/DEC-10,NOV/DEC2016,NOV/DEC2017)
Common process framework
- Process framework activities
- Umbrella activities
- Framework activities
- Task sets
4. For the scenario described below, which life cycle model would you choose? Give the reason why you
would choose this model. (NOV/DEC-11,)
You are interacting with the MIS department of a very large oil company with multiple
departments. They have a complex regency system.
Migrating the data from this legacy system is not an easy task and would take a considerable
time. The oil company is very particular about processes, acceptance criteria and legal contracts.
Spiral model Proactive problem prevention. Each iteration has a risk analysis, sector that
evaluates. Alternatives for proactive problem avoidance.
5. Give two reasons why system engineers must understand the environment of a system? APR/MAY- 12
1. The reason for the existence of a system is to make some changes it environment.
7. What is the advantage of adhering to life cycle models for software? NOV/DEC-12
It helps to produce good quality software products without time and cost over runs. It encourages the
development of software in a systematic & disciplined.
o Software is easier to change than hardware. The cost of change is much higher for hardware than for
software.
o Software products evolve through multiple releases by adding new features and re-writing existing
logic to support the new features. Hardware products consist of physical components that cannot be
“refactored” after manufacturing, and cannot add new capabilities that require hardware changes.
o Specialized hardware components can have much longer lead times for acquisition than is true for
software.
o Hardware design is driven by architectural decisions. More of the architectural work must be done up
front compared to software products.
o The cost of development for software products is relatively flat overtime. However, the cost of
hardware development rises rapidly towards the end of the development cycle.
o Testing software commonly requires developing thousands of test cases. Hardware testing involves far
fewer tests.
o Hardware must be designed and tested to work over arrange of time and environmental conditions,
which is not the case for software.
PART–B
1. Explain the following: (i) Waterfall model (ii)Spiral model (iii) RAD model(iv)Prototyping model.
NOV/DEC-12,
2. Discuss in detail the project structure and programming team structure of a software organization.
NOV/DEC-10.
4. What is the difference between information engineering & product engineering? Also explain the product
engineering hierarchy in detail. MAY/JUN-13
5. Write note on business process engineering and product engineering? MAY/JUN-13 , APRIL/MAY-15
6. Explain in detail about spiral model with a neat sketch and describe why this model comes under both
evolutionary and RAD models. APRIL/MAY-15, NOV/DEC 2017.
7. Which process model is best suited for risk management? Discuss in detail with an example. Give its
advantages and disadvantages? NOV/DEC 2016,APRIL/MAY 2018
UNIT – 2
PART–A
5. Draw the DFD for the following (i) External entity (ii) Data items NOV/DEC-11
External entity
Data items
7. Distinguishbetween the term inception, elicitation, & elaboration with reference to requirements?
NOV/DEC-12
Inception–set of questions are asked to establish basic understanding of problem.
Elicitation-collaborative requirements gathering & quality function deployment
Elaboration– It focuses on developing are fined Technical model of software function,
features & constraints.
PART –B
1. Discuss any four process models with suitable application. NOV/DEC-10 ,APR/MAY-11, NOV/DEC-
12, MAY/JUN-13
2. Explain the execution of seven distinct functions accomplished in requirement engineering process /
Explain briefly the requirement engineering process with neat sketch and describe each process with an
example. APRIL/MAY-15 NOV/DEC-15, NOV/DEC 2017, APRIL/MAY 2017
3. What is data dictionary? Explain. How to select the appropriate prototyping approach?
APR/MAY-11,APR/MAY-12, NOV/DEC2015
4. How does the analysis modeling help to capture unambiguous & consistent requirements? Discuss
several methods for requirements validation? NOV/DEC-11
5. Explain prototyping in the software process. APRIL/MAY-15MAY/JUNE 2016
6. Explain the functional& behavioral model for software requirements process? NOV/DEC-
12,MAY/JUN 13, NOV/DEC 2013
7. Explain metrics for specifying non-functional requirements? IEEE standard software requirement
document? MAY/JUN- 13
UNIT-III
PART-A
1. What are the primary interaction styles and state their advantages? NOV/DEC-10
1. Direct manipulation - Easiest to grasp with immediate feedback , Difficult to program
2. Menu selection - User effort and errors minimized, large numbers and combinations of choices a
problem
3. Form fill-in - Ease of use, simple data entry, Tedious, takesa lot of screen space
4. Command language - Easy to program and process, Difficult to master for casual users
Natural language–Great for casual users, Tedious for expert users.
PART-B
1. Explain the core activities involved in User Interface designprocess with necessary block diagrams
MAY/JUNE 2016 ,NOV/DEC2015, NOV/DEC 2017.
2. Explain the various modular decomposition and control styles commonly used in any organizational
model. MAY/JUNE 2016.
3. Discuss the process of translating the analysis model in to a software design, List the golden rules of user
interface design NOV/DEC2015.
4. Explain the basic concepts of software design APR/MAY-11 ,NOV/DEC 2017.
5. Explain clearly the concept of coupling & cohesion? For each type of coupling give an example of two
components coupled in that way? APRIL/MAY 2015, APRIL/MAY 2017, APRIL/MAY 2018
6. Write short notes on Architectural & component design. MAY/JUN-15,NOV/DEC2015.
7. Bring out the necessity of Real-time system design process with appropriate example? APR/MAY-12,
MAY/JUNE-13, APRIL/MAY-15
UNIT-IV
PART-A
1. What are the characteristics of good tester? NOV/DEC-10,MAY/JUN-13
All tests should be traceable to customer requirements. Tests should be planned long before testing begins.
4. What is integration testing? and What are the approaches of integration testing? APR/MAY-11
In this testing the individual software modules are combined and tested as a group. It occurs after unit
testing & before system testing.
1. The non-incremental testing.
2. Incremental testing.
PART-B
1. What is black box & white-box testing? Explain how basis path testing helps to derive test cases to test
every statement of a program. NOV/DEC-12, APRIL/MAY 2015, NOV/DEC 2017, APRIL/MAY
2017
2. Define: Regression testing. Distinguish: top-down and bottom-up integration. How is testing different
from debugging? Justify NOV/DEC-10, APRIL/MAY 2018
3. Write a note on equivalence partitioning & boundary value analysis of black box testing APR/MAY-
16 , NOV/DEC-15
4. What is unit testing? Why is it important? Explain the unit test consideration and test procedure.
APR/MAY- 11,MAY/JUN-13 NOV/DEC2015
5. Explain Integration & debugging activities? MAY/JUN-15
7. Write elaborately on unit testing and regression testing. How do you develop test suites. APRIL/MAY-
15, APRIL/MAY 2018
UNIT-V
PART-A
3. List any five CASE tools classified by function in the taxonomy of CASEtools NOV/DEC-11
1. Project Planning Tools
2. Metrics & Management Tools.
3. Prototyping Tools
4. Re- Engineering Tools
5. Documentation Tools.
7. Differentiate between size oriented and function oriented metrics? MAY/JUN-13 MAY/JUNE
2016,NOV/DEC 2015
Size oriented metrics – it considers the size of the software that has been produced. The software
organization maintains simple records intabular form. Table entries are LOC, effort, defects, and project
name. Function oriented metrics – it measures the functionality delivered bysoftware. Function point
based on software information domain and complexity.
8. Define measure.(APRIL/MAY-2008)
Measure is defined as a quantitative indication of the extent, amount, dimension, or size of
some attribute of a product or process.
UNIT I
PART A
Data communication is defined as the exchange of data between two devices via some
form of transmission medium in whatever form that is agreed upon by the parties
creating and using the data.
2. What are the three criteria necessary for an effective and efficient network?
The three criteria necessary for the effective and efficient networks are
a. Performance
b. Reliability
c. Security
3. What are the fundamental characteristics that determine the effectiveness of the data
communication system?
a. Delivery
b. Accuracy
c. Timeliness
d. Jitter
a. Security
b. Encapsulation
c. Distributed databases
f. Collaborative processing
6. For an ‘n’ device in a network, what is the number of cable links required for a mesh
and ring topology?
The link required for the number of cables for a mesh and ring topologies are Mesh
topology: n (n-1)/2 (Duplex), n (n-1) (Simplex)
Ring Topology: n
7. What are the five important component of the data communication? (or) Name the
various components of data communication system. The five important components of
the data communication are
a. Message
b. Sender
c. Receiver
d. Transmission Medium
e. Protocol
a. Ring
b. Star
c. Mesh
d. Bus
b. Propagation Speed
c. Propagation Time
d. Wavelength
PARTB
1. Explain in detail, the OSI-ISO reference model of a computer with neat diagram. (16)
2. Explain the TCP/IP reference model with neat sketch. (16) (M-13)
3. Explain the different types of switching networks and list out its advantages and
disadvantages. (16)
4. Explain the four basic network topologies and explain with its relevant features. (16)
(N-10)
5. Distinguish between point-to-point links and multi-point links with relevant diagram.
(16)
ii) Compare the performance of TCP/IP (Internet model) with ISO/OSI reference
model.
(8) (M-11)(M-15)
ii) How is cable TV used for data transfer? Explain in detail. (8)
UNIT II
PART A
1. Define – Link
Link is a physical medium that transfers data from one device to another
2. List the types of Link. (N/D – 10 R08)(or) What are the two types of line
configuration?
a. Point to Point
Flow Control refers to a set of procedures which is used to restrict the flow of data that
the sender can send before waiting for acknowledgment.
Error control in the data link layer refers primarily to methods of error detection and
retransmission and is based on automatic repeat request, which is the retransmission of
data.
5. What are headers and trailers and how do they get removed?
Each layer in sending machine adds its own information to the message it receives from
the layer just above it and passes the whole packages to the layer just below it. This
information is added in the form of headers or trailers. Headers are added to the
message at the layers 6, 5, 4, 3, 2. Trailers are added in the layer 2. At the receiving
machine, the headers or trailers attached to the data unit corresponding to the sending
layers are removed and appropriate actions are taken at the receiving layers.
6. The transport layer creates a communication between the source and destination.
What are the three events involved in the connection?
The three events involved in connection between the source and destination are
a. Connection Establishment
b. Data Transfer
c. Connection Release
7. What are the modes for propagating light along optical channels?
There are two modes for propagating light along optical channels, multimode and single
mode.
Multimode: Multiple beams from a light source move through the core in different
paths. Single mode: Fiber with extremely small diameter that limits beams to a few
angles, resulting in an almost horizontal beam.
b. Representation of bits
c. Data rate
d. Synchronization of bits
e. Line configuration
f. Physical topology
g. Transmission mode
The role of Digital Subscriber Line (DSL) modem, is to provide high speed access to the
Internet over the existing local loops. DSL technology is a set of technologies, each
differing in the first letter (ADSL,VDSL, HDSL, and SDSL).
PART B
2. List out the types of Ethernet. Explain in detail standard Ethernet and fast Ethernet
in detail. (16)
(N-12)(N-11)
3. Explain the flow and error control mechanisms in data link control. (16) (N-11)
4. i) Explain the stop and wait protocol with a neat diagram. (8) (M-13)
5. i) Compare the dore rakes of standard Ethernet, fast Ethernet, Gigabit Ethernet and
Ten-Gigabit Ethernet. (6) (M-13)
(M-13)
7. Explain the architecture of a frame relay network with a neat sketch.(16) (M-13)
PART A
a. Framing
b. Physical Addressing
c. Flow Control
d. Error Control
e. Access Control
Error correction is the mechanism used to correct the error and it can be handled in
two ways
a. When an error is discovered, the receiver can have the sender to retransmit the entire
data unit.
b. A receiver can use an error correcting code, which automatically corrects certain
error.
Flow Control refers to a set of procedures which is used to restrict the flow of data that
the sender can send before waiting for acknowledgment.
Error control in the data link layer refers primarily to methods of error detection and
retransmission and is based on automatic repeat request, which is the retransmission of
data.
5. What is a buffer?
Buffer is a device which has a block of memory, reserved for storing incoming data until
they are processed.
The function of stop and wait protocol is to transmit frame and wait for the
acknowledgement before sending the next frame.
In selective reject ARQ only specific damaged or lost frame is transmitted. If a frame is
corrupted in transit, a NAK (Negative Acknowledgement) is returned and the frame is
resent out of sequence.
Error Control in the data link layer is based on the Automatic Repeat Request, which
means retransmission of data in three cases.
a. Damaged Frame
b. Lost Frame
c. Lost Acknowledgement
The function of go-back-N ARQ is to control the error in the continuous transmission.
PART B
3. Explain in detail the IPV6 addressing schemes, notation, representation and address
4. Explain in detail the ICMP message format and error reporting in detail. (16) (M-13)
5. Define bridge. Explain the features and types of bridges. (16) (N-11)
6. Draw the IPV4 header format and explain the various components and its role in that
format. (16)
(M-12)
7. Explain in detail any one routing algorithm. (8) (M-14)
UNIT IV
PART A
Network Support Layers: The network support layers are Physical, Data Link and
Network Layers.These layers deal with the electrical specifications, physical connection,
transport timing and reliability.
User Support Layers: The user support layers are Session, Presentation and
Application Layers. These allow interoperability among the unrelated software systems.
2. State the goals of Network layer (Or) What are the responsibilities of the network lay
(N/D – 10 R08 MCA)
The Network Layer is responsible for the source to destination delivery of packet across
multiple network links. The specific responsibilities of network layer includes
a. Logical Addressing
b. Routing
ICMP is a mechanism used by host and gateways to send query and error messages to
the source of the datagram.
14.23.120.8
14.23.120.8 – Class A
A virtual circuit is defined as a circuit that is made between the sender and the receiver
after handshaking. All the packets of the sender and the receiver pair travel in the same
path and it is dedicated for the entire session.
7. What is datagram approach?
In datagram approach, each packet is treated independently from all others. Even when
a packet represents part of a multipacket transmission, the network treats it as if it
exists alone. The individual packets travel different path. Packets in this technology are
referred as datagram.
9. What is a router? (Or) What is the function or role of a router? (M/J – 12 R08)
A router is a three layer device that routes packets based on their logical addresses i.e.
host to host addressing. A router normally connects LANs and WANs in the internet
and has a routing table that is used for making decisions about the route.
c. router that connects to the internet uses one private address and one global address.
IPV6 is preferred than IPV4 due to some deficiencies in IPV4 which becomes unsuitable
for fast growing internet
PART B
1. Explain the segment formats for TCP and UDP. (16) (N-12)
2. How is connection established and released in TCP? Explain with neat sketch. (8)
(M-13) (M-12)
3. Explain the congestion control mechanism and transmission control protocol with
neat sketches. (16)
(N-11) (N-12) (M-12)
4. Explain in detail, the TCP congestion avoidance algorithm. (8) (N-11) (N-11)
6. Explain the leaky bucket and token bucket algorithm with flow charts. (8) (N-11)
UNIT V
PART A
1. What is the purpose of Domain Name System? (Or)State the role of DNS. (M/J – 12
R08)
Domain Name System maps a name to an address (IP address) and conversely an
address to name.
Cryptanalysis refers to the science and art of breaking ciphers to gain as much
information as possible about the original messages.
Cryptography refers to the science and art of transforming messages to make them
secure and immune to attack.
Pretty Good Privacy (PGP) protocol provides security at the application layer. PGP is
designed to create authenticated and confidential e-mails.
Hyper Text Transfer Protocol (HTTP) is a protocol which is used to access data on the
World Wide Web (WWW). It functions as a combination of File transfer protocol (FTP)
and Simple mail transfer protocol (SMTP).
8. What are the functionalities of TELNET? (N/D – 11 MCA) (Or)Name the function of
TELNET.
(N/D – 10 MCA)
POP3 or IMAP4 is a client-server protocol. POP3 or IMAP4 for E-mail is needed by the
client to pull messages i.e. retrieve messages from the server. The direction of the bulk
data is from the server to the client. The POP3 or IMAP4 are message access agent
protocols.
PART B
2. What is the role of the local name server and the authoritative name server in DNS?
What is the
3. Explain the SMTP. List out its uses, state strengths and weakness. (8)
(N-10) (N-11)
4. Explain in detail, the HTTP and FTP with neat sketches. (16)
7. Draw the architecture of WWW and explain in detail the various blocks. (16)
OCE552- GEOGRAPHIC INFORMATION SYSTEM
V SEM CSE
QUESTION BANK
UNIT I
PART A
1.What is Nominal?
Nominalitems may have numbers assigned to them. This may appearordinalbutisnot—
theseareusedtosimplifycaptureandreferencing.
3.What is Quantitativedata?
Quantitative dataisanumericalmeasurementexpressednotbymeansofanatural language description, but
rather in terms of numbers. However, not allnumbers are continuous and measurable. For example, the
social security numberis a number, but not something that one can add or subtract. Quantitative
dataalwaysareassociated with a scalemeasure.
4.What is Ordinal?
Items on an ordinal scale are set into some kind of order by their
positiononthescale.Thismayindicatesuchastemporalposition, superiority,etc.The order of items is often
defined by assigning numbers to them to showtheir relative position. Letters or other sequential
symbols may also beusedas appropriate.
5. What is Digitizer?
A device connected to a computer, consisting of a tablet and a handheld puck,that converts positions on
the tablet surface as they are traced by an operator to digitalx,ycoordinates,yieldingvector
dataconsistingof points,lines,and polygons
6. Define Vehiclenavigationsystems?
Vehicle navigation systems are used for guiding vehicles to their destination. Thesesystems usually use
GPS or inertial navigation systems or a combination of both forpositioning the vehicle.
PARTB
1. Describe in detail the various components of GIS
2. Discuss the elements of GIS
3. Explain the various levels of mesurement in GIS
4. Illustrate with an Example spatial and attribute Data type
5. Describe the various applications of GIS
6. Describe the various types of map projection.
7. Discuss about the geographic Coordinate systems
UNIT II
PART A
1.Define Spatial Data Model?
Spatial data is any type of data that directly or indirectly references a specific geographical area or
location. Sometimes called geospatial data or geographic information, spatial data can also numerically
represent a physical object in a geographic coordinate system.
5.Define Entity?
Entity is any fact that can be localized spatially. (b) Attributes or characteristics attached to the entities.
Each attribute has a limited domain of possible values, i.e. the quality of a road can be bad, average,
good, very good. (c) Relations or mechanisms that allow to relate entity
10.WhatisDigitalRasterGraphics?
Digital raster graphic (DRG) is a digital image resulting from scanning a paper USGS topographic map
for use on a computer.
PART B
1 1. i)Explain theobject oriented data model(7)
ii)Explainhow the softwaredevelopers organize classes.(6)
2 .i)Examinehowtherasterdataaredivided.(7)
ii)Illustratewithanexampletheelementsoftheraster Data model.(6)
3.Summarizethe variousdigital elevationmodels(13)
4.Summarize rasterdatacompression.(13)
5.Explainhowthespatialentitiesareusedtocreateadata
model.(13)
6.Comparethe advantages anddisadvantages of the rasterdata
Modelversusthevectordatamodel.(13)
7.Demonstrate the GRID model of GIS with necessarydiagram.(13)
UNIT III
PART A
1. Define scanning?
Scanning coverts paper maps into digital format by capturing features as individual
cells, or pixels, producing an automated image.
3.Summarize the few possible encoding methods for different data sources.
Encoding is the process of using various patterns of voltage or current levels to represent 1s and
0sof the digital signals on the transmission link. The common types of line encoding are Uni
polar, Polar, Bipolar, and Manchester.
PART B
1. Describe how data are collected using satellitenavigation systemor GPS.
2. Demonstrate the File Formats of Vector Spatialdata
3. Develop Vectorization of Scanned Images
4. Givethestandards offorspatial datawithexample
5. Illustrate with example the three different types ofscanner.
6. Describe the scale of measurement with respect tospatialdata
7. Describe how data are collected using satellitenavigation systemor GPS
UNIT IV
PART A
1. Listthetoolsforvectordataanalysis.
Tools are available in a GIS package for manipulating and managing maps in a database. These tools
include Dissolve, Clip, Append, Select, Eliminate, Update, Erase, and Split.
4. Discussthefourbasicrulesfollowedinoverlay.
Describe the three variations in buffering Buffers in vector GIS are generated around points, lines,
and polygons. A 'point buffer' is a zone that encompasses the area around a point. A 'line buffer' is a
zone that encompasses a line and its contours.
5. ComposeSpatialAutocorrelation.
Spatial autocorrelation measures how close objects are in comparison with other close objects
6. DemonstrateRipley’s K-function.
Ripley's K,t function is a tool for analyzing completely mapped spatial point process data (see Point
processes, spatial), i.e. data on the locations
7. DiscusstheApplicationsofPatternAnalysis
A very basic form of point pattern analysis involves summary statistics such as the mean center
standard distance and standard deviational ellipse.
8. Explaintheupdateanderaseinfeaturemanipulation.
Update uses a “cut and paste” operation to replace the input layer with the update layer and its
features. Erase removes from the inputlayer .
9. Defineinlay ?
An inlay may be defined as a restoration which has been constructed out of mouth from gold, porcelain, or
othermaterial .
PART B
1.Brieflydescribethefollowing
i) Buffering.(7)
ii) Vectoroverlay(6)
2. i)Explaintheerrorpropagationinoverlay(7)
ii)ExplaintheapplicationofOverlay(6)
3Illustratewithanexamplethefollowing
(i) Distance measurement(7)
ii)patternanalysis.(6)
4.Give in detail about an application that uses basic tools ofvector data analysis including
Buffer, Overlay, andSelect.(13)
5.DescribeindetailMoran’sIforMeasuringSpatial
Autocorrelation(13)
6.i) Discuss the G-Statistic for Measuring the High/LowClustering.(7)
ii)Expressthe featuremanipulation.(6)
7.DeveloptheAllocationandLocation–Allocationin
Networkanalysis(13)
UNIT V
PART A
11. TabulatethethreecategoriesofGIS applications.
GIS-based mapping - Maps define 'The Power of Where' Benefits of GIS in Urban Planning.Geographic
Information Systems for Transportation (GIS-T) .GIS in Disaster Management GIS in Agriculture
Integrate Sustainability GIS and Natural Resource Management
22. DescribethebusinessapplicationofGIS.
Geographic Information Systems are powerful decision-making tools for any business or industry since
it allows the analyzation of environmental, demographic, and topographic data. Data intelligence
compiled from GIS applications help companies and various industries, and consumers, make informed
decisions.
33. AssessLocation-BasedServices.
Location Based Services is a growing technology field that focuses on providing GIS and spatial
information via mobile and field units. Global Positioning System (GPS) is a technology that uses the
locations satellites to determine locations on earth
55.PointoutHowdidwenavigatebeforeusingGPS.
Radar navigation involves transmitting an electromagnetic signal at a target and using the reflected
echo to calculate distance
7. Define Navstar?
Navstar is a network of U.S. satellites that provide global positioning system (GPS) services. They are
used for navigation by both the military and civilians. These 24 main GPS satellites orbit Earth every 12
hours, sending a synchronized signal from each individual satellite
1.Briefly
1. 1 describe the business application of GIS(13)
2.Describe
2. 2 the following
i)Simple route(7)
ii)Combined
3. 3 route(6)
3. i)Describe about the marketing application(7)
4. 4
ii)Discuss the four trends in marketing(6)
4. i)Illustrate how GIS type functionality is useful in navigation(7)
5. 5
ii)Demonstrate an example of GIS.(6)
6.
5.Analyze in detail about natural resource management.(13)
6 6. Resource management(13)
7 7
7. Describe in detail about Dispatching.(13)
7.
JAYARAJ ANNAPACKIAM CSI COLLEGE OF
ENGINEERING
PARTA
1. What is Object-Oriented Analysis and Design? APRIL/MAY 2011,
APRIL/MAY 2017, NOV/DEC 2014, APRIL/MAY-2015
During object-oriented analysis there is an emphasis on finding and describing
the objects or concepts in the problem domain. For example, in the case of the
flight information system, some of the concepts include Plane, Flight, and Pilot.
During object-oriented design (or simply, object design) there is an emphasis on
defining software objects and how they collaborate to fulfill the requirements.
The combination of these two concepts shortly known as object oriented analysis
and design.
2. Define Design Class Diagrams
A static view of the class definitions is usefully shown with a design class
diagram. This illustrates the attributes and methods of the classes.
3. What is the UML? MAY/JUNE 2012, NOV/DEC 2014
The Unified Modeling Language is a visual language for specifying,
constructing and documenting the artifacts of systems.
4. What are the three ways and perspectives to Apply UML?
APRIL/MAY-2017, NOV/DEC 2012
Ways - UML as sketch, UML as blueprint, UML as programming language
Perspectives-Conceptual perspective, Specification (software) perspective,
Implementation(Software) perspective.
5. What is Inception? APRIL/MAY-2011
Inception is the initial short step to establish a common vision and basic scope for
theProject. It will include analysis of perhaps 10% of the use cases, analysis of the
critical non- Functional requirement, creation of a business case, and preparation
of the development Environment so that programming can start in the elaboration
phase. Inception in one Sentence: Envision the product scope, vision, and
business case.
6. What are Actors? APRIL/MAY 2022
An actor is something with behavior, such as a person (identified by role),
computer system, or Organization; for example, a cashier.
7. Define Use case. APRIL/MAY-2015
A use case is a collection of related success and failure scenarios that describe
an actor using a system to support a goal. Use cases are text documents, not
diagrams, and use-case modeling is primarily an act of writing text, not drawing
diagrams.
8. What is the use of component diagram? MAY/JUNE 2012,
APRIL/MAY 2015, NOV/DEC 2012
a. A component is a code module. Component diagrams are physical
analogs of class diagram.
b. Deployment diagrams show the physical configurations of software
and hardware.
9. What is the different between coupling and cohesion? NOV/DEC 2015,
APRIL/MAY 2015
Coupling:
Coupling is a measure of how strongly one element is connected to other elements
Cohesion:
Cohesion informally measure how functionally related the operations of a
software element are, and also measures how much work a software elements
doing promotion of reusability.
10. Distinguish between method and message in object. NOV/DEC 2015
Method Message
i.Methods are similar to functions, procedures or subroutines in more traditional
programming languages. Messages essentially are non-specific function calls.
ii.Method is the implementation. Message is the instruction.
iii.In an object oriented system, a method is invoked by sending an object a
message. An object understands a message when it can match the message to a
method that has the same name as the message.
PART- B
7. What are the key ideas and best practices that will manifest in
elaboration?
Do short time boxed risk-driven iterations
Start programming early
Adaptively design, implement, and test the core and risky parts of the
architecture
Test early, often, realistically
Adapt based on feedback from tests, users, developers
8. Define Association. Nov/Dec 2015
An association is a relationship between classes (more precisely, instances
of those classes) that indicates some meaningful and interesting
connection.
9. What is a Domain Model? Apr/May 2015
A domain model is a visual representation of conceptual classes or real-
situation objects in a domain. The term "Domain Model" means a
representation of real-situation conceptual classes, not of software objects.
The term does not mean a set of diagrams describing software classes, the
domain layer of a software architecture, or software objects with
responsibilities.
10. What is composition? Nov/Dec 2015, Nov/Dec 2014, APRIL/MAY-2022
Composition, also known as composite aggregation, is a strong kind of whole-
part aggregation and is useful to show in some models. A composition
relationship implies that 1) an instance of the part (such as a Square) belongs
to only one composite instance (such as one Board) at a time, 2) the part must
always belong to a composite (no free-floating Fingers), and 3) the composite
is responsible for the creation and deletion of its parts either by itself
creating/deleting the parts, or by collaborating with other objects.
Part B
1. Describe the domain model refinement with suitable example? Apr/May
2015.
2. What is the relationship between sequence diagram and use cases? Take an
example to show the relationship, highlighting the advantages. Nov/Dec
2014, APRIL/MAY-2022
3. Describe the strategies used to identify the conceptual and describe the
steps to create a domain model used for representing the conceptual classes
Nov/Dec 2014
4. With a suitable example showing the various relationships used in Use
Case and also give a short note on each relationship.
5. Explain logical architecture and UML package diagram in detail
6. Explain about interaction diagram notation in detail.
7. 7). Write about elaboration and discuss the difference between elaboration
and inception with suitable diagram. Nov/Dec 2015
UNIT III
DYNAMIC AND IMPLEMENTATION UML DIAGRAMS
PART-A
1. What is the use of system sequence diagram? Mention its use. [April/May
2011, Nov/Dec 2011, May/June 2012, May/June 2014, Nov/Dec 2014,
Nov/Dec 2015]It is a fast and easily created artifact that illustrates the input and
output events related to the systems under discussion. System sequence diagram
is a picture that shows, for one particular scenario of a use case, the events that
external actors generate their order, and inter-system events.
2. Define package and draw the UML notation for package. [May/June
2012, May/June 2016]
Package is a namespace used to group together elements that are semantically
related and might change together. It is a general purpose mechanism to
organize elements into groups to provide better structure for system model.
UNIT-IV
DESIGN PATTERNS
PART-A
1. Define patterns. Nov/Dec 2014,April/May 2015, APRIL/MAY-2022
A pattern is a named problem/solution pair that can be applied in new
context, with advice on how to apply it in novel situations and discussion of its
trade-offs.
2. How to Apply the GRASP Patterns?
Following sections present the first five GRASP patterns:
. Information Expert
. Creator
. High Cohesion
. Low Coupling
. Controller
3. Define Responsibilities and Methods.
The UML defines a responsibility as "a contract or obligation of a classifier"
[OMG01]. Responsibilities are related to the obligations of an object in terms of
its behavior. Basically, these responsibilities are of the following two types:
- knowing
-doing
Doing responsibilities of an object include:
- doing something itself, such as creating an object or doing a calculation
- initiating action in other objects
-controlling and coordinating activities in other objects
Knowing responsibilities of an object include:
- knowing about private encapsulated data
- knowing about related objects
- knowing about things it can derive or calculate
4. Who is creator?
Solution Assign class B the responsibility to create an instance of class A
if one or more
of the following is true:
. B aggregates an object.
. B contains an object.
. B records instances of objects.
. B closely uses objects.
. B has the initializing data that will be passed to A when it is created (thus B is
an Expert with respect to creating A).
B is a creator of an object.
If more than one option applies, prefer a class B which aggregates or contains
class A.
5. List out some scenarios that illustrate varying degrees of functional
cohesion.
-Very low cohesion
-low cohesion
-High cohesion
-Moderate cohesion
6. Define Modular Design.
Coupling and cohesion are old principles in software design; designing with
objects does not
imply ignoring well-established fundamentals. Another of these. Which is
strongly related to coupling and cohesion? is to promote modular design.
7. What are the advantages of Factory objects?
• Separate the responsibility of complex creation into cohesive helper
objects.
• Hide potentially complex creation logic.
• Allow introduction of performance-enhancing memory management
strategies, such as object caching or recycling.
8. What is meant by Abstract Class Abstract Factory?
A common variation on Abstract Factory is to create an abstract class
factory that is accessed using the Singleton pattern, reads from a system
property to decide which of its subclass factories to create, and then returns the
appropriate subclass instance. This is used, for example,
in the Java libraries with the java.awt.Toolkit class, which is an abstract class
abstract factory for creating families of GUI widgets for different operating
system and GUI subsystems.
9. Define coupling. APRAL/MAY-2011, APRIL/MAY-2022
The degree to which components depend on one another. There are two
types of coupling,
"tight" and "loose". Loose coupling is desirable for good software engineering
but tight coupling may be necessary for maximum performance. Coupling is
increased when the data exchanged between components becomes larger or more
complex.
10. State the use of Design patterns? (Nov/Dec 2013) (Nov/Dec 2014),
(Nov/Dec 2015)
Understandability: Classes are easier to understand in isolation.
Maintainability: Classes aren’t affected by changes in other components.
Reusability: easier to grab hold of classes.
PART B
1. Explain GRASP: Patterns of General Principles in Assigning
Responsibilities. APIRAL/MAY-2011
2. Designing the Use-Case Realizations with GoF Design Patterns.
APRIL/MAY-2011
3. Explain Creator and Information Expert with an Example?
May/June 2013, APRIL/MAY-2022
4. Explain Low Coupling and Controller with an Example? May/June
2013, NOV/DEC 2019, APRIL/MAY-2022
5. a .Differentiate Bridge and Adapter(8) Nov/Dec 2014
6. b. How will you design the behavioral pattern? Nov/Dec 2014, NOV/DEC
2019
7. Outline the GRASP principles with suitable example. NOV/DEC 2019
UNIT V
TESTING
PART-A
1. What is debugging?
Debugging is the process of finding out where something went wrong and
correcting the code to eliminate the error s or bugs that cause unexpected
result.
2. What is Test Cases? Nov/Dec 2019, APRIL/MAY-2022
To test a system, you must construct some test input cases, then describe
how the output will look. A good test case is the one that has high
probability of detecting an as yet discover error.
3. What is Test Plan? Nov/Dec 2019
A test plan is to developed to detect and identify potential problem before
delivering the software to its users.
4. Define Black Box Testing?
The Black Box is used to represent a system whose inside workings are not
available for inspection. The Black Box testing techniques is used for
scenario-based testing.
5. What is White Box Testing?
White Box Testing assumes that the specific logic is important and
must be tested to guarantee the system proper function. The main use of the
white box testing is in error based testing.
6. Describe Path Testing?
One form of White Box Testing , called path testing, make certain that each
path in a object method is executed at least once during testing.
7. Define testing. Nov/Dec 2015
Testing is the process of using suitable test cases to evaluate and ensure the
quality of a product by removing or sorting out the errors and discrepancies.
It is also used to ensure that the product has not regressed.Testing involves
various types and levels based on the type of object/product under test.
8. What are the issues in object oriented testing? Nov/Dec 2018
Specify product requirements long before testing commences Understand the
users of the software, with use cases Develop testing plan that emphasizes
“rapid cycle testing Build robust software that is designed to test itself
Conduct formal technical reviews to assess test strategy and test cases.
9. Explain about object oriented integration testing. Apr/May 2017
Integration testing is the process of testing the classes in combination with
other classes. If everything works as expected then it is termed that the class
has passed the test. In this test methodology, the test cases and classes that
create errors or are faulty can be removed and replaced with correct and
working classes.
10.Why do conventional top down and bottom up integration testing
methods have less meaning in an object oriented context? Nov/Dec 2018
Basic object oriented software does not have a hierarchical control
structure, hence top down approach and bottom up approach of testing is of
less use in testing. Therefore, thread based, use based and cluster based
testing methods are incorporated for performing integration testing.
PART- B
1. Explain the object oriented methodologies? APRIL/MAY-2022
2. Explain software quality assurance? Nov/Dec 2019
3. What are the impacts of object orientation testing?
4. Develop test cases and test plan?
5. Explain the different kind of testing stratergies? Nov/Dec 2019
6. Explain Booch methodology in details.
7. Explain blackbox testing and white boxtesting.
JAYARAJANNAPACKIAMCSICOLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi and Affiliated to Anna University)
MARGOSCHIS NAGAR, NAZARETH – 628 617
UNIT – I
PART – A (2 mark)
FA consists of a finite set of states and a set of transitions from state to state that occur on
input symbols chosen from an alphabet ∑. Finite Automaton is denoted by a 5- tuple(Q,∑,δ,q0,F),
where Q is the finite set of states , ∑ is a finite input alphabet, q0 in Q is the initial state, F is the set of
final states and δ is the transition mapping function Q * Σ to Q. Transition diagram is a directed graph
in which the vertices of the graph correspond to the states of FA. If there is a transition from state q to
state p on input a, then there is an arc labeled ‘ a ‘ from q to p in the transition diagram.
It is other form of if then statement. The contra positive of the statement “if H
then C” is “if not C then not H”.
The components of FA model are Input tape, Read control and finite control.
(a)The input tape is divided into number of cells. Each cell can hold one i/p symbol.
(b)The read head reads one symbol at a time and moves ahead.
( c)Finite control acts like a CPU. Depending on the current state and input symbol read from
the input tape it changes state.
7.Differentiate NFA and DFA
NFA or Non Deterministic Finite Automaton is the one in which there exists many paths for a
specific input from current state to next state. NFA can be used in theory of computation because they
are more flexible and easier to use than DFA. Deterministic Finite Automaton is a FA in which there
is only one path for a specific input from current state to next state. There is a unique transition on
each input symbol.(Write examples with diagrams).
Є-closure(q0 ) denotes a set of all vertices p such that there is a path from q0 to p labeled Є.
Example :
q0 q1
Є-closure(q0)={q0,q1}
• Basis step:
P(1) is true.
• Assume p(k) is true.
• P(K+1) is shown to be true.
UNIT – II
1 .What is a regular expression?
A regular expression is a string that describes the whole set of strings according to
certain syntax rules. These expressions are used by many text editors and utilities to search
bodies of text for certain patterns etc. Definition is: Let Σ be an alphabet. The regular
expression over Σ and the sets they denote are:
i. Φ is a r.e and denotes empty set. ii. Є is a r.e and denotes the set {Є}
iii. For each ‘a’ in Σ , a+ is a r.e and denotes the set {a}.
iv. If ‘r’ and ‘s’ are r.e denoting the languages R and S respectively then (r+s),
(rs) and (r*) are r.e that denote the sets RUS, RS and R* respectively.
2. Differentiate L* and L+
L* denotes Kleene closure and is given by L* =U Li
i=0
example : 0* ={Є ,0,00,000,…………………………………}
Language includes empty words also.
∞
L+ denotes Positive closure and is given by L+= U Li
i=1 example:0+={0,00,000,……………………………………..}
4.Write a r.e to denote a language L which accepts all the strings which begin or end
with either 00 or 11.
There consists of two parts: L1=(00+11) (any no of 0’s and 1’s) =(00+11)(0+1)*
L2=(any no of 0’s and 1’s)(00+11) =(0+1)*(00+11) Hence
R=L1+L2 =[(00+11)(0+1)*] + [(0+1)* (00+11)]
5.Construct a r.e for the language which accepts all strings with atleast two c’s over the
set Σ={c,b}
(b+c)* c (b+c)* c (b+c)*
6.Construct a r.e for the language over the set Σ={a,b} in which total number of a’s are
divisible by 3
( b* a b* a b* a b*)*
UNIT – III
Construction of compilers.
implified the definition of programming languages.
Describes the arithmetic expressions with arbitrary nesting of balanced parenthesis { (, ) }.
Describes block structure in programming languages. Model neural nets.
A context free grammar (CFG) is denoted as G=(V,T,P,S) where V and T are finite set of
variables and terminals respectively. V and T are disjoint. P is a finite set of productions each is of the
form A->α where A is a variable and α is a string of symbols from (V U T)*.
The language generated by G ( L(G) ) is {w | w is in T* and S =>w .That is a G string is in L(G) if:
(1) The string consists solely of terminals.
(2) The string can be derived from S.
P={S->aSb, S->ab}?
S=> aSb=>aaSbb=>…………………………..=>anbn
Thus the language L(G)={anbn | n>=1}.The language has strings with equal number of a’s and b’s.
(a) Let G=(V,T,P,S) be the context free grammar. If A->β is a production of P and
α and γ are any strings in (VUT)* then α A γ => αβγ.G
(b) A tree is a parse \ derivation tree for G if:
(i) Every vertex has a label which is a symbol of VU TU{Є}.
(ii) The label of the root is S.
(iii) If a vertex is interior and has a label A, then A must be in V.
(iv) If n has a label A and vertices n1,n2,….. nk are the sons of the vertex n in order
from leftwith labels X1,X2,………..Xk respectively then A→ X1X2…..Xk must be
in P.
(v) If vertex n has label Є ,then n is a leaf and is the only son of its father.
(c ) A subtree of a derivation tree is a particular vertex of the tree together with all its
descendants ,the edges connecting them and their labels.The label of the root may not be the
start symbol of the grammar.
CFL are closed under union, concatenation and Kleene closure. CFL are closed under
substitution , homomorphism.CFL are not closed under intersection , complementation.
Closure properties of CFL’s are used to prove that certain languages are not context free.
Let L be any CFL. Then there is a constant n, depending only on L, such that if z is in L
and |z| >=n, then z=uvwxy such that :
(i) |vx| >=1
(ii) |vwx| <=n and
(iii) for all i>=0 uviwxiy is in L.
The pumping lemma can be used to prove a variety of languages are not context
free . Some examples are:
L1 ={ aibici | i>=1} is not a CFL.
L2= { aibjcidj | i>=1 and J>=1 } is not a CFL.
Let G=(V,T,P,S) be a CF GThe fanout of G , Φ(G) is largest number of symbols on the RHS
of any rule in R.The height of the parse tree is the length of the longest path from the root to
some leaf.
UNIT – V
A problem whose language is recursive is said to be decidable. Otherwise the problem is said
to be undecidable. Decidable problems have an algorithm that takes as input an instance of the
problem and determines whether the answer to that instance is “yes” or “no”. (eg) of undecidable
problems are (1)Halting problem of the TM.
there is a TM that decides L. (Turing decidable languages). there is a TM that semi-decides L. (Turing acceptable l
TMs TMs
that decide languages are algorithms. that semi-decides languages are not algorithms.
Universal TMs are TMs that can be programmed to solve any problem, that can be solved by
any Turing machine. A specific Universal Turing machine U is: Input to U: The encoding “M “ of a
Tm M and encoding “w” of a string w. Behavior : U halts on input “M” “w” if and only if M halts on
input w.
There are no transitions from any of the halt states of any given TM . Apart from the halt state
, a given TM is total.
Emptiness
Finiteness
Regularity
Context-freedom.
The diagonalization language consists of all strings w such that the TM M whose code is w
doesnot accept when w is given as input.
Unit - I
1. Explain the different forms of proof with examples. (8) NOV/DEC 2012
2. Prove that, if L is accepted by an NFA with ε-transitions, then L is accepted by an NFA without ε-
transitions. (8) NOV/DEC 201 2 , NOV/DEC 2013
3. Prove that if n is a positive integer such that n mod 4 is 2 or 3 then n is not a perfect square. (6)
NOV/DEC 2012
(i) L={ x € {a,b}:|x|a = odd and |x|b = even}. (10) NOV/DEC 2012
(ii) Binary strings such that the third symbol from the right end is 1. (10) M A Y /JUNE 2012
(iii) All strings w over {0,1} such that the number of 1’s in w is 3 mod 4. (8) NOV/DEC 2011
(iv) Set of all strings with three consecutive 0’s.(10) NOV/DEC 2010 EnggTree.com D
7. Construct an NFA accepting binary strings with two consecutive 0’s. (8) M A Y /JUNE 2012
8. Show that a connected graph G with n vertices and n-1 edges (n>2) has at least one leaf.
9. Prove that there exists a DFA for every ε-NFA. (8) A P R/ MAY 2011 Refer Notes
10. Show that the maximum edges in a graph (with no self-loops or parallel edges) is given by (n(n-
1))/2 where ‘n’ is the number of nodes. (8) A P R/ M AY 2 011
UNIT – II
1. Differentiate regular expression and regular language. NOV/DEC 2012 Refer notes
2. Construct NFA for the regular expression a*b*. M A Y /JUNE 2012 Refer notes
5. Is the set of strings over the alphabet {0} of the form 0n where n is not a prime is regular?
Prove or disprove
6. Let L = {w:w ε {0,1}* w does not contain 00 and is not empty}. Construct a regular
expression that generates L.
7. Give the regular expression for set of all strings ending in 00. NOV/DEC 2010
8. State pumping lemma for regular set. NOV/ D EC 201 0, NOV/DEC 2 0 1 3,NOV/DEC 2014
9. Prove that there exists an NFA with ε-transitions that accepts the regular expression
10. Prove any two closure properties of regular languages.(8) NOV/DEC 2012, NOV/DEC 2011,
APRIL/MAY 2010
UNIT – III
1. Consider the following grammar for list structures:
2. Construct the PDA accepting the language
3. Find the PDA equivalent to the given CFG with the following productions (i) SA, ABC, Bba,
Cac (6) NOV/DEC 2012 (ii) SaSb|A, AbSa|S| ε (10) NOV/DEC 2011
4. Is the following grammar is ambiguous? Justify your answer. (i) E E+E |E*E | id (6)
MAY/JUNE 2012 (ii) E E+E|E*E|(E)|a (4) APRIL/MAY 2011
5. Discuss the equivalence between PDA and CFG. (6) M A Y /J U NE 201 2, MAY/JUNE
2013
6. Prove that if ‘w’ is a string of a language then there is a parse tree with yield ‘w’ and also
prove that if Aw then it implies that ‘w’ is a string of the language L defined by a CFG.
(6)APR/MAY 2011
7. Construct a CFG for the set {a ib j c k |i≠j or j≠k} (6) APR/MAY 2011
8. Prove that if there exists a PDA that accepts by final state then there exists an equivalent
PDA that accepts by Null state. (8) APRIL/MAY 2011
9. Is NPDA (Nondeterministic PDA) and DPDA (Deterministic PDA) equivalent? Illustrate
with an example. (8) NOV/DEC 2011
10. What are the different types of language acceptances by a PDA and define them. Is it true that
the language accepted by a PDA by these different types provides different languages? (8)
NOV/DEC 2011
UNIT – IV
1. Convert the following grammar into CNF (i) ScBA, SA, AcB, AAbbS, Baaa (6)
NOV/DEC 2012 (ii) Sa|AAB, Aab|aB| ε, Baba| ε (8) APR/MAY 2011 (iii) SA|CB, AC|D,
B1B|1, C0C|0, D2D|2 (16) APR/MAY 2010 (iv) SaAD AaB|bAB B b D d (6) NOV/DEC
2014
2. Design a Turing machine for the following
(i) Reverses the given string {abb}. (8) NOV/DEC 2012
(ii) L={1 n0 n1 n |n>=1} (10) MAY/JUNE 2012
(iii) L={a nb n c n } (8) APR/MAY 2011
(iv) To perform proper subtraction (8) APR/MAY 2011
(v) To move an input string over the alphabet A ={a} to the right one cell. Assume that
the tape head starts somewhere on a blank cell to the left of the input string. All other
cells are blank, labeled by ^. The machine must move the entire string to the right one
cell, leaving all remaining cells blank. (10) A P R/ M AY 2010
3. State and prove the pumping lemma for CFL. What is its main application? Give two
examples. (10) NOV/DEC 2012, N OV/DEC 201 1, MAY/JUNE 2013
4. Write briefly about the programming techniques for TM. (8) NOV/DEC
2012,MAY/JUNE 2013
5. Find Greibach normal form for the following grammar (ii) SAA | 1, ASS |0 (10)
MAY/JUNE 2012 (iii) Sa|AB, Aa|BC, Bb, Cb (4) APR/MAY 2011 (iv) SAA|0, ASS|1 (8)
NOV/DEC 2010 (v) A1A2A3, A2A3A1|b, A3A1A2|a (10) NOV/DEC 2014 6. Explain
any two higher level techniques for Turing machine construction. (6) MAY/JUNE 2012,
NOV/DEC 2011
6. Discuss the closure properties of CFLS. (6) M A Y /J U NE 2012, N OV/DEC
2011,NOV/DEC 2010, MAY/JUNE 2013
7. Prove that every grammar with ε productions can be converted to an equivalent grammar
without ε productions. (4) A P R/ MAY 201 1, NOV/DEC 2013
8. Explain the different models of Turing machines. (10) NOV/DEC 2011
9. Define Pumping Lemma for Context Free Languages. Show that L={a i b j c k :
i<jBCD/b B->Yc/d C->gA/c D->dB/a y->f M A Y /JUNE 2013
10. Explain turing machine as a computer of integer functions with an example. NOV/DEC
2013 13. Write short notes on the following (i) Two-way infinite tape TM (ii) Multiple
tracks TM
UNIT – V
1. If L1 and L2 are recursive language then L1UL2 is a recursive language.(6)NOV/DEC
2012
2. Prove that the halting problem is undecidable. (10) NOV/DEC 201 2, NOV/DEC 2010
3. State and prove the Post’s correspondence problem. (10) NOV/D EC 2012, NOV/DEC
2010
4. Write a note on NP problems. (6) NOV/DEC 2012
5. Explain undecidability with respect to post correspondence problem. (8) MAY/JUNE
2012
6. Discuss the properties of recursive languages. (8) MAY/JUNE 2012
7. Explain any two undecidable problems with respect to Turing machine. (8) MAY/JUNE
2012
8. Discuss the difference between NP-complete and NP-hard problems. (8) MAY/JUNE
2012, NOV/DEC 2011
9. Prove that the universal language Lu is recursively enumerable but not recursive. Also
prove that Ld is not recursive or recursively enumerable. (16) APR/MAY 2011
10. Prove that PCP problem is undecidable and explain with an example. (16) APR/MAY
2011, NOV/DEC 2013
JAYARAJANNAPACKIAMCSICOLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi and Affiliated to Anna University)
MARGOSCHIS NAGAR, NAZARETH – 628 617
UNIT -I
PART-A
1) What are the four basic types of agent program in any intelligent system? Explain how did
you convert them into learning agents?. (16)
2) Explain the following uninformed search strategies with examples.
(a) Breadth First Search. (4)
(b) Uniform Cost Search (4)
(c) Depth First Search (4)
(d) Depth Limited Search (4)
3) What is PEAS? Explain different agent types with their PEAS descriptions. (16)
4) Explain in detail the properties of Task Environments. (16)
5) Define a problem and its components. Explain how a problem solving agent works? (16)
6) Explain real-world problems with examples. (16)
7) Explain in detail with examples
(i) Iterative deepening search (8)
(ii) Bidirectional search (8)
UNIT -II
PART A
1. How will you measure the problem-solving performance? May 10
Problem solving performance is measured with 4 factors. 1) Completeness - Does
the algorithm (solving procedure) surely finds solution if really the solution exists.
2) Optimality – If multiple solutions exits then do the algorithm returns optimal
amongst them. 3) Time requirement. 4) Space requirement.
UNIT –III
PART -A
1.What are the limitations in using propositional logic to represent the
knowledge base? May-11
Propositional logic has following limitations to represent the knowledge base.
i. It has limited expressive power. ii. It cannot directly represent properties of
individuals or relations between individuals. iii. Generalizations, patterns,
regularities cannot easily be represented. iv. Many rules (axioms) are
requested to write so as to allow inference.
2.Name two standard quantifiers. Dec – 09,May – 13
The two standard quantifier are universal quantifiers and existential
quantifier. They are used for expressing properties of entire collection of
objects rather just a single object. Eg.x Happy(x) means that “if the universe
of discourse is people, then everyone is happy”. x Happy(x) means that “if
the universe of discourse is people, then this means that there is at-least one
happy person.”
3.What is the purpose of unification? May – 12,Dec – 12,Dec - 09
It is for finding substitutions for inference rules, which can make different
logical expression to look identical. It helps to match to logical expressions.
Therefore it is used in many algorithm in first order logic.
4.What is ontological commitment (what exists in the world) of first order
logic? Represent the sentence “Brothers are siblings” in first order logic?
Dec - 10 Ontological commitment means what assumptions language makes
about the nature if reality. Representation of “Brothers are siblings” in first
order logic is x, y [Brother (x, y) Siblings (x, y)]
5.Differentiate between propositional and first order predicate logic?
May – 10 , Dec – 11
Following are the comparative differences versus first order logic and
propositional logic. 1) Propositional logic is less expressive and do not reflect
individual object`s properties explicitly. First order logic is more expressive
and can represent individual object along with all its properties. 2)
Propositional logic cannot represent relationship among objects whereas first
order logic can represent relationship. 3) Propositional logic does not consider
generalization of objects where as first order logic handles generalization. 4)
Propositional logic includes sentence letters (A, B, and C) and logical
connectives, but not quantifier. First order logic has the same connectives as
propositional logic, but it also has variables for individual objects, quantifier,
symbols for functions and symbols for relations.
6.What factors justify whether the reasoning is to be done in forward or
backward reasoning? Dec – 11
Following factors justify whether the reasoning is to be done in forward or
backward reasoning: a. possible to begin with the start state or goal state? b. Is
there a need to justify the reasoning? c. What kind of events trigger the
problem - solving? d. In which direction is the branching factor greatest? One
should go in the direction with lower branching factor?
7. Define diagnostic rules with example? May – 12
Diagnostics rules are used in first order logic for inference. The diagnostics
rules generate hidden causes from observed effect. They help to deduce hidden
facts in the world. For example consider the Wumpus world. The diagnostics
rule finding ‘pit’ is “If square is breezy some adjacent square must contain
pit”, which is written as, s Breezy(s) => Adjacent (r,s) pit (r).
8. Represent the following sentence in predicate form: “All the children
like sweets” Dec – 12
x child(x) sweet(y) likes (x,y). 5. what is Skolemization? May - 13 It is
the process of removing existential quantifier by elimination. It converts a
sentence with existential quantifier into a sentence without existential
quantifier such that the first sentence is satisfiable if and only if the second is.
For eliminating an existential quantifier each occurrence of its variable is
replaced by a skolem function whose argument are the variables of universal
quantifier whose argument are the variables of universal quantifier whose
scope includes the scope of existential quantifier.
9. Define the first order definite clause? Dec – 13
They are disjunctions of literals of which exactly one is positive. 2) A definite
clause is either atomic sentence or is an implication whose antecedents (left
hand side clause) is a conjunction of positive literals and consequent (right
hand side clause) is a single positive literal. For example: Princess (x)
Beautiful (x) Goodhearted(x) Princess(x) Beautiful(x)
10. Write the generalized Modus ponens Rule? May – 14
1) Modus ponens : If the sentence P and P Q are known to be true, then
modus ponens lets us infer Q For example : if we have statement , “ If it is
raining then the ground will be wet” and “It is raining”. If P denotes “It is
raining” and Q is “The ground is wet” then the first expression becomes P
Q. Because if it is indeed now raining (P is true), our set of axioms
becomes, P Q P Through an application of modus ponens, the fact that
“The ground is wet” (Q) may be added to the set of true expressions. 2) The
generalized modus ponens : For atomic sentences Pi , P'i and q, where there is
a substitution Q such that SUBST (,P'i) = SUBST (,P'i) , For all i , P'1, P'2 ,
…… P'n , (P1 P2 …..Pn q) SUBST (, q) There is n+ 1 premise to
this rule: The ‘n’ atomic sentences P'i and the one implication. The conclusion
is the result applying the substitution to the consequent q
PART-B
PART-B
1) Define the terms a) Communications (b) Speech act (c) Formal Language and (d) Gram-
mar (16)
2) What are the component steps in communication? Explain the steps for the example
sentence “The wumpus is dead” (16)
3) Contruct a lexicon and grammar for a small fragment of English Language. (16)
4) What is parsing? Explain in detail two parsing methods and give a trace of a bottom up
parse on the string “The wumpus is dead” (16)
5) What is augmented grammar? Explain with examples
(a) Verb sub categorization (8)
(b) Semantic interpretation (8)
6) Discuss ambiguity and disambiguation. (16)
7) What is Grammar indication? Explain with an example (16)
UNIT-V
1.Define Facts
A definite clause with no negative literals simply asserts a given preposition
2.Define Rules
knowledge representation formalises and organises the knowledge. One widely used
representation is called rule.
3. Define Interpreter
An interpreter is used to interpret the program line by line.
4 Define Scheduler
The actual determination of which KS should be activated next is done by a special KS,
called the scheduler.
5 Define Inference engine
The inference engine enables the expert system to draw deductions from the rule in
knowledge base.
6 What is backward chaining in rule based system?
Backward chaining- the inference engine attempts to match the assumed (hypothesized)
conclusion - the goal or subgoal state - with the conclusion (THEN) part of the rule. If such a
rule is found, its premise becomes the new subgoal.
7. Give the classification of learning process.
The learning process can be classified as: Process which is based on coupling new
information to previously acquired knowledge a. Learning by analyzing differences. b.
Learning by managing models. c. Learning by correcting mistakes. d. Learning by explaining
experience. Process which is based on digging useful regularity out of data, usually called as
Data base mining: a. Learning by recording cases. b. Learning by building identification trees
8 What are the different types of induction heuristics?
There are two different types of induction heuristics. They are: i. Require-link heuristics. ii.
Forbid-link heuristics.
9 Define a solution.
A solution is defined as a plan that an agent can execute and that guarantees the achievement
of goal.
10.Define conditional planning. Conditional planning is a way in which the incompleteness
of information is incorporated in terms of adding a conditional step, which involves if – then
rules
PART B
1) Explain in detail Information Retrieval
2) Explain in detail Information Extraction
3) What is machine translation? What are different types of machine translation? (16)
4) Draw the schematic of a machine translation and explain for an example problem (16)
5)Write notes on Meta Knowledge and Heuristics in Knowledge Acquisition
6)Explain in detail about the expert system shell.[ NOV/DEC 2018 ]
7)Explain the basic components and applications of expert system. [ MAY / JUNE 2016 ]
CS8602 / COMPILER DESIGN
(R – 2017)
UNIT I - INTRODUCTION TO COMPILERS
PART A
Preprocessor
Source program
6. What is a Symbol table?
A Symbol table is a data structure containing a record for each identifier, with fields for the
attributes of the identifier. The data structure allows us to find the record for each identifier
quickly and to store or retrieve data from that record quickly.
7. What is a regular expression? State the rules, which define regular expression?
Regular expression is a method to describe regular language
Rules:
1) ε-is a regular expression that denotes {ε} that is the set containing the empty string
2) If a is a symbol in ∑,then a is a regular expression that denotes {a}
3) Suppose r and s are regular expressions denoting the languages L(r ) and L(s) Then,
a) (r )/(s) is a regular expression denoting L(r) U L(s). b) (r
)(s) is a regular expression denoting L(r )L(s)
c) (r )* is a regular expression denoting L(r)*. d) (r) is
a regular expression denoting L(r ).
PART - B
1. What are the phases of the compiler? Explain the phase in detail. Write down output of each phase for
the expression a:=b+c*60
2. Convert the Regular Expression to DFA using direct method and minimize it.
i. abb(a|b)*
ii. (a|b)*ab
iii. abb(a|b)*
iv. (a*|b*)*
v. (1*01*0)*1*
vi. (+|-|Ɛ).(E|e).(digit) +
3. Explain briefly about compiler construction tools.
4. Differentiate between lexeme, token and pattern and What are the issues in lexical analysis?
5. Explain various Errors encountered in different phases of compiler.
6. Discuss the role of lexical analyzer in detail with necessary examples.
7. What are the operations available in languages.
8. Write a short notes on Regular Expression.
UNIT II – LEXICAL ANALYSIS
PART - A
Part - B
1. Construct parsing table for the grammar and find moves made by predictive parser on input id+id*id and find
FIRST and FOLLOW
E→ E+T|T
T→ T*F|F
F →(E)|id
2. Constuct stack implementation of shift reduce parsing for the grammar E→E+E|E*E|(E)|-E|id and the input
string id1+id2+id3
3. Constuct SLR parsing table for the following grammar.
E→E+T|T
T→T*F|F
F→(E)|id
4. Constuct LALR parsing table for the following grammar.
S→AA
A→aA|b
5. i) Write the algorithms for FIRST and FOLLOW IN parser.
ii) Explain LL(1) grammar for the sentence
S→iEts|iEtSeS|a
E→b
6. Consider the grammar S->ABD, A->a|Db|€, B->gD|dA|€, D->e|f. Construct FIRST and FOLLOW for each non
terminal of the above grammar and Construct the predictive parsing table for the grammar.
7. Explain briefly about the specification of a simple type checker
8. Implement an Arithmetic Calculator using LEX and YACC
UNIT III - SYNTAX ANALYSIS
PART - A
1. Define parser.
Hierarchical analysis is one in which the tokens are grouped hierarchically into nested collections with
collective meaning. Also termed as Parsing.
2. Mention the basic issues in parsing.
There are two important issues in parsing.
Specification of syntax
Representation of input after parsing.
3. Define a context free grammar.
A context free grammar G is a collection of the following
V is a set of non terminals
T is a set of terminals
S is a start symbol
P is a set of production rules
G can be represented as G = (V,T,S,P)
Production rules are given in the following form
Non terminal → (V U T)*
4. Define ambiguous grammar.
A grammar G is said to be ambiguous if it generates more than one parse tree for some
sentence of language L(G). i.e. both leftmost and rightmost derivations are same for the given sentence.
5. What is a operator precedence parser?
A grammar is said to be operator precedence if it possess the following properties:
No production on the right side is e.
There should not be any production rule possessing two adjacent non terminals at the right hand
side.
6. List the properties of LR parser.
LR parsers can be constructed to recognize most of the programming languages for which the
context free grammar can be written.
The class of grammar that can be parsed by LR parser is a superset of class of grammars that can be
parsed using predictive parsers.
LR parsers work using non backtracking shift reduce technique yet it is efficient one.
7. Mention the types of LR parser.
SLR parser- simple LR parser
LALR parser- lookahead LR parser
Canonical LR parser
8. What are the problems with top down parsing?
The following are the problems associated with top down parsing:
Backtracking
Left recursion
Left factoring
Ambiguity
9. What is meant by handle pruning?
A rightmost derivation in reverse can be obtained by handle pruning.
If w is a sentence of the grammar at hand, then w = γn, where γn is the nth right sentential form of
some as yet unknown rightmost derivation
S=γ0 =>γ1…=>γn-1=>γn =w
10. What is dangling else problem?
Ambiguity can be eliminated by means of dangling-else grammar which is show below:
stmt → if expr then stmt
| if expr then stmt else stmt
| other
PART - B
1. Construct a predictive parsing. table for the grammar NOV/DEC 2018
E -> E + T / F
T -> T * F / F
F -> (E) / id
2. Give the LALR parsing table for the grammar. APR/MAY 2018
S -> L = R / R
L -> * R / id
R -> L
3. Consider the grammar
E -> TE’
E’ -> + TE’ / E
T -> FT’
T’ -> *FT’ / E
F -> (E) / id
Construct a predictive parsing table for the grammar shown above. Verify whether the
input string id + id * id is accepted by the grammar or not.
4. Consider the grammar.
E -> E + T
E -> T
T -> T * F
T -> F
F -> (E) / id
Construct an LR parsing table for the above grammar. Give the moves of the LR parser on
id * id + id
5. For the grammar given below, calculate the operator precedence relation and the precedence
functions
E -> E + E | E – E || E * E | E | E || E ^ E | (E) || -E | id
6. What are LR parsers? Explain with a diagram the LR parsing algorithm. APR/MAY 2017
7. Explain recursive descent parser with appropriate examples.
8. Compare SLR, LALR and LR parses
UNIT IV - SYNTAX DIRECTED TRANSLATION & RUN TIMEENVIRONMENT
PART – A
PART - B
2. Explain briefly about the specification of a simple type checker.Nov/ Dec 2017
i. Storage organization
PART - A
UNIT – II
UNIT – III
1. What is the use of middleware?
Middleware is a layer of software whose purpose is to mask heterogeneity and to
provide a convenient programming model to application programmers. Middleware is
represented by processes or objects in a set of computers that interact with each other to
implement communication and resource sharing support for distributed applications.
2. Write about the parts available in routing algorithm?
∑ Routing algorithm must make decisions that determine the route taken by each packet as it
travels through the network. In circuit-switched network layers such as X.25 and frame relay
networks such as ATM the route is determined whenever a virtual circuit or connection is
established. ∑ In packet-switched network layers such as IP it is determined separately for
each packet, and the algorithm must be particularly simple and efficient if it is not to degrade
network performance. ∑ It must dynamically update its knowledge of the network based on
traffic monitoring and the detection of configuration changes or failures. This activity is less
timecritical; slower and more computation-intensive techniques can be used.
3. Define multicast communication?
It is the implementation of group communication. Multicast communication requires
coordination and agreement. The aim is for members of a group to receive copies of messages
sent to the group . Many different delivery guarantees are possible Example: agreement on the
set of messages received or on delivery ordering.
4. What are the Application dependencies of Napster?
Napster took advantage of the special characteristics of the application for which it
was designed in other ways: ∑ Music files are never updated, all the replicas of files need to
remain consistent after updates. ∑ No guarantees are required concerning the availability of
individual files – if amusic file is temporarily unavailable, it can be downloaded later. This
reduces the requirement for dependability of individual computers and their connections tothe
Internet.
5. Define Routing overlay.
In peer-to-peer systems a distributed algorithm known as a routing overlay takes
responsibility for locating nodes and objects. The name denotes the fact that the middleware
takes the form of a layer that is responsible for routing requests from any client to a host that
holds the object to which the request is addressed.
6. What is a file group?
A collection of files that can be located on any server or moved between servers
while maintaining the same names is a file group. Simillar to a UNIX file system helps with
distributing the load of file serving between several servers.File groups have identifiers which
are unique throughout the system used to refer file groups and files
7. What is flat file service interface?
It is RPC interface used by client modules. It is not normally used directly by user
level programs. A field is invalid if the file that it refers to is not present in the server
processing the request or if its access permissions are inappropriate for the operation
requested.
8. Write a note on Andrew file system?
AFS provides transparent access to remote shared files for unix programs running on
workstations. Access to AFS files is via the normal unix file primitives, enabling existing
unix programs to access AFS files without modification or recompilation.
9. Write a note on X.500 directory service?
It is a directory service. It can be in the same way as a conventional name service but
it is primarily used to satisfy descriptive queries, designed to discover the names and
attributes of other users or system resources.
10. What is the use of iterative navigation?
DNS supports the model known as iterative navigation. To resolve a name, a client
presents the name to the local name server, which attempts to resolve it. If the local name
server has the name, it returns the result immediately.
UNIT - IV
UNIT – V
1. What is process migration?
Process migration is the relocation of a process from its current location (source node) to
another node(destination node).The process can be either a non-preemptive or preemptive
process. Selection of the process to be migrated, selection of the destination node and the
actual transfer of the selected process are the three steps involved in process migration.
2. What are the advantages of process migration?
Various advantages of process migration are: ∑ Reduces average response time of processes.
∑ Speeds up individual jobs. ∑ Gains higher throughput. ∑ Effective utilization of resources
and reduces network traffic.
3. What are the activities involved in process migration?
Migration of a process is a complex activity that involves many sub-activities. They are: 1.
Freezing the process on its source node and restarting it on its destination node. 2.
Transferring the process’s address space from its source node to its destination node. 3.
Forwarding messages meant for the migrant process. 4. Handling communication between
cooperating processes that have been separated as a result of process migration.
4. Mention the levels of transparency in process migration.
Transparency is an important requirement for a system that supports process migration. The
two levels of transparency are: ∑ Object access level: Minimum requirement for a system to
support non-preemptive process migration. ∑ System call and interprocess communication
level: This facility is required to support preemptive process migration.
5. What is Threads?
Threads are an efficient way to improve application performance through parallelism. Each
thread of a process has its own program counter,its own register states, and its own stack.But
all the threads shares the same address space.Threads are often referred to as lightweight
process.
6. What are the main advantages of using threads instead of multiple processes?
Threads has its own program counter,its own register states, and its own stack but shares the
same address space Advantages of threads over multiple processes are: ∑ Context Switching:
Threads are very inexpensive to create and destroy, and they are inexpensive to represent. For
eg: they require space to store, the PC, the SP, and the general-purpose registers, but they do
not require space to share memory information, Information about open files of I/O devices in
use, etc. In other words, it is relatively easier for a context switch using threads. ∑ Sharing:
Treads allow the sharing of a lot resources that cannot be shared in process, for example,
sharing code section, data section, Operating System resources like open file etc
7. Mention the models used to organize the threads of a process.
∑ Dispatcher-workers model – In this model, process consists of a single dispatcher thread
and multiple worker threads. ∑ Team model – In this model, all threads behave as equals and
there is no dispatcherworker relationship for processing client’s requests. ∑ Pipeline model –
In this model, the threads of a process are organized as a pipeline where the output data from
one thread is used for processing by the other threads.
8. Define critical region.
A segment of code in which a thread may be accessing some shared variable is called critical
region. Multiple threads should not access the same data simultaneously. Hence the execution
of critical regions in which the same data is accessed by the threads must be mutually
exclusive in time.
9. Define mutex variable.
Mutex variable is like a binary semaphore that is always in one of the two states locked or
unlocked. Mutex variables are used to implement mutual exclusion technqiues. A thread that
wants to execute in a critical region performs a lock operation over the mutex variable which
has to be in unlocked state.
10. Mention some library procedures for managing the threads.
Some of the library procedures for managing threads are: ∑ pthread_create – Creates a new
thread in the same address space as the calling thread. ∑ pthread_exit – Terminates the calling
thread. ∑ pthread_join – It makes the calling thread to block itself and waits until thread
specified in the routine’s argument terminates. ∑ pthread_detach – Used by the parent thread
to disown a child thread. ∑ pthread_cancel – Used by a thread to kill another thread.
PART – B
UNIT - I
9. Define distributed systems. What are the significant issues and challenges of the
UNIT – III
3. What is a deadlock? How deadlock can be recovered? Explain distributed dead locks.
9. a. Discuss about threads in distributed systems (8) b. Discuss about the distributed file system.
UNIT – IV
UNIT – V
2. Define RIA.
A rich Internet application (RIA) is a Web application designed to deliver the same features and
functions normally associated with deskop applications. RIAs generally split the processing
across the Internet/network divide by locating the user interface and related activity and capability on the
client side, and the data manipulation and operation on the application server side.
3. Define collaboration.
Collaboration is a process defined by the recursive interaction of knowledge and mutual learning
between two or more people who are working together, in an intellectual endeavour, toward a common
goal which is typically creative in nature.
-Making
9. Define Website.
A website is hosted on at least one web server, accessible via a network such as the Internet or a
private local area network through an Internet address known as a uniform resource locator (URL). All
publicly accessible websites collectively constitute the World Wide Web
Part-B
4. Explain HTML elements in detail also State the types of lists supported by HTML and explain
them in detail. (APR/MAY 2011)
HTML element
Heading Tags
Paragraph Tag
Line Break
Tag Centering
Content
Horizontal
Lines
Nonbreaking Spaces
HTML Lists
5. Discuss the various features available in HTML to format the text with example.
Basic functionality
Few Definitions
Server Configuration and Tuning
Service has Five Components
Defining Virtual Hosts
Configuring Host
Elements Host Attributes
Logging
Access Control
6. Explain how tables can be inserted into HTML document with example.
TR
TD
TH
<TABLE border="1"
summary="This table gives some statistics about
fruit flies: average height and weight, and
percentage
with red eyes (for both males and females).">
<CAPTION><EM>A test table with merged cells</EM></CAPTION>
<TR><TH rowspan="2"><TH colspan="2">Average
<TH rowspan="2">Red<BR>eyes
<TR><TH>height<TH>weight
<TR><TH>Males<TD>1.9<TD>0.003<TD>40%
<TR><TH>Females<TD>1.7<TD>0.002<TD>43%</
TABLE>
7.What is the significance of using forms on the web page? Enlist various components used on form.
Elements
uses of various elements:
What is JavaScript?
Unit II
Part – A
Javascript supports event driven programming. when user clicks the mouse or hit the keys on
the keyboard or if user submits the form then these events and response to them can be handled using
javascript. Hence javascript is mainly used in web programming for validating the data provided by the
user.
10. What is the use of pop up boxes in java script?
There are three types of popup boxes used in javascript. Using these popup boxes the user can
interact with the web application.
Part - B
say: function(message) {
return this.name + ': ' +
message; }};
var guy = new
Person('Miro');
guy.say('hi');
// -> "Miro: hi"
var Pirate = Class.create();
// inherit from Person class:
Pirate.prototype =
Object.extend(new Person(),
{
// redefine the speak method
3.Discuss Javascript objects in detail with suitable examples. (NOV/DEC 2012, MAY/JUNE 2014)
Enumerating Properties
Array notation Object reference Methods
4. Discuss about Javascript debugging. Explain how local and global functions can be written using
java script (MAY/JUNE 2012)
Local and global functions
5. Explain the way in which java script handles arrays with example. (MAY/JUNE 2012)
Array
Creating an Array
Using the JavaScript Keyword
new Access the Elements of an
Array Different Objects in One
Array Arrays are Objects
Adding Array Elements
Looping Array Elements
<script language="javascript">
var n=prompt("Enter User Value")
var x=1;
if(n==0 || n==1) x=0;
for(i=2;i<n;i++)
{ if(n%i==0)
{x=;
brek;
}
} if(x==1)
8. Write a servlet program which displays the different content each time the user visits the page.
9. Write a Java script program to create Popup box, alert and confirm box.
10. Write a Java script program to print the numbers from 0 to 50.
<script type = "text/javascript">
var
input;
var
i=0;
input=
50;
while ( input > I )
{ document.write (i); i++ } </scrip
Unit – IV Part - A
1. Define PHP.
PHP - Hypertext Preprocessor -one of the most popular server-side scripting languages for
creating dynamic Web pages.
- an open-source technology
- platform independent
2. List the data types used in PHP.
Data types Description
Integer Whole numbers (i.e., numbers without a decimal
point) Double Real numbers (i.e., numbers containing a
decimal point) String Text enclosed in either single ('') or
double ("") quotes. Boolean True or false
Array Group of elements of the same type
Group of associated data and methods
Resource An external data source
3. How type conversion is done in PHP?
In PHP, data-type conversion can be performed by passing the data type as an argument to function
settype. Function settype takes two arguments: The variable whose data type is to be changed and the
variable ’s new data type.
E.g., settype( $testString, "double" );
expressions
3. Given an XSLT document and a source XML document explain the XSLT transformation
process that produces a single result XML document. (NOV/DEC 2012)
10. Develop a shopping cart application using PHP with use of cookies.
Step 1: create a database and run the following SQL queries to create the sample
tables. Step 2: In your chosen root directory, create a folder named config.
Step 3: Inside that config folder, create a file named db_connect.php, and put the
following code inside it, just change to database credentials to your own.
Step 4: Create a file called products.php, we will retrieve the products using the code below.
Step 5: products.php on step 4 above will not actually work without the
layout_head.php and
layout_foot.php, so first, we’ll create the layout_head.php with the following code:
Step 6: layout_head.php includes another PHP file called navigation.php, so we’ll create
it and
put the following code.
Step 7: Now we’ll create the layout_foot.php
Step 8: products.php has links to the add_to_cart.php file, we’ll create that file and put the
code
below.
Step 9: Now if the products were able to be added on the cart, we’ll have to view it
using cart.php, we’ll create that file with the following codes.
Step 10: cart.php links to a file called remove_from_cart.php, to remove an item from the
cart.
Unit-V
Part – A
1. What is Ajax?
Ajax is a set of client side technologies that provides asynchronous communication between
user interfaces and web server. So the advantages of using Ajax are asynchronous communication,
minimal data transfer and server is not overloaded with unnecessary load.
2. What technologies are being used in AJAX?
AJAX uses four technologies, which are asfollows:
JavaScript, XMLHttpRequest, Document Object Model (DOM), Extensible HTML (XHTML) and
Cascading Style Sheets (CSS)
3. Explain the limitations of AJAX.
It is difficult to bookmark a particular state of the application,Function provided in the code-behind
file do not work because the dynamic pages cannot register themselves on browsers history engine
automatically
4. Describe AJAX Control Extender Toolkit.
AJAX Control Toolkit is a set of extenders that are used to extend the functionalities of the ASP.NET
controls. The extenders use a block of JavaScript code to add new and enhanced capabilities to the
ASP.NET controls. AJAX Control Toolkit is a free download available on the Microsoft site. You need to
install this toolkit on your system before using extenders.
5. 30) What is the syntax to create AJAX objects?
AJAX uses the following syntax to create an
object: Var myobject = new
AjaxObject("pagepath");
The page path is the URL of the Web page containing the object that you want to
call. The URL must be of the same domain as the Web page.
6. How can you find out that an AJAX request has been completed?
You can find out that an AJAX request has been completed by using the readyState property. If the
value of this property equals to four, it means that the request has been completed and the data is available.
Part-B
1. Explain about the object that helps AJAX reload parts of a web page without reloading the whole
page.(NOV/DEC 2011, MAY/JUNE 2014)
Ajax request and response objects
Useful methods to work with XMLHttpRequest
a) open(method, url, isAsync, userName, password)
b) setRequestHeader(name, value)
c) send(payload)
d) abort()
Synchronous and Asynchronous requests
Handling returned response from server
6. With a simple example illustrate the steps to create a java web service. (NOV/DEC 2012)
Writing a java web service
Currency conversion Service
Writing server software
service endpoint interface
JWSDP: Server
11. Describe the major elements of SOAP. (NOV/DEC 2011, MAY/JUNE 2014) (APR/MAY 2013)
2. What is Mobility?
UNIT-II
2
2. Mention the different entities in a mobile IP.
Mobile Node
Correspondent Node
Home Network
Foreign Network
Foreign Agent
Home A gent
Care-Of address
Foreign agent COA
Co-located COA
3. Define Mobile node:
A mobile node is an end-system or router that can change its point of attachment to the
Internet using mobile IP. The MN keeps its IP address and can continuously with any other system
in the Internet as long as link layer connectivity is given.
4. Explain Cellular IP.
Cellular IP provides local handovers without renewed registration by installing a single
cellular IP gateway for each domain, which acts to the outside world as a foreign agent.
5. What do you mean by mobility binding?
The Mobile Node sends its registration request to the Home Agent. The HA now sets up a
mobility binding containing the mobile node’s home IP address and the current COA.
6. Define COA.
The COA (care of address) defines the current location of the MN from an IP point of view.
All IP packets sent to the MN are delivered to the COA, not directly to the IP address of the MN.
Packet delivery toward the MN is done using the tunnel. DHCP is a good candidate for supporting
the acquisition of Care Of Addresses.
7. Define a tunnel.
A tunnel establishes a virtual pipe for data packets between a tunnel entry and a tunnel
endpoint. Packets entering a tunnel are forwarded inside the tunnel and leave the tunnel unchanged.
8. What is encapsulation?
Encapsulation is the mechanism of taking a packet consisting of packet header and data
putting it into the data part of a new packet.
9. What is decapsulation?
The reverse operation, taking a packet out of the data part of another packet, is called
decapsulation.
3
UNIT III
1. Define GSM?
The global system for mobile communication (GSM) was developed by Group Speciale
Mobile(GSM) which was founded in Europe in 1992. The Gsm is a standard for mobile
telecommunication through a cellular network at data rates if upto 14.4 kbps. Now a days it consist
of a set of standards and protocols for mobile telecommunication.
2. Define GPRS?
General Packet Radio Service (GPRS) is a packet oriented service for mobile devices data
communication which utilizes the unused channels in TDMA mode in a GSM network and also
sends and receives packet of data through the internet.
3. What are subsystems in GSM system?
Radio subsystem (RSS)
Network & Switching subsystem (NSS)
Operation subsystem (OSS)
4. What are the control channel groups in GSM?
The control channel groups in GSM are:
Broadcast control channel (BCCH)
Common control channel (CCCH)
Dedicated control channel(DCCH)
5. What are the four types of handover available in GSM?
Intra cell Handover
Inter cell Intra BSC Handover
Inter BSC Intra MSC handover
Inter MSC Handover
10 . List out the numbers needed to locate an MS and to address the MS.
The numbers needed to locate an MS and to address the MS
are: Mobile station international ISDN number (MSISDN)
International mobile subscriber identity (IMSI)
Temporary mobile subscriber identity (TMSI)
Mobile station roaming number (MSRN)
4
UNIT IV
1. Define MANET.
• MANET - Mobile Adhoc NET works
. Continuously self-configuring, infrastructure-less network of mobile devices
connected without wires
MANET VANET
MANET - Mobile AdhocNET work VANET- Vehicular AdhocNET works
Nodes moves randomly Nodes moves regularly
Mobility is low Mobility is high
Reliability is medium Reliability is high
Node lifetime depends on power source N ode lifetime depends on vehicle life
time
Network topology is sluggish and slow Network topology is frequent and fast
6
UNIT V
1. Define Operating System.
Interface between hardware and user
Manages hardware and software resources of the system
Provides set of services to application programs
2. Name the features of Operating System.
• Multitasking
• Scheduling
• Memory Allocation
• File System Interface
• Keypad Interface
• I/O Interface
• Protection and Security
• Multimedia features
3. How is the operating system structured?
Kernel Layer
Shell Layer
4. Give the types of Operating System.
Monolithic Kernel
Microkernel
5. Specify the motivation of Monolithic Kernel OS design.
Kernel contains the entire OS operations except shell code
Motivation
o OS services can run more securely and efficiently in supervisor mode
6. Mention the examples of Monolithic Kernel OS design.
Windows
Unix
7. List the Advantages of Monolithic Kernel OS design.
Provides good performance
7
9. List the disadvantages of Microkernel OS design.
• Flexible
• Modular
Easier to port
Easy to extend and implement
10. List the disadvantages of Microkernel OS design,
Difficult to debug compared to application programs
Bog in the kernel crashes the system and the debugger
Non-reliable
16 MARKS – KEYPOINTS
Questions Bank
Unit I
1. Discuss the advantage and disadvantage of cellular system with small cells.(06)
2.Briefly explain the Frequency Division Multiplexing.(06)
3.Write short notes on DHSS(04)
4.Write short note on FHSS(04)
5.Explain the GSM system architecture with a neat diagram.(16)
6.Describe the security services provided by GSM.(08)
7.Explain the protocol architecture of GSM for signaling. (16)
8.Explain the architecture of GPRS with a neat diagram.(10)
9. What are typical steps for handover on GSM network?(08)
10. Explain the steps involved in the call delivery procedure in GSM network in the following cases:
(i) GSM mobile terminated call(08)
(ii) GSM mobile originated call(08)
11. Why are so many different identifiers/addresses needed in GSM?
Give reasons and distinguish between user-related and system related identifiers.(08)
13. Explain the services provided by GSM?(08)
14. Write short notes on
(i) Mobile management.(08)
(ii) Connection Establishment.(08)
UNIT-II
1. Compare Hyperlink and Blue tooth in terms of ad-hoc capabilities, power saving mode, solving hidden
terminal problem, providing reliability fairness problem regarding channel access.(16)
2. Write short notes on wireless PAN?(04)
3. Explain the operation of DFWMAC_DCF with a neat timing diagram.(8)
4. Draw the MAC frame of 802.11 and list the use of the fields.(8)
5.Describe Hyperlink architectural components and their interactions. (16)
6.Explain the architecture of Wi-Fi in detail.(16)
7.Explain the system architecture of IEEE802. 11(16)
8.Describe the architecture of Wi MAX in detail. (16)
9.Compare and Contrast Wi-Fi and Wi Max.(06)
10. Briefly explain about BRAN.(04)
11. Explain in detail about Wireless ATM. (10)
12. Explain the information bases and networking of adhoc HIPERLAN.(8)
13. Discuss MAC layer Bluetooth system (08)
UNIT – III
1. Show the steps required for a handover from one FA to another FA including layer-2 andlayer-3.
Assume 802.11aslayer-2.(08)
2. Name the ineffiencies of Mobile IP regarding data forwarding from CN
to MN. W hat are the optimizations possible?(08)
3. What are the differences between wired networks and ad-hoc networks
related to routing?(06)
4. What is the need for DHCP? With a state chart explain
11 the operation of DHCP?(10)
5. List the entities involved in mobile IP and describe the process of data transfer from a mobile node to a
fixed node and vice versa.(08)
6. Why is conventional routing in wired networks not suitable for wireless
networks? Substantiate your answers with suitable examples.(08)
7. Discuss DSDV routing in detail.(16)
UNIT IV
UNIT V
1. What are the design and implementation issues in mobile device operating Systems. (08)
2. Explain the operating system issues related to miniature devices.(08)
3. Explain the commercial mobile operating systems.(16)
4. Describe the software Development kit with an example.(8)
5. Discuss the following:
i)Android
ii) Black Berry
iii)Windows
Phone iv)M-
Commerce
v)Mobile payment system
12
13
JAYARAJ ANNAPACKIAM C.S.I COLLEGE OF ENGINEERING
(Approved by AICTE, New Delhi and Affiliated to Anna University)
MARGOSCHIS NAGAR, NAZARETH – 628 617
6. List the members of the critical groups in a testing process (U.Q Nov/Dec 2008)
• Manager
• Developer/Tester
• User/Client
1. What are the factors affecting less than 100% degree of coverage? (Apr/May – 2018)
The nature of the unit
• Some statements/branches may not be reachable.
• The unit may be simple, and not mission, or safety, critical, and so complete coverage is
thought to be unnecessary.
• The lack of resources
• The time set aside for testing is not adequate to achieve complete coverage for all of the
units.
• There is a lack of tools to support complete coverage
• Other project related issues such as timing, scheduling. And marketing constraints.
3. Differentiate black box and white box testing. (Apr/May – 2017) (Nov/Dec – 2018)
4. Give some example methods for black box testing. (Apr/May – 2017)
o Equivalence class partitioning (ECP)
o Boundary value analysis (BVA)
o State Transition testing.(STT)
o Cause and Effect Graphing.
o Error guessing
5. List the various iterations of Loop testing. (Nov/Dec – 2016)
o Zero iteration of the loop
o One iteration of the loop
o Two iterations of the loop
o K iterations of the loop where k<n
o n-1 iterations of the loop
o n+1 iterations of the loop
6. What is Random Testing
Random testing is a black-box software testing technique where programs are tested by
generating random, independent inputs. Results of the output are compared against software
specifications to verify that the test output is pass or fail.
PART B
1) Demonstrate black box test cases using equivalence class
partitioning and boundary value analysis to test a module for payrollsystem (Apr May 2018)
(Nov/Dec – 2016)
2) Explain in detail about equivalence class partitioning (Apr May 2017) (Nov/Dec – 2018)
3) Explain about boundary value analysis in detail (Apr May 2017) (Nov/Dec – 2018)
4) Explain the various axioms that allow testers to valuate Test Adequacy Criteria.(Apr May
2017)
5) What inference can you make from random testing, requirement based testing and domain
testing explain?
6) Explain the various axioms that allow testers to evaluate Test Adequacy Criteria.
7) Explain about state transition testing . (Apr May 2018)
8) Explain mutation testing with an example (Apr May 2017)
9) How data flow testing aid in identifying defects in variable declaration and its use (Apr
May 2017)
10) Discuss in detail about static testing and structural testing.Also mention the difference
between these two testing concepts. (Nov/Dec – 2018)
Unit 3
Part A
Part B
1) What do you mean by unit testing? Explain in detail about the process of unit testing and
unit test planning (Apr May 2018) (Nov/Dec – 2018)
2) Write the importance of security testing and explain the consequences of security breaches,
also write the various areas which has to be focused on during security testing. (Apr May
2018)
3) Write notes on configuration testing and its objectives. (Apr May 2018)
4) State the need for integration testing in procedural code (Apr May 2018) (Nov/Dec –
2016)
5) Explain in detail about test harness. Also write notes on integration test.
6) Explain various system testing approaches in detail. (Nov/Dec – 2018)
7) Write notes on configuration testing and compatibility testing
8) How Would you identify the hardware and software for configuration testing? (Nov/Dec
– 2016)
9) Explain the significance of control flow graph and Cyclomatic complexity in white box
testing with a pseudo code for sum of positive numbers. Also mention the independent paths
with test cases.(Apr. May 2017)
10) Explain the black box testing techniques with example .(Apr. May 2017)
Unit 4
Part B
1) Describe about the testing team structure for single product companies (Apr May
2018) (Nov/Dec – 2016)
2) What are the skills needed for a test specialist. (Nov/Dec – 2016)
3) Name the reports of test results and the contents available in each test reports (Apr
May 2018)
4) Analyze the various steps in forming the test group. How will you build a testing
group discuss with an example. (Nov/Dec – 2018)
5) Develop the challenges and issues faced in testing service organization also write how
we can eliminate challenges.
Can you list the components of test plan in detail. (Apr May 2018) (Nov/Dec – 2016)
6) Illustrate the various components of Test plan with an example (Nov/Dec – 2018)
Point out the five stages in a test plan process./
7) Explain the concepts of test planning in detail. Also mention the way of defining test
plan (Nov/Dec – 2018)
8) Compare and contrast the role of debugging goals and policies in testing. (Nov/Dec –
2016)
Unit 5
5.What are the benefits of testing tools and automation? (Nov/Dec – 2016)
Speed, Efficiency, Accuracy and Precision, Relentlessness.
8. Define test automation. / What is the need of test automation (Nov/Dec – 2018)
In software testing, test automation is the use of special software (separate from the
software being tested) to control the execution of tests and the comparison of actual outcomes
with predicted outcomes.
It reduces human effort and reduce human error.
Part B
1) Discuss the types of review. Explain various components of review plans. (Apr May
2018)
2) Explain various requirements for test tool.
3) Explain the design and architecture for automation (Nov/Dec– 2016)
4) List and discuss metrics that can be used for detection prevention and how Narrate and
formulate about the metrics of parameters to be considered for evaluating the software
quality.(Apr May 2018)
5) Outline the challenges in automation. (Nov/Dec – 2016)
6) What is the need for metrics in testing? Analyze about Productivity metrics. (Nov/Dec –
2016)
7) Briefly explain the test tool selection procedure. (Nov/Dec – 2018)
8) Explain the various generations of automation and the required skills for each. (Apr May
2017)
9) Explain the different types of Test defect metrics under progress metrics based on what
they measure and what area they focus on. (Apr May 2017)
UNIT – I
INTRODUCTION TO CLOUD COMPUTING
PART – A
1. What is Service Oriented Architecture (SOA)? (Nov/Dec 2018)
A service-oriented architecture is essentially a collection of services. These
services communicate with each other. The communication can involve either
simple data passing or it could involve two or more services coordinating some
activity.
2. Highlight the importance of the term “cloud computing” (Nov/Dec 2016)
Elasticity Demand Cost Savings Speed Flexibility Integration
Data Security & Recovery Workforce Efficiency.
3. Bring out the difference between private and public cloud (Nov/Dec 2016)
Public Cloud These are based on shared physical hardware which is owned
and operated by a third party provider. Public clouds are ideal for small and
medium sized businesses or businesses that have fluctuating demands.
Private Cloud A private cloud is infrastructure dedicated entirely to our
business that’s hosted either on-site or in a service provider’s data center.
4. What is Cloud Computing (Nov/Dev 2021 )
“Cloud is a parallel and distributed computing system consisting of a
collection of inter- connected and virtualized computers that are
dynamically provisioned and presented as one or more unified computing
resources based on service-level agreements (SLA) established through
negotiation between the service provider and consumers.”
5. What is a Virtual Machine (VM)?
A virtual machine (VM) is a software program or operating system that
not only exhibits the behavior of a separate computer, but is also
capable of performing tasks such as running applications and programs
like a separate computer. A virtual machine, usually known as a guest
is created within another computing environment referred as a "host."
Multiple virtual machines can exist within a single host at one time. A
virtual machine is also known as a guest.
6. What is virtualization in cloud computing?
Virtualization is a software that creates virtual (rather than actual)
version of something, such as an operating system, a server, a storage
device or network resource. It is the fundamental technology that
powers cloud computing.
7. What is a hypervisor?
A hypervisor, also called a virtual machine manager, is a
program that allows multiple operating systems to share a
single hardware host. Each operating system appears to have
the host's processor, memory, and other resources all to itself.
8. What is meant by Distributed computing?
A distributed system is a network of autonomous
computers that communicate with each other in order to
achieve a goal.
The computers in a distributed system are independent and
do not physically share memory or processors. They
communicate with each other using messages, pieces of
information transferred from one computer to another
over a network.
9. What are the differences between Grid computing and
cloud computing? (Nov/Dev 2017)
Grid computing Cloud computing
5. Define IaaS?
Allows users to rent the infrastructure itself: servers, data
center space, and software, network equipment such as
routers/switches.
6. Define PaaS?(Apr/May-2017)
Platform as a service (PaaS) is a category of cloud computing
services that provides a platform allowing customers to
develop, run, and manage applications without the complexity
of building and maintaining the infrastructure typically
associated with developing and launching an app. The PaaS
model provides the user to deploy user-built applications on
top of the cloud infrastructure, that are built using the
programming languages and software tools supported by the
provider (e.g., Java, python, .Net).
7. Define SaaS? (Apr/May-2017)
Software as a Service (SaaS) is a software delivery method
that provides access to software and its functions remotely as
a Web-based service. SaaS model provides the software
applications as a service. As a result, on the customer side,
there is no upfront investment in servers or software licensing.
On the provider side, costs are rather low, compared with
conventional hosting of user applications. The customer data
is stored in the cloud that is either vendor proprietary or a
publically hosted cloud supporting the PaaS and IaaS.
8. Why do we need hybrid cloud (Nov/Dec 2016)
Maintain security and high performance
Run workloads where they perform best
Reduce IT cost and improve network efficiency
9. Mention the characteristics features of the cloud (Apr/May 2017)
On-Demand Usage
Ubiquitous Access
Multi-tenancy (Resourcing Pooling)
Elasticity (and Scalability)
Measured Usage
Resiliency
10. Define Hybrid Cloud. (Nov/Dec 2021)
Hybrid cloud is a cloud computing environment which uses a
mix of on-premises, private cloud and third-party, public
cloud services with orchestration between the two platforms.
For example, an enterprise can deploy an on-premises private
cloud to host sensitive or critical workloads, but use a third-
party public cloud provider, such as Google Computer
Engine, to host less-critical resources, such as test and
development workloads.
PART B
1. What are the services provided by cloud with
deployment model? Explain in detail (Nov/Dec 2017)
2. List the cloud deployment models and give a detailed about them
(Nov/Dec 2016)
3. Explain in detail about cloud delivery model. (Nov/Dec 2021)
4. Discuss the operational and economic benefits of SaaS.
5. Give the importance of cloud computing and elaborate the
different types of services offered by it. (Nov/Dec 2016)
6. Specify a scenario where PaaS can be applied
7. Identify upfront Investment in New Initiatives and what will be its
benefits in cloud.
UNIT – IV
RESOURCE MANAGEMENT AND SECURITY IN
CLOUD
PART A
1. Define Intercloud. 1. (Nov/Dec 2021)
Intercloud is a network of cloud s that are linked with each
other. This includes private, public, and hybrid clouds that come
together to provide a seamless exchange of data.
PART B
1. Explain in detail about cloud resource provisioning methods.
2. Write short note on cloud security challenges. (Nov/Dec 2021)
3. Write short notes on data security. (Nov/Dec 2016)
4. Write short on Virtual machine security. (Nov/Dec 2016)
5. Investigate the differences among encryption, watermarking,
and colouring for protecting data sets and software in cloud
environments. Discuss their relative strengths and limitations.
6. Compile a table to compare public clouds and private clouds
in each of the following four aspects. Also identify their
differences, advantages, and shortcomings in terms of design
technologies and application flexibility. Give several example
platforms that you know of under each cloud class.
• Technology leveraging and IT resource ownership
• Provisioning methods of resources including data and VMs, and
their management
• Workload distribution methods and loading policies Security
precautions and data privacy enforcement.
7. Discuss different ways for cloud service providers to maximize their
revenues.
UNIT-V
UNIT V CLOUD TECHNOLOGIES
AND ADVANCEMENTS
PART-A
1. What is Google App Engine? (Nov/Dec 2021)
Google App Engine (often referred to as GAE or simply App
Engine) is a web framework and cloud computing platform for
developing and hosting web applications in Google-managed
data centers. Applications are sandboxed and run across multiple
servers
2. What are the key features in Google App Engine application
environment?
dynamic web serving, with full support for common web technologies
persistent storage with queries, sorting and transactions
automatic scaling and load balancing
APIs for authenticating users and sending email using google accounts
a fully featured local development environment that
simulates Google App Engine on users computer
task queues for performing work outside of the scope of a web request
scheduled tasks for triggering events at specified times and regular
intervals
UNIT 1 – 2 MARKS
1. Define cryptography
Cryptography is associated with the process of converting ordinary plain text into
unintelligible text and vice-versa. It is a method of storing and transmitting data in a
particular form so that only those for whom it is intended can read and process it.
Cryptography not only protects data from theft or alteration, but can also be used for user
authentication.
2. Define cryptanalysis.
Techniques used for deciphering a message without any knowledge of the enciphering details
fall into the area of cryptanalysis. Cryptanalysis is what the layperson calls “breaking the
code.”
3. Define security Attack, mechanism and service
• Security attack: Any action that compromises the security of information owned by an
organization.
• Security mechanism: A process (or a device incorporating such a process) that is designed
to detect, prevent, or recover from a security attack.
• Security service: A processing or communication service that enhances the security of the
data processing systems and the information transfers of an organization. The services are
intended to counter security attacks, and they make use of one or more security mechanisms
to provide the service.
4. Distinguish Threat and Attack
Threat -A potential for violation of security, which exists when there is a circumstance,
capability, action, or event that could breach security and cause harm. That is, a threat is a
possible danger that might exploit vulnerability.
Attack -An assault on system security that derives from an intelligent threat; that is, an
intelligent act that is a deliberate attempt (especially in the sense of a method or technique) to
evade security services and violate the security policy of a system.
5. Differentiate active attacks and passive attacks.
A passive attack attempts to learn or make use of information from the system but does not
affect system resources. Two types of passive attacks are the release of message contents and
traffic analysis.
An active attack attempts to alter system resources or affect their operation. It can be
subdivided into four categories: masquerade, replay, modification of messages, and denial of
service.
6. Specify the components of encryption algorithm
Plaintext
Encryption algorithm
Secret key
Cipher text
Decryption algorithm
7. Describe security mechanism.
• Security mechanism: A process (or a device incorporating such a process) that is designed
to detect, prevent, or recover from a security attack.
A block cipher processes the input one block of elements at a time, producing an output block
for each input block. A stream cipher processes the input elements continuously, producing
output one element at a time, as it goes along.
9. What are the essential ingredients of a symmetric cipher?
• Plaintext: This is the original intelligible message or data that is fed into the algorithm as
input.
• Encryption algorithm: The encryption algorithm performs various substitutions and
transformations on the plaintext.
• Secret key: The secret key is also input to the encryption algorithm. The key is a value
independent of the plaintext and of the algorithm. The algorithm will produce a different
output depending on the specific key being used at the time. The exact substitutions and
transformations performed by the algorithm depend on the key.
• Cipher text: This is the scrambled message produced as output. It depends on the plaintext
and the secret key. For a given message, two different keys will produce two different cipher
texts. The cipher text is an apparently random stream of data and, as it stands, is
unintelligible.
• Decryption algorithm: This is essentially the encryption algorithm run in reverse. It takes
the cipher text and the secret key and produces the original plaintext.
10. Specify four categories of security threats
Interruption
Interception
Modification
Fabrication
PART B
1. Tabulate the substitution Techniques in detail. (12)
Definition , example and disadvantages
Caesar cipher
monoalphabetic cipher
playfair cipher
hill cipher
polyalphabetic ciphers –vigenere and vernam cipher
one time pad
2. An active attack attempts to alter system resources or affect their operation. It can be
subdivided into four categories:
masquerade,
replay,
modification of messages, and
denial of service.
UNIT II PART A
1.What is the difference between a block cipher and a stream cipher?
A block cipher processes the input one block of elements at a time, producing an output block
for each input block. A stream cipher processes the input elements continuously, producing
output one element at a time, as it goes along.
2.What is the difference between diffusion and confusion?
In diffusion, the statistical structure of the plaintext is dissipated into long-range statistics of
the ciphertext. This is achieved by having each plaintext digit affect the value of many
ciphertext
digits; generally, this is equivalent to having each ciphertext digit be affected by many
plaintext digits.
confusion seeks to make the relationship between the statistics of the ciphertext and the value
of the encryption key as complex as possible, again to thwart attempts to discover the key.
Thus, even if the attacker can get some handle on the statistics of the ciphertext, the way in
which the key was used to produce that ciphertext is so complex as to make it difficult to
deduce the key. This is achieved by the use of a complex substitution algorithm
3.What are the design parameters of a Feistel cipher?
• Block size
• Key size
• Number of rounds
• Subkey generation algorithm
• Round function F
• Fast software encryption/ Decryption
• Ease of analysis
4.Explain the avalanche effect.
A desirable property of any encryption algorithm is that a small change in either the plaintext
or the key should produce a significant change in the ciphertext. In particular, a change in one
bit of the plaintext or one bit of the key should produce a change in many bits of the
ciphertext. This is referred to as the avalanche effect. If the change were small, this might
provide a way to reduce the size of the plaintext or key space to be searched.
5.What is the strength of DES?
• The use of 56 bit keys
• The nature of DES algorithm
• Timing attacks
6.Define product cipher
product cipher, which is the execution of two or more simple ciphers
in sequence in such a way that the final result or product is cryptographically stronger
than any of the component ciphers.
7.What is substitution and permutation?
Substitution: Each plaintext element or group of elements is uniquely replaced by a
corresponding ciphertext element or group of elements.
Permutation: A sequence of plaintext elements is replaced by a permutation of that
sequence. That is, no elements are added or deleted or replaced in the sequence, rather the
order in which the elements appear in the sequence is changed
8.Give 5 modes of operation in block cipher
• Electronic Codebook(ECB)
• Cipher Block Chaining(CBC)
9.State advantages of counter mode.
*Hardware Efficiency
* Software Efficiency
*Preprocessing
* Random Access
* Provable Security
* Simplicity.
10.Define Multiple Encryption.
It is a technique in which the encryption is used multiple times. Eg: Double DES, Triple
DES. In the first instance, plaintext is converted to ciphertext using the encryption algorithm.
This ciphertext is then used as input and the algorithm is applied again. This process may be
repeated through any number of stages.
PART B
4. Perform encryption and decryption using the RSA algorithm, as in Figure 9.5, for the
following:
a. p = 3; q = 11, e = 7;M = 5
b. p = 5; q = 11, e = 3;M = 9
c. p = 7; q = 11, e = 17;M = 8
d. p = 11; q = 13, e = 11;M = 7
e. p = 17; q = 31, e = 7;M = 2
5. In a public-key system using RSA, you intercept the ciphertext C = 10 sent to a user
whose public key is e = 5, n = 35.What is the plaintext M?
6. Users A and B use the Diffie-Hellman key exchange technique with a common prime
q=71 and a primitive root α=7.
a. If user A has private key Xa = 5, what is A’s public key Ya ?
b. If user B has private key Xb=12, what is B’s public key Yb ?
c. What is the shared secret key?
7. Consider a Diffie-Hellman scheme with a common prime q=11 and a primitive root
α=2
a. Show that 2 is a primitive root of 11.
b. If user A has public key Ya = 9, what is A’s private key Xa?
c. If user B has public key Yb = 3, what is the secret key K shared with A?
UNIT III PART A
1.What is a hash in cryptography?
A hash function H accepts a variable-length block of data M as input and produces a fixed-
size hash value h= H(M) called as message digest as output. It is the variation on the message
authentication code
2.What is the role of a compression function in a hash function?
The hash algorithm involves repeated use of a compression function f, that takes two inputs
and produce a n-bit output. At the start of hashing the chaining variable has an initial value
that is specified as part of the algorithm. The final values of the chaining variable is the hash
value usually b>n; hence the term compression
3.What is cryptography hash function?
The kind of hash function needed for security applications is referred to as a cryptographic
hash function. A cryptographic hash function is an algorithm for which it is computationally
infeasible (because no attack is significantly more efficient than brute force) to find either (a)
a data object that maps to a pre-specified hash result (the one-way property) or (b) two data
objects that map to the same hash result (the collision-free property). Because of these
characteristics, hash functions are often used to determine whether or not data has changed
4.What are the applications of cryptographic hash function?
Message Authentication
Digital Signatures
pseudorandom function (PRF) or a pseudorandom number generator (PRNG).
(R2017)
CS8079 HUMAN COMPUTER INTERACTION
OBJECTIVES:
To learn the foundations of Human Computer Interaction.
To become familiar with the design technologies for individuals and
persons with disabilities.
To be aware of mobile HCI.
To learn the guidelines for user interface.
TEXT BOOKS:
1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, ―Human
Computer Interaction‖, 3rd Edition, Pearson Education, 2004 (UNIT I, II &
III)
2. Brian Fling, ―Mobile Design and Development‖, First Edition, O‘Reilly
Media Inc., 2009 (UNIT – IV)
3. Bill Scott and Theresa Neil, ―Designing Web Interfaces‖, First Edition,
O‘Reilly, 2009. (UNIT-V)
Unit –I - FOUNDATIONS OF HCI
PART - A
1. What is HCI ?(Understanding)
HCI (human-computer interaction) is the study of how people interact with
computers and to what extent computers are or are not developed for successful
interaction with human beings.
Human–computer interaction researches the design and use of computer
technology, focused on the interfaces between people (users) and computers.
Researchers in the field of HCI both observe the ways in which humans interact
with computers and design technologies that let humans interact with computers
in novel ways.
9. Define Problem Solving & list the theories involved in problem solving
(Understanding)
Problem solving is the process of finding a solution to an unfamiliar task,
using the knowledge we have. Human problem solving is characterized by the
ability to adapt the information we have to deal with new situations.
Theories involved in problem solving
1. Gestalt theory
2. Problem space theory
3. Analogy – mapping knowledge relating to a similar known domain to the
new problem – called analogical mapping.
10. List the steps involved execution/evaluation loop(Understanding)
PART – B
3. Define Scenarios(Understanding)
Scenarios are the simplest design representation, but one of the most flexible and
powerful. Some scenarios are quite short and others are focused more on
describing the situation or context.
8. What are the two issues in structure with respect to Navigation design?
(Understanding)
The two issues in structure are:
Local structure : looking from one screen or page out
Global structure : structure of site, movement between screens
2. Define GOMS(Understanding)
The GOMS model is an acronym for Goals, Operators, Methods and Selection. A
GOMS description consists of these four elements:
Goals These are the user’s goals, describing what the user wants to achieve. Operators
These are the lowest level of analysis. They are the basic actions that the user must
perform in order to use the system.
Methods: It is decomposition of a goal into subgoals/operators. For instance, in a
certain window manager a currently selected window can be closed to an icon either
by selecting the ‘CLOSE’ option from a pop-up menu, or by hitting the ‘L7’ function
key
Selection: It is means of choosing between competing methods
3. Define mobile platform & its types? (or) Identify the categories of
mobile platforms? (Apr/May ’17) (Understanding)
A mobile platform
provide access to the devices.
run software and services on each of these devices
is a core programming language in which all of your software is written.
three types : 1) licensed, 2) proprietary, 3) open source.
PART – B
1. Describe the following (Understanding)
a. Mobile EcoSystem
b. Platforms
2. What are Application Framework and explain in detail(Understanding)
3. Appraise the types of mobile applications with examples (Apr/May ’17)
4. Explain the various mobile information architecture(Understanding)
5. List and explain the elements of mobile design (Apr/May ’17)
6. Explain briefly about mobile information architecture. (Nov/Dec ’17)
(April/May 2018)
7. Elaborate on Mobile application medium types (Remember) (Nov/Dec ’18)
8. With neat diagram of mobile ecosystem, discuss its platforms and application
frameworks. (Remember) (Apr/May ’19)
9. List and explain the elements of mobile interface design. ( Nov/Dec’17)
a. (Apr/May 2019) (Analyze)
10. Discuss the various elements of Mobile Design with a step by step method
explain how to design an registration page for movie ticket
booking.(Analyze)(April/May 2018)
1. Discuss about the bioelectric signal which is responsible for the electrical activity of
Neurons (ENG)
2. Discuss about the bioelectric signal which is responsible for the electrical activity of
Brain (EEG)
3. Explain in detailed about the bioelectric signal which give details of the functions of
Eye (EOG)
4. Discuss about the bioelectric signal which is responsible for the electrical activity of
Nerves and muscles of the stomach (EGG)
5. There are some difficulties in analysis of the bio electric signal, Discuss the problem in
detailed also mention about the term action potential and Evoked potential.
6. What are the various types of electrodes used for recording of ECG signal?
Explain the ‘polarization’ phenomenon as applicable to bio-electric electrodes.
Give example of a non-polarizing electrode used for ECG recording.
[Nov / Dec 2020]
7. Define contact potential. What are the factors on which contact potential depends?
How we can reduce the contact potential? Illustrate with the help of a diagram
the origin of electromyogram signal and give its characteristic values in terms of
amplitude and frequency. [Nov / Dec 2020]
UNIT – II
BIO-CHEMICAL AND NON ELECTRICAL PARAMETER MEASUREME
PART- A
1. What are the typical values of blood pressure and pulse rate of an adult? Nov/Dec.2012
Systolic (maximum) blood pressure in the normal adult is in the range of 95 to145 mm
Hg, with 120 mm Hg being average. Diastolic (lowest pressure between beats) blood
pressure ranges from60 to 90 mm Hg, 80 mm Hg being average.
2. What are systolic and diastolic pressures
The heart’s pumping cycle is divided into two major parts systole and diastole. Systole
is defined as the period of contraction of the heart muscles specifically the ventricular
muscle at which time blood is pumped into the pulmonary artery and the aorta.
Systolic pressure is 120mm Hg(average value). Diastole is the period of dilation of the
heart cavities as they fill with blood. Diastolic pressure is 80 mm Hg (average value).
3. What is the reason for decrease of cardiac output?
The reason for decrease of cardiac output may be due to low blood pressure, reduced
tissue oxygenation, poor renal function, shock and acidosis.
4. Define– Cardiac Output
Cardiac output is defined as the amount of blood delivered by the heart to the aorta per
minute. In case of adults during each beat, the amount of blood pumped ranges from
70 to 100 ml. for normal adults the cardiac output is about 4- 6 liters / minute.
5. State the principle behind the indicator dilution method.
The indicator dilution method is based on the principle that a known amount of dye or
radioisotope as an indicator is introduced with respect to time at the measurement site,
so the volume flow of blood can be estimated.
6. What is residual volume? May /June 2007
Residual volume is the volume of gas remaining in the lungs at the end of maximum
expiration.
7. Define– Tidal Volume
Tidal volume is also called as normal depth volume of breathing or is the volume of
gas inspired or expired during each normal quiet respiration cycle.
8. What is total lung capacity?
The total lung capacity is the amount of gas contained in the lungs at the end of
maximal inspiration.
9. Define– Vital Capacity
The vital capacity (VC) is the maximum volume of gas that can be expelled from the
lungs after a maximal inspiration.
10. What is electrophoresis? April / May 2010
Electrophoresis is a method for separating and analyzing macromolecular substances
such as plasma proteins. The method is based on the fact that, the molecules carry
electric charges and therefore migrate in a electric field.
PART - B
1. Draw the schematic diagram of an automated continuous flow type analysis
system and explain in brief the working of each of the building block.
[Nov / Dec 2020]
2. What is blood pCO2 and how is it measured? Draw the construction of blood
pO2 electrode and the circuit diagram for measurement of signal developed at the
electrode and explain the technique for measuring blood pO2.
[Nov / Dec 2020]
3. Describe the different methods of analysis of respiratory gases. Explain impedance
pneumography for measurement of respiratory function. What are the limitations
of this method? Is it suitable to analyze patients affected with COVID-19?
4. Explain the block diagram and working of colorimeter.
5. Explain auscultator blood pressure measurement and write its advantages and
disadvantages.
6. How lung volume can be measured? Explain with necessary diagram.
7. Define the term cardiac output? How is cardiac output measured by dilution
techniques?
UNIT – III
ASSIST DEVICES
PART - A
1. Give two important factors that demand internal pace maker’s usage. [A/M2005]
The two important factors that demand internal pace maker’s usage are
Type and nature of the electrode used
Nature of the cardiac problems.
Mode of operation of the pacemaker system.
2. Classify Pacing modes [ N/D 2007]
Based on the modes of operation of the pacemakers, they can be classified into
five types. They are:
i)Ventricular asynchronous pacemaker(fixed rate pacemaker)
ii) Ventricular synchronous pacemaker
iii) Ventri defibrillator inhibited pacemaker
iv) Atrial synchronous pacemaker
v) Atrial sequential ventricular inhibited
3. What are the batteries used for implantable pacemaker? [N/D 2012]
The batteries used for implantable pacemakers are
(i)Mercury cell (ii) Lithium cells (iii) Nuclear cell DC Defibrillator
4. What types of electrodes are used in a defibrillator? [A/M 2005]
The electrodes used in a defibrillator are (i) Internal electrodes - Spoon shaped
(ii)External electrodes -Paddle shaped
5. What are the three types of exchangers used in HEMODIALYSIS system? [M/J 2005]
The three types of exchangers used in HEMODIALYSIS systems are i)Parallel
Flow dialyzer (ii)Coil Hemodialyser (iii)Hollow Fiber Hemodialyser
6. What is meant by fibrillation? [M/J 2009][A/M 2010]
The condition at which the necessary synchronizing action of the heart is lost is
known as fibrillation. During fibrillation the normal rhythmic contractions of either
atria or the ventricles are replaced by rapid irregular twitching of the muscular wall
7. What is the modulation techniques used for biotelemetry?
The two different modulation techniques used for biotelemetry are
i)Double Modulation ii)Pulse Width Modulation
8. What are the advantages of biotelemetry system? [M/J 2007] [M/J 2009]
The advantages of biotelemetry systems
are(i) It is used to record the biosignals over long periods and while the Patient is enga
ged in his normal activities.
(ii) The medical attendant or computer can easily diagnose the nature of Disease by
seeing the telemeter bio signals without attending patient Room(iii) Patient is not
disturbed during recording(iv) For recording on animals, particularly for research, the
biotelemetry is greatly used.
9. Specify the frequencies used for biotelemetry. [N/D 2012]
Wireless telemetry system uses modulating systems for transmitting
biomedical signals. Two modulators are used here. A lower frequency sub-carrier is
employed in addition to very-high frequency (VHF). This transmits the signal from the
transmitter
10. What is a radio-pill? [N/D 2009][A/M 2010][M/J 2012]
The radio pill is capable of measuring various parameters that are available in
the tract. With the help of radio pill type devices, it is possible for us to measure or
sense temperature, pH, enzyme activity and oxygen tension values. These
measurements can be made in association with transducers. Pressure can be sensed by
using variable inductance and temperature can be measured by using temperature-
sensitive transducer
PART - B
1. Explain the working of a ventricular synchronous demand pacemaker with the help
of a block diagram. [Nov / Dec 2020]
2. How is ultrasound generated? Explain the role of frequency, focusing and active
element diameter with reference to ultrasound transducers. [Nov / Dec 2020]
3. Distinguish between Internal and External Pacemaker.
4. Discuss with suitable diagram the various modes of operation of cardiac pacemaker.
5. Explain briefly on ultrasonic imaging systems.
6. Define the term "Cardiac Output". How is cardiac Output measured by dye
dilution technique? Explain.
7. Distinguish between Internal and External Defibrillation.
UNIT- IV
PHYSICAL MEDICINE AND BIOTELEMETRY
PART - A
1. What is meant by diathermy? [A/M 2010]
Diathermy is the treatment process by which, cutting coagulation of tissues are
obtained.
2. List the types of diathermy.
The types of diathermy are
i) Short wave diathermy
ii)Microwave diathermy
iii)Ultrasonic diathermy
iv)Surgical diathermy
3. What are the types of thermography?
The types of thermography are
i) Infrared thermography
ii) Liquid crystal thermography
iii) Microwave thermography
4. Define - Endoscopes and mention some of its types.
Endoscope is a tubular optical instrument to inspect or view the body cavities
which are notvisible to the naked eye normally.
Types of endoscopes are cardioscope, bronchoscope, laparoscope, otoscope, gastroscope
etc.
5. What are the two methods of shortwave diathermy?
The two methods of shortwave diathermy are
i) Capacitive method
ii) Inductive method
6. What is the modulation techniques used for biotelemetry? Mention the reason for
adopting that modulation scheme.[N/D 2004]
The two different modulation techniques used for biotelemetry
Double Modulation
Pulse Width Modulation
The purpose behind this double modulation, it gives better interference free
performance in transmission, and this enables the reception of low frequency biological
signals. The sub modulators can be a FM (frequency modulation) system, or a PWM
(pulse width modulation) system or a final modulator is practically always an FM
system.
Output unit
8. What are the advantages of biotelemetry system? [M/J 2007] [M/J 2009]
The advantages of biotelemetry systems are
i. It is used to record the bio signals over long periods
ii. The medical attendant or computer can easily diagnose the nature of
Disease by seeing thetelemeter bio signals without attending patient
Room
iii. Patient is not disturbed during recording
iv. For recording on animals, particularly for research, the biotelemetry is
greatly used
9. Specify the frequencies used for biotelemetry.[N/D 2012]
Wireless telemetry system uses modulating systems for transmitting biomedical
signals. Two modulators are used here. A lower frequency sub-carrier is employed in
addition to very- high frequency (VHF). This transmits the signal from the transmitter.
10. What are the application techniques in short – wave diathermy machines?
Why the pulse therapy is preferred? [Nov / Dec 2020 ]
1. Condenser shortwave diathermy (high-frequency electrical field)
2. Induction shortwave diathermy (high-frequency magnetic field)
Pulse therapy was introduced to minimize the side effects of conventional
corticosteroid therapy.
PART - B
1. Explain the principle of surgical diathermy. Draw the block diagram of a surgical
diathermy machine. And explain each block present, also state why do we use isolated
circuit in the output circuit? [Nov / Dec 2020]
2. State the application technique of ultrasound therapy. Explain the working of an
ultrasonic therapy unit with the help of a block diagram. [Nov / Dec 2020]
3. What is the application of diathermy?
4. Explain the working of a biotelemetry system with sub-carrier.
5. What is telemetry? Mention the application of telemetry.
6. Explain the working principle of a diathermy unit with a neat block diagram.
7.Draw the block diagram of short wave and microwave diathermy and explain in detail.
UNIT- V
RECENT TRENDS IN MEDICAL INSTRUMENTATION
PART - A
3. How does lab on a chip work? State its advantages. [ Nov / Dec 2020 ]
A lab-on-a-chip is a miniaturized device that integrates into a single chip one or
several analyses, which are usually done in a laboratory; analyses such as DNA sequencing
or biochemical detection.
Advantages:
• Low fluid volumes consumption (less waste, lower reagents costs and less required
sample volumes for diagnostics)
• faster analysis and response times due to short diffusion distances, fast heating, high
surface to volume ratios, small heat capacities.
• better process control because of a faster response of the system (e.g. thermal control
for exothermic chemical reactions)
• compactness of the systems due to integration of much functionality and small
volumes
• massive parallelization due to compactness, which allows high-throughput analysis
• lower fabrication costs, allowing cost-effective disposable chips, fabricated in mass
production[18]
• part quality may be verified automatically[19]
• safer platform for chemical, radioactive or biological studies because of integration of
functionality, smaller fluid volumes and stored energies.
4. List the types of lasers used in medical field.
The types of lasers used in medical fields are
i). Pulsed Nd-YaG laser
ii). Continuous laser. Co2 laser
iii). Continuous wave organ ion laser.
5. What are the advantages of performing surgery using LASER?
The advantages of performing surgery using LASER are
Highly sterile
Non-contact surgery
Highly localized and precise
Prompt surgery
Short period of surgical time
6. Mention the blocks in BMI.
Signal acquisition
Signal preprocessing
Feature extraction
Classification (Detection)
Application interface
A lab on chip is a miniaturized device that integrates onto a single chip one or
several analyses, which are usually done in a laboratory, analyses such as DNA
sequencing or biochemical detection.
10. What is brain machine interface?
PART - B
1. What are the typical communication services available for use in telemedicine system?
Explain the type of information which is essentially transmitted in a telemedicine
system with their advantages and limitations. [Nov / Dec 2020]
2. What is an insulin pump? Describe with a neat block diagram, the working of a
programme controlled insulin-dosing device. [Nov / Dec 2020]
3. What are the common methods used for modulation in bio-telemetry system?
Describe the working of a generalized FM telemetry transmitter with an example
scenario. [Nov / Dec 2020]
4. Explain in detail on telemedicine.
5. Discuss about the working principle of insulin pumps
6. Draw the detail block diagram of Radio Pill.
7. Write short notes on Brain machine interface.
MG8591- PRINCIPLES OF MANAGEMENT
IV/7 SEM
UNIT 1
INTRODUCTION TO MANAGEMENT AND ORGANIZATIONS
PART A
5. What are the essential skills needed for the managers? (May/June2012)
o Technical Skill
o Human Skill
o Conceptual Skill
S. No Administration Management
PART A
1. Define planning. (Nov/Dec2008 & 2009, April/May 2019)
Planning is the process of selecting the objectives and determining the course of action
required to achieve these objective.
8. What are the different types of plans? Or classify various plans. (Nov/Dec2012)
PART A
7. What are the limitations of line and staff authority? (Nov/Dec 2015)
o Advices ignored
o Encourages carelessness
o Expensive
o Conflict between line and staff
8. Why performance management is important? (April 2017)
Performance management is important because it ensures that the employees
understand the importance of their contributions to the organizational goals and objects
and also ensures that each employee understands what is expected from them and
equally ascertaining whether the employees possess the required skills and support for
fulfilling such expectations.
.
PART B
1. Explain the difference between line and staff organization with an examples.
Discuss its merits and demerits. (13) (May 2014, Nov 2014, Nov/Dec 2013)
2. What is departmentation ? Bring out the features of departmentation and explain
eachwith suitable example.(13) (April 2014, Nov/Dec 2016)
3. Elucidate any four types of organization. (13) (Nov/Dec 2017)
4. Explain the difference between centralization and decentralization. (13)
5. Explain nature and purpose of organization. (13) (April 2016)
6. Explain the various sources of Recruitment. Compare their merits and demerits. (13)
7. Explain the benefits and limitations of decentralization in detail. (13) (Nov/Dec 2016)
UNIT IV
DIRECTING
PART A
.
7. What is non-verbal communication?(Nov/Dec2010,Nov/Dec2011)
Nonverbal communication between people is communication through sending and
receiving wordless cues Facial expression, eye contact, dress, posture, gesture,
handshakes, phonemics, chronometry etc
People are able to think more freely and they suggest many spontaneous new ideas as
possible.
PART B
PART A
PART B
PART A
&
PART-B
1
SOFTWARE PROJECT MANAGEMENT
UNIT I
INTRODUCTION TO SOFTWARE PROJECT MANAGEMENT
PART-A
1) What is software project management?
Ans: Software project management is the art and science of planning and leading software projects.
It is a sub discipline of project management in which software projects are planned, monitored and
controlled.
2) What is a project?
Ans: A project is defined as:
• A specific plan or design.
• A planned undertaking.
• A large undertaking. Example: Public works scheme
7) What is planning?
Ans: It is an act of formulating a program for a definite course of action “the planning was more fun
than the trip itself’. Planning in short in defined as “deciding what is to be done”.
2
SOFTWARE PROJECT MANAGEMENT
3
SOFTWARE PROJECT MANAGEMENT
PART-B
(NOV/DEC 2014,2013,AU-2008/10)
6. What are the different evaluation techniques used for cost-benefit analysis?
4
SOFTWARE PROJECT MANAGEMENT
UNIT II
PROJECT EVALUATION
5
SOFTWARE PROJECT MANAGEMENT
PART-B
1. What is Software Process? Explain different Software process models used in Software
development.
2. What is RAD? Explain the RAD Model Design along with a neat diagram.
5. What are the different Cost Estimation techniques used in Software Development.
(NOV/DEC-2013,MAY/JUNE,NOV/DEC-2014,AU-2008/10)
6
SOFTWARE PROJECT MANAGEMENT
UNIT III
ACTIVITY PLANNING
7
SOFTWARE PROJECT MANAGEMENT
PART-B
1. Explain the different network planning models. Give example for precedence construction.
(Nov/Dec 2012).
4. Explain the various steps involved in activity planning with its objectives.(Nov/Dec 2013)
5. Describe the steps involved in sequencing and scheduling activities in a planning model. Give
examples.(May/Jun 2014)
6. Differentiate between PERT and CPM and also explain the steps involved in construction give the
7. Explain the various steps involved in resource allocation along with creation of critical patterns.
8
SOFTWARE PROJECT MANAGEMENT
UNIT IV
MONITORING AND CONTROL
3) What is BCWS?
Ans: The budgeted cost of tasks as scheduled in the project plan, based on the costs of resources assigned
to these tasks, plus any fixed costs associated with the tasks, called
“The Budgeted cost of work Schedule” BCWS. It is the baseline cost up to the status date you choose.
6) What is cost performance index (CPI) and schedule performance index (SPI)?
Ans: Cost performance index is the ratio of budgeted costs to actual costs.
CPI=BCWP
ACWP Schedule performance index is the ratio of work performed to work schedule
SPI=BCWP/BCWS
9
SOFTWARE PROJECT MANAGEMENT
PART-B
2. What are the typical stages in awarding a contract. (May 2013, April 2016)
3. Outline the various steps involved in change control procedure. (Nov 2014)
4. Describe the various ways in visualizing the progress of the project. (Dec 2012)
5. Explain the change control process applicable for an operational system. (Jun 2012)
6. Explain the advantages and disadvantages of fixed price contract model. (Jun 2012)
10
SOFTWARE PROJECT MANAGEMENT
UNIT V
MANAGING PEOPLE AND ORGANIZING TEAMS
1) What is milestone?
Ans: A milestone is a significant event in a project, usually associated with a major work product or
deliverable. Stages or phases are not milestones but are collections of related product activities.
11
SOFTWARE PROJECT MANAGEMENT
PART-B
2. Describe the best methods of staff selection and its merits and demerits.(April 2017)
3. What are the five factors and methods of motivation suggested by the oldharn-Hackman job
characteristics model.
5. Explain different types of team structures used in the project management. (April 2017)
b) Communication Genres.
12
CS8080 INFORMATION RETRIEVAL TECHNIQUES
BRANCH : CSE
SEM-VIII
REG-2017
UNIT I – INTRODUCTION
PART - A
PART – B
PART - A
PART – B
1. Explain Boolean Retrieval model and Vector space model with a neat diagram. [April/May
2021]
2. Summarize a comparative study on Latent semantic indexing model and Neural
network model. [April/May 2021]
3. i)Explain Latent Semantic Indexing and latent semantic space with an illustration. ii) Analyze
the use of LSI in Information Retrieval. What is its need in synonyms and semantic
relatedness?
4. i) Discuss the structure of inverted indices and the basic Boolean Retrieval model ii)Discuss
the searching process in inverted file
5. i) Explain in detail about binary independence model for Probability Ranking
Principle(PRP). ii) Analyze how the query generation probability for query likelihood model
can be estimated.
6. Create a Relevance feedback mechanism for your college website search in the internet.
7. What is IR model ? What are the types IR model? Explain each with an example.
PART – B
PART - A
SEO Pay-Per-click
PART – B
PART - B
1. Classify and explain recommendation techniques with suitable examples and list it’s
advantages and disadvantages. [April/May 2021]
2. Explain about Matrix Factorization and narrate in detail about Neighborhood models.
[April/May 2021]
3.Differentiate collaborative filtering and content based systems.
4. i) Detailed the rules of HLA ii) Difference between Hybrid and Collaborative Recommendation.
5. Define Recommendation based on User Ratings using appropriate example.
6. i) Describe web based recommendation system ii) When can Collaborative Filtering be used?
7. Explain the different types of recommendation system.
1. Explain the four important functions, the information security performs in an organization
2. What are deliberate acts of Espionage or tresspass. Give examples. NOV/DEC 2018
3. Explain in detail the different types of cryptanalytic attacks
4. Enumerate different types of attacks on computer based systems APR/MAY 2018
5. Explain in detail the Legal, Ethical and Professional issues during the security investigation
6. What are threats? Explain the different categories of threat
7. What is the code of ethics to be adhered to by the information security personnel stipulated by
different professional organizations? APR/MAY 2018
8. What is Intellectual property? How it can be protected?
UNIT - II
PART - A
1. What are the four important functions, the information security performs in an organization?
Information security performs four important functions for an organization:
1. Protects the organization’s ability to function
2. Enables the safe operation of applications implemented on the organization’s
IT systems
3. Protects the data the organization collects and uses
4. Safeguards the technology assets in use at the organization
2. What are threats? Apr/May 2017
a. A threat is an object, person, or other entity that represents a constant danger to an asset
b. Management must be informed of the various kinds of threats facing the organization
c. By examining each threat category in turn, management effectively protects its information
through policy, education and training, and technology controls
3. What is Intellectual property? Nov/Dec 2019
Intellectual property is “the ownership of ideas and control over the tangible or virtual
representation of those ideas” . Many organizations are in business to create intellectual property
1. trade secrets
2. copyrights
3. trademarks
4. patents
4. How Intellectual property can be protected?
Enforcement of copyright has been attempted with technical security mechanisms,such as using
digital watermarks and embedded code.The most common reminder of the individual’s obligation
to fair and responsible use is the license agreement window that usually pops up during the
installation of a new software.
5. What is deliberate acts of espionage or trespass? Apr/May 2017
a. Broad category of activities that breach confidentiality
1. Unauthorized accessing of information
2. Competitive intelligence vs. espionage
3. Shoulder surfing can occur any place a person is accessing confidential
information
b. Controls implemented to mark the boundaries of an organization’s virtual territory giving
notice to trespassers that they are encroaching on the organization’s cyberspace
c. Hackers uses skill, guile, or fraud to steal the property of someone else
6. What is deliberate acts of sabotage and vandalism? Apr/May 2018
• Individual or group who want to deliberately sabotage the operations of a computer system or
business, or perform acts of vandalism to either destroy an asset or damage the image of the
organization
• These threats can range from petty vandalism to organized sabotage
• Organizations rely on image so Web defacing can lead to dropping consumer confidence and
sales
• Rising threat of hacktivist or cyber-activist operations – the most extreme version is cyber-
terrorism
7. What are the deliberate acts of theft?Nov/Dec 2019
• Illegal taking of another’s property - physical, electronic, or intellectual
• The value of information suffers when it is copied and taken away without the owner’s
knowledge
• Physical theft can be controlled - a wide variety of measures used from locked doors to guards
or alarm systems
• Electronic theft is a more complex problem to manage and control - organizations may not even
know it has occurred
8. What is an attack?
a. An attack is the deliberate act that exploits vulnerability
b. It is accomplished by a threat-agent to damage or steal an organization’s information or
physical asset
1. An exploit is a technique to compromise a system
2. A vulnerability is an identified weakness of a controlled system whose
controls are not present or are no longer effective
3. An attack is then the use of an exploit to achieve the compromise of a
controlled system
9. What is Denial-of-service (DoS) ? APR/MAY 2018
a. attacker sends a large number of connection or information requests to a target
b. so many requests are made that the target system cannot handle them successfully along
with other, legitimate requests for service
c. may result in a system crash, or merely an inability to perform ordinary functions
10. Define Spoofing. Apr/May 2018
It is a technique used to gain unauthorized access whereby the intruder sends messages to a
computer with an IP address indicating that the message is coming from a trusted host
PART B
1. What are dual homed host firewalls? Explain APR/MAY 2018
2. What deliberate software attacks?
3. What are different US laws and International laws on computer based crimes? NOV/DEC 2018
4. Who are Hackers? Explain its levels
5. Explain the attack replication vectors. APR/MAY 2018
6. Discuss in detail the forces of Nature affecting information security
7. Explain deliberate software attacks
8. Explain Denial-of-service (DoS) ? NOV/DEC 2019
UNIT- III
PART- A
1. What is risk management?
Risk management is the process of identifying vulnerabilities in an organization’s information
systems and taking carefully reasoned steps to assure
• Confidentiality
• Integrity
• Availability
of all the components in the organization’s information systems
2. What the roles to be played by the communities of interest to manage the risks an
organization encounters? NOV/DEC 2018
It is the responsibility of each community of interest to manage risks; each community has a role to
play:
• Information Security
• Management and Users
• Information Technology
3. What is the process of Risk Identification? APR/MAY 2017
A risk management strategy calls on us to “know ourselves” by identifying, classifying, and
prioritizing the organization’s information assets
These assets are the targets of various threats and threat agents and our goal is to protect them from
these threats
4. Define data classification and management.
• A variety of classification schemes are used by corporate and military organizations
• Information owners are responsible for classifying the information assets for which they are
responsible
• Information owners must review information classifications periodically
• The military uses a five-level classification scheme but most organizations do not need the
detailed level of classification used by the military or federal agencies
5. How to identify and Prioritize Threats? APR/MAY 2018
• Each threat must be further examined to assess its potential to impact organization - this is
referred to as a threat assessment
• To frame the discussion of threat assessment, address each threat with a few questions:
• Which threats present a danger to this organization’s assets in the given environment?
• Which threats represent the most danger to the organization’s information?
• How much would it cost to recover from a successful attack?
• Which of these threats would require the greatest expenditure to prevent?
6. Give an example of Risk determination. NOV/DEC 2018
For the purpose of relative risk assessment:
• risk = likelihood of vulnerability occurrence times value (or impact) -
• percentage risk already controlled + an element of uncertainty
• Information Asset A has an value score of 50 and has one vulnerability:
• Vulnerability 1 has a likelihood of 1.0 with no current controls and you estimate that
assumptions and data are 90 % accurate
• Asset A: vulnerability rated as 55 = (50 * 1.0) – 0% + 10%
7. What is residual risk?
• For each threat and its associated vulnerabilities that have any residual risk, create a preliminary
list of control ideas
• Residual risk is the risk that remains to the information asset even after the existing control has
been applied
8. What is access control? APR/MAY 2017
• One particular application of controls is in the area of access controls
• Access controls are those controls that specifically address admission of a user into a trusted
area of the organization
• There are a number of approaches to controlling access
• Access controls can be - discretionary , mandatory , nondiscretionary
9. What are the different types of Access Controls?
• Discretionary Access Controls (DAC)
• Mandatory Access Controls (MACs)
• Nondiscretionary Controls
• Role-Based Controls
• Task-Based Controls
• Lattice-based Control
10. Define Business Continuity Plan APR/MAY 2019
The BCP is the most strategic and long term of the three plans. It encompasses the continuation of
business activities if a catastrophic event occurs,such as the loss of an entire database,building or
entire operations center. The BCP includes the planning the steps necessary to to ensure the
continuation of the organization when the scope or scale of a disaster exceeds the ability of the DRP
to restore operations.
PART - B
1. Discuss in detail the process of assessing and controlling risk management issues
2. What is risk management? Why is the identification of risks by listing assets and vulnerabilities
is so important in the risk management process?
3. Explain in detail the three types of Security policies (EISP,ISSP and sysSP).
4. Explain the roles to be played by the communities of interest to manage the risks an
organization encounters APR/MAY 2018
5. Explain the process of Risk assessment APR/MAY 2017
6. Explain how the risk controls are effectively maintained in an organization
7. Write short notes on
a)Incidence Response Plan b)Disaster Recovery Plan c)Business continuity plan
8. Explain in detail the process of asset identification for different categories APR/MAY 2018
UNIT - IV
PART - A
1. What is a policy?
A policy is a plan or course of action, as of a government, political party, or business, intended
to influence and determine decisions, actions, and other matters
2. What are the three types of security policies?
Management defines three types of security policy:
General or security program policy
Issue-specific security policies
Systems-specific security policies
3. Define Issue-Specific Security Policy (ISSP) APR/MAY 2017
The ISSP:
addresses specific areas of technology
requires frequent updates
contains an issue statement on the organization’s position on an issue
4. What are ACL Policies? NOV/DEC 2018
ACLs allow configuration to restrict access from anyone and anywhere
ACLs regulate:
1. Who can use the system
2. What authorized users can access
3. When authorized users can access the system
4. Where authorized users can access the system from
5. How authorized users can access the system
5. What is Information Security Blueprint?
The Security Blue Print is the basis for Design,Selection and Implementation of Security
Policies,education and training programs,and technology controls.
6. Define ISO 17799/BS 7799 Standards and their drawbacks APR/MAY 2018
One of the most widely referenced and often discussed security models is the Information
Technology – Code of Practice for Information Security Management, which was originally
published as British Standard BS 7799
This Code of Practice was adopted as an international standard by the International
Organization for Standardization (ISO) and the International Electrotechnical Commission
(IEC) as ISO/IEC 17799 in 2000 as a framework for information security
7. What are the objectives of ISO 17799? 1. APR/MAY 2017
Organizational Security Policy is needed to provide management direction and support
Objectives:
1. Operational Security Policy
2. Organizational Security Infrastructure
3. Asset Classification and Control
4. Personnel Security
5. Physical and Environmental Security
6. Communications and Operations Management
7. System Access Control
8. System Development and Maintenance
9. Business Continuity Planning
10. Compliance
8. What is the alternate Security Models available other than ISO 17799/BS 7799?
1. Another approach available is described in the many documents available
from the Computer Security Resource Center of the National Institute for
Standards and Technology (csrc.nist.gov) – Including:
2. NIST SP 800-12 - The Computer Security Handbook
3. NIST SP 800-14 - Generally Accepted Principles and Practices for Securing
IT Systems
4. NIST SP 800-18 - The Guide for Developing Security Plans for IT Systems
9. What is Defense in Depth? APR/MAY 2018
1. One of the foundations of security architectures is the requirement to
implement security in layers
2. Defense in depth requires that the organization establish sufficient security
controls and safeguards, so that an intruder faces multiple layers of controls
10. What is Systems-Specific Policy (SysSP)?
SysSPs are frequently codified as standards and procedures used when configuring or
maintaining systems
Systems-specific policies fall into two groups:
Access control lists (ACLs) consist of the access control lists, matrices, and capability tables
governing the rights and privileges of a particular user to a particular system
PART – B
1. What are ISO 7799 and BS7799? Explain their different sections and salient features.
2. Explain salient features of NIST security models. APR/MAY 2018
3. Explain how information security policy is implemented as procedure
4. What are the three types of security policies? Explain NOV/DEC 2018
5. List the styles of security architecture models. Discuss them in detail
6. Explain the key technological components used for security implementation
7. Write short notes on APR/MAY 2017
a. Defense in depth
b. Security perimeter
8. Write short notes on
Incident Response plan(IRP)
Disaster Recovery Plan
Business Continuity Plan
UNIT – V
PART – A
1. What are firewalls?
A firewall is any device that prevents a specific type of information from moving between the
untrusted network outside and the trusted network inside
The firewall may be:
a separate computer system
a service running on an existing router or server
a separate network containing a number of supporting devices
2. Explain different generations of firewalls. NOV/DEC 2018
First Generation - packet filtering firewalls
Second Generation-application-level firewall or proxy server
Third Generation- Stateful inspection firewalls
Fourth Generation-dynamic packet filtering firewall
Fifth Generation- kernel proxy
3. Define stateful inspection firewall APR/MAY 2018
It keeps track of each network connection established between internal and external systems using a
state table which tracks the state and context of each packet in the conversation by recording which
station sent what packet and when
4. How firewalls are categorized by processing mode?
The five processing modes are
a. Packet filtering
b. Application gateways
c. Circuit gateways
d. MAC layer firewalls
e. Hybrids
5. What are Screened-Subnet Firewalls? NOV/DEC 2018
Consists of two or more internal bastion-hosts, behind a packet-filtering router, with each host
protecting the trusted network
The first general model consists of two filtering routers, with one or more dual-homed bastion-
host between them
The second general model involves the connection from the outside or untrusted network
6. What are the recommended practices in designing firewalls?
All traffic from the trusted network is allowed out
The firewall device is always inaccessible directly from the public network
Allow Simple Mail Transport Protocol (SMTP) data to pass through your firewall, but insure it
is all routed to a well-configured SMTP gateway to filter and route messaging traffic securely
All Internet Control Message Protocol (ICMP) data should be denied
Block telnet (terminal emulation) access to all internal servers from the public networks
When Web services are offered outside the firewall, deny HTTP traffic from reaching your
internal networks by using some form of proxy access or DMZ architecture
7. What are intrusion detection systems(IDS)?
IDSs work like burglar alarms
IDSs require complex configurations to provide the level of detection and response desired
An IDS operates as either network-based, when the technology is focused on protecting network
information assets, or host-based, when the technology is focused on protecting server or host
information assets
IDSs use one of two detection methods, signature-based or statistical anomaly-based
8. What are different types of IDSs? NOV/DEC 2018
i. Network-based IDS
ii. Host-based IDS
iii. Application-based IDS
iv. Signature-based IDS
v. Statistical Anomaly-Based IDS
9. What are the advantages and disadvantages of using honey pot or padded cell approach?
Advantages:
a. Attackers can be diverted to targets that they cannot damage.
b. Administrators have time to decide how to respond to an attacker.
c. Attackers action can be easily and extensively monitored
d. Honey pots may be effective at catching insiders who are snooping around a network.
Disadvantages:
a. The legal implication of using such devices are not well defined.
b. Honey pots and Padded cells have not yet been shown to be generally useful security
technologies.
c. An exper attacker,once diverted into a decoy system,may become angry and launch a hostile
attack againt an organization’s systems
d. Admins and security managers will need a high level of expertise to use these systems.
PART - B