1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?

Size: px
Start display at page:

Download "1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram?"

Transcription

1 (DMCA 101) ASSIGNMENT - 1, DEC PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of Information Technology in modern business? 2) Define computer? Explain the Block Diagram of computer with a neat diagram? 3) Explain about software and Hardware indetail? 4) Differentiate between RAM & ROM. 5) Write about the following a) Primary memory b) Secondary memory 6) Functions of Internet explorer? 7) Write about TCP/IP? 8) What is e-commerce? 9) Give any two Internet protocols?

2 (DMCA 101) ASSIGNMENT - 2, DEC PAPER- I : INFORMATION TECHNOLOGY 1) Define operating system. Write the functions and features of OS? 2) Write about the following a) CRT b) ISDN c) compiler 3) Explain the role of modern in data communication? 4) Distinguish between Intranet and Extranet? 5) Write about number system? 6) Write about generations of computers? 7) What is network topology. 8) Define Artificial Intelligence. 9) What is IIS?

3 (DMCA 102) ASSIGNMENT - 1, DEC PAPER- II : PROGRAMMING WITH C++ 1) Discuss about variable scope and storage classes 2) Explain various iterative statements with suitable example 3) Define a string. Explain about different string manipulations 4) Describe the structure of a C++ program 5) Explain about different types of access specifiers 6) Distinguish between printer and reference variable in C++ 7) Explain late binding and early binding 8) What is an identifier 9) Write syntax of else-if ladder

4 (DMCA 102) ASSIGNMENT - 2, DEC PAPER- II : PROGRAMMING WITH C++ 1) Explain multiple and multi-level inheritance. Implement these inheritances through programming. 2) What is exception? Discuss about exception handling and its benefits. 3) Write a C++ program using overloaded constructor. 4) Describe various file mode operations available in C++ 5) Write a note on pure virtual function 6) Write a template function min( ) for finding minimum in a list 7) What do you mean by function call? 8) What is data hiding? 9) What is typecasting

5 (DMCA 103) ASSIGNMENT - 1, DEC PAPER- III : COMPUTER ORGANIZATION 1) Explain the operational component of a computer. 2) Explain various secondary storage devices organizations. 3) Explain about instruction and instruction sequencing in instruction set architecture. 4) Write short notes on Dynamic Memory Access(DMA) 5) Explain the standard I/O interfaces with a suitable diagram 6) Discuss about virtual memories management requirements 7) Explain about interface circuits. 8) What is cache? 9) What is processor?

6 (DMCA 103) ASSIGNMENT - 2, DEC PAPER- III : COMPUTER ORGANIZATION 1) Briefly explain cache design parameters and draw the block diagram for Direct mapping cache organization. 2) What is two s complement multiplication and explain Booth s algorithm for two s compliment multiplication. 3) Explain about Multiplication of Positive numbers. 4) Explain about basic organization of a micro-programmed control unit. 5) Explain about semiconductor RAM memory 6) Explain different RAID techniques. 7) What is program counter? 8) What is register? 9) What is cycle?

7 (DMCA 104) ASSIGNMENT - 1, DEC PAPER- IV : DATA STRUCTURES 1. Define the concept of data structure. Explain data structures operations with illustrative examples. 2. Write the second pattern matching algorithm. Use this algorithm to find the table and the corresponding graph for the pattern P = ababab. 3. Discuss about Polish notation. Using stack transform A + (B * C (D / E F) * G) * H into its equivalent post fix expression. 4. Explain the concept of complexity of algorithms. 5. Discuss about different operations associated with word processing. 6. Explain binary search technique with suitable example. 7. Describe the circular linked list and how do you traverse it. 8. Define pointer array. 9. Represent two - way linked list

8 (DMCA 104) ASSIGNMENT - 2, DEC PAPER- IV : DATA STRUCTURES 1. Write Huffman s algorithm and trace the algorithm on the following: Data item : A B C D E F G H Weight : Explain the selection sort technique with suitable example 3. Explain the towers of Hanoi problem and give its recursive solution for n = Find the traversals of the corresponding binary tree of the expression (A + (B C)) * [D E) / (F + G H)] 5. Discuss about the inorder threading of a binary tree. 6. Explain different hashing techniques with suitable examples. 7. Define complete binary tree 8. What is priority queue? 9. What are stack operations?

