The general objectives for Com S 342 are divided into three parts: a set of essential objectives, a set of supporting objectives, and a set of enrichment objectives. The essential objectives will be helpful for your career as a computer scientist; hence our objective is to help you to master them. The supporting objectives are part of the means we will use to achieve the essential objectives. You are encouraged to explore the enrichment objectives both for their own sake and because learning more about those will help deepen your understanding of the essential objectives.

Learning Objectives

In one sentence, the essential objective is to familiarize you with modern programming languages and paradigms. In more detail the essential objectives for Com S 342 are as follows.

Understand the concepts and terms used to describe languages that support the imperative, functional, object-oriented, and logic programming paradigms. Solve problems using the functional paradigm.
Solve problems using the object-oriented paradigm.
Solve problems using the logic programming paradigm.
Critically evaluate what paradigm and language are best suited for a new problem.

English is the most popular and well-known Human Language. The English language has its own set of grammar rules, which has to be followed to write in the English language correctly. Likewise, any other Human Languages (German, Spanish, Russian, etc.) are made of several elements like nouns, adjective, adverbs, propositions, and conjunctions, etc. So, just like English, Spanish or other human languages, programming languages are also made of different elements. Just like human languages, programming languages also follow grammar called syntax. There are certain basic program code elements which are common for all the programming languages.

Most important basic elements for programming languages are:

Programming Environment
Data Types
Variables
Keywords
Logical and Arithmetical Operators
If else conditions
Loops
Numbers, Characters and Arrays
Functions
Input and Output Operations

×



C Programming

Pre -requisite: Basic Computer Knowledge

Duration: 1.5 Month

Description

Java Training Institute In Pune

Basic C


Environment Setup
Program Structure
Data Types, Variables, Constants
Storage Classes
Operators
Loops
Functions
Arrays
Strings
Structures
Unions
Bit Fields
File I/O
Preprocessors
Header Files
Type Casting
Error Handling
Memory Management
Command Line Arguments

Advanced C

Pointers
Structures
Function arguments by reference
Dynamic allocation
Recursion
Linked lists
Unions



×



C++ Programming

Pre -requisite: Basic C programming Knowledge

Duration: 1Month

Introduction
C++ Basics
Variables
Operators
Control Flow
Arrays, Strings, Pointers, and References
Functions
object-oriented programming
Operator overloading
Composition
Inheritance
Virtual Functions
Input and output (I/O)
Templates
Exceptions
The Standard Template Library






×



Data Structure

Member Joined: 35+ Trained Members Joined

1.5 Months

Description

About Data Structures

Data structures provide a means to manage large amounts of data for use in databases and internet indexing services. Efficient data structures are key for designing efficient algorithms and obtaining maintainable software design.In this Computer Science course, you will start by learning basic data types, such as numbers, and gradually build a conceptual framework for organizing and managing efficient structures.

What You Will Learn

Various data structures
How to organize data efficiently
How to use appropriate data structures for representing, organizing, and manipulating data
How to create data structures using basic programming

Description

In this Learning Data Structures and Algorithms training course, expert author Rod Stephens will teach you how to analyze and implement common algorithms used. This course is designed for the absolute beginner, meaning no previous programming experience is required. You will start by learning about the complexity theory, then jump into learning about numerical algorithms, including randomizing arrays, prime factorization, and numerical integration. From there, Rod will teach you about linked lists, such as singly linked lists, sorted, and doubly linked lists. This video tutorial also covers arrays, stacks and queues, and sorting. You will also learn about searching, hash tables, recursion, and backtracking algorithms. Finally, you will cover trees, balanced trees, decision trees, and network algorithms. Once you have completed this computer based training course, you will be fully capable of analyzing and implementing algorithms, as well as be able to select the best algorithm for various situations. Working files are included, allowing you to follow along with the author throughout the lessons.

Who should take the course

Anyone interested in learning about Data structures and Algorithms