Skip to main content

Some of the Important Questions for ISAM ( Information storage and Management)(CBCS PE834IT)

·         Describe the evolution of storage technology and architecture

·         Explain Information life cycle management with suitable examples.

·         What are the major factors that affect disk drive performance.

·         What are the components of an intelligent storage system. Explain in details

·         What are the components of SAN? Explain in detail

·         Write a brief notes on cloud computing infrastructure.

·         What are backup typologies?

·         Explain client server model of DAS.

·         List the key characteristics of data center

·         What is structured and unstructured data

·         What is RAID and describe its level? In which condition RAID level used

·         What  do you mean by data categorization?

·         What is storage virtualizations? How is it important? Explain with diagram

·         Explain Cloud Computing architecture? What are the services provide by the cloud? explain with example

·         What is structured and unstructured data? What are the challenges of storing and managing unstructured data?

·         What are the advantages of a virtualized data center over a classic data center

·         Discuss the impact of random and sequential I/O in different RAID configuration

·         How does flow control work in a FC network?

·         Explain how the performance of NAS can be affected in the TCP window size at the sender and receiver are not synchronized

·         Explain Backup and recovery strategy in NAS environments

·         Explain the benefits and challenges of using cloud storage for archiving

·         Write short notes: 1. Cloud challenges 2. SNMP 3.cloud computing Infrastructure

·         Discuss the impact of random and sequential I/O in different RAID configuration

·         Discuss cache coherency mechanism and explain how they address the environment with multiple stared caches.

·         Explain briefly the following: 1. Data 2. Information 3. Information Life Cycle Management (ILM) Implementation 4. ILM benefits

·         Write a short note a different levels of RAID and compare them

·         Write a short note on stripping and mirroring

·         What are the security and limitations of DAS

·         What is NAS? Explain how the performance of NAS can be affected if the TCP window size at the sender and receiver are not synchronized.

·         Discuss various security criticisms in networked storage technologies.

·         What is direct Attached Storage (DAS)? Write down its advantages and dis advantages.

·         Discuss the various factors that affect NAS performance and availability

·         Write down the essential characteristics of cloud computing

·         Give a brief note on cloud architecture

·         Discuss various storage technologies in detail

·         Explain briefly the following 1.  Data categorization 2. Evolution of storage management 3. Storage device

·         What is FC Ports

·         What is soft zoning and hard zoning?

·         Explain NSA and what are the benefits of NAS

·         Explain network file sharing and its components of NAS.

·         What is file sharing protocols

·         Evolution of SAN and  its components of FC SAN

·         What are the type of intelligent storage system

 

 

 

 

 

 

 

 


Comments

Popular posts from this blog

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

  ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK                                         BE III Year II Semester (A & B Sections) –PC 603 CS     Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Why is an algorithm analysis required? 2.       State about UNION & FIND operations. 3.       List out the UNION algorithm using weighting rule. 4.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5.       List and define operations performed on sets? 6.       What do you mean by performance analysis of an algorithm? Explain. 7.       Explain the significance of input size of a problem. 8.       State the weighting, collapsing rules in sets. 9.       Explain set representation and write algorithm for FIND. 10.   Solve T(n)=3T(n/3)+√n. 11.   Define the terms direct recursive and indirect rec

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION   HTML   CSS   WEB APPLICATION FUNDAMENTALS   Unit II XML   Unit III JQuery   JSON Java Script Unit IV AngularJS   Unit V MEAN Stack   SMACK Stack LAB PROGRAMS:  Click Here Important Question for MID I :  Click here WAD Previous Question : Click Here TEXT BOOK:  Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective:     Ø    To develop dynamic web applications using the concepts of HTML 5.0 and   CSS     Ø    To understand the document structure and schemas and represent data in  that format     Ø    To develop applications using Query and represent objects in JSON   notation    

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

  ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Explain linear probing in Hashing with an example. 2.       Define Heap. 3.       List out the collision resolution techniques in hashing. 4.       Why is an algorithm analysis required? 5.       State about UNION & FIND operations. 6.       List out the UNION algorithm using weighting rule. 7.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8.       List and define operations performed on sets? 9.       What do you mean by performance analysis of an algorithm? Explain. 10.   Explain the significance of input size of a problem. 11.   State the weighting, collapsing rules in sets. 12.   Explain set representation and write algorithm for FIND. 17