9 (DMCA 105) ASSIGNMENT - 1, DEC PAPER - V : OPERATING SYSTEMS 1) Explain the structure of operating system in detail. 2) Explain about the Interprocess communication in detail with a neat label diagram. 3) Explain the Virtual memory in detail. 4) Differentiate between short term and Medium term scheduler. 5) Write a note on system calls in detail. 6) Write about Race conditions. 7) Write a note on phase tables. 8) Sleep and wakeup 9) Semaphores

10 (DMCA 105) ASSIGNMENT - 2, DEC PAPER - V : OPERATING SYSTEMS 1) What is a deadlock? Explain deadlock prevention methods in detail. 2) Explain the optimal phase replacement algorithm in detail. 3) Explain Memory mapped files in detail. 4) Explain security and protection issues. 5) Explain about PCB in detail. 6) Explain about Authentication & verification in detail. 7) Priority scheduling 8) Define swapping. 9) Disk schedulings.

11 (DMCA 106) ASSIGNMENT - 1, DEC PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Explain each component of database management system and discuss how can you establish economic justification of database system. 2) What is a B-tree? Give an algorithm to construct a B-tree. Construct a B-tree of degree three with the keys: 125, 140, 200, 115, 135, 145, 118, 150, 105, 120, 250, 130, 110, ) What is Normalization? Explain different normal forms with suitable example. 4) Classify the association between the fields of a file and explain them with suitable example. 5) Illustrate the construction of an indexed sequential file with a suitable example. 6) Explain how will you map conceptual data model into a relational data model. 7) What are the basic actions performed over databases? Explain them in brief. 8) What is the state-of-art relationship? 9) What is multi-list data structure?

12 (DMCA 106) ASSIGNMENT - 2, DEC PAPER - VI : DATABASE MANAGEMENT SYSTEMS 1) Give a skeleton of the DBD of IMS. List and explain different DL/I commands of IMS. 2) Discuss the importance of database recovery and explain different database recovery procedures. 3) Discuss about different symbols used in database action diagram. 4) List different DML modification commands of IDMS and explain them in brief. 5) Briefly explain about the commands under PC-FOCUS data manipulation. 6) What are special relational operators? Explain them in brief. 7) What is LAM? 8) Illustrate the use of GET HOLD UNIQUE. 9) What is timestamp?

13 (DMCA 107) ASSIGNMENT - 1, DEC PAPER - VII : ACCOUNTS AND FINANCE 1) Explain the concepts used in accounting. 2) State the regulations relating to balance sheet and profit and Loss a/c of a company. 3) What are the essentials of budgetary control? 4) Explain accounting cycle. 5) State different types of cash books. 6) Classify costs. 7) What are the issues in financial decision making? 8) Journal. 9) Budget.

14 (DMCA 107) ASSIGNMENT - 2, DEC PAPER - VII : ACCOUNTS AND FINANCE 1) State the tools used in financial analysis. 2) Bring out the limitations of ratio analysis. 3) What do you mean by finance function. 4) When does flow of fund take place? 5) State the sources of working Capital 6) Examine the uses of trial balance. 7) Cost concept. 8) Networking capital. 9) Cash concept of fund.

15 (DMCA 108) ASSIGNMENT - 1, DEC PAPER - VIII : DISCRETE MATHEMATICS 1) a) Show that SVR is logically implied by ( PVQ) ( P R) ( Q S) b) Show that ( x)( P( x) Q( x) ) ( x) P( x) ( ( xq ) ( x) ) 2) a) Define power set of a set and show that the cardinality of the power set of A, P(A) is 2 n if cardinality of A is n. 2 b) Let f( x) = Sinx, g( x) = x + 4 and hx ( ) = 5x, for x R where R is the set of all real numbers. Find fog, gof, foh, hof, gof, hoh and fogoh. 3) Make logic circuits from the following Boolean expressions: a) AB + ABC+ C + B b) wyz+ wz+ yz+ xyz 4) Prove that ( x)( P( x) Q( x) ) ( x) P( x) ( ( xq ) ( x) ) 5) Define strong mathematical induction. 6) What is Monoid of the Machine? Explain. 7) Find the recurrence relation form the sequence 0, 1, 1, 2, 3, 5, 8, 13, 8) Define Set 9) Define Recursion

