BTech/MCA/BCA - Computer Science - Trees - Heaps & Its Implementation Computer Science - Data Structure Notes - Part 5 (#mcanotes)(#ipumusings)

Trees - Heaps & Its Implementation

Computer Science - Data Structure Notes - Part 5

Data structures are the building blocks of any programming language. Following are the PDF notes on Data Structures, help you in your studies. For large amounts of input, the linear access time of linked lists is prohibitive. A tree can be defined in several ways. A tree is a collection of nodes.

A Binary Heap is a Binary Tree with following properties:

(1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.

(2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to Min Binary Heap.

Read More

BA LLB- Semester 1 - Economics-1 Microeconomic Analysis (End Term Paper Dec 2017)(#ballbpapers)(#ipumusings)

BA LLB- Semester 1 - Economics-1
(Microeconomic Analysis) 

(End Term Paper Dec 2017)

The objective of this paper is to provide broad understanding of basic concepts of economics and understanding of relationship between economics and law.

The question paper is of 3 Hours duration carrying 75 as maximum marks. Part A is compulsory.

Read More

MCA Data and File Structure: Arrays, Stacks, Queues and Lists - Question Bank (Set 1)

Data and File Structure: Arrays, Stacks, Queues and Lists 

Question Bank (Set 1) 

Unit I Syllabus: Fundamentals of algorithm analysis Big ‘O’ notations, Time and space complexity of algorithms, linked lists: singly and doubly linked lists, stacks, queues, double stack, multistacks and multiqueues, deques, polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations

Questions

1. Define Data structure.

2. List the operations performed in the Linear Data Structure.

3. What is abstract datatype?

4. Define Array.

5. Write the limitations of Array.

6. What are the ways to represent the two dimensional Array in memory.

7. Calculate the address of the element a[2][4] of an array a[3][5] in row major order.

Read More

BTech BioTechnology Quiz (Set 1)

BioTechnology Quiz 

(Set 1)

Multiple Choice Based Questions

Q1: Who was the first ever cloned animal?
(a) Dolly
(b) Albert
(c) Madonna
(d) Medusa

Q2: Genetic engineering is the manipulation of ________ for practical purpose

(A) Genetic bacteria
(B) Genetic plant
(C) Genetic material
(D) Genetic animal


Q3: Each basis inheritable character is controlled by a factor called ________.

(A) Chromosome
(B) DNA
(C) gene
(D) RNA


Q4: Genetic engineering usually utilizes ________.

(A) Bacterial cells
(B) Bacterial plasmids
(C) Both of these
(D) None of these

Read More

BCA/BTech/MCA Computer Science - Software Engineering - What are Software Metrics? (#ipumusings)

What are Software Metrics?

Software Engineering Study Notes

Software Metrics:
When a single data point has been collected, a measure has been established. Measurement occurs as a result of the collection of one or more data points. A software metric relates the individual data
items in some way (e.g. the number of errors found per review). A software engineer collects measures and develops metrics so that indicators will be obtained. An indicator is a metric or a combination of metrics, which provides insight into the software process, project or the product. Insight leads to informed decision making. It helps software engineers to adjust the process, project or product to improve the general quality.

Types of Metrics:
Metrics may fall into one of two categories:

Read More

IPU - MCA/BTech/BCA - Trees Computer Science - Data Structure Notes - Part 4(#ipumusings)(#eduvictors)

Trees

Computer Science - Data Structure Notes - Part 4

Data structures are the building blocks of any programming language. Following are the PDF notes on Data Structures, help you in your studies. For large amounts of input, the linear access time of linked lists is prohibitive. A tree can be defined in several ways. A tree is a collection of nodes.

Read More

IPU MCA - Semester 4 - Design and Analysis Of Algorithms (End Term Paper 2016) (#ggsipupapers)(#mcapapers)

MCA - Semester 4 - Design and Analysis Of Algorithms (End Term Paper 2016)

The objective of the course is to design new algorithms based on standard algorithm-design strategies. To analyze the time and space usage and correctness of new algorithms based on
standard algorithm-analysis techniques. To apply and adapt fundamental algorithms (sorting, searching, order statistics, graph algorithms) to new situations. To solve problems and to express your solutions using the language and concepts of algorithms and its mathematical tools.

The question paper structure, usually follows the given below pattern:
1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit.

2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including sub-parts, if any.

Read More

MCA - Semester 4 - Object Oriented Analysis And Design (End Term Paper 2016) (#ipumusings)(#mcapapers)

MCA - Semester 4 - Object Oriented Analysis & Design (End Term Paper 2016)

The objective of the course is to give students a detailed understanding of processes and techniques for building large object-oriented software systems. To develop skills to evolve object-oriented systems from analysis, to design, to implement and to understand most of the major object-oriented technologies including basic OO concepts, processes, languages, databases, user interfaces, frameworks, and design patterns.

The question paper structure, usually follows the given below pattern:
1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit.

2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including sub-parts, if any.

Read More

MCA - Semester 2 - Data and File Structure (End Term Paper 2016)(#ipumusings)(#mcapapers)

MCA - Semester 2 - Data & File Structure (End Term Paper 2016)

The subject covers Algorithm analysis: Trees, Graphs, searching and sorting and files. Fundamentals of algorithm analysis Big ‘O’ notations, Time and space complexity of algorithms, linked lists: singly and doubly linked lists, stacks, queues, double stack, multistacks and multiqueues, deques, polynomial arithmetic, infix, postfix and prefix arithmetic expression conversion and evaluations.


The question paper structure, usually follows the given below pattern:
1. Question No. 1 should be compulsory and cover the entire syllabus. There should be 10 questions of short answer type of 2 marks each, having at least 2 questions from each unit.

2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions to evaluate analytical/technical skills of candidate. However, student may be asked to attempt only 1 question from each unit. Each question should be 10 marks including sub-parts, if any.

Read More

BTech Semester 1 - Engineering Graphics - Introduction (Handwritten Notes)

Drawing Pencils and Drawing Sheets

Introduction to Engineering Graphics

(Handwritten Notes)

Read More