16 (DMCA 108) 1) a) Solve the recurrence relation n n 1 n 2 n 3 ASSIGNMENT - 2, DEC PAPER - VIII : DISCRETE MATHEMATICS a 7a + 16a 12a = O for r 3 a = 1, a = 4 a = 8 Wim b) Solve the recurrence relation an an 1 an = 0 where a 0 = 2 and a 1= 5 2) a) Show that the Chromatic number of a planar graph is no greater than 4. b) Find the shortest path between A and F of the following weighed graph by using DISJKStals algorithm. 3) When are the two graphs said to be an Isomorphic. Give an example. 4) Define and explain the Adjacency matrix of the graph. 5) Define order of the recurrence relation. 6) Define Oval of a Planar Graph. 7) Define Lattice 8) What is Karnough Map 9) What is bipartite graph

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the

More information

M.C.A. FIRST YEAR DEGREE

M.C.A. FIRST YEAR DEGREE (DMCA 101) ASSIGNMENT - 1, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) What is MIS? Explain role of MIS in an organisation. 2) Explain in detail about input and output technologies. 3) Discuss about

More information

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75 M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the

More information

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY

(DMCA101) M.C.A. DEGREE EXAMINATION, MAY First Year INFORMATION TECHNOLOGY (DMCA101) M.C.A. DEGREE EXAMINATION, MAY - 2017 First Year INFORMATION TECHNOLOGY Time : 3 Hours Maximum Marks : 70 SECTION - A (3 15 = 45) Answer any three of the following Q1) Discuss business pressures

More information

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. (DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?

More information

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

ASSIGNMENT - 1, DEC P.G. DIPLOMA IN COMPUTER APPLICATIONS Paper I INFORMATION TECHNOLOGY Maximum : 30 MARKS Answer ALL questions.

ASSIGNMENT - 1, DEC P.G. DIPLOMA IN COMPUTER APPLICATIONS Paper I INFORMATION TECHNOLOGY Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1, DEC - 2018. (PGDCA 01) Paper I INFORMATION TECHNOLOGY 1) What is an information technology? Discuss the general technological trends for information technology. 2) Describe how IT support

More information

ASSIGNMENT - 1, DEC

ASSIGNMENT - 1, DEC (PGDCA 01) Paper I INFORMATION TECHNOLOGY 1) What is an information technology? Discuss the general technological trends for information technology. 2) Describe how IT support at different organizational

More information

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75 (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the

More information

1) What is information system? Describe the basic concepts of information systems.

1) What is information system? Describe the basic concepts of information systems. (DMSIT 01) ASSIGNMENT - 1, DEC - 2018. PAPER- I : BASICS OF 1) What is information system? Describe the basic concepts of information systems. 2) Discuss about input and output technologies of computer

More information

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY

(DMCA 101) M.C.A.(Previous) DEGREE EXAMINATION, MAY 2006 PAPER - I - INFORMATION TECHNOLOGY 1 (DMCA 101) PAPER - I - INFORMATION TECHNOLOGY 1. What is a computer based information system? Discuss the general technological trends for information technology. 2. (a) Describe the four main types

More information

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology

(PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 COMPUTER APPLICATIONS Information Technology (PGDCA 01) ASSIGNMENT -1 PG DIPLOMA DEGREE EXAMINATION, DECEMBER 2017 Information Technology Q1) How does IT support various functionalities at different organization levels? Q2) Write a short note on

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)

More information

2) Explain in detail about different AVL rotation applied on unbalanced trees.

2) Explain in detail about different AVL rotation applied on unbalanced trees. (DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES (DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer

More information

INFORMATION TECHNOLOGY

INFORMATION TECHNOLOGY [DMSIT 01] M.Sc. (Previous) DEGREE EXAMINATION, DEC 2013 First Year INFORMATION TECHNOLOGY Paper I BASICS OF INFORMATION TECHNOLOGY Time : 3 hours Max. Marks : 75 Section A (3x15 = 45) Answer any THREE

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)

More information

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment.

More information

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)

More information

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer

More information

CS/IT DIGITAL LOGIC DESIGN

CS/IT DIGITAL LOGIC DESIGN CS/IT 214 (CR) Total No. of Questions :09] [Total No. of Pages : 02 II/IV B.Tech. DEGREE EXAMINATIONS, DECEMBER- 2016 First Semester CS/IT DIGITAL LOGIC DESIGN Time: Three Hours 1. a) Flip-Flop Answer

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year INFORMATION TECHNOLOGY. (DMSIT01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year INFORMATION TECHNOLOGY Basics of IT Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15

More information

P.G.D.C.A. EXAMINATION, 2009

P.G.D.C.A. EXAMINATION, 2009 P.G.D.C.A. EXAMINATION, 2009 ADVANCED DATABASE MANAGEMENT SYSTEM Time allowed: Three Hours Maximum Marks: 100 Attempt any five questions, selecting one question from each unit. All questions carry equal

More information

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR

COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY TO BE EFFECTIVE FROM THE ACADEMIC YEAR COURSE STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING HELD ON JULY- 2000 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001 MCA SEMESTER -1 Scheme of evaluation Max. Marks Min. Marks to

More information

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) ASSIGNMENTS Chapter Q. No. Questions Course Outcom e (CO) Progra m Outcom e I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n)) 2 3. What is the time complexity of the algorithm? 4

More information

Assignment-I PGDCA 01- INFORMATION TECHNOLOGY

Assignment-I PGDCA 01- INFORMATION TECHNOLOGY PGDCA 01- INFORMATION TECHNOLOGY 1. What is role of IT industry in the global world? Explain. 2. What is software? Describe system software and Application Software. 3. Describe various parts of digital

More information

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False: (DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory

More information

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \ BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,

More information

JAIPUR NATIONAL UNIVERSITY, JAIPUR

JAIPUR NATIONAL UNIVERSITY, JAIPUR Paper Code: MCA - 101 Paper Title: Fundamental of Computer Master of Computer Application (MCA) (i) Differentiate between data and information. Which is more useful to the people and why? (ii) Explain

More information

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8) B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a

More information

PG DIPLOMA EXAMINATION, DECEMBER INFORMATION TECHNOLOGY. Paper - I : Basics of Information Technology. Time : 3 Hours Maximum Marks : 70

PG DIPLOMA EXAMINATION, DECEMBER INFORMATION TECHNOLOGY. Paper - I : Basics of Information Technology. Time : 3 Hours Maximum Marks : 70 (PGDIT 01) PG DIPLOMA EXAMINATION, DECEMBER - 2015 Paper - I : Basics of Information Technology Answer any five questions from the following 1) Describe the pressures and responses of business in the information

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

Answer any Five Questions. All questions carry equal marks.

Answer any Five Questions. All questions carry equal marks. PART II, PAPER XII (Object Oriented Analysis and Design) 1. What are the benefits of object oriented development over structure development. How one way association is different than two way association.

More information

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the

More information

«Computer Science» Requirements for applicants by Innopolis University

«Computer Science» Requirements for applicants by Innopolis University «Computer Science» Requirements for applicants by Innopolis University Contents Architecture and Organization... 2 Digital Logic and Digital Systems... 2 Machine Level Representation of Data... 2 Assembly

More information

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM II BTech (CSE) I Semester BTCSE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER

ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM II BTech (CSE) I Semester BTCSE301 DIGITAL LOGIC DESIGN MODEL QUESTION PAPER ADIKAVI NANNAYA UNIVERSITY:: RAJAMAHENDRAVARAM BTCSE301 DIGITAL LOGIC DESIGN 1. a) List out the Basic Theorems and Properties of Boolean Algebra. Justify with the Proof b) Explain how 1's complement and

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)

More information

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24 Prepared By ASCOL CSIT 2070 Batch Institute of Science and Technology 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE TED (10)-3071 Reg. No.. (REVISION-2010) Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours (Maximum marks: 100)

More information

Table of Contents. Chapter 1: Introduction to Data Structures... 1

Table of Contents. Chapter 1: Introduction to Data Structures... 1 Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction

More information

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question

More information

Visit ::: Original Website For Placement Papers. ::: Data Structure

Visit  ::: Original Website For Placement Papers. ::: Data Structure Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship

More information

Answer any Five Questions. All questions carry equal marks.

Answer any Five Questions. All questions carry equal marks. PART I, PAPER I (Problem Solving and Programming) 1. What do you understand by function prototype? Differentiate between call by value and call by reference methods of parameters passing to a function

More information

Question Paper Code : 97044

Question Paper Code : 97044 Reg. No. : Question Paper Code : 97044 B.E./B.Tech. DEGREE EXAMINATION NOVEMBER/DECEMBER 2014 Third Semester Computer Science and Engineering CS 6301 PROGRAMMING AND DATA STRUCTURES-II (Regulation 2013)

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation?

More information

Time : 03 Hours Maximum Marks : 75

Time : 03 Hours Maximum Marks : 75 (DMSIT 01) Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY Answer any Three of the following 1) Define IT. Enumerate various IT trends and their benefits to the organizations. 2) Bring

More information

Sr. No. Subject. 1 Paper I- Theory Computer Component Unit-I- Computer Organization & Architecture Unit-II- Software Engg Unit-III-O.S.

Sr. No. Subject. 1 Paper I- Theory Computer Component Unit-I- Computer Organization & Architecture Unit-II- Software Engg Unit-III-O.S. Shivaji University (Faculty of Commerce) Implemented from Academic year 2013-14 Bridge Course: - The bridge course for the direct MCA II year admitted Candidates Sr. No. Subject Theory Marks Practical

More information

Note: Select one full question from each unit

Note: Select one full question from each unit P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :

More information

Course Code : MCS-033 Course Title : Advanced Discrete Mathematics Assignment Number : MCA(III)/033/Assignment/2018-19 Maximum Marks : 100 Weightage : 25% Last Dates for Submission : 15th October, 2018

More information

Fundamental of I.T. (c) Application of computer *************

Fundamental of I.T. (c) Application of computer ************* Paper I Fundamental of I.T 1. What is an output device? Discuss the type of output device used in computer. 2. What is Secondary memory? Discuss the type of secondary memory used in computer. 3. Explain

More information

CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon

CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon CS2013 Course Syllabus Spring 2017 Lecture: Friday 8:00 A.M. 9:40 A.M. Lab: Friday 9:40 A.M. 12:00 Noon Instructor Course name Credits Contact hours Text book Course Information Course Goals Jungsoo (Sue)

More information

DATA STRUCTURES THROUGH C++

DATA STRUCTURES THROUGH C++ II Year I Semester DATA STRUCTURES THROUGH C++ L T P C 4 0 0 3 OBJECTIVES: To be familiar with basic techniques of object oriented principles and exception handling using C++ To be familiar with the concepts

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis p. 5 Statement Constructs p. 5 Pseudocode Example p.

More information

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION MH 1301 DISCRETE MATHEMATICS TIME ALLOWED: 2 HOURS NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER II EXAMINATION 2015-2016 MH 1301 DISCRETE MATHEMATICS May 2016 TIME ALLOWED: 2 HOURS INSTRUCTIONS TO CANDIDATES 1. This examination paper contains FIVE (5) questions

More information

Ph.D. Written Examination Syllabus

Ph.D. Written Examination Syllabus Ph.D. Written Examination Syllabus August 11, 2016 1 Analysis of Algorithms Syllabus Philosophy: We are testing analytical ability: how well students think on their feet, rather than details of some data

More information

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions: Tribhuvan University 2065 Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSC. 154) Pass Marks: 24 (Data Structure and Algorithm) Time:

More information

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes

Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 S. No. Course Outcomes Subject: OBJECT ORIENTED PROGRAMMING WITH C++ Paper (U.G): BCA -231 1 In Object Oriented Programming in C++ the students will study about the extension version of c language and the Features of C++, Classes

More information

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK

VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK VALLIAMMAI ENGNIEERING COLLEGE SRM Nagar, Kattankulathur 603203. DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Degree & Branch : B.E E.C.E. Year & Semester : II / IV Section : ECE 1, 2 &

More information

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example.

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example. Programme:- MCA-Semester-II Subject Code 201 Data Structures What is ADT? Explain stack as an ADT with suitable example. You know what a queue is... Implement a queue class with Java. What is the cost

More information

Seth Jai Parkash Polytechnic, Damla

Seth Jai Parkash Polytechnic, Damla Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018

More information

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR (2015-2016 REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR

More information

Department of Computer Science and Technology

Department of Computer Science and Technology UNIT : Stack & Queue Short Questions 1 1 1 1 1 1 1 1 20) 2 What is the difference between Data and Information? Define Data, Information, and Data Structure. List the primitive data structure. List the

More information

Discuss the following operations on One-Dimensional array with algorithms.

Discuss the following operations on One-Dimensional array with algorithms. (i). Searching (ii). Sorting (iii). Traversing (16CS503) DATA STRUCTURES THROUGH C UNIT-I Discuss the following operations on One-Dimensional array with algorithms. 2.Discuss the following operations on

More information

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular

More information

Syllabus for Computer Science General Part I

Syllabus for Computer Science General Part I Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions

More information

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu. 17CA 104DATA STRUCTURES Academic Year : 018-019 Programme : MCA Year / Semester : I / I Question Bank Course Coordinator: Mrs. C.Mallika Course Objectives The student should be able to 1. To understand

More information

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions.

ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 Second Year SOFTWARE ENGINEERING. Maximum : 30 MARKS Answer ALL questions. ASSIGNMENT - 1 M.C.A.DEGREE EXAMINATION, MAY 2019 SOFTWARE ENGINEERING (DMCA201) Q1) Explain Spiral model with suitable example. Also explain how it differs from Software Prototyping model. Q2) a) Draw

More information

Object Oriented Programming with c++ Question Bank

Object Oriented Programming with c++ Question Bank Object Oriented Programming with c++ Question Bank UNIT-1: Introduction to C++ 1. Describe the following characteristics of OOP. i Encapsulation ii Polymorphism, iii Inheritance 2. Discuss function prototyping,

More information

17CS33:Data Structures Using C QUESTION BANK

17CS33:Data Structures Using C QUESTION BANK 17CS33:Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C Learn : Usage of structures, unions - a conventional tool for handling a group of logically

More information

BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam

BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CSI33 Sample Final Exam NAME Directions: Solve problems 1 through 5 of Part I and choose 5 of the

More information

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers

More information

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal Subject-I- Data Structure through C Maximum Marks: 30 funz s'k& Q3 Q4 Q5 Q3 Describe the methods of parallel processing. What do you mean by Instruction? Describe the computer instructions in brief. How

More information

12 Abstract Data Types

12 Abstract Data Types 12 Abstract Data Types 12.1 Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT). Define

More information

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT) D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.

More information

Big Java Late Objects

Big Java Late Objects Big Java Late Objects Horstmann, Cay S. ISBN-13: 9781118087886 Table of Contents 1. Introduction 1.1 Computer Programs 1.2 The Anatomy of a Computer 1.3 The Java Programming Language 1.4 Becoming Familiar

More information

CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION

CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION CLASS: II YEAR / IV SEMESTER CSE CS 6402-DESIGN AND ANALYSIS OF ALGORITHM UNIT I INTRODUCTION 1. What is performance measurement? 2. What is an algorithm? 3. How the algorithm is good? 4. What are the

More information

CS302 Data Structures using C++

CS302 Data Structures using C++ CS302 Data Structures using C++ Study Guide for the Final Exam Fall 2018 Revision 1.1 This document serves to help you prepare towards the final exam for the Fall 2018 semester. 1. What topics are to be

More information

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And

More information

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER

LESSON PLAN B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER DEPARTMENT OF COMPUTER APPLICATIONS LESSON PLAN B.C.A. - FIRST YEAR (2014-2015 REGULATION) SECOND SEMESTER SRM UNIVERSITY FACULTY OF SCIENCE AND HUMANITIES SRM NAGAR, KATTANKULATHUR 603 203 SRM UNIVERSITY

More information

DS ata Structures Aptitude

DS ata Structures Aptitude DS ata Structures Aptitude 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge

More information

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

End-Term Examination Second Semester [MCA] MAY-JUNE 2006 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.

More information

A Survey of Mathematics with Applications 8 th Edition, 2009

A Survey of Mathematics with Applications 8 th Edition, 2009 A Correlation of A Survey of Mathematics with Applications 8 th Edition, 2009 South Carolina Discrete Mathematics Sample Course Outline including Alternate Topics and Related Objectives INTRODUCTION This

More information

STUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl

STUDENT NUMBER: MATH Final Exam. Lakehead University. April 13, Dr. Adam Van Tuyl Page 1 of 13 NAME: STUDENT NUMBER: MATH 1281 - Final Exam Lakehead University April 13, 2011 Dr. Adam Van Tuyl Instructions: Answer all questions in the space provided. If you need more room, answer on

More information

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017)

Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017) Post Graduate Diploma in Computer Applications I Semester INTERNAL ASSIGNMENT QUESTIONS (November, 2017) DIRECTOR Prof. SHIVARAJ PROF. G. RAM REDDY CENTRE FOR DISTANCE EDUCATION (RECOGNISED BY THE DISTANCE

More information

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE

MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE A Modern Approach to Discrete Mathematics SIXTH EDITION Judith L. Gersting University of Hawaii at Hilo W. H. Freeman and Company New York Preface Note to the

More information

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.0) Sessional Unit Code. Theory Unit Course

UNIVERSITY POLYTECHNIC B.I.T., MESRA, RANCHI. COURSE STRUCTURE (W.E.F Batch Students) (Total Unit 7.0) Sessional Unit Code. Theory Unit Course COURSE STRUCTURE (W.E.F. 2011 Batch Students) (Total Unit 7.0) Course Theory Unit Course Sessional Unit Code Code DCP 5001 Data Communication and 1.0 DCP 5002 Networking Lab. 0.5 Networking DCP 5003 Introduction

More information

SARDAR RAJA COLLEGE OF ENGINEERING

SARDAR RAJA COLLEGE OF ENGINEERING SARDAR RAJA COLLEGE OF ENGINEERING RAJA NAGAR, ALANGULAM Department of Electronics & Communication Engineering Subject Name : DATA STRUCTURES AND OBJECT ORIENTED PROGRAMMING IN C++ Subject Code : EC 2202

More information

Department of Computer Science Admission Test for PhD Program. Part I Time : 30 min Max Marks: 15

Department of Computer Science Admission Test for PhD Program. Part I Time : 30 min Max Marks: 15 Department of Computer Science Admission Test for PhD Program Part I Time : 30 min Max Marks: 15 Each Q carries 1 marks. ¼ mark will be deducted for every wrong answer. Part II of only those candidates

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF ELECTRONICS AND INSTRUMENTATION ENGINEERING QUESTION BANK VI SEMESTER EE6602 EMBEDDED SYSTEMS Regulation 2013 Academic Year

More information

Computer Programming II C++ (830)

Computer Programming II C++ (830) DESCRIPTION This is an advanced course in computer programming/software engineering and applications. It reviews and builds on the concepts introduced in CP I. It introduces students to dynamic data structures,

More information

Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2

Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2 Quantitative Finance COURSE NUMBER: 22:839:615 COURSE TITLE: Special Topics Oriented Programming 2 COURSE DESCRIPTION This course assumes a student has prior programming language experience with C++. It

More information

1. Which of the following circuits can be used to store one bit of data? A) Encoder B) OR gate C) Flip Flop D) Decoder

1. Which of the following circuits can be used to store one bit of data? A) Encoder B) OR gate C) Flip Flop D) Decoder MCA Lateral 1. Which of the following circuits can be used to store one bit of data? A) Encoder B) OR gate C) Flip Flop D) Decoder 2. What would be the output of the following C program? main ( ){ int

More information

Course Review for Finals. Cpt S 223 Fall 2008

Course Review for Finals. Cpt S 223 Fall 2008 Course Review for Finals Cpt S 223 Fall 2008 1 Course Overview Introduction to advanced data structures Algorithmic asymptotic analysis Programming data structures Program design based on performance i.e.,

More information